conftrace_

minimax regret

74 papers

Explore in graph

Co-occurring keywords

online learning (1777) regret bound (1926) multi-armed bandit (1098) contextual bandit (381) partial monitoring (32) logarithmic loss (13) bandit feedback (118) markov decision process (790) online algorithm (445) sequential probability assignment (4)

Papers

Restless and uncertain: Robust policies for restless bandits via deep multi-agent reinforcement learning UAI 2022
Smoothed Online Learning is as Easy as Statistical Learning COLT 2022
Minimax Regret for Partial Monitoring: Infinite Outcomes and Rustichini’s Regret COLT 2022
Minimax Regret for Cascading Bandits NIPS 2022
Precise Regret Bounds for Log-loss via a Truncated Bayesian Algorithm NIPS 2022
Grounding Aleatoric Uncertainty for Unsupervised Environment Design NIPS 2022
Return of the bias: Almost minimax optimal high probability bounds for adversarial linear bandits COLT 2022
Minimax Regret Optimisation for Robust Planning in Uncertain Markov Decision Processes AAAI 2021
On Uninformative Optimal Policies in Adaptive LQR with Unknown B-Matrix L4DC 2021
Robust reinforcement learning under minimax regret for green security UAI 2021
Possibilistic preference elicitation by minimax regret UAI 2021
Predictive Power of Nearest Neighbors Algorithm under Random Perturbation AISTATS 2021
Minimax Regret for Stochastic Shortest Path NIPS 2021
Sequential prediction under log-loss with side information ALT 2021
Precise Minimax Regret for Logistic Regression with Categorical Feature Values ALT 2021
Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition COLT 2021
Continuum-Armed Bandits: A Function Space Perspective AISTATS 2021
Multinomial Logit Bandit with Low Switching Cost ICML 2020
Exploration by Optimisation in Partial Monitoring COLT 2020
Tight Bounds on Minimax Regret under Logarithmic Loss via Self-Concordance ICML 2020
The Influence of Shape Constraints on the Thresholding Bandit Problem COLT 2020
Taking a hint: How to leverage loss predictors in contextual bandits? COLT 2020
Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition NIPS 2020
Adaptive Minimax Regret against Smooth Logarithmic Losses over High-Dimensional l1-Balls via Envelope Complexity AISTATS 2019
Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information COLT 2019