Estimation / CONCEPT
Finite-Family Sample Complexity
Independent repetition turns a common-reference divergence ceiling into a lower bound on the number of observations required by every estimator.
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES0
PROOF DEPTH10
DOCUMENT LINKS1
Average one-sample divergence controls n-sample information
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 Error Exponent and Sample Complexitystructural-affinity · Closed
- Counting Hypotheses with Uniform Finite Fanostructural-affinity · Closed
- Divergence Support: General Support Additivitystructural-affinity · Closed
- Fano's Method for a Finite Familystructural-affinity · Closed
- Finite Fano with an Arbitrary Observation Referencestructural-affinity · Closed
- Power Additivity of Finite Classical KL Divergencestructural-affinity · Closed
- Power Additivity of Finite Renyi Divergencestructural-affinity · Closed
- Sample Complexity from Finite Testing-Error Floorsstructural-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