arXiv (All)
open access
Adaptive inference for functionals of M-estimands
Reinforcement learning and contextual bandit algorithms have become increasingly common in sequential decision-making applications. When these methods are deployed in high-stakes domains, there is growing interest not only in learning effective policies, but also in conducting statistical inference
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
- Sharp Characterization of Bias in Post-Bandit Inference#1052257
- On the Pitfalls of Verbalized Confidence Priors for Calibrating Large Reasoning Models#1116801
- SIPO: Selective-Inference Policy Optimization for Tree-Structured Agentic RL#1129422
- Sharpening Tax in Post-Training#1167700
- Sharpening Tax in Post-Training#1156781
Record · ID 1144241
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