Research map / Learning theory and algorithms / Sample complexity
Bilinear Classes: A Structural Framework for Provable Generalization in RL
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Scalable Bilinear Pi Learning Using State and Action Features (ICML 2018 · similarity 0.90)
- Sample-Efficient Reinforcement Learning Is Feasible for Linearly Realizable MDPs with Limited Revisiting (NeurIPS 2021 · similarity 0.89)
- Bellman Eluder Dimension: New Rich Classes of RL Problems, and Sample-Efficient Algorithms (NeurIPS 2021 · similarity 0.88)
- On the Sample Complexity Bounds of Bilevel Reinforcement Learning (NeurIPS 2025 · similarity 0.88)
- Model-Based RL for Mean-Field Games is not Statistically Harder than Single-Agent RL (ICML 2024 · similarity 0.87)
- On the Complexity of Offline Reinforcement Learning with Q*-Approximation and Partial Coverage (NeurIPS 2026 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.