Saved in:
| Main Author: | Arora, Raman |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2606.02363 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Learning in Markov Games with Adaptive Adversaries: Policy Regret, Fundamental Barriers, and Efficient Algorithms
by: Nguyen-Tang, Thanh, et al.
Published: (2024)
by: Nguyen-Tang, Thanh, et al.
Published: (2024)
Bi-directional Recurrence Improves Transformer in Partially Observable Markov Decision Processes
by: Arora, Ashok, et al.
Published: (2025)
by: Arora, Ashok, et al.
Published: (2025)
Internal State-Based Policy Gradient Methods for Partially Observable Markov Potential Games
by: Yang, Wonseok, et al.
Published: (2026)
by: Yang, Wonseok, et al.
Published: (2026)
Nearly Minimax Optimal Regret for Multinomial Logistic Bandit
by: Lee, Joongkyu, et al.
Published: (2024)
by: Lee, Joongkyu, et al.
Published: (2024)
Learning What to Recommend: Minimax Optimal Simple Regret in Logistic Bandits
by: Liu, Shuai, et al.
Published: (2026)
by: Liu, Shuai, et al.
Published: (2026)
Apple Tasting: Combinatorial Dimensions and Minimax Rates
by: Raman, Vinod, et al.
Published: (2023)
by: Raman, Vinod, et al.
Published: (2023)
Achieving Tractable Minimax Optimal Regret in Average Reward MDPs
by: Boone, Victor, et al.
Published: (2024)
by: Boone, Victor, et al.
Published: (2024)
Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path
by: Di, Qiwei, et al.
Published: (2024)
by: Di, Qiwei, et al.
Published: (2024)
Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
by: Yang, Junwen, et al.
Published: (2024)
by: Yang, Junwen, et al.
Published: (2024)
Independent Learning of Nash Equilibria in Partially Observable Markov Potential Games with Decoupled Dynamics
by: Jordan, Philip, et al.
Published: (2026)
by: Jordan, Philip, et al.
Published: (2026)
Finite Memory Belief Approximation for Optimal Control in Partially Observable Markov Decision Processes
by: Kim, Mintae
Published: (2026)
by: Kim, Mintae
Published: (2026)
Minimax Optimal Variance-Aware Regret Bounds for Multinomial Logistic MDPs
by: Boudart, Pierre, et al.
Published: (2026)
by: Boudart, Pierre, et al.
Published: (2026)
Minimax Optimal Simple Regret in Two-Armed Best-Arm Identification
by: Kato, Masahiro
Published: (2024)
by: Kato, Masahiro
Published: (2024)
Mitigating Goal Misgeneralization via Minimax Regret
by: Sadek, Karim Abdel, et al.
Published: (2025)
by: Sadek, Karim Abdel, et al.
Published: (2025)
On the Minimax Regret in Online Ranking with Top-k Feedback
by: Zhang, Mingyuan, et al.
Published: (2023)
by: Zhang, Mingyuan, et al.
Published: (2023)
Refining Minimax Regret for Unsupervised Environment Design
by: Beukman, Michael, et al.
Published: (2024)
by: Beukman, Michael, et al.
Published: (2024)
Optimal Regret for Policy Optimization in Contextual Bandits
by: Levy, Orin, et al.
Published: (2026)
by: Levy, Orin, et al.
Published: (2026)
Dynamic Deep-Reinforcement-Learning Algorithm in Partially Observable Markov Decision Processes
by: Omi, Saki, et al.
Published: (2023)
by: Omi, Saki, et al.
Published: (2023)
Guided Policy Optimization under Partial Observability
by: Li, Yueheng, et al.
Published: (2025)
by: Li, Yueheng, et al.
Published: (2025)
Minimax Regret Learning for Data with Heterogeneous Subgroups
by: Mo, Weibin, et al.
Published: (2024)
by: Mo, Weibin, et al.
Published: (2024)
Partially Observable Stochastic Games with Neural Perception Mechanisms
by: Yan, Rui, et al.
Published: (2023)
by: Yan, Rui, et al.
Published: (2023)
Best of Both Worlds: Regret Minimization versus Minimax Play
by: Müller, Adrian, et al.
Published: (2025)
by: Müller, Adrian, et al.
Published: (2025)
Geometric Preference Elicitation for Minimax Regret Optimization in Uncertainty Matroids
by: Ellendula, Aditya Sai, et al.
Published: (2025)
by: Ellendula, Aditya Sai, et al.
Published: (2025)
Efficient and Optimal No-Regret Caching under Partial Observation
by: Mazziane, Younes Ben, et al.
Published: (2025)
by: Mazziane, Younes Ben, et al.
Published: (2025)
Observation Interference in Partially Observable Assistance Games
by: Emmons, Scott, et al.
Published: (2024)
by: Emmons, Scott, et al.
Published: (2024)
Near-Optimal Partially Observable Reinforcement Learning with Partial Online State Information
by: Shi, Ming, et al.
Published: (2023)
by: Shi, Ming, et al.
Published: (2023)
Regret Minimization and Convergence to Equilibria in General-sum Markov Games
by: Erez, Liad, et al.
Published: (2022)
by: Erez, Liad, et al.
Published: (2022)
Minimax Optimality and Spectral Routing for Majority-Vote Ensembles under Markov Dependence
by: Shihab, Ibne Farabi, et al.
Published: (2026)
by: Shihab, Ibne Farabi, et al.
Published: (2026)
A Multi-Step Minimax Q-learning Algorithm for Two-Player Zero-Sum Markov Games
by: R, Shreyas S, et al.
Published: (2024)
by: R, Shreyas S, et al.
Published: (2024)
Warm-up Free Policy Optimization: Improved Regret in Linear Markov Decision Processes
by: Cassel, Asaf, et al.
Published: (2024)
by: Cassel, Asaf, et al.
Published: (2024)
Tackling Heavy-Tailed Rewards in Reinforcement Learning with Function Approximation: Minimax Optimal and Instance-Dependent Regret Bounds
by: Huang, Jiayi, et al.
Published: (2023)
by: Huang, Jiayi, et al.
Published: (2023)
Minimax Regret Estimation for Generalizing Heterogeneous Treatment Effects with Multisite Data
by: Zhang, Yi, et al.
Published: (2024)
by: Zhang, Yi, et al.
Published: (2024)
Achieving Logarithmic Regret in KL-Regularized Zero-Sum Markov Games
by: Nayak, Anupam, et al.
Published: (2025)
by: Nayak, Anupam, et al.
Published: (2025)
On the Role of Information Structure in Reinforcement Learning for Partially-Observable Sequential Teams and Games
by: Altabaa, Awni, et al.
Published: (2024)
by: Altabaa, Awni, et al.
Published: (2024)
Observation Adaptation via Annealed Importance Resampling for Partially Observable Markov Decision Processes
by: Zhang, Yunuo, et al.
Published: (2025)
by: Zhang, Yunuo, et al.
Published: (2025)
Adversarial Latent-State Training for Robust Policies in Partially Observable Domains
by: Ahuja, Angad Singh
Published: (2026)
by: Ahuja, Angad Singh
Published: (2026)
On the Minimax Regret of Sequential Probability Assignment via Square-Root Entropy
by: Jia, Zeyu, et al.
Published: (2025)
by: Jia, Zeyu, et al.
Published: (2025)
Information-Theoretic Minimax Regret Bounds for Reinforcement Learning based on Duality
by: Bongole, Raghav, et al.
Published: (2024)
by: Bongole, Raghav, et al.
Published: (2024)
Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization
by: Stradi, Francesco Emanuele, et al.
Published: (2024)
by: Stradi, Francesco Emanuele, et al.
Published: (2024)
Model-Free, Regret-Optimal Best Policy Identification in Online CMDPs
by: Zhou, Zihan, et al.
Published: (2023)
by: Zhou, Zihan, et al.
Published: (2023)
Similar Items
-
Learning in Markov Games with Adaptive Adversaries: Policy Regret, Fundamental Barriers, and Efficient Algorithms
by: Nguyen-Tang, Thanh, et al.
Published: (2024) -
Bi-directional Recurrence Improves Transformer in Partially Observable Markov Decision Processes
by: Arora, Ashok, et al.
Published: (2025) -
Internal State-Based Policy Gradient Methods for Partially Observable Markov Potential Games
by: Yang, Wonseok, et al.
Published: (2026) -
Nearly Minimax Optimal Regret for Multinomial Logistic Bandit
by: Lee, Joongkyu, et al.
Published: (2024) -
Learning What to Recommend: Minimax Optimal Simple Regret in Logistic Bandits
by: Liu, Shuai, et al.
Published: (2026)