arXiv (All)
open access
Provably Efficient Risk-Sensitive Offline Reinforcement Learning via Optimized Certainty Equivalents
Risk-sensitive reinforcement learning (RL) addresses decision-making under uncertainty and adverse outcomes. Learning risk-sensitive policies from fixed datasets is important when additional interaction with the environment is costly. Existing work on risk-sensitive RL focuses on online settings or
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Pessimism Meets Risk: Risk-Sensitive Offline Reinforcement Learning#1063715
- Credal Machine Learning for Risk-Averse Decision Making#1249539
- Q-learning Penalized Transformer for Safe Offline Reinforcement Learning#1131660
- Cantelli Constrained Policy Optimization#999192
- Exchange Policy Optimization Algorithm for Semi-Infinite Safe Reinforcement Learning#821737
Record · ID 1357525
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive