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

Online Density Estimation of Bradley-Terry Models COLT 2015
Towards Minimax Online Learning with Unknown Time Horizon ICML 2014
A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret COLT 2013
Beating Bandits in Gradually Evolving Worlds COLT 2013
Dynamical Models and tracking regret in online convex programming ICML 2013
Online Optimization with Gradual Variations COLT 2012
Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints JMLR 2012
No-Regret Algorithms for Unconstrained Online Convex Optimization NIPS 2012
Beyond Logarithmic Bounds in Online Learning AISTATS 2012
Follow-the-Regularized-Leader and Mirror Descent: Equivalence Theorems and L1 Regularization AISTATS 2011
Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization COLT 2011
Improved Regret Guarantees for Online Smooth Convex Optimization with Bandit Feedback AISTATS 2011
Random Walk Approach to Regret Minimization NIPS 2010
On Stochastic and Worst-case Models for Investing NIPS 2009
Adaptive Online Gradient Descent NIPS 2007