{"total":71,"rows":[{"id":"2302.11055","title":"SGD learning on neural networks: leap complexity and saddle-to-saddle dynamics","created":"2023-02-21","cited_by_count":143,"area":null},{"id":"2106.15013","title":"Small random initialization is akin to spectral learning: Optimization and generalization guarantees for overparameterized low-rank matrix reconstruction","created":"2021-06-28","cited_by_count":78,"area":null},{"id":"2305.10633","title":"Smoothing the Landscape Boosts the Signal for SGD: Optimal Sample Complexity for Learning Single Index Models","created":"2023-05-18","cited_by_count":61,"area":null},{"id":"2106.14289","title":"Global Convergence of Gradient Descent for Asymmetric Low-Rank Matrix Factorization","created":"2021-06-27","cited_by_count":45,"area":null},{"id":"2302.01186","title":"The Power of Preconditioning in Overparameterized Low-Rank Matrix Sensing","created":"2023-02-02","cited_by_count":33,"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":"2105.08306","title":"Sample Efficient Linear Meta-Learning by Alternating Minimization","created":"2021-05-18","cited_by_count":25,"area":null},{"id":"2103.04902","title":"Stochasticity helps to navigate rough landscapes: comparing gradient-descent-based algorithms in the phase retrieval problem","created":"2021-03-08","cited_by_count":23,"area":null},{"id":"2408.03733","title":"Bayes-optimal learning of an extensive-width neural network from quadratically many samples","created":"2024-08-07","cited_by_count":23,"area":null},{"id":"2107.12365","title":"Inference for Heteroskedastic PCA with Missing Data","created":"2021-07-26","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":"2106.10744","title":"On the Cryptographic Hardness of Learning Single Periodic Neurons","created":"2021-06-20","cited_by_count":20,"area":null},{"id":"2305.18502","title":"Escaping mediocrity: how two-layer networks learn hard generalized linear models with SGD","created":"2023-05-29","cited_by_count":15,"area":null},{"id":"2106.15358","title":"Towards Sample-Optimal Compressive Phase Retrieval with Sparse and Generative Priors","created":"2021-06-29","cited_by_count":14,"area":null},{"id":"2104.12031","title":"Low-rank Tensor Estimation via Riemannian Gauss-Newton: Statistical Optimality and Second-Order Convergence","created":"2021-04-24","cited_by_count":13,"area":null},{"id":"2106.04769","title":"Submodular + Concave","created":"2021-06-09","cited_by_count":13,"area":null},{"id":"2202.08064","title":"Learning a Single Neuron for Non-monotonic Activation Functions","created":"2022-02-16","cited_by_count":13,"area":null},{"id":"2207.01789","title":"Improved Global Guarantees for the Nonconvex Burer--Monteiro Factorization via Rank Overparameterization","created":"2022-07-05","cited_by_count":13,"area":null},{"id":"2106.01660","title":"Bandit Phase Retrieval","created":"2021-06-03","cited_by_count":12,"area":null},{"id":"2305.06927","title":"Convergence of Alternating Gradient Descent for Matrix Factorization","created":"2023-05-11","cited_by_count":12,"area":null},{"id":"2204.11516","title":"Randomly Initialized Alternating Least Squares: Fast Convergence for Matrix Sensing","created":"2022-04-25","cited_by_count":11,"area":null},{"id":"2206.04044","title":"Model-Based Reinforcement Learning for Offline Zero-Sum Markov Games","created":"2022-06-08","cited_by_count":11,"area":null},{"id":"2208.09550","title":"Sudakov-Fernique post-AMP, and a new proof of the local convexity of the TAP free energy","created":"2022-08-19","cited_by_count":9,"area":null},{"id":"2302.03682","title":"Approximate message passing from random initialization with applications to $\\mathbb{Z}_{2}$ synchronization","created":"2023-02-07","cited_by_count":9,"area":null},{"id":"2406.01589","title":"Tilting the Odds at the Lottery: the Interplay of Overparameterisation and Curricula in Neural Networks","created":"2024-06-03","cited_by_count":9,"area":null},{"id":"2106.02985","title":"Escaping Saddle Points Faster with Stochastic Momentum","created":"2021-06-05","cited_by_count":8,"area":null},{"id":"2210.05571","title":"Misspecified Phase Retrieval with Generative Priors","created":"2022-10-11","cited_by_count":7,"area":null},{"id":"2110.03975","title":"Tensor train completion: local recovery guarantees via Riemannian optimization","created":"2021-10-08","cited_by_count":6,"area":null},{"id":"2110.07810","title":"Towards Statistical and Computational Complexities of Polyak Step Size Gradient Descent","created":"2021-10-15","cited_by_count":5,"area":null},{"id":"2204.14067","title":"Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition","created":"2022-04-29","cited_by_count":5,"area":null},{"id":"2210.06705","title":"From Gradient Flow on Population Loss to Learning with Stochastic Gradient Descent","created":"2022-10-13","cited_by_count":5,"area":null},{"id":"2105.08678","title":"Nonparametric Modeling of Higher-Order Interactions via Hypergraphons","created":"2021-05-18","cited_by_count":4,"area":null},{"id":"2206.04276","title":"Robust Matrix Completion with Heavy-tailed Noise","created":"2022-06-09","cited_by_count":4,"area":null},{"id":"2209.15130","title":"Nonconvex Matrix Factorization is Geodesically Convex: Global Landscape Analysis for Fixed-rank Matrix Optimization From a Riemannian Perspective","created":"2022-09-29","cited_by_count":4,"area":null},{"id":"2212.09396","title":"Rank-1 Matrix Completion with Gradient Descent and Small Random Initialization","created":"2022-12-19","cited_by_count":4,"area":null},{"id":"2411.05708","title":"Sample and Computationally Efficient Robust Learning of Gaussian Single-Index Models","created":"2024-11-08","cited_by_count":4,"area":null},{"id":"2204.05923","title":"An Algebraically Converging Stochastic Gradient Descent Algorithm for Global Optimization","created":"2022-04-12","cited_by_count":3,"area":null},{"id":"2306.14288","title":"Near Optimal Heteroscedastic Regression with Symbiotic Learning","created":"2023-06-25","cited_by_count":3,"area":null},{"id":"2402.07445","title":"Top-$K$ ranking with a monotone adversary","created":"2024-02-12","cited_by_count":3,"area":null},{"id":"2406.10015","title":"Gradient-based Learning in State-based Potential Games for Self-Learning Production Systems","created":"2024-06-14","cited_by_count":3,"area":null},{"id":"2408.13276","title":"Non-convex matrix sensing: Breaking the quadratic rank barrier in the sample complexity","created":"2024-08-20","cited_by_count":3,"area":null},{"id":"2101.05113","title":"Beyond Procrustes: Balancing-Free Gradient Descent for Asymmetric Low-Rank Matrix Sensing","created":"2021-01-13","cited_by_count":2,"area":null},{"id":"2104.10314","title":"Efficient Sparse Coding using Hierarchical Riemannian Pursuit","created":"2021-04-21","cited_by_count":2,"area":null},{"id":"2210.09248","title":"Provable Phase Retrieval with Mirror Descent","created":"2022-10-17","cited_by_count":2,"area":null},{"id":"2305.19206","title":"Gradient descent in matrix factorization: Understanding large initialization","created":"2023-05-30","cited_by_count":2,"area":null},{"id":"2307.07030","title":"Accelerated Gradient Methods for Nonconvex Optimization: Escape Trajectories From Strict Saddle Points and Convergence to Local Minima","created":"2023-07-13","cited_by_count":2,"area":null},{"id":"2409.08771","title":"In-depth Analysis of Low-rank Matrix Factorisation in a Federated Setting","created":"2024-09-13","cited_by_count":2,"area":null},{"id":"2604.07372","title":"NS-RGS: Newton-Schulz based Riemannian gradient method for orthogonal group synchronization","created":"2026-04-07","cited_by_count":2,"area":null},{"id":"2604.09412","title":"Sharp description of local minima in the loss landscape of high-dimensional two-layer ReLU neural networks","created":"2026-04-10","cited_by_count":2,"area":"distill"},{"id":"2206.12486","title":"Variational Bayesian inference for CP tensor completion with side information","created":"2022-06-24","cited_by_count":1,"area":null},{"id":"2302.10066","title":"Sharp analysis of EM for learning mixtures of pairwise differences","created":"2023-02-20","cited_by_count":1,"area":null},{"id":"2308.11518","title":"EM for Mixture of Linear Regression with Clustered Data","created":"2023-08-22","cited_by_count":1,"area":null},{"id":"2311.12888","title":"Acceleration and Implicit Regularization in Gaussian Phase Retrieval","created":"2023-11-21","cited_by_count":1,"area":null},{"id":"2311.15221","title":"The Local Landscape of Phase Retrieval Under Limited Samples","created":"2023-11-26","cited_by_count":1,"area":null},{"id":"2406.01149","title":"Agnostic Learning of Mixed Linear Regressions with EM and AM Algorithms","created":"2024-06-03","cited_by_count":1,"area":null},{"id":"2409.04733","title":"A Sample Efficient Alternating Minimization-based Algorithm For Robust Phase Retrieval","created":"2024-09-07","cited_by_count":1,"area":null},{"id":"2504.19530","title":"Euclidean Distance Matrix Completion via Asymmetric Projected Gradient Descent","created":"2025-04-28","cited_by_count":1,"area":null},{"id":"2602.17876","title":"Interactive Learning of Single-Index Models via Stochastic Gradient Descent","created":"2026-02-19","cited_by_count":1,"area":null},{"id":"2603.06028","title":"Improved high-dimensional estimation with Langevin dynamics and stochastic weight averaging","created":"2026-03-06","cited_by_count":1,"area":null},{"id":"2205.08098","title":"Can We Do Better Than Random Start? The Power of Data Outsourcing","created":"2022-05-17","cited_by_count":0,"area":null},{"id":"2405.18427","title":"Classifying Overlapping Gaussian Mixtures in High Dimensions: From Optimal Classifiers to Neural Nets","created":"2024-05-28","cited_by_count":0,"area":null},{"id":"2409.01570","title":"Smoothed Robust Phase Retrieval","created":"2024-09-03","cited_by_count":0,"area":null},{"id":"2410.09990","title":"Global convergence of gradient descent for phase retrieval","created":"2024-10-13","cited_by_count":0,"area":null},{"id":"2411.15972","title":"Stability properties of gradient flow dynamics for the symmetric low-rank matrix factorization problem","created":"2024-11-24","cited_by_count":0,"area":null},{"id":"2502.00320","title":"$k$-SVD with Gradient Descent","created":"2025-02-01","cited_by_count":0,"area":null},{"id":"2503.18500","title":"Learning a Class of Mixed Linear Regressions: Global Convergence under General Data Conditions","created":"2025-03-24","cited_by_count":0,"area":null},{"id":"2506.22982","title":"Revisiting CroPA: A Reproducibility Study and Enhancements for Cross-Prompt Adversarial Transferability in Vision-Language Models","created":"2025-06-28","cited_by_count":0,"area":"mllm"},{"id":"2508.19579","title":"High-Speed FHD Full-Color Video Computer-Generated Holography","created":"2025-08-27","cited_by_count":0,"area":null},{"id":"2508.21657","title":"Unfolding Framework with Complex-Valued Deformable Attention for High-Quality Computer-Generated Hologram Generation","created":"2025-08-29","cited_by_count":0,"area":null},{"id":"2604.05842","title":"Expectation Maximization (EM) Converges for General Agnostic Mixtures","created":"2026-04-07","cited_by_count":0,"area":null},{"id":"2607.03596","title":"Empirical Bayes for correlated Gaussian sequence model","created":"2026-07-03","cited_by_count":0,"area":null}],"next_cursor":null}