Copertina

Optimistic Regret Bounds for Online Learning in Adversarial Markov Decision Processes

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Moon, Sang Bin, Hashemi, Abolfazl
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning Artificial Intelligence
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Optimistic Policy Learning under Pessimistic Adversaries with Regret and Violation Guarantees
di: Ganguly, Sourav, et al.
Pubblicazione: (2026)

Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent
di: Xu, Hang, 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)

Kernel-Based Function Approximation for Average Reward Reinforcement Learning: An Optimist No-Regret Algorithm
di: Vakili, Sattar, et al.
Pubblicazione: (2024)

Equitable Federated Learning with Activation Clustering
di: Upadhyay, Antesh, et al.
Pubblicazione: (2024)

Optimistic Thompson Sampling for No-Regret Learning in Unknown Games
di: Li, Yingru, et al.
Pubblicazione: (2024)

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

An Optimistic Algorithm for online CMDPS with Anytime Adversarial Constraints
di: Zhu, Jiahui, et al.
Pubblicazione: (2025)

Regret-Based Defense in Adversarial Reinforcement Learning
di: Belaire, Roman, et al.
Pubblicazione: (2023)

Multi-Step Alignment as Markov Games: An Optimistic Online Gradient Descent Approach with Convergence Guarantees
di: Wu, Yongtao, et al.
Pubblicazione: (2025)

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

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

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

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

Kernelized Reinforcement Learning with Order Optimal Regret Bounds
di: Vakili, Sattar, et al.
Pubblicazione: (2023)

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

Learning in Markov Games with Adaptive Adversaries: Policy Regret, Fundamental Barriers, and Efficient Algorithms
di: Nguyen-Tang, Thanh, et al.
Pubblicazione: (2024)

Robust Lagrangian and Adversarial Policy Gradient for Robust Constrained Markov Decision Processes
di: Bossens, David M.
Pubblicazione: (2023)

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

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

Improved Bayesian Regret Bounds for Thompson Sampling in Reinforcement Learning
di: Moradipari, Ahmadreza, et al.
Pubblicazione: (2023)

Regret Bounds and Reinforcement Learning Exploration of EXP-based Algorithms
di: Xu, Mengfan, et al.
Pubblicazione: (2020)

Optimistic Reinforcement Learning with Quantile Objectives
di: Alipour-Vaezi, Mohammad, et al.
Pubblicazione: (2025)

Online Mixture of Experts: No-Regret Learning for Optimal Collective Decision-Making
di: Liu, Larkin, et al.
Pubblicazione: (2025)

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

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

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

Bridging Distributional and Risk-sensitive Reinforcement Learning with Provable Regret Bounds
di: Liang, Hao, et al.
Pubblicazione: (2022)

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

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

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

Optimistic Rates for Learning from Label Proportions
di: Li, Gene, et al.
Pubblicazione: (2024)

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

FedSGM: A Unified Framework for Constraint Aware, Bidirectionally Compressed, Multi-Step Federated Optimization
di: Upadhyay, Antesh, et al.
Pubblicazione: (2026)

Optimistic Policy Regularization
di: Pham, Mai, et al.
Pubblicazione: (2026)

Linear Mixture Distributionally Robust Markov Decision Processes
di: Liu, Zhishuai, et al.
Pubblicazione: (2025)

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

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

A Unified Theory of Compositionality, Modularity, and Interpretability in Markov Decision Processes
di: Ringstrom, Thomas J., et al.
Pubblicazione: (2025)

Dual Formulation for Non-Rectangular Lp Robust Markov Decision Processes
di: Kumar, Navdeep, et al.
Pubblicazione: (2025)