conftrace_

linear mixture mdp

13 papers

Explore in graph

Co-occurring keywords

regret bound (1926) reinforcement learning (4352) adversarial reward (10) linear function approximation (101) reward-free exploration (26) linear mixture markov decision process (2) linear bandit (124) markov decision process (790) dynamic regret (94) sample complexity (1169)

Papers

Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition AISTATS 2024
Prior-dependent analysis of posterior sampling reinforcement learning with function approximation AISTATS 2024
Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs NIPS 2024
Optimal Horizon-Free Reward-Free Exploration for Linear Mixture MDPs ICML 2023
Optimistic Planning by Regularized Dynamic Programming ICML 2023
Dynamic Regret of Adversarial Linear Mixture MDPs NIPS 2023
Variance-Dependent Regret Bounds for Linear Bandits and Reinforcement Learning: Adaptivity and Computational Efficiency COLT 2023
Locally Differentially Private Reinforcement Learning for Linear Mixture Markov Decision Processes ACML 2022
Near-optimal Policy Optimization Algorithms for Learning Adversarial Linear Mixture MDPs AISTATS 2022
Nearly Minimax Optimal Regret for Learning Infinite-horizon Average-reward MDPs with Linear Function Approximation AISTATS 2022
Computationally Efficient Horizon-Free Reinforcement Learning for Linear Mixture MDPs NIPS 2022
Reward-Free Model-Based Reinforcement Learning with Linear Function Approximation NIPS 2021
Improved Variance-Aware Confidence Sets for Linear Bandits and Linear Mixture MDP NIPS 2021