Fetching the paper…
Reading the bibliography…
We study nonconvex optimization landscapes for learning overcomplete representations, including learning (i) sparsely used overcomplete dictionaries and (ii) convolutional dictionaries, where these unsupervised learning problems find many applications in high-dimensional data analysis.
Lower bounds on the maximum cross correlation of signals (corresp.)
Lloyd Welch · 1974
Earlier work this paper cites.
Sparse coding with an overcomplete basis set: A strategy employed by v1?
Bruno A Olshausen and David J Field · 1997
Earlier work this paper cites.
Learning nonlinear overcomplete representations for efficient coding
Michael S Lewicki and Terrence J Sejnowski · 1998
Earlier work this paper cites.
Learning overcomplete representations
Michael S Lewicki and Terrence J Sejnowski · 2000
Earlier work this paper cites.
Atomic decomposition by basis pursuit
Scott Shaobing Chen, David L Donoho, and Michael A Saunders · 2001
Earlier work this paper cites.
Global optimization with polynomials and the problem of moments
Jean B Lasserre · 2001
Earlier work this paper cites.
Convex optimization
Stephen Boyd and Lieven Vandenberghe · 2004
Earlier work this paper cites.
Designing structured tight frames via an alternating projection method
Joel A Tropp, Inderjit S Dhillon, Robert W Heath, and Thomas Strohmer · 2005
Earlier work this paper cites.
K-svd: An algorithm for designing overcomplete dictionaries for sparse representation
Michal Aharon, Michael Elad, and Alfred Bruckstein · 2006
Earlier work this paper cites.
Cubic regularization of newton method and its global performance
Yurii Nesterov and Boris T Polyak · 2006
Earlier work this paper cites.
Trust-region methods on Riemannian manifolds
Pierre-Antoine. Absil, Christopher G. Baker, and Kyle A. Gallivan · 2007
Earlier work this paper cites.
Efficient sparse coding algorithms
Honglak Lee, Alexis Battle, Rajat Raina, and Andrew Y Ng · 2007
Earlier work this paper cites.
On the existence of equiangular tight frames
Mátyás A Sustik, Joel A Tropp, Inderjit S Dhillon, and Robert W Heath Jr · 2007
Earlier work this paper cites.
An introduction to compressive sampling [a sensing/sampling paradigm that goes against the common knowledge in data acquisition]
Emmanuel J Candès and Michael B Wakin · 2008
Earlier work this paper cites.
Optimization algorithms on matrix manifolds
P-A Absil, Robert Mahony, and Rodolphe Sepulchre · 2009
Earlier work this paper cites.
Optimization Algorithms on Matrix Manifolds
Pierre-Antoine. Absil, Robert Mahoney, and Rodolphe Sepulchre · 2009
Earlier work this paper cites.
Exact matrix completion via convex optimization
Emmanuel J Candès and Benjamin Recht · 2009
Earlier work this paper cites.
Sparse and redundant representations: from theory to applications in signal and image processing
Michael Elad · 2010
Earlier work this paper cites.
Generalized power method for sparse principal component analysis
Michel Journée, Yurii Nesterov, Peter Richtárik, and Rodolphe Sepulchre · 2010
Earlier work this paper cites.
Online learning for matrix factorization and sparse coding
Julien Mairal, Francis Bach, Jean Ponce, and Guillermo Sapiro · 2010
Earlier work this paper cites.
Dictionaries for sparse representation modeling
Ron Rubinstein, Alfred M Bruckstein, and Michael Elad · 2010
Earlier work this paper cites.
Sparse representation for computer vision and pattern recognition
John Wright, Yi Ma, Julien Mairal, Guillermo Sapiro, Thomas S Huang, and Shuicheng Yan · 2010
Earlier work this paper cites.
Deconvolutional networks
Matthew D Zeiler, Dilip Krishnan, Graham W Taylor, and Rob Fergus · 2010
Earlier work this paper cites.
Robust principal component analysis?
Emmanuel J Candès, Xiaodong Li, Yi Ma, and John Wright · 2011
Earlier work this paper cites.
A probabilistic and ripless theory of compressed sensing
Emmanuel J Candes and Yaniv Plan · 2011
Earlier work this paper cites.
Quan Geng, Huan Wang, and John Wright · 2011
Earlier work this paper cites.
Ica with reconstruction cost for efficient overcomplete feature learning
Quoc V Le, Alexandre Karpenko, Jiquan Ngiam, and Andrew Y Ng · 2011
Earlier work this paper cites.
Semidefinite optimization and convex algebraic geometry
Grigoriy Blekherman, Pablo A Parrilo, and Rekha R Thomas · 2012
Earlier work this paper cites.
Exact recovery of sparsely-used dictionaries
Daniel A. Spielman, Huan Wang, and John Wright · 2012
Cited alongside, same era.
Representation learning: A review and new perspectives
Yoshua Bengio, Aaron Courville, and Pascal Vincent · 2013
Cited alongside, same era.
Fast convolutional sparse coding
Hilton Bristow, Anders Eriksson, and Simon Lucey · 2013
Cited alongside, same era.
Concentration inequalities: A nonasymptotic theory of independence
Stéphane Boucheron, Gábor Lugosi, and Pascal Massart · 2013
Cited alongside, same era.
An invitation to compressive sensing
Simon Foucart and Holger Rauhut · 2013
Cited alongside, same era.
A Mathematical Introduction to Compressive Sensing
Simon Foucart and Holger Rauhut · 2013
Cited alongside, same era.
Alternating minimization for dictionary learning with random initialization
Niladri Chatterji and Peter L Bartlett · 2017
Later among the works it cites.
On the optimization landscape of tensor decompositions
Rong Ge and Tengyu Ma · 2017
Later among the works it cites.
Using negative curvature in solving nonlinear programs
Donald Goldfarb, Cun Mu, John Wright, and Chaoxu Zhou · 2017
Later among the works it cites.
How to escape saddle points efficiently
Chi Jin, Rong Ge, Praneeth Netrapalli, Sham M Kakade, and Michael I Jordan · 2017
Later among the works it cites.
Cong Ma, Kaizheng Wang, Yuejie Chi, and Yuxin Chen · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Scaling law for recovering the sparsest element in a subspace
Laurent Demanet and Paul Hand · 2014
Cited alongside, same era.
Sparse modeling for image and vision processing
Julien Mairal, Francis Bach, Jean Ponce, et al · 2014
Cited alongside, same era.
Simple, efficient, and neural algorithms for sparse coding
Sanjeev Arora, Rong Ge, Tengyu Ma, and Ankur Moitra · 2015
Cited alongside, same era.
Dictionary learning and tensor decomposition via the sum-of-squares method
Boaz Barak, Jonathan A Kelner, and David Steurer · 2015
Cited alongside, same era.
Escaping from saddle points—online stochastic gradient for tensor decomposition
Rong Ge, Furong Huang, Chi Jin, and Yang Yuan · 2015
Cited alongside, same era.
Convolutional sparse coding for image super-resolution
Shuhang Gu, Wangmeng Zuo, Qi Xie, Deyu Meng, Xiangchu Feng, and Lei Zhang · 2015
Cited alongside, same era.
Convolutional dictionary learning via local processing
Vardan Papyan, Yaniv Romano, Jeremias Sulam, and Michael Elad · 2017
Later among the works it cites.
Convolutional dictionary learning via local processing
Vardan Papyan, Yaniv Romano, Jeremias Sulam, and Michael Elad · 2017
Later among the works it cites.
Fast and robust tensor decomposition with applications to dictionary learning
Tselil Schramm and David Steurer · 2017
Later among the works it cites.
On the global geometry of sphere-constrained sparse blind deconvolution
Yuqian Zhang, Yenson Lau, Han-Wen Kuo, Sky Cheung, Abhay Pasupathy, and John Wright · 2017
Later among the works it cites.
Global rates of convergence for nonconvex optimization on manifolds
Nicolas Boumal, Pierre-Antoine Absil, and Coralia Cartis · 2018
Later among the works it cites.
Subgradient descent learns orthogonal dictionaries
Yu Bai, Qijia Jiang, and Ju Sun · 2018
Later among the works it cites.
Efficient dictionary learning with gradient descent
Dar Gilboa, Sam Buchanan, and John Wright · 2018
Later among the works it cites.
Convolutional dictionary learning: A comparative review and new algorithms
Cristina Garcia-Cardona and Brendt Wohlberg · 2018
Later among the works it cites.
Global geometry of multichannel sparse blind deconvolution on the sphere
Yanjun Li and Yoram Bresler · 2018
Later among the works it cites.
Theoretical foundations of deep learning via sparse representations: A multilayer sparse model and its connection to convolutional neural networks
Vardan Papyan, Yaniv Romano, Jeremias Sulam, and Michael Elad · 2018
Later among the works it cites.
A geometric analysis of phase retrieval
Ju Sun, Qing Qu, and John Wright · 2018
Later among the works it cites.
Structured local minima in sparse blind deconvolution
Yuqian Zhang, Han-wen Kuo, and John Wright · 2018
Later among the works it cites.
Efficiently escaping saddle points on manifolds
C. Criscitiello and N. Boumal · 2019
Closest in time.
Efficient dictionary learning with gradient descent
Dar Gilboa, Sam Buchanan, and John Wright · 2019
Closest in time.
Geometry and symmetry in short-and-sparse deconvolution
Han-Wen Kuo, Yenson Lau, Yuqian Zhang, and John Wright · 2019
Closest in time.
Nonsmooth optimization over stiefel manifold: Riemannian subgradient methods, 2019
Xiao Li, Shixiang Chen, Zengde Deng, Qing Qu, Zhihui Zhu, and Anthony Man Cho So · 2019
Closest in time.
Short-and-sparse deconvolution – a geometric approach
Yenson Lau, Qing Qu, Han-Wen Kuo, Pengcheng Zhou, Yuqian Zhang, and John Wright · 2019
Closest in time.
A nonconvex approach for exact and efficient multichannel sparse blind deconvolution
Qing Qu, Xiao Li, and Zhihui Zhu · 2019
Closest in time.
When does non-orthogonal tensor decomposition have no spurious local minima?, 2019
Maziar Sanjabi, Sina Baharlouei, Meisam Razaviyayn, and Jason D. Lee · 2019
Closest in time.
Manifold gradient descent solves multi-channel sparse blind deconvolution provably and efficiently
Laixi Shi and Yuejie Chi · 2019
Closest in time.
A linearly convergent method for non-smooth non-convex optimization on the grassmannian with applications to robust subspace and dictionary learning
Zhihui Zhu, Tianyu Ding, Daniel Robinson, Manolis Tsakiris, and René Vidal · 2019
Closest in time.
Complete dictionary learning via
Yuexiang Zhai, Zitong Yang, Zhenyu Liao, John Wright, and Yi Ma · 2019
Closest in time.