Co-occurring keywords · papers mentioning both
Papers
A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret
COLT 2013
Beating Bandits in Gradually Evolving Worlds
COLT 2013
Dimension-Free Exponentiated Gradient
NeurIPS 2013
Dynamical Models and tracking regret in online convex programming
ICML 2013
Beyond Logarithmic Bounds in Online Learning
AISTATS 2012
No-Regret Algorithms for Unconstrained Online Convex Optimization
NeurIPS 2012
Online Optimization with Gradual Variations
COLT 2012
Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints
JMLR 2012
Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization
COLT 2011
Follow-the-Regularized-Leader and Mirror Descent: Equivalence Theorems and L1 Regularization
AISTATS 2011
Improved Regret Guarantees for Online Smooth Convex Optimization with Bandit Feedback
AISTATS 2011
On the Universality of Online Mirror Descent
NeurIPS 2011
Random Walk Approach to Regret Minimization
NeurIPS 2010
On Stochastic and Worst-case Models for Investing
NeurIPS 2009
Mind the Duality Gap: Logarithmic regret algorithms for online optimization
NeurIPS 2008
Adaptive Online Gradient Descent
NeurIPS 2007