Fetching the paper…
Reading the bibliography…
Is it possible to find the sparsest vector (direction) in a generic subspace $\mathcal{S} \subseteq \mathbb{R}^p$ with $\mathrm{dim}(\mathcal{S})= n < p$? This problem can be considered a homogeneous variant of the sparse recovery problem, and finds connections to sparse dictionary learning, sparse PCA, and many other problems in signal processing and machine learning.
T. Figiel, J. Lindenstrauss, and V. D. Milman, “The dimension of almost spherical sections of convex bodies,” Acta Mathematica
1977
Earlier work this paper cites.
S. T. McCormick, “A combinatorial approach to some sparse matrix problems.,” tech. rep., DTIC Document, 1983
1983
Earlier work this paper cites.
A. Y. Garnaev and E. D. Gluskin, “The widths of a euclidean ball,” in Dokl. Akad. Nauk SSSR
1984
Earlier work this paper cites.
M. Berry, M. Heath, I. Kaneko, M. Lawo, R. Plemmons, and R. Ward, “An algorithm to compute a sparse basis of the null space,” Numerische Mathematik
1985
Earlier work this paper cites.
T. F. Coleman and A. Pothen, “The null space problem i. complexity,” SIAM Journal on Algebraic Discrete Methods
1986
Earlier work this paper cites.
New York, NY, USA: Oxford University Press, Inc., 1986
I. S. Duff, A. M. Erisman, and J. K. Reid, Direct Methods for Sparse Matrices · 1986
Earlier work this paper cites.
J. R. Gilbert and M. T. Heath, “Computing a sparse basis for the null space,” SIAM Journal on Algebraic Discrete Methods
1987
Earlier work this paper cites.
K. G. Murty and S. N. Kabadi, “Some NP-complete problems in quadratic and nonlinear programming,” Mathematical programming
1987
Earlier work this paper cites.
Springer, 1999
V. De la Pena and E. Giné, Decoupling: from dependence to independence · 1999
Earlier work this paper cites.
Cambridge University Press, 1999
G. Pisier, The volume of convex bodies and Banach space geometry · 1999
Earlier work this paper cites.
A. J. Smola and B. Schölkopf, “Sparse greedy matrix approximation for machine learning,” pp. 911–918, Morgan Kaufmann, 2000
2000
Earlier work this paper cites.
M. Zibulevsky and B. A. Pearlmutter, “Blind source separation by sparse decomposition in a signal dictionary,” Neural computation
2001
Earlier work this paper cites.
R. Basri and D. W. Jacobs, “Lambertian reflectance and linear subspaces,” Pattern Analysis and Machine Intelligence, IEEE Transactions on
2003
Earlier work this paper cites.
E. Gluskin and V. Milman, “Note on the geometric-arithmetic mean inequality,” in Geometric aspects of Functional analysis
2003
Earlier work this paper cites.
T. Kavitha, K. Mehlhorn, D. Michail, and K. Paluch, “A faster algorithm for minimum cycle basis of graphs,” in 31st International Colloquium on Automata, Languages and Programming
2004
Earlier work this paper cites.
E. J. Candès and T. Tao, “Decoding by linear programming,” Information Theory, IEEE Transactions on
2005
Earlier work this paper cites.
G. Beylkin and L. Monzón, “On approximation of functions by exponential sums,” Applied and Computational Harmonic Analysis
2005
Earlier work this paper cites.
D. L. Donoho, “For most large underdetermined systems of linear equations the minimal ℓ 1 \ell^{1} -norm solution is also the sparsest solution,” Communications on pure and applied mathematics
2006
Earlier work this paper cites.
H. Zou, T. Hastie, and R. Tibshirani, “Sparse principal component analysis,” Journal of computational and graphical statistics
2006
Earlier work this paper cites.
A. d’Aspremont, L. El Ghaoui, M. I. Jordan, and G. R. Lanckriet, “A direct formulation for sparse pca using semidefinite programming,” SIAM review
2007
Earlier work this paper cites.
A. d’Aspremont, L. El Ghaoui, M. Jordan, and G. Lanckriet, “A direct formulation of sparse PCA using semidefinite programming,” SIAM Review
2007
Earlier work this paper cites.
I. M. Johnstone and A. Y. Lu, “On consistency and sparsity for principal components analysis in high dimensions,” Journal of the American Statistical Association
2009
Earlier work this paper cites.
L.-A. Gottlieb and T. Neylon, “Matrix sparsification and the sparse null space problem,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
2010
Earlier work this paper cites.
2010
Earlier work this paper cites.
E. Candès, X. Li, Y. Ma, and J. Wright, “Robust principal component analysis?,” Journal of the ACM
2011
Cited alongside, same era.
D. A. Spielman, H. Wang, and J. Wright, “Exact recovery of sparsely-used dictionaries,” in Proceedings of the 25th Annual Conference on Learning Theory
2012
Cited alongside, same era.
Y. Dai, H. Li, and M. He, “A simple prior-free method for non-rigid structure-from-motion factorization,” in Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on
2012
Cited alongside, same era.
2013
Cited alongside, same era.
V. Q. Vu, J. Cho, J. Lei, and K. Rohe, “Fantope projection and selection: A near-optimal convex relaxation of sparse pca,” in Advances in Neural Information Processing Systems
2014
Closest in time.
P. Netrapalli, U. Niranjan, S. Sanghavi, A. Anandkumar, and P. Jain, “Non-convex robust pca,” in Advances in Neural Information Processing Systems
2014
Closest in time.
P. Jain and S. Oh, “Provable tensor factorization with missing data,” in Advances in Neural Information Processing Systems
2014
Closest in time.
2014
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
Y.-B. Zhao and M. Fukushima, “Rank-one solutions for homogeneous linear matrix equations over the positive semidefinite cone,” Applied Mathematics and Computation
2013
Cited alongside, same era.
A. Anandkumar, D. Hsu, M. Janzamin, and S. M. Kakade, “When are overcomplete topic models identifiable? uniqueness of tensor tucker decompositions with structured sparsity,” in Advances in Neural Information Processing Systems
2013
Cited alongside, same era.
J. Ho, Y. Xie, and B. Vemuri, “On a nonlinear generalization of sparse coding and dictionary learning,” in Proceedings of The 30th International Conference on Machine Learning
2013
Cited alongside, same era.
Q. Berthet and P. Rigollet, “Complexity theoretic lower bounds for sparse principal component detection,” in Conference on Learning Theory
2013
Cited alongside, same era.
2013
Cited alongside, same era.
2013
Cited alongside, same era.
2013
Cited alongside, same era.
2014
Closest in time.
2014
Closest in time.
2015
Closest in time.
R. Krauthgamer, B. Nadler, D. Vilenchik, et al
2015
Closest in time.
2015
Closest in time.
J. Lei, V. Q. Vu, et al
2015
Closest in time.
C. T. Manolis and V. Rene, “Dual principal component pursuit,” arXiv preprint arXiv:1510.04390
2015
Closest in time.
Y. Nakatsukasa, T. Soma, and A. Uschmajew, “Finding a low-rank basis in a matrix subspace,” CoRR
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
R. Ge, F. Huang, C. Jin, and Y. Yuan, “Escaping from saddle points—online stochastic gradient for tensor decomposition,” in Proceedings of The 28th Conference on Learning Theory
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.