linear mdp

A Computationally Efficient Algorithm for Infinite-Horizon Average-Reward Linear MDPs ICML 2025 Logarithmic Regret for Linear Markov Decision Processes with Adversarial Corruptions AAAI 2025 Provably Efficient RL for Linear MDPs under Instantaneous Safety Constraints in Non-Convex Feature Spaces ICML 2025 A Primal-Dual Algorithm for Offline Constrained Reinforcement Learning with Linear MDPs ICML 2024 How does Inverse RL Scale to Large State Spaces? A Provably Efficient Approach NeurIPS 2024 Hybrid Reinforcement Learning Breaks Sample Size Barriers In Linear MDPs NeurIPS 2024 Imitation Learning in Discounted Linear MDPs without exploration assumptions ICML 2024 Linear Bellman Completeness Suffices for Efficient Online Reinforcement Learning with Few Actions COLT 2024 Near-Optimal Regret in Linear MDPs with Aggregate Bandit Feedback ICML 2024 Offline Primal-Dual Reinforcement Learning for Linear MDPs AISTATS 2024 Warm-up Free Policy Optimization: Improved Regret in Linear Markov Decision Processes NeurIPS 2024 A Tale of Two Efficient Value Iteration Algorithms for Solving Linear MDPs with Large Action Space AISTATS 2023 Leveraging Offline Data in Online Reinforcement Learning ICML 2023 Multi-User Reinforcement Learning with Low Rank Rewards ICML 2023 One Policy is Enough: Parallel Exploration with a Single Policy is Near-Optimal for Reward-Free Reinforcement Learning AISTATS 2023 Online RL in Linearly q^π-Realizable MDPs Is as Easy as in Linear MDPs If You Learn What to Ignore NeurIPS 2023 Refined Regret for Adversarial MDPs with Linear Function Approximation ICML 2023 Regularization and Variance-Weighted Regression Achieves Minimax Optimality in Linear MDPs: Theory and Practice ICML 2023 A Model Selection Approach for Corruption Robust Reinforcement Learning ALT 2022 Corruption-robust Offline Reinforcement Learning AISTATS 2022 First-Order Regret in Reinforcement Learning with Linear Function Approximation: A Robust Estimation Approach ICML 2022 Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDP ICML 2022 Improved Regret for Differentially Private Exploration in Linear MDP ICML 2022 Instance-Dependent Near-Optimal Policy Identification in Linear MDPs via Online Experiment Design NeurIPS 2022 Learning Bellman Complete Representations for Offline Policy Evaluation ICML 2022