The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Hypothesis testing with active information
Open accessAbstract
Abstract We develop hypothesis testing for active information — the averaged quantity in the Kullback–Leibler divergence. To our knowledge, this is the first paper to derive exact probabilities of type-I errors for hypothesis testing in the area.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“A very efficient way to keep accountability is by calculating the active information I + = log( P ∗ /P max ) [42-44]. I + measures the amount of information added or subtracted when P ∗ is used instead of P max . If I + is positive, P ∗ is overfitting for ℓ X with respect to P max ; if I + is negative, P ∗ is underfitting the life-permitting interval with respect to P max ; and if I + = 0 , P ∗”
From Is cosmological tuning fine or coarse? (2021) · cites this paper as [44]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Conservation of Information in Search: Measuring the Cost of Success
Dembski, W. A., & Marks II, R. J. (2009) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2009.2025027 · Cited by 59
Research works printed but not linked: 7
- Dazard, 2010, Local sparse bump hunting, J. Comput. Graph. Stat., 19, 900, 10.1198/jcgs.2010.09029 · DOI
- Dembski, W.A., Marks, R.J., II, 2009b. Bernoulli’s principle of insufficient reason and conservation of information in computer search. In: Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics. San Antonio, TX, USA, pp. 2647–2652. · DOI · Paper page
- Díaz-Pachón, 2020, Generalized active information: Extension to unbounded domains, J. BIO-Complex
- Díaz-Pachón, 2019, Mode hunting through active information, Appl. Stoch. Models Bus. Ind., 1
- Friedman, 1999, Bump-hunting in high dimensional data, Stat. Comput., 9, 123, 10.1023/A:1008894516817 · DOI
- Montañez, 2018, A unified model of complex specified information, BIO-Complexity, 4, 1
- Wolpert, 1997, No free lunch theorems for optimization, IEEE Trans. Evol. Comput., 1, 67, 10.1109/4235.585893 · DOI · Paper page
Cited by
Is cosmological tuning fine or coarse?
Díaz-Pachón, D. A., Hössjer, O., & Marks II, R. J. (2021) · Journal of Cosmology and Astroparticle Physics · doi:10.1088/1475-7516/2021/07/020 · Cited by 10
Self-citation
Metadata
- Authors
- Díaz–Pachón, D. A., Sáenz, J. P., & Rao, J. S.
- Affiliations
- University of Miami (US)
- Venue
- Statistics & Probability Letters
- Publisher
- Elsevier BV
- Published
- 2020-06
- Volume
- 161
- Pages
- 108742
- ISSN
- 0167-7152 (ISSN-L)
- OpenAlex
- W3006719132
- Cited by
- 12
- References
- 1
- Citations by year
- 2026: 1 · 2025: 1 · 2024: 1 · 2023: 2 · 2022: 5 · 2021: 2
- FWCI
- 1.59
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/legal/tdmrep-license (tdm)
- Locations
- Statistics & Probability Letters (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Mathematics › Statistics and Probability › Probability and Statistical Research
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
- Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Inference
- Keywords
- hypothesis testing, active information, Kullback-Leibler divergence, type I error probability, exact error probability
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
