regret minimization

Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems AAAI 2020 Solving Bernoulli Rank-One Bandits with Unimodal Thompson Sampling ALT 2020 Stochastic Regret Minimization in Extensive-Form Games ICML 2020 Tightening Exploration in Upper Confidence Reinforcement Learning ICML 2020 Algorithms for Average Regret Minimization AAAI 2019 Are sample means in multi-armed bandits positively or negatively biased? NeurIPS 2019 Batched Multi-armed Bandits Problem NeurIPS 2019 Be Greedy: How Chromatic Number meets Regret Minimization in Graph Bandits UAI 2019 Bridging the gap between regret minimization and best arm identification, with application to A/B tests AISTATS 2019 Combinatorial Bandits with Relative Feedback NeurIPS 2019 Competing Against Nash Equilibria in Adversarially Changing Zero-Sum Games ICML 2019 Competitive ratio vs regret minimization: achieving the best of both worlds ALT 2019 Decentralized Cooperative Stochastic Bandits NeurIPS 2019 Dueling Bandits with Qualitative Feedback AAAI 2019 Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions NeurIPS 2019 Dynamic Pricing in High-dimensions JMLR 2019 Dynamic Pricing with Finitely Many Unknown Valuations ALT 2019 Efficient Regret Minimization Algorithm for Extensive-Form Correlated Equilibrium NeurIPS 2019 Exploration Bonus for Regret Minimization in Discrete and Continuous Average Reward MDPs NeurIPS 2019 Explore Truthful Incentives for Tasks with Heterogenous Levels of Difficulty in the Sharing Economy IJCAI 2019 Garbage In, Reward Out: Bootstrapping Exploration in Multi-Armed Bandits ICML 2019 Incremental Elicitation of Rank-Dependent Aggregation Functions based on Bayesian Linear Regression IJCAI 2019 Learning to Optimize in Swarms NeurIPS 2019 Minimax Online Prediction of Varying Bernoulli Process under Variational Approximation ACML 2019 On First-Order Bounds, Variance and Gap-Dependent Bounds for Adversarial Bandits UAI 2019