MétaCan
Menu
Back to cohort
Record W2145647981 · doi:10.1109/isit.2008.4595272

Kullback-Leibler distance in linear parametric modeling

2008· article· en· W2145647981 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldMathematics
TopicStatistical Methods and Inference
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsParametric statisticsProbabilistic logicKullback–Leibler divergenceParametric modelProbability density functionMathematicsAlgorithmProbability distributionApplied mathematicsComputer scienceMathematical optimizationStatistics

Abstract

fetched live from OpenAlex

This paper addresses the estimation of the Kulback-Leibler (KL) distance in data-driven modeling of parametric probability distributions. Given a finite observation of a parametric probability density function (pdf), the goal is to provide the best representative of the true parameter, which is known to belong to a given parametric model set. The first step in this problem setting is to estimate the true parameter in available nested model sets of different orders. The proposed method calculates the KL distance between these estimates and the unknown true parameter. By using only the observed data, we provide probabilistic worst case bounds on these KL distances. The best candidate among the available estimates is the solution of a resulting probabilistic min-max problem. A comparison of this approach with existing methods that estimate the KL distance is provided.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.002
Version: codex-gemma-dda1882f352aValidation 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: Methods · Consensus signal: Methods
Teacher disagreement score0.636
Threshold uncertainty score0.398

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.243
GPT teacher head0.404
Teacher spread0.160 · 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

Quick stats

Citations7
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicStatistical Methods and InferenceFrench-language works237,207