Online Algorithms

Regret Lower Bound and Optimal Algorithm in Finite Stochastic Partial Monitoring NeurIPS 2015 Response-Based Approachability with Applications to Generalized No-Regret Problems JMLR 2015 Revenue Optimization against Strategic Buyers NeurIPS 2015 Second-order Quantile Methods for Experts and Combinatorial Games COLT 2015 Sequential Information Maximization: When is Greedy Near-optimal? COLT 2015 Simple regret for infinitely many armed bandits ICML 2015 Smooth Interactive Submodular Set Cover NeurIPS 2015 Sparse Dueling Bandits AISTATS 2015 Streaming Min-max Hypergraph Partitioning NeurIPS 2015 Strongly Adaptive Online Learning ICML 2015 The Hedge Algorithm on a Continuum ICML 2015 The Pareto Regret Frontier for Bandits NeurIPS 2015 Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits AISTATS 2015 Adaptivity and Optimism: An Improved Exponentiated Gradient Algorithm ICML 2014 A Drifting-Games Analysis for Online Learning and Applications to Boosting NeurIPS 2014 Approachability in unknown games: Online learning meets multi-objective optimization COLT 2014 Bandit Convex Optimization: Towards Tight Bounds NeurIPS 2014 Best-Arm Identification in Linear Bandits NeurIPS 2014 Bounded Regret for Finite-Armed Structured Bandits NeurIPS 2014 Combinatorial Partial Monitoring Game with Linear Feedback and Its Applications ICML 2014 Combinatorial Pure Exploration of Multi-Armed Bandits NeurIPS 2014 Conditional Swap Regret and Conditional Correlated Equilibrium NeurIPS 2014 Delay-Tolerant Algorithms for Asynchronous Distributed Online Learning NeurIPS 2014 Discovering, Learning and Exploiting Relevance NeurIPS 2014 Dynamic Resource Allocation for Optimizing Population Diffusion AISTATS 2014