{"list":"other","total":58,"rows":[{"id":"1708.07747","title":"Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms","created":"2017-08-25","cited_by_count":4349},{"id":"1607.00133","title":"Deep Learning with Differential Privacy","created":"2016-07-01","cited_by_count":2728},{"id":"1309.5549","title":"Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programming","created":"2013-09-22","cited_by_count":724},{"id":"1608.04636","title":"Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-\\L{}ojasiewicz Condition","created":"2016-08-16","cited_by_count":539},{"id":"1905.11881","title":"Why gradient clipping accelerates training: A theoretical justification for adaptivity","created":"2019-05-28","cited_by_count":341},{"id":"1912.02365","title":"Lower Bounds for Non-Convex Stochastic Optimization","created":"2019-12-05","cited_by_count":307},{"id":"1801.05039","title":"Global Convergence of Policy Gradient Methods for the Linear Quadratic Regulator","created":"2018-01-15","cited_by_count":250},{"id":"1605.07110","title":"Deep Learning without Poor Local Minima","created":"2016-05-23","cited_by_count":234},{"id":"1803.06523","title":"Stochastic model-based minimization of weakly convex functions","created":"2018-03-17","cited_by_count":159},{"id":"2102.00135","title":"Policy Mirror Descent for Reinforcement Learning: Linear Convergence, New Sampling Complexity, and Generalized Problem Classes","created":"2021-01-30","cited_by_count":156},{"id":"1308.6594","title":"Mini-batch Stochastic Approximation Methods for Nonconvex Stochastic Composite Optimization","created":"2013-08-29","cited_by_count":143},{"id":"1802.05251","title":"Differentially Private Empirical Risk Minimization Revisited: Faster and More General","created":"2018-02-14","cited_by_count":128},{"id":"2201.07443","title":"On the Convergence Rates of Policy Gradient Methods","created":"2022-01-19","cited_by_count":119},{"id":"2007.02151","title":"Variational Policy Gradient Method for Reinforcement Learning with General Utilities","created":"2020-07-04","cited_by_count":111},{"id":"1610.05708","title":"Relatively-Smooth Convex Optimization by First-Order Methods, and Applications","created":"2016-10-18","cited_by_count":108},{"id":"2101.04233","title":"Independent Policy Gradient Methods for Competitive Reinforcement Learning","created":"2021-01-11","cited_by_count":101},{"id":"2105.11066","title":"Policy Mirror Descent for Regularized Reinforcement Learning: A Generalized Framework with Linear Convergence","created":"2021-05-24","cited_by_count":84},{"id":"2103.01516","title":"Private Stochastic Convex Optimization: Optimal Rates in $\\ell_1$ Geometry","created":"2021-03-02","cited_by_count":83},{"id":"2305.01588","title":"Revisiting Gradient Clipping: Stochastic bias and tight convergence guarantees","created":"2023-05-02","cited_by_count":83},{"id":"1907.04232","title":"Unified Optimal Analysis of the (Stochastic) Gradient Method","created":"2019-07-09","cited_by_count":82},{"id":"2102.08607","title":"On the Convergence and Sample Efficiency of Variance-Reduced Policy Gradient Method","created":"2021-02-17","cited_by_count":70},{"id":"1705.10257","title":"Boltzmann Exploration Done Right","created":"2017-05-29","cited_by_count":69},{"id":"1703.09947","title":"Efficient Private ERM for Smooth Objectives","created":"2017-03-29","cited_by_count":61},{"id":"1605.00125","title":"Efficiency of minimizing compositions of convex functions and smooth maps","created":"2016-04-30","cited_by_count":59},{"id":"1407.1537","title":"Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent","created":"2014-07-06","cited_by_count":58},{"id":"2302.01734","title":"Stochastic Policy Gradient Methods: Improved Sample Complexity for Fisher-non-degenerate Policies","created":"2023-02-03","cited_by_count":58},{"id":"2103.01278","title":"Non-Euclidean Differentially Private Stochastic Convex Optimization: Optimal Rates in Linear Time","created":"2021-03-01","cited_by_count":51},{"id":"2302.14843","title":"High Probability Convergence of Stochastic Gradient Methods","created":"2023-02-28","cited_by_count":49},{"id":"2105.01424","title":"On the Linear convergence of Natural Policy Gradient Algorithm","created":"2021-05-04","cited_by_count":48},{"id":"2107.05585","title":"Differentially Private Stochastic Optimization: New Results in Convex and Non-Convex Settings","created":"2021-07-12","cited_by_count":45},{"id":"2302.06570","title":"Beyond Uniform Smoothness: A Stopped Analysis of Adaptive SGD","created":"2023-02-13","cited_by_count":41},{"id":"1802.04477","title":"A Simple Proximal Stochastic Gradient Method for Nonsmooth Nonconvex Optimization","created":"2018-02-13","cited_by_count":33},{"id":"1907.02707","title":"Algorithms of Robust Stochastic Optimization Based on Mirror Descent Method","created":"2019-07-05","cited_by_count":32},{"id":"2305.15155","title":"Momentum Provably Improves Error Feedback!","created":"2023-05-24","cited_by_count":31},{"id":"1707.03505","title":"Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems","created":"2017-07-12","cited_by_count":30},{"id":"2311.03252","title":"Parameter-Agnostic Optimization under Relaxed Smoothness","created":"2023-11-06","cited_by_count":29},{"id":"2004.09875","title":"Optimizing Static Linear Feedback: Gradient Method","created":"2020-04-21","cited_by_count":27},{"id":"2006.13501","title":"Private Stochastic Non-Convex Optimization: Adaptive Algorithms and Tighter Generalization Bounds","created":"2020-06-24","cited_by_count":26},{"id":"2110.10116","title":"On the Global Optimum Convergence of Momentum-based Policy Gradient","created":"2021-10-19","cited_by_count":26},{"id":"2202.11632","title":"Mirror Descent Strikes Again: Optimal Stochastic Convex Optimization under Infinite Noise Variance","created":"2022-02-23","cited_by_count":24},{"id":"2305.12475","title":"Two Sides of One Coin: the Limits of Untuned SGD and the Power of Adaptive Methods","created":"2023-05-21","cited_by_count":23},{"id":"1808.03045","title":"Accelerated Bregman Proximal Gradient Methods for Relatively Smooth Convex Optimization","created":"2018-08-09","cited_by_count":20},{"id":"2210.01748","title":"Sharp Analysis of Stochastic Optimization under Global Kurdyka-{\\L}ojasiewicz Inequality","created":"2022-10-04","cited_by_count":20},{"id":"1806.04781","title":"On the Convergence Rate of Stochastic Mirror Descent for Nonsmooth Nonconvex Optimization","created":"2018-06-12","cited_by_count":18},{"id":"2302.11381","title":"Optimal Convergence Rate for Exact Policy Mirror Descent in Discounted Markov Decision Processes","created":"2023-02-22","cited_by_count":18},{"id":"2306.01854","title":"Reinforcement Learning with General Utilities: Simpler Variance Reduction and Large State-Action Space","created":"2023-06-02","cited_by_count":18},{"id":"2106.12112","title":"Bregman Gradient Policy Optimization","created":"2021-06-23","cited_by_count":17},{"id":"1911.08510","title":"Optimal Complexity and Certification of Bregman First-Order Methods","created":"2019-11-19","cited_by_count":16},{"id":"1710.04718","title":"\"Relative-Continuity\" for Non-Lipschitz Non-Smooth Convex Optimization using Stochastic (or Deterministic) Mirror Descent","created":"2017-10-12","cited_by_count":15},{"id":"1803.07374","title":"Fastest Rates for Stochastic Mirror Descent Methods","created":"2018-03-20","cited_by_count":14},{"id":"2207.08347","title":"Private Convex Optimization in General Norms","created":"2022-07-18","cited_by_count":13},{"id":"2304.01119","title":"Improved Convergence in High Probability of Clipped Gradient Methods with Heavy Tails","created":"2023-04-03","cited_by_count":13},{"id":"2401.00108","title":"Stochastic Optimization under Hidden Convexity","created":"2023-12-30","cited_by_count":12},{"id":"1604.08096","title":"Forward-backward quasi-Newton methods for nonsmooth optimization problems","created":"2016-04-27","cited_by_count":9},{"id":"2306.14522","title":"Nonconvex Stochastic Bregman Proximal Gradient Method with Application to Deep Learning","created":"2023-06-26","cited_by_count":7},{"id":"1905.11904","title":"A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima","created":"2019-05-28","cited_by_count":6},{"id":"2309.04272","title":"Learning Zero-Sum Linear Quadratic Games with Improved Sample Complexity and Last-Iterate Convergence","created":"2023-09-08","cited_by_count":4},{"id":"1605.00201","title":"Further properties of the forward-backward envelope with applications to difference-of-convex programming","created":"2016-05-01","cited_by_count":3}],"next_cursor":null}