Near-Optimal Sample Complexity for Recursive Entropic Risk Reinforcement Learning with a Generative Model
arXiv 2610.06931v1•c8f9d19ef50f67b99ad80a2a2919f38c9f930bc59766b4b04ffbafd9687671a3
Paper metadata
- arXiv ID
- 2610.06931
- Version
- v1
- Category
- cs.LG, stat.ML
- Authors
- Amirparsa Bahrami, Oliver Mortensen, Mohammad Sadegh Talebi
- Publication date
- 2026-10-07T04:00:00Z
- Source identifier
- 2610.06931v1
- Public record ID
- record:sha256:c8f9d19ef50f67b99ad80a2a2919f38c9f930bc59766b4b04ffbafd9687671a3
The PDF link points to arxiv.org. Baitaphish does not expose a private stored PDF.
This is source-provided metadata, not an enriched summary or an impact assessment. Follow the canonical source link for the published material.
Evidence and limitations
- Source ID
- arxiv_research
- Record identifier
- c8f9d19ef50f67b99ad80a2a2919f38c9f930bc59766b4b04ffbafd9687671a3
- Record type
- Source metadata
This record may overlap with other records. Source metadata can be incomplete or change. Validate consequential decisions against the linked source and your own environment.