regret minimization

Minimax Fixed-Design Linear Regression COLT 2015 Online Learning of Eigenvectors ICML 2015 Qualitative Multi-Armed Bandits: A Quantile-Based Approach ICML 2015 Simple regret for infinitely many armed bandits ICML 2015 Strongly Adaptive Online Learning ICML 2015 Approachability in unknown games: Online learning meets multi-objective optimization COLT 2014 Beyond the Regret Minimization Barrier: Optimal Algorithms for Stochastic Strongly-Convex Optimization JMLR 2014 Conditional Swap Regret and Conditional Correlated Equilibrium NeurIPS 2014 Efficient learning by implicit exploration in bandit problems with side observations NeurIPS 2014 Efficient Partial Monitoring with Prior Information NeurIPS 2014 Exploiting easy data in online optimization NeurIPS 2014 Extreme bandits NeurIPS 2014 lil’ UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits COLT 2014 Multiarmed Bandits With Limited Expert Advice COLT 2014 Online Decision-Making in General Combinatorial Spaces NeurIPS 2014 On the convergence of no-regret learning in selfish routing ICML 2014 Optimal Regret Minimization in Posted-Price Auctions with Strategic Buyers NeurIPS 2014 Set-Valued Approachability and Online Learning with Partial Monitoring JMLR 2014 Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards NeurIPS 2014 Stochastic Regret Minimization via Thompson Sampling COLT 2014 Adaptive Market Making via Online Learning NeurIPS 2013 A near-optimal algorithm for finite partial-monitoring games against adversarial opponents COLT 2013 Better Rates for Any Adversarial Deterministic MDP ICML 2013 Combinatorial Multi-Armed Bandit: General Framework and Applications ICML 2013 Competing With Strategies COLT 2013