Fetching the paper…
Reading the bibliography…
This paper focus on the minimization of a possibly nonsmooth objective function over the Stiefel manifold.
A class of methods for nonlinear programming with termination and convergence properties
Roger Fletcher · 1970
Earlier work this paper cites.
Semianalytic and subanalytic sets
Edward Bierstone and Pierre D Milman · 1988
Earlier work this paper cites.
Optimization and nonsmooth analysis , volume 5
Frank H Clarke · 1990
Earlier work this paper cites.
A nonsmooth version of Newton’s method
Liqun Qi and Jie Sun · 1993
Earlier work this paper cites.
Geometric categories and o-minimal structures
Lou Van den Dries and Chris Miller · 1996
Earlier work this paper cites.
Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function
Alex J Wilkie · 1996
Earlier work this paper cites.
Subgradient algorithm on Riemannian manifolds
OP Ferreira and PR Oliveira · 1998
Earlier work this paper cites.
Proximal point algorithm on Riemannian manifolds
OP Ferreira and PR Oliveira · 2002
Earlier work this paper cites.
A robust gradient sampling algorithm for nonsmooth, nonconvex optimization
James V Burke, Adrian S Lewis, and Michael L Overton · 2005
Earlier work this paper cites.
Riemannian stochastic proximal gradient methods for nonsmooth optimization over the stiefel manifold
Bokun Wang, Shiqian Ma, and Lingzhou Xue · 2005
Earlier work this paper cites.
Special paraunitary matrices, Cayley transform, and multidimensional orthogonal filter banks
Jianping Zhou, Minh N Do, and Jelena Kovacevic · 2006
Earlier work this paper cites.
Convergence of the gradient sampling algorithm for nonsmooth nonconvex optimization
Kiwiel and C. Krzysztof · 2007
Earlier work this paper cites.
Optimization algorithms on matrix manifolds
P-A Absil, Robert Mahony, and Rodolphe Sepulchre · 2009
Earlier work this paper cites.
Learning multiple layers of features from tiny images
Alex Krizhevsky, Geoffrey Hinton, et al · 2009
Earlier work this paper cites.
Variational analysis , volume 317
R Tyrrell Rockafellar and Roger J-B Wets · 2009
Earlier work this paper cites.
Probability theory: STAT310/MATH230; September 12, 2010. Available at https://web.stanford.edu/class/stats310a/lnotes.pdf
Amir Dembo · 2010
Earlier work this paper cites.
Understanding the difficulty of training deep feedforward neural networks
Xavier Glorot and Yoshua Bengio · 2010
Earlier work this paper cites.
A first-order primal-dual algorithm for convex problems with applications to imaging
Antonin Chambolle and Thomas Pock · 2011
Earlier work this paper cites.
Rectifier nonlinearities improve neural network acoustic models
Andrew L Maas, Awni Y Hannun, Andrew Y Ng, et al · 2013
Earlier work this paper cites.
Very deep convolutional networks for large-scale image recognition
Karen Simonyan and Andrew Zisserman · 2014
Earlier work this paper cites.
Optimality conditions for the nonlinear programming problems on Riemannian manifolds
Wei Hong Yang, Lei-Hong Zhang, and Ruyi Song · 2014
Earlier work this paper cites.
Unitary evolution recurrent neural networks
Martin Arjovsky, Amar Shah, and Yoshua Bengio · 2016
Cited alongside, same era.
A new approach to the proximal point method: convergence on general Riemannian manifolds
Glaydston de Carvalho Bento, João Xavier da Cruz Neto, and Paulo Roberto Oliveira · 2016
Cited alongside, same era.
First-order methods for geodesically convex optimization
Hongyi Zhang and Suvrit Sra · 2016
Cited alongside, same era.
l1-regularized neural networks are improperly learnable in polynomial time
Yuchen Zhang, Jason D Lee, and Michael I Jordan · 2016
Cited alongside, same era.
A collection of nonsmooth Riemannian optimization problems
PA Absil and S Hosseini · 2017
Cited alongside, same era.
A Riemannian gradient sampling algorithm for nonsmooth optimization on manifolds
Seyedehsomayeh Hosseini and André Uschmajew · 2017
Gradient sampling methods for nonsmooth optimization
James V Burke, Frank E Curtis, Adrian S Lewis, Michael L Overton, and Lucas EA Simões · 2020
Later among the works it cites.
Proximal gradient method for nonsmooth optimization over the Stiefel manifold
Shixiang Chen, Shiqian Ma, Anthony Man-Cho So, and Tong Zhang · 2020
Later among the works it cites.
Stochastic subgradient method converges on tame functions
Damek Davis, Dmitriy Drusvyatskiy, Sham Kakade, and Jason D Lee · 2020
Later among the works it cites.
An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
Serge Gratton, Ehouarn Simon, and Ph L Toint · 2020
Later among the works it cites.
A brief introduction to manifold optimization
Jiang Hu, Xin Liu, Zai-Wen Wen, and Ya-Xiang Yuan · 2020
Later among the works it cites.
An efficient orthonormalization-free approach for sparse dictionary learning and dual principal component pursuit
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Can we gain more from orthogonality regularizations in training deep networks?
Nitin Bansal, Xiaohan Chen, and Zhangyang Wang · 2018
Cited alongside, same era.
Subgradient methods for sharp weakly convex functions
Damek Davis, Dmitriy Drusvyatskiy, Kellie J MacPhee, and Courtney Paquette · 2018
Cited alongside, same era.
Line search algorithms for locally Lipschitz functions on Riemannian manifolds
Seyedehsomayeh Hosseini, Wen Huang, and Rohollah Yousefpour · 2018
Cited alongside, same era.
An overview of robust subspace recovery
Gilad Lerman and Tyler Maunu · 2018
Cited alongside, same era.
Dual principal component pursuit
Manolis C Tsakiris and René Vidal · 2018
Cited alongside, same era.
Adaptive methods for nonconvex optimization
Manzil Zaheer, Sashank Reddi, Devendra Sachan, Satyen Kale, and Sanjiv Kumar · 2018
Cited alongside, same era.
Xiaoyin Hu and Xin Liu · 2020
Later among the works it cites.
A class of smooth exact penalty function methods for optimization problems with orthogonality constraints
Nachuan Xiao, Xin Liu, and Ya-xiang Yuan · 2020
Later among the works it cites.
Complexity of finding stationary points of nonsmooth nonconvex functions
Jingzhao Zhang, Hongzhou Lin, Stefanie Jegelka, Ali Jadbabaie, and Suvrit Sra · 2020
Later among the works it cites.
Towards theoretically understanding why sgd generalizes better than adam in deep learning
Pan Zhou, Jiashi Feng, Chao Ma, Caiming Xiong, Steven Chu Hong Hoi, et al · 2020
Later among the works it cites.
Analysis of limited-memory BFGS on a class of nonsmooth convex functions
Azam Asl and Michael L Overton · 2021
Later among the works it cites.
Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning
Jérôme Bolte and Edouard Pauwels · 2021
Later among the works it cites.
An inertial Newton algorithm for deep learning
Camille Castera, Jérôme Bolte, Cédric Févotte, and Edouard Pauwels · 2021
Later among the works it cites.
Riemannian proximal gradient methods
Wen Huang and Ke Wei · 2021
Later among the works it cites.
Weakly convex optimization over Stiefel manifold using Riemannian subgradient-type methods
Xiao Li, Shixiang Chen, Zengde Deng, Qing Qu, Zhihui Zhu, and Anthony Man-Cho So · 2021
Later among the works it cites.
Ranger21: a synergistic deep learning optimizer
Less Wright and Nestor Demeure · 2021
Later among the works it cites.
Solving optimization problems over the Stiefel manifold by smooth exact penalty function
Nachuan Xiao and Xin Liu · 2021
Later among the works it cites.
A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization
Minghan Yang, Andre Milzarek, Zaiwen Wen, and Tong Zhang · 2021
Later among the works it cites.
Yuhao Zhou, Chenglong Bao, Chao Ding, and Jun Zhu · 2021
Later among the works it cites.
Nonsmooth automatic differentiation: a cheap gradient principle and other complexity results
Jérôme Bolte, Ryan Boustany, Edouard Pauwels, and Béatrice Pesquet-Popescu · 2022
Closest in time.
Constraint dissolving approaches for Riemannian optimization
Nachuan Xiao, Xin Liu, and Kim-Chuan Toh · 2022
Closest in time.