Research map / Bandits and online learning / RL theory and MDPs
The Benefits of Being Distributional: Small-Loss Bounds for Reinforcement Learning
Kaiwen Wang, Kevin Zhou, Runzhe Wu, Nathan Kallus, Wen Sun
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 |
|---|---|---|---|
| Learn conditional cost distributions with online MLE and use their means for action selection instead of FastCB's direct mean estimation | DistCB · King County Housing, All episodes | average cost: .734 (.0007) -> .726 (.0003) | Improved |
| Learn conditional cost distributions with online MLE and use their means for action selection instead of FastCB's direct mean estimation | DistCB · King County Housing, Last 100 ep. | average cost: .719 (.0013) -> .708 (.0019) | Improved |
| Learn conditional cost distributions with online MLE and use their means for action selection instead of FastCB's direct mean estimation | DistCB · Prudential Life Insurance, All episodes | average cost: .491 (.0029) -> .411 (.0038) | Improved |
| Learn conditional cost distributions with online MLE and use their means for action selection instead of FastCB's direct mean estimation | DistCB · Prudential Life Insurance, Last 100 ep. | average cost: .474 (.0111) -> .388 (.0086) | Improved |
| Learn conditional cost distributions with online MLE and use their means for action selection instead of FastCB's direct mean estimation | DistCB · CIFAR-100, All episodes | average cost: .856 (.0016) -> .838 (.0021) | Improved |
| Learn conditional cost distributions with online MLE and use their means for action selection instead of FastCB's direct mean estimation | DistCB · CIFAR-100, Last 100 ep. | average cost: .793 (.0031) -> .775 (.0027) | Improved |
Closest papers by meaning
- More Benefits of Being Distributional: Second-Order Bounds for Reinforcement Learning (ICML 2024 · similarity 0.95)
- Intrinsic Benefits of Categorical Distributional Loss: Uncertainty-aware Regularized Exploration in Reinforcement Learning (NeurIPS 2025 · similarity 0.90)
- Provable Risk-Sensitive Distributional Reinforcement Learning with General Function Approximation (ICML 2024 · similarity 0.89)
- Hybrid Reinforcement Learning Breaks Sample Size Barriers In Linear MDPs (NeurIPS 2024 · similarity 0.89)
- Optimal Single-Policy Sample Complexity and Transient Coverage for Average-Reward Offline RL (NeurIPS 2025 · similarity 0.88)
- Near-Minimax-Optimal Distributional Reinforcement Learning with a Generative Model (NeurIPS 2024 · similarity 0.88)
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.
