arXiv (All)
open access
PDE-Based Bounds on Optimal Exponents in Active Simple Hypothesis Testing
We present general upper and lower bounds on the optimal error exponent for the Active Simple Hypothesis Testing (ASHT) problem. ASHT has been extensively studied across diverse fields including Information Theory, Bandits, and Operations Research, a precise characterization of this optimal exponent
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
- Optimal Support Size Testing#1344220
- Asymptotically Lossless Exact and Pivotal E-Values#1064467
- An $\tilde Ω(\log n \log m)$ Information-Theoretic Lower Bound for Randomized Online Set Cover#1034420
- Nonlinear lower-tail large deviations at criticality#1234600
- Instance-Log-Optimality of Portfolio-Based E-Processes and their Sequential Hypothesis Tests#1109756
Record · ID 1467981
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