{"list":"other","total":77,"rows":[{"id":"1606.04838","title":"Optimization Methods for Large-Scale Machine Learning","created":"2016-06-15","cited_by_count":1150},{"id":"1811.03804","title":"Gradient Descent Finds Global Minima of Deep Neural Networks","created":"2018-11-09","cited_by_count":574},{"id":"1911.10635","title":"Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithms","created":"2019-11-24","cited_by_count":567},{"id":"1702.03849","title":"Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysis","created":"2017-02-13","cited_by_count":243},{"id":"1711.00141","title":"Training GANs with Optimism","created":"2017-10-31","cited_by_count":217},{"id":"1412.7392","title":"Theoretical guarantees for approximate sampling from smooth and log-concave densities","created":"2014-12-23","cited_by_count":208},{"id":"1901.09401","title":"SGD: General Analysis and Improved Rates","created":"2019-01-27","cited_by_count":207},{"id":"1507.05021","title":"Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm","created":"2015-07-17","cited_by_count":197},{"id":"1507.00407","title":"Fast Convergence of Regularized Learning in Games","created":"2015-07-02","cited_by_count":150},{"id":"1712.06559","title":"The Power of Interpolation: Understanding the Effectiveness of SGD in Modern Over-parametrized Learning","created":"2017-12-18","cited_by_count":150},{"id":"1810.07288","title":"Fast and Faster Convergence of SGD for Over-Parameterized Models and an Accelerated Perceptron","created":"2018-10-16","cited_by_count":143},{"id":"1310.5715","title":"Stochastic Gradient Descent, Weighted Sampling, and the Randomized Kaczmarz algorithm","created":"2013-10-21","cited_by_count":133},{"id":"1707.03663","title":"Underdamped Langevin MCMC: A non-asymptotic analysis","created":"2017-07-12","cited_by_count":133},{"id":"1801.02309","title":"Log-concave sampling: Metropolis-Hastings algorithms are fast","created":"2018-01-08","cited_by_count":118},{"id":"1710.00095","title":"User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient","created":"2017-09-29","cited_by_count":116},{"id":"2006.05988","title":"Random Reshuffling: Simple Analysis with Vast Improvements","created":"2020-06-10","cited_by_count":115},{"id":"1705.10461","title":"The Numerics of GANs","created":"2017-05-30","cited_by_count":105},{"id":"1908.08465","title":"On the convergence of single-call stochastic extra-gradient methods","created":"2019-08-22","cited_by_count":89},{"id":"1707.06386","title":"Bridging the Gap between Constant Step Size Stochastic Gradient Descent and Markov Chains","created":"2017-07-20","cited_by_count":88},{"id":"2009.09623","title":"The Complexity of Constrained Min-Max Optimization","created":"2020-09-21","cited_by_count":82},{"id":"1608.07310","title":"Learning in games with continuous action sets and unknown payoff functions","created":"2016-08-25","cited_by_count":81},{"id":"2006.11144","title":"On the Almost Sure Convergence of Stochastic Gradient Descent in Non-Convex Problems","created":"2020-06-19","cited_by_count":80},{"id":"1510.08560","title":"Why Random Reshuffling Beats Stochastic Gradient Descent","created":"2015-10-29","cited_by_count":79},{"id":"1909.05503","title":"The Randomized Midpoint Method for Log-Concave Sampling","created":"2019-09-12","cited_by_count":78},{"id":"1805.01648","title":"Sharp convergence rates for Langevin dynamics in the nonconvex setting","created":"2018-05-04","cited_by_count":68},{"id":"1806.10077","title":"Random Shuffling Beats SGD after Finite Epochs","created":"2018-06-26","cited_by_count":67},{"id":"2002.07867","title":"Global Convergence of Deep Networks with One Wide Layer Followed by Pyramidal Topology","created":"2020-02-18","cited_by_count":66},{"id":"1908.00045","title":"How Good is SGD with Random Shuffling?","created":"2019-07-31","cited_by_count":64},{"id":"1807.09382","title":"On sampling from a log-concave density using kinetic Langevin diffusions","created":"2018-07-24","cited_by_count":62},{"id":"1903.01463","title":"SGD without Replacement: Sharper Rates for General Smooth Convex Functions","created":"2019-03-04","cited_by_count":61},{"id":"2006.06946","title":"SGD with shuffling: optimal rates without component convexity and large epoch requirements","created":"2020-06-12","cited_by_count":58},{"id":"2002.10400","title":"Closing the convergence gap of SGD without replacement","created":"2020-02-24","cited_by_count":57},{"id":"2005.13097","title":"On the Convergence of Langevin Monte Carlo: The Interplay between Tail Growth and Smoothness","created":"2020-05-27","cited_by_count":55},{"id":"1308.6370","title":"Fast Convergence of Stochastic Gradient Descent under a Strong Growth Condition","created":"2013-08-29","cited_by_count":54},{"id":"1507.02564","title":"Sampling from a log-concave distribution with Projected Langevin Monte Carlo","created":"2015-07-09","cited_by_count":52},{"id":"1610.01945","title":"Connecting Generative Adversarial Networks and Actor-Critic Methods","created":"2016-10-06","cited_by_count":50},{"id":"2006.09065","title":"The limits of min-max optimization algorithms: convergence to spurious non-critical sets","created":"2020-06-16","cited_by_count":50},{"id":"2006.07904","title":"An Analysis of Constant Step Size SGD in the Non-convex Regime: Asymptotic Normality and Bias","created":"2020-06-14","cited_by_count":48},{"id":"1507.01030","title":"Incremental Gradient, Subgradient, and Proximal Methods for Convex Optimization: A Survey","created":"2015-07-03","cited_by_count":45},{"id":"1810.12361","title":"Global Non-convex Optimization with Discretized Diffusions","created":"2018-10-29","cited_by_count":44},{"id":"1705.08964","title":"Sampling from a log-concave distribution with compact support with proximal Langevin Monte Carlo","created":"2017-05-24","cited_by_count":43},{"id":"2107.00052","title":"Stochastic Gradient Descent-Ascent and Consensus Optimization for Smooth Games: Convergence Analysis under Expected Co-coercivity","created":"2021-06-30","cited_by_count":43},{"id":"1802.09128","title":"Averaging Stochastic Gradient Descent on Riemannian Manifolds","created":"2018-02-26","cited_by_count":39},{"id":"2110.04261","title":"Extragradient Method: $O(1/K)$ Last-Iterate Convergence for Monotone Variational Inequalities and Connections With Cocoercivity","created":"2021-10-08","cited_by_count":39},{"id":"1905.11373","title":"Revisiting Stochastic Extragradient","created":"2019-05-27","cited_by_count":35},{"id":"1910.01845","title":"The Complexity of Finding Stationary Points with Stochastic Gradient Descent","created":"2019-10-04","cited_by_count":35},{"id":"1901.09149","title":"Escaping Saddle Points with Adaptive Gradient Methods","created":"2019-01-26","cited_by_count":34},{"id":"1910.12837","title":"Online Stochastic Gradient Descent with Arbitrary Initialization Solves Non-smooth, Non-convex Phase Retrieval","created":"2019-10-28","cited_by_count":34},{"id":"1906.07868","title":"Stochastic Runge-Kutta Accelerates Langevin Monte Carlo and Beyond","created":"2019-06-19","cited_by_count":33},{"id":"2205.08446","title":"Last-Iterate Convergence of Optimistic Gradient Method for Monotone Variational Inequalities","created":"2022-05-17","cited_by_count":33},{"id":"1906.03563","title":"Adversarial Attack Generation Empowered by Min-Max Optimization","created":"2019-06-09","cited_by_count":32},{"id":"2007.04202","title":"Stochastic Hamiltonian Gradient Methods for Smooth Games","created":"2020-07-08","cited_by_count":32},{"id":"2210.00953","title":"Bias and Extrapolation in Markovian Linear Stochastic Approximation with Constant Stepsizes","created":"2022-10-03","cited_by_count":30},{"id":"2103.04410","title":"Optimistic Dual Extrapolation for Coherent Non-monotone Variational Inequalities","created":"2021-03-07","cited_by_count":29},{"id":"2002.09806","title":"Finite-Time Last-Iterate Convergence for Multi-Agent Learning in Games","created":"2020-02-23","cited_by_count":26},{"id":"2310.10810","title":"Robust Multi-Agent Reinforcement Learning via Adversarial Regularization: Theoretical Foundation and Stable Algorithms","created":"2023-10-16","cited_by_count":25},{"id":"2206.03922","title":"A unified stochastic approximation framework for learning in games","created":"2022-06-08","cited_by_count":23},{"id":"2306.02601","title":"Aiming towards the minimizers: fast convergence of SGD for overparametrized problems","created":"2023-06-05","cited_by_count":22},{"id":"1810.04723","title":"Tight Dimension Independent Lower Bound on the Expected Convergence Rate for Diminishing Step Sizes in SGD","created":"2018-10-10","cited_by_count":18},{"id":"2401.13884","title":"Constant Stepsize Q-learning: Distributional Convergence, Bias and Extrapolation","created":"2024-01-25","cited_by_count":17},{"id":"2406.09241","title":"What is the long-run distribution of stochastic gradient descent? A large deviations analysis","created":"2024-06-13","cited_by_count":17},{"id":"2006.01510","title":"Recht-R\\'e Noncommutative Arithmetic-Geometric Mean Conjecture is False","created":"2020-06-02","cited_by_count":16},{"id":"2210.08857","title":"On the convergence of policy gradient methods to Nash equilibria in general stochastic games","created":"2022-10-17","cited_by_count":16},{"id":"2302.14043","title":"Single-Call Stochastic Extragradient Methods for Structured Non-monotone Variational Inequalities: Improved Analysis under Weaker Conditions","created":"2023-02-27","cited_by_count":14},{"id":"2206.02953","title":"Sampling without Replacement Leads to Faster Rates in Finite-Sum Minimax Optimization","created":"2022-06-07","cited_by_count":10},{"id":"2405.14285","title":"Computing the Bias of Constant-step Stochastic Approximation with Markovian Noise","created":"2024-05-23","cited_by_count":9},{"id":"2210.05995","title":"SGDA with shuffling: faster convergence for nonconvex-P{\\L} minimax optimization","created":"2022-10-12","cited_by_count":8},{"id":"2311.02374","title":"Riemannian stochastic optimization methods avoid strict saddle points","created":"2023-11-04","cited_by_count":8},{"id":"2503.16398","title":"The global convergence time of stochastic gradient descent in non-convex landscapes: Sharp estimates via large deviations","created":"2025-03-20","cited_by_count":8},{"id":"2207.07557","title":"The Computational Complexity of Multi-player Concave Games and Kakutani Fixed Points","created":"2022-07-15","cited_by_count":6},{"id":"2306.12498","title":"Empirical Risk Minimization with Shuffled SGD: A Primal-Dual Perspective and Improved Bounds","created":"2023-06-21","cited_by_count":6},{"id":"2306.16502","title":"Stochastic Methods in Variational Inequalities: Ergodicity, Bias and Refinements","created":"2023-06-28","cited_by_count":6},{"id":"2410.05106","title":"Nonasymptotic Analysis of Stochastic Gradient Descent with the Richardson-Romberg Extrapolation","created":"2024-10-07","cited_by_count":6},{"id":"2403.07148","title":"Stochastic Extragradient with Random Reshuffling: Improved Convergence for Variational Inequalities","created":"2024-03-11","cited_by_count":5},{"id":"2410.13067","title":"Two-Timescale Linear Stochastic Approximation: Constant Stepsizes Go a Long Way","created":"2024-10-16","cited_by_count":5},{"id":"2202.10523","title":"Semi-Implicit Hybrid Gradient Methods with Application to Adversarial Robustness","created":"2022-02-21","cited_by_count":1},{"id":"2207.09962","title":"PPAD-Complete Pure Approximate Nash Equilibria in Lipschitz Games","created":"2022-07-20","cited_by_count":1}],"next_cursor":null}