minimax regret

3 papers

• A Novel General Framework for Sharp Lower Bounds in Succinct Stochastic Bandits
• Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
• Stochastic Shortest Path with Sparse Adversarial Costs