:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Moon, Sang Bin, Hashemi, Abolfazl
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Artificial Intelligence
Online Access:	https://arxiv.org/abs/2405.02188
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent
by: Xu, Hang, et al.
Published: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Optimistic Policy Regularization
by: Pham, Mai, et al.
Published: (2026)

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

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

Unveiling Privacy, Memorization, and Input Curvature Links
by: Ravikumar, Deepak, et al.
Published: (2024)

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

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

A Regret Perspective on Online Multiple Testing
by: Hao, Qingyang, et al.
Published: (2026)