regret minimization

Follow the Compressed Leader: Faster Online Learning of Eigenvectors and Faster MMWU ICML 2017 Multi-Agent Planning with Baseline Regret Minimization IJCAI 2017 Near-Optimal Design of Experiments via Regret Minimization ICML 2017 Online Decision-Making for Scalable Autonomous Systems IJCAI 2017 Online Learning and Blackwell Approachability with Partial Monitoring: Optimal Convergence Rates AISTATS 2017 Regret Minimization in Behaviorally-Constrained Zero-Sum Games ICML 2017 Regret Minimization in MDPs with Options without Prior Knowledge NeurIPS 2017 Retaining Data from Streams of Social Platforms with Minimal Regret IJCAI 2017 The Price of Differential Privacy for Online Learning ICML 2017 Thompson Sampling for the MNL-Bandit COLT 2017 Gains and Losses are Fundamentally Different in Regret Minimization: The Sparse Case JMLR 2016 Heteroscedastic Sequences: Beyond Gaussianity ICML 2016 Minimizing Regret on Reflexive Banach Spaces and Nash Equilibria in Continuous Zero-Sum Games NeurIPS 2016 Minimum Regret Search for Single- and Multi-Task Optimization ICML 2016 Multiple-Play Bandits in the Position-Based Model NeurIPS 2016 Online Learning and Blackwell Approachability in Quitting Games COLT 2016 On the Complexity of Best-Arm Identification in Multi-Armed Bandit Models JMLR 2016 Parameter-Free Convex Learning through Coin Betting AutoML 2016 Pricing a Low-regret Seller ICML 2016 Safe Policy Improvement by Minimizing Robust Baseline Regret NeurIPS 2016 Time series prediction and online learning COLT 2016 Bandit Convex Optimization: \sqrtT Regret in One Dimension COLT 2015 Copeland Dueling Bandits NeurIPS 2015 Explore no more: Improved high-probability regret bounds for non-stochastic bandits NeurIPS 2015 Fast Convergence of Regularized Learning in Games NeurIPS 2015