conftrace_

linear mdp

34 papers

Explore in graph

Co-occurring keywords

reinforcement learning (4352) regret bound (1926) sample complexity (1169) function approximation (319) linear function approximation (101) value iteration (162) linear markov decision process (11) offline reinforcement learning (492) tabular mdp (14) sample efficiency (472)

Papers

Logarithmic Regret for Linear Markov Decision Processes with Adversarial Corruptions AAAI 2025
How does Inverse RL Scale to Large State Spaces? A Provably Efficient Approach NIPS 2024
Offline Primal-Dual Reinforcement Learning for Linear MDPs AISTATS 2024
Warm-up Free Policy Optimization: Improved Regret in Linear Markov Decision Processes NIPS 2024
Linear Bellman Completeness Suffices for Efficient Online Reinforcement Learning with Few Actions COLT 2024
Hybrid Reinforcement Learning Breaks Sample Size Barriers In Linear MDPs NIPS 2024
Refined Regret for Adversarial MDPs with Linear Function Approximation ICML 2023
Online RL in Linearly $q^\pi$-Realizable MDPs Is as Easy as in Linear MDPs If You Learn What to Ignore NIPS 2023
A Tale of Two Efficient Value Iteration Algorithms for Solving Linear MDPs with Large Action Space AISTATS 2023
One Policy is Enough: Parallel Exploration with a Single Policy is Near-Optimal for Reward-Free Reinforcement Learning AISTATS 2023
Leveraging Offline Data in Online Reinforcement Learning ICML 2023
Regularization and Variance-Weighted Regression Achieves Minimax Optimality in Linear MDPs: Theory and Practice ICML 2023
Multi-User Reinforcement Learning with Low Rank Rewards ICML 2023
Nearly Minimax Optimal Reinforcement Learning with Linear Function Approximation ICML 2022
First-Order Regret in Reinforcement Learning with Linear Function Approximation: A Robust Estimation Approach ICML 2022
Reward-Free RL is No Harder Than Reward-Aware RL in Linear Markov Decision Processes ICML 2022
Making Linear MDPs Practical via Contrastive Representation Learning ICML 2022
Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDP ICML 2022
A Model Selection Approach for Corruption Robust Reinforcement Learning ALT 2022
Corruption-robust Offline Reinforcement Learning AISTATS 2022
On the Statistical Efficiency of Reward-Free Exploration in Non-Linear RL NIPS 2022
Instance-Dependent Near-Optimal Policy Identification in Linear MDPs via Online Experiment Design NIPS 2022
Learning Bellman Complete Representations for Offline Policy Evaluation ICML 2022
Improved Regret for Differentially Private Exploration in Linear MDP ICML 2022
Reinforcement Learning in Linear MDPs: Constant Regret and Representation Selection NIPS 2021