conftrace_

online convex optimization

165 papers

Explore in graph

Also known as

OCO

Co-occurring keywords

regret bound (1926) online learning (1777) dynamic regret (94) regret minimization (315) constraint violation (39) stochastic optimization (1060) gradient descent (1144) strongly convex (89) bandit feedback (118) learning rate (192)

Papers

Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimization NIPS 2019
Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games AAAI 2019
Online Learning via the Differential Privacy Lens NIPS 2019
Connections Between Mirror Descent, Thompson Sampling and the Information Ratio NIPS 2019
Artificial Constraints and Hints for Unbounded Online Learning COLT 2019
Online Convex Optimization in Adversarial Markov Decision Processes ICML 2019
Lipschitz Adaptivity with Multiple Learning Rates in Online Learning COLT 2019
Parameter-Free Online Convex Optimization with Sub-Exponential Noise COLT 2019
Surrogate Losses for Online Learning of Stepsizes in Stochastic Non-Convex Optimization ICML 2019
Adaptive Regret of Convex and Smooth Functions ICML 2019
Efficient Adaptive Online Learning via Frequent Directions IJCAI 2018
Online convex optimization for cumulative constraints NIPS 2018
Adaptive Online Learning in Dynamic Environments NIPS 2018
Nearly second-order optimality of online joint detection and estimation via one-sample update schemes AISTATS 2018
Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descent COLT 2018
Efficient online algorithms for fast-rate regret bounds under sparsity NIPS 2018
Variants of RMSProp and Adagrad with Logarithmic Regret Bounds ICML 2017
Online Convex Optimization with Stochastic Constraints NIPS 2017
Adaptive Algorithms for Online Convex Optimization with Long-term Constraints ICML 2016
Online Convex Optimization with Unconstrained Domains and Losses NIPS 2016
Tracking Slowly Moving Clairvoyant: Optimal Dynamic Regret of Online Learning with True and Noisy Gradient ICML 2016
An Online Convex Optimization Approach to Blackwell's Approachability JMLR 2016
Accelerating Online Convex Optimization via Adaptive Prediction AISTATS 2016
Designing smoothing functions for improved worst-case competitive ratio in online optimization NIPS 2016
MetaGrad: Multiple Learning Rates in Online Learning NIPS 2016