Fetching the paper…
Reading the bibliography…
We provide new approximation guarantees for greedy low rank matrix estimation under standard assumptions of restricted strong convexity and smoothness.
G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher, “An analysis of approximations for maximizing submodular set functions—i,” Mathematical Programming , vol. 14, no. 1, pp. 265–294, 1978
1978
Earlier work this paper cites.
U. Feige, “A threshold of ln n for approximating set cover,” Journal of the ACM (JACM) , vol. 45, no. 4, pp. 634–652, 1998
1998
Earlier work this paper cites.
J. Shi and J. Malik, “Normalized cuts and image segmentation,” IEEE Trans. Pattern Anal. Mach. Intell. , vol. 22, no. 8, pp. 888–905, Aug. 2000
2000
Earlier work this paper cites.
A. Y. Ng, M. I. Jordan, and Y. Weiss, “On spectral clustering: Analysis and an algorithm,” in ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS . MIT Press, 2001, pp. 849–856
2001
Earlier work this paper cites.
M. Collins, S. Dasgupta, and R. E. Schapire, “A generalization of principal component analysis to the exponential family,” in Advances in Neural Information Processing Systems . MIT Press, 2001
2001
Earlier work this paper cites.
L. Finkelstein, E. Gabrilovich, Y. Matias, E. Rivlin, Z. Solan, G. Wolfman, and E. Ruppin, “Placing search in context: the concept revisited,” 2001, pp. 406–414
2001
Earlier work this paper cites.
R. Gribonval and P. Vandergheynst, “On the exponential convergence of matching pursuits in quasi-incoherent dictionaries,” IEEE Trans. Inform. Theory , vol. 52, no. 1, pp. 255–261, 2006
2006
Earlier work this paper cites.
A. R. Barron, A. Cohen, W. Dahmen, and R. A. DeVore, “Approximation and learning by greedy algorithms,” The Annals of Statistics , vol. 36, no. 1, p. 64–94, Feb 2008
2008
Earlier work this paper cites.
P. Buhlmann and B. Yu, “Boosting,” Wiley Interdisciplinary Reviews: Computational Statistics , vol. 2, no. 1, p. 69–74, Dec 2009
2009
Earlier work this paper cites.
B. Recht, M. Fazel, and P. A. Parrilo, “Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization,” SIAM Review , vol. 52, no. 3, p. 471–501, Jan 2010
2010
Earlier work this paper cites.
M. Jaggi and M. Sulovský, “A simple algorithm for nuclear norm regularized problems,” in Proceedings of the 27th International Conference on Machine Learning (ICML-10) , J. Fürnkranz and T. Joachims, Eds. Omnipress, 2010, pp. 471–478
2010
Earlier work this paper cites.
S. Negahban and M. J. Wainwright, “Estimation of (near) low-rank matrices with noise and high-dimensional scaling,” The Annals of Statistics , vol. 39, no. 2, pp. 1069–1097, 2011
2011
Cited alongside, same era.
A. Rohde and A. B. Tsybakov, “Estimation of high-dimensional low-rank matrices,” The Annals of Statistics , vol. 39, no. 2, p. 887–930, Apr 2011
2011
Cited alongside, same era.
S. Shalev-Shwartz, A. Gonen, and O. Shamir, “Large-scale convex minimization with a low-rank constraint,” in ICML , 2011
2011
Cited alongside, same era.
A. Das and D. Kempe, “Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection,” in ICML , Feb. 2011
2011
Cited alongside, same era.
S. Negahban, P. Ravikumar, B. Yu, and M. J. Wainwright, “A Unified Framework for High-Dimensional Analysis of M-Estimators with Decomposable Regularizers,” Statistica Sinica , vol. 27, no. 4, pp. 538–557, 2012
2013
Later among the works it cites.
P. Jain, A. Tewari, and P. Kar, “On iterative hard thresholding methods for high-dimensional m-estimation,” in Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, December 8-13 2014, Montreal, Quebec, Canada , 2014, pp. 685–693
2014
Later among the works it cites.
O. Levy and Y. Goldberg, “Neural word embedding as implicit matrix factorization,” in Advances in Neural Information Processing Systems 27 , Z. Ghahramani, M. Welling, C. Cortes, N. D. Lawrence, and K. Q. Weinberger, Eds. Curran Associates, Inc., 2014, pp. 2177–2185
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2012
Cited alongside, same era.
E. Bruni, G. Boleda, M. Baroni, and N.-K. Tran, “Distributional semantics in technicolor,” in Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1 , ser. ACL ’12. Stroudsburg, PA, USA: Association for Computational Linguistics, 2012, pp. 136–145
2012
Cited alongside, same era.
P. Jain, P. Netrapalli, and S. Sanghavi, “Low-rank matrix completion using alternating minimization,” in Symposium on Theory of Computing Conference, STOC’13, Palo Alto, CA, USA, June 1-4, 2013 , 2013, pp. 665–674
2013
Cited alongside, same era.
K. Lee and Y. Bresler, “Corrections to ”admira: Atomic decomposition for minimum rank approximation”,” IEEE Trans. Information Theory , vol. 59, no. 7, pp. 4730–4732, 2013
2013
Cited alongside, same era.
M. Jaggi, “Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization,” in ICML , 2013, pp. 427–435
2013
Cited alongside, same era.
T. Mikolov, I. Sutskever, K. Chen, G. S. Corrado, and J. Dean, “Distributed representations of words and phrases and their compositionality,” in Advances in Neural Information Processing Systems 26 , C. J. C. Burges, L. Bottou, M. Welling, Z. Ghahramani, and K. Q. Weinberger, Eds. Curran Associates, Inc., 2013, pp. 3111–3119
2013
Cited alongside, same era.
T. Mikolov, S. W.-t. Yih, and G. Zweig, “Linguistic regularities in continuous space word representations,” in Proceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT-2013) . Association for Computational Linguistics, May 2013
2013
Cited alongside, same era.
2015
Later among the works it cites.
Z. Wang, M.-J. Lai, Z. Lu, W. Fan, H. Davulcu, and J. Ye, “Orthogonal rank-one matrix pursuit for low rank matrix completion,” SIAM Journal on Scientific Computing , vol. 37, no. 1, p. A488–A514, Jan 2015
2015
Later among the works it cites.
N. Rao, P. Shah, and S. Wright, “Forward backward greedy algorithms for atomic norm regularization,” IEEE Transactions on Signal Processing , vol. 63, no. 21, p. 5798–5811, Nov 2015
2015
Later among the works it cites.
P.-L. Loh and M. J. Wainwright, “Regularized m-estimators with nonconvexity: Statistical and algorithmic theory for local optima,” J. Mach. Learn. Res. , vol. 16, no. 1, pp. 559–616, Jan. 2015
2015
Later among the works it cites.
2016
Later among the works it cites.
R. Khanna, M. Tschannen, and M. Jaggi, “Pursuits in Structured Non-Convex Matrix Factorizations,” arXiv , 2016, 1602.04208v1
2016
Later among the works it cites.
E. Elenberg, R. Khanna, A. Dimakis, and S. Negahban, “Restricted Strong Convexity Implies Weak Submodularity,” Proc. NIPS Workshop on Learning in High Dimensions with Structure , Dec. 2016
2016
Later among the works it cites.
R. Khanna, E. Elenberg, A. Dimakis, S. Neghaban, and J. Ghosh, “Scalable Greedy Support Selection via Weak Submodularity,” AISTATS , 2017
2017
Closest in time.