average-reward mdp

The Plug-in Approach for Average-Reward and Discounted MDPs: Optimal Sample Complexity Analysis ALT 2025 Achieving Tractable Minimax Optimal Regret in Average Reward MDPs NeurIPS 2024 Dealing With Unbounded Gradients in Stochastic Saddle-point Optimization ICML 2024 Offline Primal-Dual Reinforcement Learning for Linear MDPs AISTATS 2024 Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs NeurIPS 2024 Learning Infinite-horizon Average-reward Markov Decision Process with Constraints ICML 2022 Primal-Dual Stochastic Mirror Descent for MDPs AISTATS 2022 Average-Reward Learning and Planning with Options NeurIPS 2021 Average-Reward Off-Policy Policy Evaluation with Function Approximation ICML 2021 Learning and Planning in Average-Reward Markov Decision Processes ICML 2021 Towards Tight Bounds on the Sample Complexity of Average-reward MDPs ICML 2021 A Maximum-Entropy Approach to Off-Policy Evaluation in Average-Reward MDPs NeurIPS 2020 Efficiently Solving MDPs with Stochastic Mirror Descent ICML 2020 Model-free Reinforcement Learning in Infinite-horizon Average-reward Markov Decision Processes ICML 2020 Approximate Relative Value Learning for Average-reward Continuous State MDPs UAI 2019