:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Roch, Zachary, Zhang, Chi, Atia, George, Wang, Yue
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2505.12462
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

CADENT: Gated Hybrid Distillation for Sample-Efficient Transfer in Reinforcement Learning
by: Alinejad, Mahyar, et al.
Published: (2026)

Sample-Efficient Distributionally Robust Multi-Agent Reinforcement Learning via Online Interaction
by: Farhat, Zain Ulabedeen, et al.
Published: (2025)

Online Robust Reinforcement Learning with General Function Approximation
by: Ghosh, Debamita, et al.
Published: (2025)

ORVIT: Near-Optimal Online Distributionally Robust Reinforcement Learning
by: Ghosh, Debamita, et al.
Published: (2025)

Bayesian Inverse Reinforcement Learning for Non-Markovian Rewards
by: Topper, Noah, et al.
Published: (2024)

Distributionally Robust Markov Games with Average Reward
by: Roch, Zachary, et al.
Published: (2025)

Sample Complexity of Distributionally Robust Average-Reward Reinforcement Learning
by: Chen, Zijun, et al.
Published: (2025)

Pessimism Principle Can Be Effective: Towards a Framework for Zero-Shot Transfer Reinforcement Learning
by: Zhang, Chi, et al.
Published: (2025)

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

RLAF: Reinforcement Learning from Automaton Feedback
by: Alinejad, Mahyar, et al.
Published: (2025)

Robust Transfer Learning with Side Information
by: Awad, Akram S., et al.
Published: (2026)

Provably Efficient Infinite-Horizon Average-Reward Reinforcement Learning with Linear Function Approximation
by: Chae, Woojin, et al.
Published: (2024)

Finite-Sample Analysis of Policy Evaluation for Robust Average Reward Reinforcement Learning
by: Xu, Yang, et al.
Published: (2025)

Sample Complexity of Average-Reward Q-Learning: From Single-agent to Federated Reinforcement Learning
by: Jiao, Yuchen, et al.
Published: (2026)

Efficient $Q$-Learning and Actor-Critic Methods for Robust Average Reward Reinforcement Learning
by: Xu, Yang, et al.
Published: (2025)

Provably Efficient Reward Transfer in Reinforcement Learning with Discrete Markov Decision Processes
by: Vora, Kevin, et al.
Published: (2025)

Provably Efficient Interactive-Grounded Learning with Personalized Reward
by: Zhang, Mengxiao, et al.
Published: (2024)

Efficient Exploration in Average-Reward Constrained Reinforcement Learning: Achieving Near-Optimal Regret With Posterior Sampling
by: Provodin, Danil, et al.
Published: (2024)

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

Provably Efficient and Agile Randomized Q-Learning
by: Wang, He, et al.
Published: (2025)

Provably Efficient Information-Directed Sampling Algorithms for Multi-Agent Reinforcement Learning
by: Zhang, Qiaosheng, et al.
Published: (2024)

Provably Efficient Sample Complexity for Robust CMDP
by: Ganguly, Sourav, et al.
Published: (2025)

Provable Domain Adaptation for Offline Reinforcement Learning with Limited Samples
by: Chen, Weiqin, et al.
Published: (2024)

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

Provably Robust Federated Reinforcement Learning
by: Fang, Minghong, et al.
Published: (2025)

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

Reinforcement Learning for Infinite-Horizon Average-Reward Linear MDPs via Approximation by Discounted-Reward MDPs
by: Hong, Kihyuk, et al.
Published: (2024)

Provable Policy Gradient Methods for Average-Reward Markov Potential Games
by: Cheng, Min, et al.
Published: (2024)

Sample-Efficient Robust Multi-Agent Reinforcement Learning in the Face of Environmental Uncertainty
by: Shi, Laixi, et al.
Published: (2024)

Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation
by: Li, Long-Fei, et al.
Published: (2024)

Model-Free Robust Reinforcement Learning with Sample Complexity Analysis
by: Wang, Yudan, et al.
Published: (2024)

Towards Provable Emergence of In-Context Reinforcement Learning
by: Wang, Jiuqi, et al.
Published: (2025)

Provable Multi-Task Reinforcement Learning: A Representation Learning Framework with Low Rank Rewards
by: Guo, Yaoze, et al.
Published: (2026)

Sample-Efficient Preference-based Reinforcement Learning with Dynamics Aware Rewards
by: Metcalf, Katherine, et al.
Published: (2024)

Optimal Sample Complexity for Average Reward Markov Decision Processes
by: Wang, Shengbo, et al.
Published: (2023)

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

Provably Efficient Online RLHF with One-Pass Reward Modeling
by: Li, Long-Fei, et al.
Published: (2025)

Contrastive UCB: Provably Efficient Contrastive Self-Supervised Learning in Online Reinforcement Learning
by: Qiu, Shuang, et al.
Published: (2022)

Distributionally Robust Model-Based Offline Reinforcement Learning with Near-Optimal Sample Complexity
by: Shi, Laixi, et al.
Published: (2022)

Efficient Learning of POMDPs with Known Observation Model in Average-Reward Setting
by: Russo, Alessio, et al.
Published: (2024)