Co-occurring keywords · papers mentioning both
Papers
Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition
COLT 2021
Minimax Regret Optimisation for Robust Planning in Uncertain Markov Decision Processes
AAAI 2021
On the Suboptimality of Thompson Sampling in High Dimensions
NeurIPS 2021
On Uninformative Optimal Policies in Adaptive LQR with Unknown B-Matrix
L4DC 2021
Possibilistic preference elicitation by minimax regret
UAI 2021
Precise Minimax Regret for Logistic Regression with Categorical Feature Values
ALT 2021
Predictive Power of Nearest Neighbors Algorithm under Random Perturbation
AISTATS 2021
Robust reinforcement learning under minimax regret for green security
UAI 2021
Sequential prediction under log-loss with side information
ALT 2021
Exploration by Optimisation in Partial Monitoring
COLT 2020
Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition
NeurIPS 2020
Multinomial Logit Bandit with Low Switching Cost
ICML 2020
Taking a hint: How to leverage loss predictors in contextual bandits?
COLT 2020
The Influence of Shape Constraints on the Thresholding Bandit Problem
COLT 2020
Tight Bounds on Minimax Regret under Logarithmic Loss via Self-Concordance
ICML 2020
Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information
COLT 2019
Adaptively Tracking the Best Bandit Arm with an Unknown Number of Distribution Changes
COLT 2019
Adaptive Minimax Regret against Smooth Logarithmic Losses over High-Dimensional l1-Balls via Envelope Complexity
AISTATS 2019
An Information-Theoretic Approach to Minimax Regret in Partial Monitoring
COLT 2019
Minimax Online Prediction of Varying Bernoulli Process under Variational Approximation
ACML 2019
Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits
COLT 2019
Confounding-Robust Policy Improvement
NeurIPS 2018
Minimax-Regret Querying on Side Effects for Safe Optimality in Factored Markov Decision Processes
IJCAI 2018
Algorithmic Chaining and the Role of Partial Feedback in Online Nonparametric Learning
COLT 2017
Minimax Regret Bounds for Reinforcement Learning
ICML 2017