conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Optimization

14,969 papers

Papers per year

18
112
342
1289
1646
'05
'10
'15
'20
'25

Papers

Stochastic Gradient Descent on Separable Data: Exact Convergence with a Fixed Learning Rate AISTATS 2019
Structured Robust Submodular Maximization: Offline and Online Algorithms AISTATS 2019
Probabilistic Multilevel Clustering via Composite Transportation Distance AISTATS 2019
Revisit Batch Normalization: New Understanding and Refinement via Composition Optimization AISTATS 2019
Multi-Order Information for Working Set Selection of Sequential Minimal Optimization AISTATS 2019
Multiscale Gaussian Process Level Set Estimation AISTATS 2019
Recovery Guarantees For Quadratic Tensors With Sparse Observations AISTATS 2019
Fixing Mini-batch Sequences with Hierarchical Robust Partitioning AISTATS 2019
ABCD-Strategy: Budgeted Experimental Design for Targeted Causal Structure Discovery AISTATS 2019
Batched Stochastic Bayesian Optimization via Combinatorial Constraints Design AISTATS 2019
Convergence of Gradient Descent on Separable Data AISTATS 2019
A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption ALT 2019
Two-Player Games for Efficient Non-Convex Constrained Optimization ALT 2019
Stochastic Nonconvex Optimization with Large Minibatches ALT 2019
Online Linear Optimization with Sparsity Constraints ALT 2019
Learning in Non-convex Games with an Optimization Oracle COLT 2019
A Universal Algorithm for Variational Inequalities Adaptive to Smoothness and Noise COLT 2019
Approximate Guarantees for Dictionary Learning COLT 2019
Near-optimal method for highly smooth convex optimization COLT 2019
Gaussian Process Optimization with Adaptive Sketching: Scalable and No Regret COLT 2019
On the Computational Power of Online Gradient Descent COLT 2019
Vortices Instead of Equilibria in MinMax Optimization: Chaos and Butterfly Effects of Online Learning in Zero-Sum Games COLT 2019
A near-optimal algorithm for approximating the John Ellipsoid COLT 2019
Artificial Constraints and Hints for Unbounded Online Learning COLT 2019
Combining Online Learning Guarantees COLT 2019