Skip to content
conftrace_

iteration complexity

96 papers

Papers

The power of first-order smooth optimization for black-box non-smooth problems ICML 2022 A Unified Analysis of First-Order Methods for Smooth Games via Integral Quadratic Constraints JMLR 2021 Escape saddle points by a simple gradient-descent based algorithm NeurIPS 2021 Optimal Complexity in Decentralized Training ICML 2021 Softmax Policy Gradient Methods Can Take Exponential Time to Converge COLT 2021 Unifying Width-Reduced Methods for Quasi-Self-Concordant Optimization NeurIPS 2021 Accelerated Factored Gradient Descent for Low-Rank Matrix Factorization AISTATS 2020 A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems NeurIPS 2020 Halpern Iteration for Near-Optimal and Parameter-Free Monotone Inclusion and Strong Solutions to Variational Inequalities COLT 2020 Highly smooth minimization of non-smooth problems COLT 2020 On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent JMLR 2020 On the Iteration Complexity of Hypergradient Computation ICML 2020 Stochastic Gauss-Newton Algorithms for Nonconvex Compositional Optimization ICML 2020 The Complexity of Finding Stationary Points with Stochastic Gradient Descent ICML 2020 Acceleration of SVRG and Katyusha X by Inexact Preconditioning ICML 2019 An Optimal High-Order Tensor Method for Convex Optimization COLT 2019 Are we there yet? Manifold identification of gradient-related proximal methods AISTATS 2019 A Tighter Analysis of Randomised Policy Iteration UAI 2019 Defending Against Saddle Point Attack in Byzantine-Robust Distributed Learning ICML 2019 Optimal Tensor Methods in Smooth Convex and Uniformly ConvexOptimization COLT 2019 SAGA with Arbitrary Sampling ICML 2019 Utilizing Second Order Information in Minibatch Stochastic Variance Reduced Proximal Iterations JMLR 2019 Convex Optimization over Intersection of Simple Sets: improved Convergence Rate Guarantees via an Exact Penalty Approach AISTATS 2018 Escaping Saddle Points in Constrained Optimization NeurIPS 2018 Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization JMLR 2018