{"total":20,"rows":[{"id":"2210.15651","title":"Learning Single-Index Models with Shallow Neural Networks","created":"2022-10-27","cited_by_count":92,"area":null},{"id":"2102.04168","title":"Provable Model-based Nonlinear Bandit and Reinforcement Learning: Shelve Optimism, Embrace Virtual Curvature","created":"2021-02-08","cited_by_count":32,"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":"2110.02479","title":"Exponentially Many Local Minima in Quantum Neural Networks","created":"2021-10-06","cited_by_count":22,"area":null},{"id":"2111.14069","title":"Escape saddle points by a simple gradient-descent based algorithm","created":"2021-11-28","cited_by_count":11,"area":null},{"id":"2209.14501","title":"On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks","created":"2022-09-29","cited_by_count":9,"area":null},{"id":"2103.13462","title":"Why Do Local Methods Solve Nonconvex Problems?","created":"2021-03-24","cited_by_count":8,"area":null},{"id":"2110.15821","title":"Landscape analysis of an improved power method for tensor decomposition","created":"2021-10-29","cited_by_count":7,"area":null},{"id":"2203.02790","title":"A Robust Spectral Algorithm for Overcomplete Tensor Decomposition","created":"2022-03-05","cited_by_count":7,"area":null},{"id":"2210.01496","title":"Zeroth-Order Negative Curvature Finding: Escaping Saddle Points without Gradients","created":"2022-10-04","cited_by_count":6,"area":null},{"id":"2211.05274","title":"Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials","created":"2022-11-10","cited_by_count":6,"area":null},{"id":"2106.07736","title":"Unique sparse decomposition of low rank matrices","created":"2021-06-14","cited_by_count":4,"area":null},{"id":"2110.12121","title":"On Geometric Connections of Embedded and Quotient Geometries in Riemannian Fixed-rank Matrix Optimization","created":"2021-10-23","cited_by_count":3,"area":null},{"id":"2211.03827","title":"Lower Bounds for the Convergence of Tensor Power Iteration on Random Overcomplete Models","created":"2022-11-07","cited_by_count":3,"area":null},{"id":"2403.07862","title":"Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing","created":"2024-03-12","cited_by_count":3,"area":null},{"id":"2201.04822","title":"A Geometric Approach to $k$-means","created":"2022-01-13","cited_by_count":2,"area":null},{"id":"2602.17779","title":"Topological Exploration of High-Dimensional Empirical Risk Landscapes: general approach, and applications to phase retrieval","created":"2026-02-19","cited_by_count":1,"area":null},{"id":"2606.27082","title":"Finding Stationary Points by Comparisons","created":"2026-06-25","cited_by_count":1,"area":null},{"id":"2506.08428","title":"Sharper Convergence Rates for Nonconvex Optimisation via Reduction Mappings","created":"2025-06-10","cited_by_count":0,"area":null}],"next_cursor":null}