Linear Programming Representations and Strongly Polynomial Algorithms for Robust Markov Decision Processes
cs.LG, cs.DS, math.OC
Submitted: 2026-10-01
Updated: 2026-10-01
Sources
- Policy iteration for perfect information stochastic mean payoff games with bounded first return times is strongly polynomial
- On the Complexity of Discounted Robust MDPs with $L_p$ Uncertainty Sets
- The Simple Strategy-Iteration Method is Strongly Polynomial for the Turn-Based Deterministic Forward Game
- Policy Iteration Is Not Strongly Polynomial for Deterministic Markov Decision Processes: The Price of Algorithmic Anarchy
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks