conftrace_

online linear optimization

35 papers

Explore in graph

Also known as

OLO

Co-occurring keywords · papers mentioning both

regret bound (29) online learning (13) bandit feedback (6) stochastic optimization (4) mirror descent (3) parameter-free algorithm (3) regret minimization (3) game theory (3) minimax regret (2) multi-armed bandit (2)

Papers

On the Complexity of Bandit Linear Optimization COLT 2015 Higher-Order Regret Bounds with Switching Costs COLT 2014 Online Linear Optimization via Smoothing COLT 2014 Unconstrained Online Linear Learning in Hilbert Spaces: Minimax Algorithms and Normal Approximations COLT 2014 Minimax Optimal Algorithms for Unconstrained Linear Optimization NeurIPS 2013 Online Learning with Predictable Sequences COLT 2013 Towards Minimax Policies for Online Linear Optimization with Bandit Feedback COLT 2012 Blackwell Approachability and No-Regret Learning are Equivalent COLT 2011 Minimax Policies for Combinatorial Prediction Games COLT 2011 The Price of Bandit Information for Online Optimization NeurIPS 2007