{"list":"other","total":64,"rows":[{"id":"2106.01946","title":"Convex optimization","created":"2021-06-03","cited_by_count":2515},{"id":"1802.09477","title":"Addressing Function Approximation Error in Actor-Critic Methods","created":"2018-02-26","cited_by_count":2417},{"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":"1511.00363","title":"BinaryConnect: Training Deep Neural Networks with binary weights during propagations","created":"2015-11-02","cited_by_count":592},{"id":"1405.4980","title":"Convex Optimization: Algorithms and Complexity","created":"2014-05-20","cited_by_count":575},{"id":"1802.04434","title":"signSGD: Compressed Optimisation for Non-Convex Problems","created":"2018-02-13","cited_by_count":571},{"id":"1407.0202","title":"SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives","created":"2014-07-01","cited_by_count":402},{"id":"1502.02551","title":"Deep Learning with Limited Numerical Precision","created":"2015-02-09","cited_by_count":376},{"id":"1809.07599","title":"Sparsified SGD with Memory","created":"2018-09-20","cited_by_count":376},{"id":"1901.09847","title":"Error Feedback Fixes SignSGD and other Gradient Compression Schemes","created":"2019-01-28","cited_by_count":310},{"id":"1912.02365","title":"Lower Bounds for Non-Convex Stochastic Optimization","created":"2019-12-05","cited_by_count":307},{"id":"1807.01695","title":"SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimator","created":"2018-07-04","cited_by_count":287},{"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":"1503.01243","title":"A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights","created":"2015-03-04","cited_by_count":206},{"id":"1310.5715","title":"Stochastic Gradient Descent, Weighted Sampling, and the Randomized Kaczmarz algorithm","created":"2013-10-21","cited_by_count":133},{"id":"1804.07795","title":"Stochastic subgradient method converges on tame functions","created":"2018-04-20","cited_by_count":124},{"id":"1905.05957","title":"DoubleSqueeze: Parallel Stochastic Gradient Descent with Double-Pass Error-Compensated Compression","created":"2019-05-15","cited_by_count":99},{"id":"1905.10988","title":"Natural Compression for Distributed Deep Learning","created":"2019-05-27","cited_by_count":90},{"id":"2010.00892","title":"Variance-Reduced Methods for Machine Learning","created":"2020-10-02","cited_by_count":79},{"id":"2111.14826","title":"Nonuniform-to-Uniform Quantization: Towards Accurate Quantization via Generalized Straight-Through Estimation","created":"2021-11-29","cited_by_count":79},{"id":"1706.02379","title":"Training Quantized Nets: A Deeper Understanding","created":"2017-06-07","cited_by_count":75},{"id":"1810.08907","title":"Understanding the Acceleration Phenomenon via High-Resolution Differential Equations","created":"2018-10-21","cited_by_count":69},{"id":"1507.06970","title":"Perturbed Iterate Analysis for Asynchronous Stochastic Optimization","created":"2015-07-24","cited_by_count":67},{"id":"1706.09156","title":"Non-convex Finite-Sum Optimization Via SCSG Methods","created":"2017-06-28","cited_by_count":61},{"id":"2010.12292","title":"Linearly Converging Error Compensated SGD","created":"2020-10-23","cited_by_count":61},{"id":"1705.02766","title":"\"Convex Until Proven Guilty\": Dimension-Free Acceleration of Gradient Descent on Non-Convex Functions","created":"2017-05-08","cited_by_count":46},{"id":"1902.00629","title":"Non-asymptotic Analysis of Biased Stochastic Approximation Scheme","created":"2019-02-02","cited_by_count":45},{"id":"2002.08958","title":"Uncertainty Principle for Communication Compression in Distributed and Federated Learning and the Search for an Optimal Compressor","created":"2020-02-20","cited_by_count":45},{"id":"1806.00291","title":"Optimal Algorithms for Non-Smooth Distributed Optimization in Networks","created":"2018-06-01","cited_by_count":41},{"id":"1506.00552","title":"Coordinate Descent Converges Faster with the Gauss-Southwell Rule Than Random Selection","created":"2015-06-01","cited_by_count":39},{"id":"1607.01231","title":"Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization","created":"2016-07-05","cited_by_count":37},{"id":"1806.11536","title":"An Exact Quantized Decentralized Gradient Descent Algorithm","created":"2018-06-29","cited_by_count":36},{"id":"1506.06438","title":"Taming the Wild: A Unified Analysis of Hogwild!-Style Algorithms","created":"2015-06-22","cited_by_count":31},{"id":"2106.02925","title":"Tensor Normal Training for Deep Learning Models","created":"2021-06-05","cited_by_count":24},{"id":"1805.01916","title":"Analysis of nonsmooth stochastic approximation: the differential inclusion approach","created":"2018-05-04","cited_by_count":23},{"id":"2102.12528","title":"Preserved central model for faster bidirectional compression in distributed settings","created":"2021-02-24","cited_by_count":21},{"id":"1803.03383","title":"High-Accuracy Low-Precision Training","created":"2018-03-09","cited_by_count":20},{"id":"1508.00882","title":"Asynchronous stochastic convex optimization","created":"2015-08-04","cited_by_count":19},{"id":"1709.00291","title":"Asymptotic Bias of Stochastic Gradient Search","created":"2017-08-30","cited_by_count":19},{"id":"2004.01025","title":"Mirrorless Mirror Descent: A Natural Derivation of Mirror Descent","created":"2020-04-02","cited_by_count":18},{"id":"2011.01170","title":"Homeomorphic-Invariance of EM: Non-Asymptotic Convergence in KL Divergence for Exponential Families via Mirror Descent","created":"2020-11-02","cited_by_count":18},{"id":"2006.06880","title":"Reintroducing Straight-Through Estimators as Principled Methods for Stochastic Binary Networks","created":"2020-06-11","cited_by_count":15},{"id":"1805.10579","title":"Robust Accelerated Gradient Methods for Smooth Strongly Convex Functions","created":"2018-05-27","cited_by_count":12},{"id":"1910.12521","title":"On the Global Convergence of (Fast) Incremental Expectation Maximization Methods","created":"2019-10-28","cited_by_count":12},{"id":"1810.13107","title":"End-to-End Feedback Loss in Speech Chain Framework via Straight-Through Estimator","created":"2018-10-31","cited_by_count":11},{"id":"2112.02880","title":"AdaSTE: An Adaptive Straight-Through Estimator to Train Binary Neural Networks","created":"2021-12-06","cited_by_count":11},{"id":"1504.06043","title":"Stability of Stochastic Approximations with `Controlled Markov' Noise and Temporal Difference Learning","created":"2015-04-23","cited_by_count":9},{"id":"1604.00151","title":"Analysis of gradient descent methods with non-diminishing, bounded errors","created":"2016-04-01","cited_by_count":9},{"id":"2004.06479","title":"Faster Stochastic Quasi-Newton Methods","created":"2020-04-12","cited_by_count":9},{"id":"2206.12848","title":"Analysis of Stochastic Processes through Replay Buffers","created":"2022-06-26","cited_by_count":9},{"id":"1802.09932","title":"VR-SGD: A Simple Stochastic Variance Reduction Method for Machine Learning","created":"2018-02-26","cited_by_count":7},{"id":"1912.13494","title":"A frequency-domain analysis of inexact gradient methods","created":"2019-12-31","cited_by_count":7},{"id":"2011.12392","title":"Geom-SPIDER-EM: Faster Variance Reduced Stochastic Expectation Maximization for Nonconvex Finite-Sum Optimization","created":"2020-11-24","cited_by_count":7},{"id":"2012.14670","title":"Fast Incremental Expectation Maximization for finite-sum optimization: nonasymptotic convergence","created":"2020-12-29","cited_by_count":7},{"id":"1411.0972","title":"Convex Optimization for Big Data","created":"2014-11-04","cited_by_count":4},{"id":"2105.11733","title":"The perturbed prox-preconditioned spider algorithm: non-asymptotic convergence bounds","created":"2021-05-25","cited_by_count":4},{"id":"1809.07203","title":"Parameter Estimation of Heavy-Tailed AR Model with Missing Data via Stochastic EM","created":"2018-09-19","cited_by_count":3},{"id":"2012.01929","title":"A Stochastic Path-Integrated Differential EstimatoR Expectation Maximization Algorithm","created":"2020-11-30","cited_by_count":3},{"id":"2301.00631","title":"Stochastic Variable Metric Proximal Gradient with variance reduction for non-convex composite optimization","created":"2023-01-02","cited_by_count":3},{"id":"1409.7287","title":"Identification of jump Markov linear models using particle filters","created":"2014-09-25","cited_by_count":1},{"id":"2105.11732","title":"The Perturbed Prox-Preconditioned SPIDER algorithm for EM-based large scale learning","created":"2021-05-25","cited_by_count":1},{"id":"2205.00058","title":"Implicit Regularization Properties of Variance Reduced Stochastic Mirror Descent","created":"2022-04-29","cited_by_count":1}],"next_cursor":null}