arXiv (All)
open access
Global Optimality for Constrained Exploration via Penalty Regularization
Efficient exploration is a central problem in reinforcement learning and is often formalized as maximizing the entropy of the state-action occupancy measure. While unconstrained maximum-entropy exploration is relatively well understood, real-world exploration is often constrained by safety, resource
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
- Asymmetric Human Compensation: Why High-Recall AI Outperforms Theoretically Optimal Profiles in Collaborative Quality Inspection#160522
- Steering Robustness into World Action Models via Mechanistic Interpretability and Optimal Control#373394
- Entropy-Regularized Optimal Transport for Time-Varying Multi-Agent Coverage Control#996647
- Knowledge by constraint#740428
- Learnable Randomization as Commitment Against Adaptive Optimizers#1117103
Record · ID 1130540
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