Skip to content
conftrace_

minimax optimal regret

9 papers

Explore in graph

Co-occurring keywords · papers mentioning both

regret bound (7) multi-armed bandit (3) thompson sampling (3) linear bandit (2) upper confidence bound (2) function approximation (2) reinforcement learning (2) bias function (1) linear mixture mdp (1) structured bandit (1)

Papers

Geometry-Aware Approaches for Balancing Performance and Theoretical Guarantees in Linear Bandits ICLR 2025 Optimal and Practical Batched Linear Bandit Algorithm ICML 2025 Achieving Tractable Minimax Optimal Regret in Average Reward MDPs NeurIPS 2024 A Nearly Optimal and Low-Switching Algorithm for Reinforcement Learning with General Function Approximation NeurIPS 2024 Scale-free Adversarial Reinforcement Learning COLT 2024 Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision Processes ICML 2023 Nearly Minimax Optimal Regret for Learning Infinite-horizon Average-reward MDPs with Linear Function Approximation AISTATS 2022 MOTS: Minimax Optimal Thompson Sampling ICML 2021 Old Dog Learns New Tricks: Randomized UCB for Bandit Problems AISTATS 2020