complexity bound

Rate-improved inexact augmented Lagrangian method for constrained nonconvex optimization AISTATS 2021 Riemannian Stochastic Recursive Momentum Method for non-Convex Optimization IJCAI 2021 The complexity of nonconvex-strongly-concave minimax optimization UAI 2021 Lower Complexity Bounds for Finite-Sum Convex-Concave Minimax Optimization Problems ICML 2020 Model-Based Synthesis of Incremental and Correct Estimators for Discrete Event Systems IJCAI 2020 Near-Optimal Methods for Minimizing Star-Convex Functions and Beyond COLT 2020 Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clipping NeurIPS 2020 Variance Reduction via Accelerated Dual Averaging for Finite-Sum Optimization NeurIPS 2020 Efficient Smooth Non-Convex Stochastic Compositional Optimization via Stochastic Recursive Gradient Descent NeurIPS 2019 Faster First-Order Methods for Stochastic Non-Convex Optimization on Riemannian Manifolds AISTATS 2019 Iterative Linearized Control: Stable Algorithms and Complexity Guarantees ICML 2019 Lower Bounds for Parallel and Randomized Convex Optimization COLT 2019 Lower Bounds for Smooth Nonconvex Finite-Sum Optimization ICML 2019 On the Complexity of Approximating Wasserstein Barycenters ICML 2019 On the Universal Approximability and Complexity Bounds of Quantized ReLU Neural Networks ICLR 2019 Planning for LTLf /LDLf Goals in Non-Markovian Fully Observable Nondeterministic Domains IJCAI 2019 Safe Grid Search with Optimal Complexity ICML 2019 Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn’s Algorithm ICML 2018 On the Complexity of Chore Division IJCAI 2018 SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path-Integrated Differential Estimator NeurIPS 2018 Combining DL-Lite_{bool}^N with Branching Time: A gentle Marriage IJCAI 2017 Improved Strong Worst-case Upper Bounds for MDP Planning IJCAI 2017 Limitations on Variance-Reduction and Acceleration Schemes for Finite Sums Optimization NeurIPS 2017 On Lower and Upper Bounds in Smooth and Strongly Convex Optimization JMLR 2016 Tight Complexity Bounds for Optimizing Composite Objectives NeurIPS 2016