{"total":19,"rows":[{"id":"2203.01238","title":"On the Optimization Landscape of Neural Collapse under MSE Loss: Global Optimality with Unconstrained Features","created":"2022-03-02","cited_by_count":97,"area":null},{"id":"2104.14526","title":"Scaling and Scalability: Provable Nonconvex Low-Rank Tensor Estimation from Incomplete Measurements","created":"2021-04-29","cited_by_count":28,"area":null},{"id":"2107.13289","title":"The loss landscape of deep linear neural networks: a second-order analysis","created":"2021-07-28","cited_by_count":24,"area":null},{"id":"2105.15081","title":"Optimal Spectral Recovery of a Planted Vector in a Subspace","created":"2021-05-31","cited_by_count":21,"area":null},{"id":"2206.03345","title":"Preconditioned Gradient Descent for Overparameterized Nonconvex Burer--Monteiro Factorization with Global Optimality Certification","created":"2022-06-07","cited_by_count":21,"area":null},{"id":"2210.12816","title":"Simple Alternating Minimization Provably Solves Complete Dictionary Learning","created":"2022-10-23","cited_by_count":6,"area":null},{"id":"2102.02837","title":"Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms","created":"2021-02-04","cited_by_count":4,"area":null},{"id":"2106.07736","title":"Unique sparse decomposition of low rank matrices","created":"2021-06-14","cited_by_count":4,"area":null},{"id":"2210.00346","title":"Behind the Scenes of Gradient Descent: A Trajectory Analysis via Basis Function Decomposition","created":"2022-10-01","cited_by_count":4,"area":null},{"id":"2302.09347","title":"Closed-Loop Transcription via Convolutional Sparse Coding","created":"2023-02-18","cited_by_count":4,"area":null},{"id":"2103.09424","title":"Escaping Saddle Points in Distributed Newton's Method with Communication Efficiency and Byzantine Resilience","created":"2021-03-17","cited_by_count":3,"area":null},{"id":"2210.10855","title":"Dictionary Learning for the Almost-Linear Sparsity Regime","created":"2022-10-19","cited_by_count":3,"area":null},{"id":"2104.10314","title":"Efficient Sparse Coding using Hierarchical Riemannian Pursuit","created":"2021-04-21","cited_by_count":2,"area":null},{"id":"2106.07053","title":"Convex Sparse Blind Deconvolution","created":"2021-06-13","cited_by_count":2,"area":null},{"id":"2101.02397","title":"A Comprehensive Study on Optimization Strategies for Gradient Descent In Deep Learning","created":"2021-01-07","cited_by_count":1,"area":null},{"id":"2304.01768","title":"Convergence of alternating minimisation algorithms for dictionary learning","created":"2023-04-04","cited_by_count":1,"area":null},{"id":"2211.03628","title":"Decentralized Complete Dictionary Learning via $\\ell^{4}$-Norm Maximization","created":"2022-11-07","cited_by_count":0,"area":null},{"id":"2405.07649","title":"Efficient Matrix Factorization Via Householder Reflections","created":"2024-05-13","cited_by_count":0,"area":null},{"id":"2409.09138","title":"Fast Structured Orthogonal Dictionary Learning using Householder Reflections","created":"2024-09-13","cited_by_count":0,"area":null}],"next_cursor":null}