{"total":279,"rows":[{"id":"2404.09591","title":"3D Gaussian Splatting as Markov Chain Monte Carlo","created":"2024-04-15","cited_by_count":217,"area":null},{"id":"2205.09745","title":"Understanding Gradient Descent on Edge of Stability in Deep Learning","created":"2022-05-19","cited_by_count":128,"area":null},{"id":"2105.12221","title":"Geometry of the Loss Landscape in Overparameterized Neural Networks: Symmetries and Invariances","created":"2021-05-25","cited_by_count":127,"area":null},{"id":"2111.12444","title":"Edge Artificial Intelligence for 6G: Vision, Enabling Technologies, and Applications","created":"2021-11-24","cited_by_count":97,"area":null},{"id":"2202.14037","title":"Understanding Contrastive Learning Requires Incorporating Inductive Biases","created":"2022-02-28","cited_by_count":96,"area":null},{"id":"2210.15651","title":"Learning Single-Index Models with Shallow Neural Networks","created":"2022-10-27","cited_by_count":92,"area":null},{"id":"2106.15933","title":"Saddle-to-Saddle Dynamics in Deep Linear Networks: Small Initialization Training, Symmetry, and Sparsity","created":"2021-06-30","cited_by_count":85,"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":"2102.12470","title":"On the Validity of Modeling SGD with Stochastic Differential Equations (SDEs)","created":"2021-02-24","cited_by_count":73,"area":null},{"id":"2106.04159","title":"Fast Federated Learning in the Presence of Arbitrary Device Unavailability","created":"2021-06-08","cited_by_count":72,"area":null},{"id":"2108.10573","title":"The staircase property: How hierarchical structure can guide deep learning","created":"2021-08-24","cited_by_count":62,"area":null},{"id":"2106.10784","title":"iDARTS: Differentiable Architecture Search with Stochastic Implicit Gradients","created":"2021-06-21","cited_by_count":51,"area":null},{"id":"2209.09211","title":"Neural Collapse with Normalized Features: A Geometric Analysis over the Riemannian Manifold","created":"2022-09-19","cited_by_count":50,"area":null},{"id":"2402.11867","title":"LoRA Training in the NTK Regime has No Spurious Local Minima","created":"2024-02-19","cited_by_count":48,"area":null},{"id":"2402.01258","title":"Transformers Learn Nonlinear Features In Context: Nonconvex Mean-field Dynamics on the Attention Landscape","created":"2024-02-02","cited_by_count":46,"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":"2109.06141","title":"On Tilted Losses in Machine Learning: Theory and Applications","created":"2021-09-13","cited_by_count":43,"area":null},{"id":"2104.06763","title":"Oracle Complexity in Nonsmooth Nonconvex Optimization","created":"2021-04-14","cited_by_count":39,"area":null},{"id":"2107.11228","title":"Taxonomizing local versus global structure in neural network loss landscapes","created":"2021-07-23","cited_by_count":34,"area":null},{"id":"2310.18286","title":"Optimal Transport for Treatment Effect Estimation","created":"2023-10-27","cited_by_count":32,"area":null},{"id":"2410.11582","title":"On-the-fly Modulation for Balanced Multimodal Learning","created":"2024-10-15","cited_by_count":32,"area":null},{"id":"2102.03198","title":"Bias-Variance Reduced Local SGD for Less Heterogeneous Federated Learning","created":"2021-02-05","cited_by_count":31,"area":null},{"id":"2103.17182","title":"Positive-Negative Momentum: Manipulating Stochastic Gradient Noise to Improve Generalization","created":"2021-03-31","cited_by_count":28,"area":null},{"id":"2212.13827","title":"Escaping Saddle Points for Effective Generalization on Class-Imbalanced Data","created":"2022-12-28","cited_by_count":28,"area":null},{"id":"2206.04613","title":"Explicit Regularization in Overparametrized Models via Noise Injection","created":"2022-06-09","cited_by_count":26,"area":null},{"id":"2105.14417","title":"Overparameterization of deep ResNet: zero loss and mean-field analysis","created":"2021-05-30","cited_by_count":24,"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":"2203.16462","title":"Convergence of gradient descent for deep neural networks","created":"2022-03-30","cited_by_count":24,"area":null},{"id":"2301.08203","title":"An SDE for Modeling SAM: Theory and Insights","created":"2023-01-19","cited_by_count":22,"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":"2207.00391","title":"A Theoretical Analysis of the Learning Dynamics under Class Imbalance","created":"2022-07-01","cited_by_count":20,"area":null},{"id":"2104.05508","title":"Noether: The More Things Change, the More Stay the Same","created":"2021-04-12","cited_by_count":19,"area":null},{"id":"2109.05439","title":"Concave Utility Reinforcement Learning with Zero-Constraint Violations","created":"2021-09-12","cited_by_count":19,"area":null},{"id":"2202.03684","title":"Efficiently Escaping Saddle Points in Bilevel Optimization","created":"2022-02-08","cited_by_count":19,"area":null},{"id":"2310.01769","title":"How Over-Parameterization Slows Down Gradient Descent in Matrix Sensing: The Curses of Symmetry and Initialization","created":"2023-10-03","cited_by_count":18,"area":null},{"id":"2201.11411","title":"Restarted Nonconvex Accelerated Gradient Descent: No More Polylogarithmic Factor in the $O(\\epsilon^{-7/4})$ Complexity","created":"2022-01-27","cited_by_count":17,"area":null},{"id":"2210.01212","title":"spred: Solving $L_1$ Penalty with SGD","created":"2022-10-03","cited_by_count":17,"area":null},{"id":"2306.14853","title":"Near-Optimal Nonconvex-Strongly-Convex Bilevel Optimization with Fully First-Order Oracles","created":"2023-06-26","cited_by_count":17,"area":null},{"id":"2110.08084","title":"Gradient Descent on Infinitely Wide Neural Networks: Global Convergence and Generalization","created":"2021-10-15","cited_by_count":16,"area":null},{"id":"2204.13751","title":"BEINIT: Avoiding Barren Plateaus in Variational Quantum Algorithms","created":"2022-04-28","cited_by_count":16,"area":null},{"id":"2406.17819","title":"Automatically Adaptive Conformal Risk Control","created":"2024-06-25","cited_by_count":16,"area":null},{"id":"2102.12430","title":"Noisy Gradient Descent Converges to Flat Minima for Nonconvex Matrix Factorization","created":"2021-02-24","cited_by_count":15,"area":null},{"id":"2307.00126","title":"Accelerating Inexact HyperGradient Descent for Bilevel Optimization","created":"2023-06-30","cited_by_count":15,"area":null},{"id":"2102.03803","title":"Lazy OCO: Online Convex Optimization on a Switching Budget","created":"2021-02-07","cited_by_count":14,"area":null},{"id":"2104.10095","title":"Turning Channel Noise into an Accelerator for Over-the-Air Principal Component Analysis","created":"2021-04-20","cited_by_count":14,"area":null},{"id":"2105.10762","title":"AutoLRS: Automatic Learning-Rate Schedule by Bayesian Optimization on the Fly","created":"2021-05-22","cited_by_count":14,"area":null},{"id":"2106.01429","title":"Smooth Bilevel Programming for Sparse Regularization","created":"2021-06-02","cited_by_count":14,"area":null},{"id":"2307.11782","title":"Convergence of Adam for Non-convex Objectives: Relaxed Hyperparameters and Non-ergodic Case","created":"2023-07-20","cited_by_count":14,"area":null},{"id":"2310.11428","title":"Butterfly Effects of SGD Noise: Error Amplification in Behavior Cloning and Autoregression","created":"2023-10-17","cited_by_count":14,"area":null},{"id":"2310.15903","title":"Neural Collapse in Multi-label Learning with Pick-all-label Loss","created":"2023-10-24","cited_by_count":14,"area":null},{"id":"2103.01338","title":"Acceleration via Fractal Learning Rate Schedules","created":"2021-03-01","cited_by_count":13,"area":null},{"id":"2206.03688","title":"Identifying good directions to escape the NTK regime and efficiently learn low-degree plus sparse polynomials","created":"2022-06-08","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":"2305.15659","title":"How to escape sharp minima with random perturbations","created":"2023-05-25","cited_by_count":13,"area":null},{"id":"2406.01909","title":"A Global Geometric Analysis of Maximal Coding Rate Reduction","created":"2024-06-04","cited_by_count":13,"area":null},{"id":"2604.07666","title":"An Imperfect Verifier is Good Enough: Learning with Noisy Rewards","created":"2026-04-09","cited_by_count":13,"area":null},{"id":"2110.02926","title":"On the Global Convergence of Gradient Descent for multi-layer ResNets in the mean-field regime","created":"2021-10-06","cited_by_count":12,"area":null},{"id":"2110.04814","title":"Finding Second-Order Stationary Points in Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-10-10","cited_by_count":12,"area":null},{"id":"2208.02711","title":"Agnostic Learning of General ReLU Activation Using Gradient Descent","created":"2022-08-04","cited_by_count":12,"area":null},{"id":"2302.09699","title":"Private (Stochastic) Non-Convex Optimization Revisited: Second-Order Stationary Points and Excess Risks","created":"2023-02-20","cited_by_count":12,"area":null},{"id":"2309.10688","title":"On the different regimes of Stochastic Gradient Descent","created":"2023-09-19","cited_by_count":12,"area":null},{"id":"2406.06838","title":"Stable Minima Cannot Overfit in Univariate ReLU Networks: Generalization by Large Step Sizes","created":"2024-06-10","cited_by_count":12,"area":null},{"id":"2504.09708","title":"Preconditioned Gradient Descent for Over-Parameterized Nonconvex Matrix Factorization","created":"2025-04-13","cited_by_count":12,"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":"2205.15235","title":"Non-convex online learning via algorithmic equivalence","created":"2022-05-30","cited_by_count":11,"area":null},{"id":"2306.10171","title":"Bootstrapped Representations in Reinforcement Learning","created":"2023-06-16","cited_by_count":11,"area":null},{"id":"2310.00526","title":"Are Graph Neural Networks Optimal Approximation Algorithms?","created":"2023-10-01","cited_by_count":11,"area":null},{"id":"2410.06441","title":"Addax: Utilizing Zeroth-Order Gradients to Improve Memory Efficiency and Performance of SGD for Fine-Tuning Language Models","created":"2024-10-09","cited_by_count":11,"area":null},{"id":"2602.03067","title":"FlashSinkhorn: IO-Aware Entropic Optimal Transport on GPU","created":"2026-02-03","cited_by_count":11,"area":null},{"id":"2102.02969","title":"Sign-RIP: A Robust Restricted Isometry Property for Low-rank Matrix Recovery","created":"2021-02-05","cited_by_count":10,"area":null},{"id":"2202.06742","title":"Trace norm regularization for multi-task learning with scarce data","created":"2022-02-14","cited_by_count":10,"area":null},{"id":"2206.02041","title":"First-Order Algorithms for Min-Max Optimization in Geodesic Metric Spaces","created":"2022-06-04","cited_by_count":10,"area":null},{"id":"2211.17263","title":"Plateau-reduced Differentiable Path Tracing","created":"2022-11-30","cited_by_count":10,"area":null},{"id":"2310.10089","title":"Over-the-Air Federated Learning and Optimization","created":"2023-10-16","cited_by_count":10,"area":null},{"id":"2408.11979","title":"Only Strict Saddles in the Energy Landscape of Predictive Coding Networks?","created":"2024-08-21","cited_by_count":10,"area":null},{"id":"2602.00170","title":"The Blessing of Dimensionality in LLM Fine-tuning: A Variance-Curvature Perspective","created":"2026-01-30","cited_by_count":10,"area":null},{"id":"2101.06070","title":"Efficient Semi-Implicit Variational Inference","created":"2021-01-15","cited_by_count":9,"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":"2104.01634","title":"Pareto Efficient Fairness in Supervised Learning: From Extraction to Tracing","created":"2021-04-04","cited_by_count":8,"area":null},{"id":"2106.02985","title":"Escaping Saddle Points Faster with Stochastic Momentum","created":"2021-06-05","cited_by_count":8,"area":null},{"id":"2107.11774","title":"SGD with a Constant Large Learning Rate Can Converge to Local Maxima","created":"2021-07-25","cited_by_count":8,"area":null},{"id":"2201.03064","title":"Stability Based Generalization Bounds for Exponential Family Langevin Dynamics","created":"2022-01-09","cited_by_count":8,"area":null},{"id":"2203.03899","title":"Noisy Low-rank Matrix Optimization: Geometry of Local Minima and Convergence Rate","created":"2022-03-08","cited_by_count":8,"area":null},{"id":"2311.02374","title":"Riemannian stochastic optimization methods avoid strict saddle points","created":"2023-11-04","cited_by_count":8,"area":null},{"id":"2401.02592","title":"Guaranteed Nonconvex Factorization Approach for Tensor Train Recovery","created":"2024-01-05","cited_by_count":8,"area":null},{"id":"2410.11061","title":"Learning to Optimize for Mixed-Integer Non-linear Programming with Feasibility Guarantees","created":"2024-10-14","cited_by_count":8,"area":null},{"id":"2410.12455","title":"Loss Landscape Characterization of Neural Networks without Over-Parametrization","created":"2024-10-16","cited_by_count":8,"area":null},{"id":"2102.06759","title":"Stochastic Gradient Langevin Dynamics with Variance Reduction","created":"2021-02-12","cited_by_count":7,"area":null},{"id":"2105.08232","title":"Sharp Restricted Isometry Property Bounds for Low-rank Matrix Recovery Problems with Corrupted Measurements","created":"2021-05-18","cited_by_count":7,"area":null},{"id":"2107.01832","title":"Provable Convergence of Nesterov's Accelerated Gradient Method for Over-Parameterized Neural Networks","created":"2021-07-05","cited_by_count":7,"area":null},{"id":"2201.09196","title":"Learning to Predict Gradients for Semi-Supervised Continual Learning","created":"2022-01-23","cited_by_count":7,"area":null},{"id":"2201.10447","title":"Differentially Private Temporal Difference Learning with Stochastic Nonconvex-Strongly-Concave Optimization","created":"2022-01-25","cited_by_count":7,"area":null},{"id":"2206.01515","title":"Understanding Deep Learning via Decision Boundary","created":"2022-06-03","cited_by_count":7,"area":null},{"id":"2207.02189","title":"Accelerating Hamiltonian Monte Carlo via Chebyshev Integration Time","created":"2022-07-05","cited_by_count":7,"area":null},{"id":"2303.15634","title":"Learning Rate Schedules in the Presence of Distribution Shift","created":"2023-03-27","cited_by_count":7,"area":null},{"id":"2304.10951","title":"A Cubic-regularized Policy Newton Algorithm for Reinforcement Learning","created":"2023-04-21","cited_by_count":7,"area":null},{"id":"2501.00817","title":"Hardness of Learning Fixed Parities with Neural Networks","created":"2025-01-01","cited_by_count":7,"area":null},{"id":"2202.00808","title":"Gromov-Wasserstein Discrepancy with Local Differential Privacy for Distributed Structural Graphs","created":"2022-02-01","cited_by_count":6,"area":null},{"id":"2208.11246","title":"Accelerating SGD for Highly Ill-Conditioned Huge-Scale Online Matrix Completion","created":"2022-08-24","cited_by_count":6,"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}],"next_cursor":"100"}