conftrace_

complexity bound

50 papers

Explore in graph

Co-occurring keywords

stochastic optimization (1060) convex optimization (1321) nonconvex optimization (316) lower bound (173) gradient descent (1144) non-convex optimization (547) first-order method (89) accelerated gradient descent (29) minimax optimization (186) optimal transport (948)

Papers

On the Expected Complexity of Maxout Networks NIPS 2021
Model-Based Synthesis of Incremental and Correct Estimators for Discrete Event Systems IJCAI 2020
Lower Complexity Bounds for Finite-Sum Convex-Concave Minimax Optimization Problems ICML 2020
Variance Reduction via Accelerated Dual Averaging for Finite-Sum Optimization NIPS 2020
Near-Optimal Methods for Minimizing Star-Convex Functions and Beyond COLT 2020
Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clipping NIPS 2020
Iterative Linearized Control: Stable Algorithms and Complexity Guarantees ICML 2019
On the Complexity of Approximating Wasserstein Barycenters ICML 2019
Planning for LTLf /LDLf Goals in Non-Markovian Fully Observable Nondeterministic Domains IJCAI 2019
Safe Grid Search with Optimal Complexity ICML 2019
Efficient Smooth Non-Convex Stochastic Compositional Optimization via Stochastic Recursive Gradient Descent NIPS 2019
Lower Bounds for Parallel and Randomized Convex Optimization COLT 2019
Faster First-Order Methods for Stochastic Non-Convex Optimization on Riemannian Manifolds AISTATS 2019
Lower Bounds for Smooth Nonconvex Finite-Sum Optimization ICML 2019
On the Complexity of Chore Division IJCAI 2018
Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn’s Algorithm ICML 2018
SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path-Integrated Differential Estimator NIPS 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 NIPS 2017
On Lower and Upper Bounds in Smooth and Strongly Convex Optimization JMLR 2016
Tight Complexity Bounds for Optimizing Composite Objectives NIPS 2016
Improved and Generalized Upper Bounds on the Complexity of Policy Iteration NIPS 2013
On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization COLT 2013
Fast and Scalable Local Kernel Machines JMLR 2010