Estimation / CONCEPT
Sample Complexity from Finite Testing-Error Floors
The finite n-sample testing floors culminate in a universal Bretagnolle--Huber lower bound on the divergence budget required to attain a prescribed error.
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES0
PROOF DEPTH9
DOCUMENT LINKS1
Every accurate i.i.d. test requires a divergence budget
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- Bhattacharyya Affinity on Finite Productsstructural-affinity · Closed
- Bhattacharyya Error Exponent and Sample Complexitystructural-affinity · Closed
- Divergence Bounds for Finite Two-Point Testing Errorstructural-affinity · Closed
- Divergence Support: General Support Additivitystructural-affinity · Closed
- Finite Repetition Preserves the Law Kernelstructural-affinity · Closed
- Finite-Family Sample Complexitystructural-affinity · Closed
- Power Additivity of Finite Classical KL Divergencestructural-affinity · Closed
- Power Additivity of Finite Renyi Divergencestructural-affinity · Closed
- Product Additivity of Finite Renyi Divergencestructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance