MétaCan
Menu
Back to cohort
Record W2056030999 · doi:10.1080/03610920601126001

Estimation of the Entropy Functional from Dependent Samples

2007· article· en· W2056030999 on OpenAlexfundno aff
Johan Lim

Bibliographic record

VenueCommunication in Statistics- Theory and Methods · 2007
Typearticle
Languageen
FieldComputer Science
TopicNeural Networks and Applications
Canadian institutionsnot available
FundersYork University
KeywordsEstimatorHistogramMathematicsEntropy (arrow of time)Entropy estimationRényi entropyMinimax estimatorApplied mathematicsStatisticsComputer sciencePrinciple of maximum entropyArtificial intelligenceMinimum-variance unbiased estimatorPhysics

Abstract

fetched live from OpenAlex

The differential entropy is importantly used in many disciplines, where the estimation of entropy is often the main research objective or the first step toward it. To estimate entropy, plug-in estimators, such as histogram based entropy estimators or kernel based entropy estimators, are commonly used. Especially, though the histogram itself performs poorly in estimating density, the histogram based entropy estimator is often employed due to its computational benefit. Many efforts have been made to understand the properties of the histogram based entropy estimator theoretically, but most of such efforts are restricted to the case of independently and identically distributed (IID) samples. In this article, we show that two histogram-based entropy estimators by Gyórfi and van der Meulen (Citation1987) are almost surely consistent when samples are from a φ-mixing process. A limited simulation study is implemented to compare those two estimators and to investigate their performance for varying intensity of dependency. In addition, we discuss the extension of -consistency of the estimators in IID setting by Hall (Citation1990) to the case of dependent samples.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.004
metaresearch head score (Gemma)0.023
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.020

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.023
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.002
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.043
GPT teacher head0.376
Teacher spread0.333 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations1
Published2007
Admission routes1
Has abstractyes

Explore more

Same venueCommunication in Statistics- Theory and MethodsSame topicNeural Networks and ApplicationsFrench-language works237,207