regret minimization

Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games AAAI 2019 Online Forecasting of Total-Variation-bounded Sequences NeurIPS 2019 On the Optimality of Perturbations in Stochastic and Adversarial Multi-armed Bandit Problems NeurIPS 2019 On the Regret Minimization of Nonconvex Online Gradient Ascent for Online PCA COLT 2019 Open Problem: Risk of Ruin in Multiarmed Bandits COLT 2019 Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating Functions NeurIPS 2019 Perturbed-History Exploration in Stochastic Linear Bandits UAI 2019 Perturbed-History Exploration in Stochastic Multi-Armed Bandits IJCAI 2019 Polynomial Cost of Adaptation for X-Armed Bandits NeurIPS 2019 Prior-Free Dynamic Auctions with Low Regret Buyers NeurIPS 2019 Provably Efficient Q-Learning with Low Switching Cost NeurIPS 2019 Real-Time Planning as Decision-Making under Uncertainty AAAI 2019 Regret Circuits: Composability of Regret Minimizers ICML 2019 Regret Minimization for Reinforcement Learning by Evaluating the Optimal Bias Function NeurIPS 2019 Regret Minimization for Reinforcement Learning with Vectorial Feedback and Complex Objectives NeurIPS 2019 What's to Know? Uncertainty as a Guide to Asking Goal-Oriented Questions CVPR 2019 Bandit Online Learning on Graphs via Adaptive Optimization IJCAI 2018 Beyond the Click-Through Rate: Web Link Selection with Multi-level Feedback IJCAI 2018 Incentivizing Exploration by Heterogeneous Users COLT 2018 Online Learning of Quantum States NeurIPS 2018 PG-TS: Improved Thompson Sampling for Logistic Contextual Bandits NeurIPS 2018 Refining the Confidence Level for Optimistic Bandit Strategies JMLR 2018 Variational inference for the multi-armed contextual bandit AISTATS 2018 Contextual Bandits with Latent Confounders: An NMF Approach AISTATS 2017 Efficient Regret Minimization in Non-Convex Games ICML 2017