Imagen de Portada

Minimax-Optimal Policy Regret in Partially Observable Markov Games

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Arora, Raman
Formato:	Preprint
Publicado:	2026
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Bi-directional Recurrence Improves Transformer in Partially Observable Markov Decision Processes
por: Arora, Ashok, et al.
Publicado: (2025)

Internal State-Based Policy Gradient Methods for Partially Observable Markov Potential Games
por: Yang, Wonseok, et al.
Publicado: (2026)

Nearly Minimax Optimal Regret for Multinomial Logistic Bandit
por: Lee, Joongkyu, et al.
Publicado: (2024)

Learning What to Recommend: Minimax Optimal Simple Regret in Logistic Bandits
por: Liu, Shuai, et al.
Publicado: (2026)

Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path
por: Di, Qiwei, et al.
Publicado: (2024)

Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
por: Yang, Junwen, et al.
Publicado: (2024)

Achieving Tractable Minimax Optimal Regret in Average Reward MDPs
por: Boone, Victor, et al.
Publicado: (2024)

Apple Tasting: Combinatorial Dimensions and Minimax Rates
por: Raman, Vinod, et al.
Publicado: (2023)

Mitigating Goal Misgeneralization via Minimax Regret
por: Sadek, Karim Abdel, et al.
Publicado: (2025)

Finite Memory Belief Approximation for Optimal Control in Partially Observable Markov Decision Processes
por: Kim, Mintae
Publicado: (2026)

Independent Learning of Nash Equilibria in Partially Observable Markov Potential Games with Decoupled Dynamics
por: Jordan, Philip, et al.
Publicado: (2026)

Minimax Optimal Variance-Aware Regret Bounds for Multinomial Logistic MDPs
por: Boudart, Pierre, et al.
Publicado: (2026)

Minimax Optimal Simple Regret in Two-Armed Best-Arm Identification
por: Kato, Masahiro
Publicado: (2024)

On the Minimax Regret in Online Ranking with Top-k Feedback
por: Zhang, Mingyuan, et al.
Publicado: (2023)

Optimal Regret for Policy Optimization in Contextual Bandits
por: Levy, Orin, et al.
Publicado: (2026)

Dynamic Deep-Reinforcement-Learning Algorithm in Partially Observable Markov Decision Processes
por: Omi, Saki, et al.
Publicado: (2023)

Refining Minimax Regret for Unsupervised Environment Design
por: Beukman, Michael, et al.
Publicado: (2024)

Best of Both Worlds: Regret Minimization versus Minimax Play
por: Müller, Adrian, et al.
Publicado: (2025)

Geometric Preference Elicitation for Minimax Regret Optimization in Uncertainty Matroids
por: Ellendula, Aditya Sai, et al.
Publicado: (2025)

Guided Policy Optimization under Partial Observability
por: Li, Yueheng, et al.
Publicado: (2025)

Minimax Regret Learning for Data with Heterogeneous Subgroups
por: Mo, Weibin, et al.
Publicado: (2024)

Efficient and Optimal No-Regret Caching under Partial Observation
por: Mazziane, Younes Ben, et al.
Publicado: (2025)

Partially Observable Stochastic Games with Neural Perception Mechanisms
por: Yan, Rui, et al.
Publicado: (2023)

Near-Optimal Partially Observable Reinforcement Learning with Partial Online State Information
por: Shi, Ming, et al.
Publicado: (2023)

A Multi-Step Minimax Q-learning Algorithm for Two-Player Zero-Sum Markov Games
por: R, Shreyas S, et al.
Publicado: (2024)

Minimax Optimality and Spectral Routing for Majority-Vote Ensembles under Markov Dependence
por: Shihab, Ibne Farabi, et al.
Publicado: (2026)

Warm-up Free Policy Optimization: Improved Regret in Linear Markov Decision Processes
por: Cassel, Asaf, et al.
Publicado: (2024)

Regret Minimization and Convergence to Equilibria in General-sum Markov Games
por: Erez, Liad, et al.
Publicado: (2022)

Observation Interference in Partially Observable Assistance Games
por: Emmons, Scott, et al.
Publicado: (2024)

Tackling Heavy-Tailed Rewards in Reinforcement Learning with Function Approximation: Minimax Optimal and Instance-Dependent Regret Bounds
por: Huang, Jiayi, et al.
Publicado: (2023)

Minimax Regret Estimation for Generalizing Heterogeneous Treatment Effects with Multisite Data
por: Zhang, Yi, et al.
Publicado: (2024)

Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization
por: Stradi, Francesco Emanuele, et al.
Publicado: (2024)

Model-Free, Regret-Optimal Best Policy Identification in Online CMDPs
por: Zhou, Zihan, et al.
Publicado: (2023)

On the Role of Information Structure in Reinforcement Learning for Partially-Observable Sequential Teams and Games
por: Altabaa, Awni, et al.
Publicado: (2024)

Adversarial Latent-State Training for Robust Policies in Partially Observable Domains
por: Ahuja, Angad Singh
Publicado: (2026)

Observation Adaptation via Annealed Importance Resampling for Partially Observable Markov Decision Processes
por: Zhang, Yunuo, et al.
Publicado: (2025)

On the Minimax Regret of Sequential Probability Assignment via Square-Root Entropy
por: Jia, Zeyu, et al.
Publicado: (2025)

Information-Theoretic Minimax Regret Bounds for Reinforcement Learning based on Duality
por: Bongole, Raghav, et al.
Publicado: (2024)

Achieving Logarithmic Regret in KL-Regularized Zero-Sum Markov Games
por: Nayak, Anupam, et al.
Publicado: (2025)