Near-Optimal Time and Sample Complexities for Solving Markov Decision Processes with a Generative Model

Aaron Sidford, Mengdi Wang, Xian Wu, Lin Yang, Yinyu Ye

Mar-13-2026, 14:20:54 GMT–Neural Information Processing Systems

Computing an approximately optimal policy with high probability in this case is known as PAC RL with a generative model.

algorithm, artificial intelligence, machine learning, (17 more...)

Neural Information Processing Systems

Mar-13-2026, 14:20:54 GMT

Conferences PDF

Country:
- Europe > United Kingdom
  - England (0.04)
- North America
  - Canada (0.04)
  - United States
    - California > Santa Clara County
      - Palo Alto (0.05)
    - Massachusetts > Middlesex County
      - Belmont (0.04)
      - Cambridge (0.04)
    - New Jersey > Mercer County
      - Princeton (0.04)

Technology:
- Information Technology > Artificial Intelligence
  - Machine Learning > Learning Graphical Models
    - Undirected Networks > Markov Models (0.47)
  - Representation & Reasoning (0.94)

Duplicate Docs Excel Report

Title
Near-Optimal Time and Sample Complexities for Solving Markov Decision Processes with a Generative Model
Near-Optimal Time and Sample Complexities for Solving Markov Decision Processes with a Generative Model

Similar Docs Excel Report more

Title	Similarity	Source
None found