Copertina

Provably Efficient Reward Transfer in Reinforcement Learning with Discrete Markov Decision Processes

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Vora, Kevin, Zhang, Yu
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Machine Learning Artificial Intelligence
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Pessimism in the Face of Confounders: Provably Efficient Offline Reinforcement Learning in Partially Observable Markov Decision Processes
di: Lu, Miao, et al.
Pubblicazione: (2022)

Model-Based Reinforcement Learning in Discrete-Action Non-Markovian Reward Decision Processes
di: Trapasso, Alessandro, et al.
Pubblicazione: (2025)

Burning RED: Unlocking Subtask-Driven Reinforcement Learning and Risk-Awareness in Average-Reward Markov Decision Processes
di: Rojas, Juan Sebastian, et al.
Pubblicazione: (2024)

Decision-Focused Model-based Reinforcement Learning for Reward Transfer
di: Sharma, Abhishek, et al.
Pubblicazione: (2023)

Almost Sure Convergence of Differential Temporal Difference Learning for Average Reward Markov Decision Processes
di: Blaser, Ethan, et al.
Pubblicazione: (2026)

Hierarchical Average-Reward Linearly-solvable Markov Decision Processes
di: Infante, Guillermo, et al.
Pubblicazione: (2024)

Provably Adaptive Average Reward Reinforcement Learning for Metric Spaces
di: Kar, Avik, et al.
Pubblicazione: (2024)

Diffusion-Augmented Markov Decision Processes for Maximum Entropy Reinforcement Learning
di: Sanokowski, Sebastian, et al.
Pubblicazione: (2025)

Globally Optimal Hierarchical Reinforcement Learning for Linearly-Solvable Markov Decision Processes
di: Infante, Guillermo, et al.
Pubblicazione: (2021)

A Cantor-Kantorovich Metric Between Markov Decision Processes with Application to Transfer Learning
di: Banse, Adrien, et al.
Pubblicazione: (2024)

Provable Reward-Agnostic Preference-Based Reinforcement Learning
di: Zhan, Wenhao, et al.
Pubblicazione: (2023)

Reinforcement Learning in Switching Non-Stationary Markov Decision Processes: Algorithms and Convergence Analysis
di: Amiri, Mohsen, et al.
Pubblicazione: (2025)

Provable Representation with Efficient Planning for Partial Observable Reinforcement Learning
di: Zhang, Hongming, et al.
Pubblicazione: (2023)

Provably Efficient Exploration in Reward Machines with Low Regret
di: Bourel, Hippolyte, et al.
Pubblicazione: (2024)

Efficient Reinforcement Learning in Probabilistic Reward Machines
di: Lin, Xiaofeng, et al.
Pubblicazione: (2024)

Regret Analysis of Policy Gradient Algorithm for Infinite Horizon Average Reward Markov Decision Processes
di: Bai, Qinbo, et al.
Pubblicazione: (2023)

Provably Efficient Exploration in Inverse Constrained Reinforcement Learning
di: Yue, Bo, et al.
Pubblicazione: (2024)

Inferring Reward Machines and Transition Machines from Partially Observable Markov Decision Processes
di: Wu, Yuly, et al.
Pubblicazione: (2025)

Solving Robust Markov Decision Processes: Generic, Reliable, Efficient
di: Meggendorfer, Tobias, et al.
Pubblicazione: (2024)

Act as You Learn: Adaptive Decision-Making in Non-Stationary Markov Decision Processes
di: Luo, Baiting, et al.
Pubblicazione: (2024)

Efficient and Sharp Off-Policy Evaluation in Robust Markov Decision Processes
di: Bennett, Andrew, et al.
Pubblicazione: (2024)

Optimal Decision Tree Policies for Markov Decision Processes
di: Vos, Daniël, et al.
Pubblicazione: (2023)

Markov Decision Processes under External Temporal Processes
di: Ayyagari, Ranga Shaarad, et al.
Pubblicazione: (2023)

RLSR: Reinforcement Learning from Self Reward
di: Simonds, Toby, et al.
Pubblicazione: (2025)

Quantum Speedups in Regret Analysis of Infinite Horizon Average-Reward Markov Decision Processes
di: Ganguly, Bhargav, et al.
Pubblicazione: (2023)

Provably Efficient Action-Manipulation Attack Against Continuous Reinforcement Learning
di: Luo, Zhi, et al.
Pubblicazione: (2024)

Policy Gradient Algorithms with Monte Carlo Tree Learning for Non-Markov Decision Processes
di: Morimura, Tetsuro, et al.
Pubblicazione: (2022)

Optimistic Regret Bounds for Online Learning in Adversarial Markov Decision Processes
di: Moon, Sang Bin, et al.
Pubblicazione: (2024)

Policy Gradient for Robust Markov Decision Processes
di: Wang, Qiuhao, et al.
Pubblicazione: (2024)

Towards the Transferability of Rewards Recovered via Regularized Inverse Reinforcement Learning
di: Schlaginhaufen, Andreas, et al.
Pubblicazione: (2024)

Homomorphic Mappings for Value-Preserving State Aggregation in Markov Decision Processes
di: Zhao, Shuo, et al.
Pubblicazione: (2025)

Transformers as Decision Makers: Provable In-Context Reinforcement Learning via Supervised Pretraining
di: Lin, Licong, et al.
Pubblicazione: (2023)

OCMDP: Observation-Constrained Markov Decision Process
di: Wang, Taiyi, et al.
Pubblicazione: (2024)

Improved Sample Complexity Analysis of Natural Policy Gradient Algorithm with General Parameterization for Infinite Horizon Discounted Reward Markov Decision Processes
di: Mondal, Washim Uddin, et al.
Pubblicazione: (2023)

Centralized Reward Agent for Knowledge Sharing and Transfer in Multi-Task Reinforcement Learning
di: Ma, Haozhe, et al.
Pubblicazione: (2024)

Process Reinforcement through Implicit Rewards
di: Cui, Ganqu, et al.
Pubblicazione: (2025)

Highly Efficient Self-Adaptive Reward Shaping for Reinforcement Learning
di: Ma, Haozhe, et al.
Pubblicazione: (2024)

Unsupervised Zero-Shot Reinforcement Learning via Functional Reward Encodings
di: Frans, Kevin, et al.
Pubblicazione: (2024)

Efficient Process Reward Model Training via Active Learning
di: Duan, Keyu, et al.
Pubblicazione: (2025)

SPOT: Scalable Policy Optimization with Trees for Markov Decision Processes
di: Xiong, Xuyuan, et al.
Pubblicazione: (2025)