{"total":20,"rows":[{"id":"2207.05738","title":"PAC Reinforcement Learning for Predictive State Representations","created":"2022-07-12","cited_by_count":43,"area":null},{"id":"2206.12020","title":"Provably Efficient Reinforcement Learning in Partially Observable Dynamical Systems","created":"2022-06-24","cited_by_count":35,"area":null},{"id":"2209.14990","title":"Partially Observable RL with B-Stability: Unified Structural Condition and Sharp Sample-Efficient Algorithms","created":"2022-09-29","cited_by_count":24,"area":null},{"id":"2307.03997","title":"Efficient Model-Free Exploration in Low-Rank MDPs","created":"2023-07-08","cited_by_count":16,"area":null},{"id":"2302.01333","title":"Lower Bounds for Learning in Revealing POMDPs","created":"2023-02-02","cited_by_count":15,"area":null},{"id":"2310.06793","title":"Spectral Entry-wise Matrix Estimation for Low-Rank Reinforcement Learning","created":"2023-10-10","cited_by_count":10,"area":null},{"id":"2311.12244","title":"Provable Representation with Efficient Planning for Partial Observable Reinforcement Learning","created":"2023-11-20","cited_by_count":10,"area":null},{"id":"2306.12356","title":"Provably Efficient Representation Learning with Tractable Planning in Low-Rank POMDP","created":"2023-06-21","cited_by_count":8,"area":null},{"id":"2209.14997","title":"Optimistic MLE -- A Generic Model-based Algorithm for Partially Observable Sequential Decision Making","created":"2022-09-29","cited_by_count":6,"area":null},{"id":"2307.00405","title":"Provably Efficient UCB-type Algorithms For Learning Predictive State Representations","created":"2023-07-01","cited_by_count":6,"area":null},{"id":"2406.01389","title":"RL in Latent MDPs is Tractable: Online Guarantees via Off-Policy Evaluation","created":"2024-06-03","cited_by_count":6,"area":null},{"id":"2309.09457","title":"Exploring and Learning in Sparse Linear MDPs without Computationally Intractable Oracles","created":"2023-09-18","cited_by_count":5,"area":null},{"id":"2302.12940","title":"Exponential Hardness of Reinforcement Learning with Linear Function Approximation","created":"2023-02-25","cited_by_count":4,"area":null},{"id":"2310.07596","title":"Prospective Side Information for Latent MDPs","created":"2023-10-11","cited_by_count":4,"area":null},{"id":"2310.19861","title":"Posterior Sampling for Competitive RL: Function Approximation and Partial Observation","created":"2023-10-30","cited_by_count":3,"area":null},{"id":"2406.07920","title":"Near-Optimal Learning and Planning in Separated Latent MDPs","created":"2024-06-12","cited_by_count":3,"area":null},{"id":"2512.09892","title":"Provably Learning from Modern Language Models via Low Logit Rank","created":"2025-12-10","cited_by_count":3,"area":null},{"id":"2603.03759","title":"Learning Approximate Nash Equilibria in Cooperative Multi-Agent Reinforcement Learning via Mean-Field Subsampling","created":"2026-03-04","cited_by_count":2,"area":null},{"id":"2604.01024","title":"Model-Based Learning of Near-Optimal Finite-Window Policies in POMDPs","created":"2026-04-01","cited_by_count":1,"area":null},{"id":"2605.12262","title":"Missingness-MDPs: Bridging the Theory of Missing Data and POMDPs","created":"2026-05-12","cited_by_count":0,"area":null}],"next_cursor":null}