{"list":"other","total":89,"rows":[{"id":"1912.04977","title":"Advances and Open Problems in Federated Learning","created":"2019-12-10","cited_by_count":3046},{"id":"1606.04838","title":"Optimization Methods for Large-Scale Machine Learning","created":"2016-06-15","cited_by_count":1150},{"id":"1405.4980","title":"Convex Optimization: Algorithms and Complexity","created":"2014-05-20","cited_by_count":575},{"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":"1603.05953","title":"Katyusha: The First Direct Acceleration of Stochastic Gradient Methods","created":"2016-03-18","cited_by_count":135},{"id":"1712.07897","title":"Non-convex Optimization for Machine Learning","created":"2017-12-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":"1802.04367","title":"Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithm","created":"2018-02-12","cited_by_count":112},{"id":"1603.04245","title":"A Variational Perspective on Accelerated Methods in Optimization","created":"2016-03-14","cited_by_count":110},{"id":"1610.05708","title":"Relatively-Smooth Convex Optimization by First-Order Methods, and Applications","created":"2016-10-18","cited_by_count":108},{"id":"2005.10785","title":"Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clipping","created":"2020-05-21","cited_by_count":104},{"id":"2010.00892","title":"Variance-Reduced Methods for Machine Learning","created":"2020-10-02","cited_by_count":79},{"id":"1511.05932","title":"On the Global Linear Convergence of Frank-Wolfe Optimization Variants","created":"2015-11-18","cited_by_count":77},{"id":"1912.08957","title":"Optimization for deep learning: theory and algorithms","created":"2019-12-19","cited_by_count":70},{"id":"1901.06482","title":"On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms","created":"2019-01-19","cited_by_count":62},{"id":"1910.05505","title":"Learning deep linear neural networks: Riemannian gradient flows and convergence to global minimizers","created":"2019-10-12","cited_by_count":61},{"id":"1506.02186","title":"A Universal Catalyst for First-Order Optimization","created":"2015-06-06","cited_by_count":54},{"id":"1809.02864","title":"Online Adaptive Methods, Universality and Acceleration","created":"2018-09-08","cited_by_count":51},{"id":"1703.08570","title":"Stochastic Methods for Composite and Weakly Convex Optimization Problems","created":"2017-03-24","cited_by_count":48},{"id":"1406.1305","title":"Faster Rates for the Frank-Wolfe Method over Strongly-Convex Sets","created":"2014-06-05","cited_by_count":44},{"id":"1510.08234","title":"From error bounds to the complexity of first-order descent methods for convex functions","created":"2015-10-28","cited_by_count":43},{"id":"1507.02000","title":"An optimal randomized incremental gradient method","created":"2015-07-08","cited_by_count":33},{"id":"1409.3257","title":"Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization","created":"2014-09-10","cited_by_count":31},{"id":"1403.4164","title":"Accelerated Schemes For A Class of Variational Inequalities","created":"2014-03-17","cited_by_count":30},{"id":"2002.10726","title":"Statistically Preconditioned Accelerated Gradient Method for Distributed Optimization","created":"2020-02-25","cited_by_count":30},{"id":"2010.12100","title":"Adaptive extra-gradient methods for min-max optimization and games","created":"2020-10-22","cited_by_count":30},{"id":"2012.06188","title":"Recent Theoretical Advances in Non-Convex Optimization","created":"2020-12-11","cited_by_count":30},{"id":"1309.5550","title":"The Complexity of Large-scale Convex Programming under a Linear Optimization Oracle","created":"2013-09-22","cited_by_count":29},{"id":"2002.04783","title":"Fixed-Support Wasserstein Barycenters: Computational Hardness and Fast Algorithm","created":"2020-02-12","cited_by_count":29},{"id":"1910.00152","title":"On the Complexity of Approximating Multimarginal Optimal Transport","created":"2019-09-30","cited_by_count":28},{"id":"1902.03694","title":"Acceleration via Symplectic Discretization of High-Resolution Differential Equations","created":"2019-02-11","cited_by_count":27},{"id":"1811.10331","title":"Hessian Riemannian gradient flows in convex programming","created":"2018-11-26","cited_by_count":26},{"id":"1902.01637","title":"A Universal Algorithm for Variational Inequalities Adaptive to Smoothness and Noise","created":"2019-02-05","cited_by_count":26},{"id":"1312.5799","title":"Accelerated, Parallel and Proximal Coordinate Descent","created":"2013-12-20","cited_by_count":25},{"id":"1512.09103","title":"Even Faster Accelerated Coordinate Descent Using Non-Uniform Sampling","created":"2015-12-30","cited_by_count":23},{"id":"1907.10536","title":"First-order optimization algorithms via inertial systems with Hessian driven damping","created":"2019-07-24","cited_by_count":22},{"id":"1506.07512","title":"Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization","created":"2015-06-24","cited_by_count":21},{"id":"1603.05642","title":"Optimal Black-Box Reductions Between Optimization Objectives","created":"2016-03-17","cited_by_count":21},{"id":"1806.03915","title":"Decentralize and Randomize: Faster Algorithm for Wasserstein Barycenters","created":"2018-06-11","cited_by_count":21},{"id":"1805.12591","title":"On Acceleration with Noise-Corrupted Gradients","created":"2018-05-31","cited_by_count":20},{"id":"1808.03045","title":"Accelerated Bregman Proximal Gradient Methods for Relatively Smooth Convex Optimization","created":"2018-08-09","cited_by_count":20},{"id":"1309.2375","title":"Accelerated Proximal Stochastic Dual Coordinate Ascent for Regularized Loss Minimization","created":"2013-09-10","cited_by_count":19},{"id":"1906.03622","title":"On a Combination of Alternating Minimization and Nesterov's Momentum","created":"2019-06-09","cited_by_count":18},{"id":"2011.06572","title":"Relative Lipschitzness in Extragradient Methods and a Direct Recipe for Acceleration","created":"2020-11-12","cited_by_count":18},{"id":"1307.0873","title":"New Analysis and Results for the Frank-Wolfe Method","created":"2013-07-02","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":"1305.1922","title":"Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for Solving Linear Systems","created":"2013-05-08","cited_by_count":14},{"id":"1809.05895","title":"Primal-dual accelerated gradient methods with small-dimensional relaxation oracle","created":"2018-09-16","cited_by_count":14},{"id":"1806.05123","title":"Linearly Convergent Frank-Wolfe with Backtracking Line-Search","created":"2018-06-13","cited_by_count":13},{"id":"1504.05002","title":"Linearly Convergent Away-Step Conditional Gradient for Non-strongly Convex Functions","created":"2015-04-20","cited_by_count":12},{"id":"1710.06612","title":"Mirror Descent and Convex Optimization Problems With Non-Smooth Inequality Constraints","created":"2017-10-18","cited_by_count":10},{"id":"1505.05198","title":"Forward-Backward Splitting with Bregman Distances","created":"2015-05-19","cited_by_count":8},{"id":"1507.06243","title":"A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization","created":"2015-07-22","cited_by_count":8},{"id":"1702.04300","title":"Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary","created":"2017-02-14","cited_by_count":8},{"id":"1802.09022","title":"An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization","created":"2018-02-25","cited_by_count":8},{"id":"1805.09185","title":"Alternating Randomized Block Coordinate Descent","created":"2018-05-23","cited_by_count":8},{"id":"1809.09449","title":"Hessian barrier algorithms for linearly constrained optimization problems","created":"2018-09-25","cited_by_count":8},{"id":"1902.00990","title":"Inexact Model: A Framework for Optimization and Variational Inequalities","created":"2019-02-03","cited_by_count":8},{"id":"2002.04320","title":"Self-Concordant Analysis of Frank-Wolfe Algorithms","created":"2020-02-11","cited_by_count":8},{"id":"1608.08883","title":"A first-order primal-dual algorithm with linesearch","created":"2016-08-31","cited_by_count":7},{"id":"1611.06730","title":"On the convergence of gradient-like flows with noisy gradient input","created":"2016-11-21","cited_by_count":7},{"id":"1706.10207","title":"Optimization Methods for Supervised Machine Learning: From Linear Models to Deep Learning","created":"2017-06-30","cited_by_count":7},{"id":"1711.03439","title":"Smooth Primal-Dual Coordinate Descent Algorithms for Nonsmooth Convex Optimization","created":"2017-11-09","cited_by_count":7},{"id":"1810.02429","title":"Restarting Frank-Wolfe: Faster Rates Under H\\\"olderian Error Bounds","created":"2018-10-04","cited_by_count":7},{"id":"1908.03878","title":"Bregman Forward-Backward Operator Splitting","created":"2019-08-11","cited_by_count":7},{"id":"1502.03123","title":"A Universal Primal-Dual Convex Optimization Framework","created":"2015-02-10","cited_by_count":5},{"id":"1710.01551","title":"Stochastic mirror descent dynamics and their convergence in monotone variational inequalities","created":"2017-10-04","cited_by_count":5},{"id":"1803.02933","title":"Distributed Computation of Wasserstein Barycenters over Networks","created":"2018-03-08","cited_by_count":5},{"id":"1804.02394","title":"An Accelerated Directional Derivative Method for Smooth Stochastic Convex Optimization","created":"2018-04-08","cited_by_count":5},{"id":"2006.14810","title":"Restarting Algorithms: Sometimes there is Free Lunch","created":"2020-06-26","cited_by_count":5},{"id":"1508.07384","title":"Generalized Uniformly Optimal Methods for Nonlinear Programming","created":"2015-08-29","cited_by_count":4},{"id":"1602.00724","title":"Frank-Wolfe Works for Non-Lipschitz Continuous Gradient Objectives: Scalable Poisson Phase Retrieval","created":"2016-02-01","cited_by_count":4},{"id":"1806.05140","title":"Generalized Mirror Prox for Monotone Variational Inequalities: Universality and Inexact Oracle","created":"2018-06-13","cited_by_count":4},{"id":"2010.01009","title":"Generalized Self-Concordant Analysis of Frank-Wolfe algorithms","created":"2020-10-02","cited_by_count":4},{"id":"1706.07622","title":"Adaptive Similar Triangles Method: a Stable Alternative to Sinkhorn's Algorithm for Regularized Optimal Transport","created":"2017-06-23","cited_by_count":3},{"id":"2004.02294","title":"Multimarginal Optimal Transport by Accelerated Alternating Minimization","created":"2020-04-05","cited_by_count":3},{"id":"1508.02182","title":"About accelerated randomized methods","created":"2015-08-10","cited_by_count":2},{"id":"1612.05057","title":"Fixing and extending some recent results on the ADMM algorithm","created":"2016-12-15","cited_by_count":2},{"id":"1712.06036","title":"Universal Intermediate Gradient Method for Convex Problems with Inexact Oracle","created":"2017-12-17","cited_by_count":2},{"id":"1902.09001","title":"Gradient Methods for Problems with Inexact Model of the Objective","created":"2019-02-24","cited_by_count":2},{"id":"1302.2349","title":"Dual subgradient algorithms for large-scale nonsmooth learning problems","created":"2013-02-10","cited_by_count":1},{"id":"1605.02970","title":"Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints","created":"2016-05-10","cited_by_count":1},{"id":"1606.08988","title":"Primal-Dual Method for Searching Equilibrium in Hierarchical Congestion Population Games","created":"2016-06-29","cited_by_count":1},{"id":"1707.08486","title":"Unifying Framework for Accelerated Randomized Methods in Convex Optimization","created":"2017-07-26","cited_by_count":1},{"id":"1710.00162","title":"Accelerated Directional Search with non-Euclidean prox-structure","created":"2017-09-30","cited_by_count":1},{"id":"1803.05771","title":"Restarting the accelerated coordinate descent method with a rough strong convexity estimate","created":"2018-03-14","cited_by_count":1},{"id":"1808.04648","title":"An Adaptive Primal-Dual Framework for Nonsmooth Convex Minimization","created":"2018-08-14","cited_by_count":1},{"id":"1810.00595","title":"Composite optimization for the resource allocation problem","created":"2018-10-01","cited_by_count":1},{"id":"1902.01572","title":"Advances in Low-Memory Subgradient Optimization","created":"2019-02-05","cited_by_count":1}],"next_cursor":null}