arXiv (All)
open access
Bellman-Certified Rounding for Sparse Policy Deployment in MDPs
Continuous policy optimization may spread an update across many states, even when deployment permits only a few complete state-level changes. We study how much discounted return can be retained when continuous row mixtures are rounded to sparse binary policies in finite MDPs. Policy-dependent visita
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
- DG-FedReuse: Proxy-Gradient-Gated Cached-Update Reuse with Matched Sparse Uplink Accounting#432504
- The Trickle Algorithm#131562
- On-line Learning in Tree MDPs by Treating Policies as Bandit Arms#158565
- Not All Rollouts are Useful: Down-Sampling Rollouts in LLM Reinforcement Learning#158694
- AReaL-TIK: Stateful Agentic Optimization of Unified RL Kernels through an Optimization IR#1129739
Record · ID 1154948
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