{"list":"other","total":52,"rows":[{"id":"1706.06083","title":"Towards Deep Learning Models Resistant to Adversarial Attacks","created":"2017-06-19","cited_by_count":6415},{"id":"1606.04838","title":"Optimization Methods for Large-Scale Machine Learning","created":"2016-06-15","cited_by_count":1150},{"id":"1309.5549","title":"Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programming","created":"2013-09-22","cited_by_count":724},{"id":"1802.04434","title":"signSGD: Compressed Optimisation for Non-Convex Problems","created":"2018-02-13","cited_by_count":571},{"id":"1901.09847","title":"Error Feedback Fixes SignSGD and other Gradient Compression Schemes","created":"2019-01-28","cited_by_count":310},{"id":"1704.05021","title":"Sparse Communication for Distributed Gradient Descent","created":"2017-04-17","cited_by_count":249},{"id":"1806.02450","title":"A Finite Time Analysis of Temporal Difference Learning With Linear Function Approximation","created":"2018-06-06","cited_by_count":229},{"id":"1703.00102","title":"SARAH: A Novel Method for Machine Learning Problems Using Stochastic Recursive Gradient","created":"2017-03-01","cited_by_count":220},{"id":"1810.10667","title":"Truncated Back-propagation for Bilevel Optimization","created":"2018-10-25","cited_by_count":190},{"id":"2006.15429","title":"Understanding Gradient Clipping in Private SGD: A Geometric Perspective","created":"2020-06-27","cited_by_count":142},{"id":"2002.12410","title":"On Biased Compression for Distributed Learning","created":"2020-02-27","cited_by_count":140},{"id":"2006.04740","title":"The Heavy-Tail Phenomenon in SGD","created":"2020-06-08","cited_by_count":124},{"id":"2005.01350","title":"A Finite Time Analysis of Two Time-Scale Actor Critic Methods","created":"2020-05-04","cited_by_count":122},{"id":"1408.3595","title":"Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints","created":"2014-08-15","cited_by_count":105},{"id":"2005.10785","title":"Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clipping","created":"2020-05-21","cited_by_count":104},{"id":"1812.05217","title":"Tight Analyses for Non-Smooth Stochastic Gradient Descent","created":"2018-12-13","cited_by_count":97},{"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":"2305.01588","title":"Revisiting Gradient Clipping: Stochastic bias and tight convergence guarantees","created":"2023-05-02","cited_by_count":83},{"id":"2106.14343","title":"High-probability Bounds for Non-Convex Stochastic Optimization with Heavy Tails","created":"2021-06-28","cited_by_count":80},{"id":"1510.08560","title":"Why Random Reshuffling Beats Stochastic Gradient Descent","created":"2015-10-29","cited_by_count":79},{"id":"2007.14294","title":"A High Probability Analysis of Adaptive SGD with Momentum","created":"2020-07-28","cited_by_count":61},{"id":"1307.1827","title":"Loss minimization and parameter estimation with heavy tails","created":"2013-07-07","cited_by_count":50},{"id":"1507.01030","title":"Incremental Gradient, Subgradient, and Proximal Methods for Convex Optimization: A Survey","created":"2015-07-03","cited_by_count":45},{"id":"2305.16296","title":"A Guide Through the Zoo of Biased SGD","created":"2023-05-25","cited_by_count":40},{"id":"2302.14428","title":"Stochastic Gradient Descent under Markovian Sampling Schemes","created":"2023-02-28","cited_by_count":38},{"id":"2102.06489","title":"Stability and Convergence of Stochastic Gradient Clipping: Beyond Lipschitz Continuity and Smoothness","created":"2021-02-12","cited_by_count":37},{"id":"1510.08562","title":"Convergence Rate of Incremental Gradient and Newton Methods","created":"2015-10-29","cited_by_count":27},{"id":"1504.01577","title":"From Averaging to Acceleration, There is Only a Step-size","created":"2015-04-07","cited_by_count":24},{"id":"2205.15084","title":"SAPD+: An Accelerated Stochastic Method for Nonconvex-Concave Minimax Problems","created":"2022-05-30","cited_by_count":23},{"id":"1706.04381","title":"Dissipativity Theory for Nesterov's Accelerated Method","created":"2017-06-14","cited_by_count":22},{"id":"2106.05958","title":"High Probability Complexity Bounds for Non-Smooth Stochastic Optimization with Heavy-Tailed Noise","created":"2021-06-10","cited_by_count":19},{"id":"1901.08022","title":"A Universally Optimal Multistage Accelerated Stochastic Gradient Method","created":"2019-01-23","cited_by_count":17},{"id":"1901.07445","title":"Accelerated Linear Convergence of Stochastic Momentum Methods in Wasserstein Distances","created":"2019-01-22","cited_by_count":16},{"id":"1710.04753","title":"A Robust Accelerated Optimization Algorithm for Strongly Convex Functions","created":"2017-10-13","cited_by_count":14},{"id":"2008.01989","title":"Differentially Private Accelerated Optimization Algorithms","created":"2020-08-05","cited_by_count":13},{"id":"1805.10579","title":"Robust Accelerated Gradient Methods for Smooth Strongly Convex Functions","created":"2018-05-27","cited_by_count":12},{"id":"1906.01133","title":"On Biased Stochastic Gradient Estimation","created":"2019-06-04","cited_by_count":11},{"id":"2111.12743","title":"Robust Accelerated Primal-Dual Methods for Computing Saddle Points","created":"2021-11-24","cited_by_count":10},{"id":"2202.03525","title":"Nesterov Accelerated Shuffling Gradient Method for Convex Optimization","created":"2022-02-07","cited_by_count":10},{"id":"1910.08701","title":"Robust Distributed Accelerated Stochastic Gradient Methods for Multi-Agent Networks","created":"2019-10-19","cited_by_count":9},{"id":"2211.00969","title":"Large deviations rates for stochastic gradient descent with strongly convex functions","created":"2022-11-02","cited_by_count":9},{"id":"2410.15637","title":"Large Deviation Upper Bounds and Improved MSE Rates of Nonlinear SGD: Heavy-tailed Noise and Power of Symmetry","created":"2024-10-21","cited_by_count":7},{"id":"1905.11011","title":"Robustness of accelerated first-order algorithms for strongly convex optimization problems","created":"2019-05-27","cited_by_count":6},{"id":"2311.11841","title":"High Probability Guarantees for Random Reshuffling","created":"2023-11-20","cited_by_count":5},{"id":"2105.08037","title":"Adversarial Training for Gradient Descent: Analysis Through its Continuous-time Approximation","created":"2021-05-17","cited_by_count":4},{"id":"2202.12276","title":"On the influence of stochastic roundoff errors and their bias on the convergence of the gradient descent method with low-precision floating-point computation","created":"2022-02-24","cited_by_count":4},{"id":"2109.05059","title":"The Speed-Robustness Trade-Off for First-Order Methods with Additive Gradient Noise","created":"2021-09-10","cited_by_count":3},{"id":"2303.16241","title":"Convergence of the Stochastic Heavy Ball Method With Approximate Gradients and/or Block Updating","created":"2023-03-28","cited_by_count":2},{"id":"2403.00853","title":"Parallel Momentum Methods Under Biased Gradient Estimations","created":"2024-02-29","cited_by_count":2},{"id":"2502.02529","title":"A weak convergence approach to large deviations for stochastic approximations","created":"2025-02-04","cited_by_count":2},{"id":"2304.00444","title":"High Probability and Risk-Averse Guarantees for a Stochastic Accelerated Primal-Dual Method","created":"2023-04-02","cited_by_count":1},{"id":"2309.11481","title":"Robustly Stable Accelerated Momentum Methods With A Near-Optimal L2 Gain and $H_\\infty$ Performance","created":"2023-09-20","cited_by_count":1}],"next_cursor":null}