Howard's Policy Iteration is Subexponential for Deterministic Markov Decision Problems with Rewards of Fixed Bit-size and Arbitrary Discount Factor

Documenti analoghi

• Efficient Computation of Blackwell Optimal Policies using Rational Functions
  di: Mukherjee, Dibyangshu, et al.
  Pubblicazione: (2025)
• Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes
  di: Asadi, Ali, et al.
  Pubblicazione: (2025)
• On-line Learning in Tree MDPs by Treating Policies as Bandit Arms
  di: Shah, Anvay, et al.
  Pubblicazione: (2026)
• Improved Sample Complexity Analysis of Natural Policy Gradient Algorithm with General Parameterization for Infinite Horizon Discounted Reward Markov Decision Processes
  di: Mondal, Washim Uddin, et al.
  Pubblicazione: (2023)
• Value Iteration with Guessing for Markov Chains and Markov Decision Processes
  di: Chatterjee, Krishnendu, et al.
  Pubblicazione: (2025)