Research map / Optimization / Optimizers
Sample Efficient Reinforcement Learning with REINFORCE
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use REINFORCE with a single trajectory per update and phased regularization | REINFORCE · Episodic discounted finite MDP | regret: O\Big(\Big(\tfrac{S^2A^2}{(1-\gamma)^{7}}+\Big\|\tfrac{d_{\rho}^{\pi^\star}}{\rho}\Big\|_{\infty}\Big) N^{\frac{5}{6}}(\ | Helped |
| Use a fixed mini-batch of M trajectories per update | REINFORCE · Episodic discounted finite MDP | regret (mini-batch): O\Big(\Big(\tfrac{S^2A^2}{(1-\gamma)^7}+\Big\|\tfrac{d_{\rho}^{\pi^\star}}{\rho}\Big\|_{\infty}\Big)(M^{\frac{1}{6}}+M^{ | Helped |
Closest papers by meaning
- Generalizable Policy Improvement via Reinforcement Sampling (Student Abstract) (AAAI 2024 · similarity 0.89)
- Convergence Analysis of Policy Gradient Methods with Dynamic Stochasticity (ICML 2025 · similarity 0.89)
- Learning Optimal Deterministic Policies with Stochastic Policy Gradients (ICML 2024 · similarity 0.89)
- Towards Global Optimality for Practical Average Reward Reinforcement Learning without Mixing Time Oracles (ICML 2024 · similarity 0.89)
- Iteratively Refined Behavior Regularization for Offline Reinforcement Learning (NeurIPS 2024 · similarity 0.89)
- Last-Iterate Global Convergence of Policy Gradients for Constrained Reinforcement Learning (NeurIPS 2024 · similarity 0.89)
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.