MétaCan
Menu
Back to cohort
Record W4255223167 · doi:10.1002/9781118014967.ch13

Cross‐Entropy Method

2011· other· en· W4255223167 on OpenAlexaff
Dirk P. Kroese, Thomas Taimre, Zdravko I. Botev

Bibliographic record

VenueWiley series in probability and statistics · 2011
Typeother
Languageen
FieldDecision Sciences
TopicSimulation Techniques and Applications
Canadian institutionsUniversité de Montréal
Fundersnot available
KeywordsCross-entropy methodMonte Carlo methodMathematical optimizationAdaptive samplingComputer scienceClosenessImportance samplingCross entropyEntropy (arrow of time)Divergence (linguistics)AlgorithmSampling (signal processing)Kullback–Leibler divergenceContinuous optimizationPrinciple of maximum entropyOptimization problemMathematicsArtificial intelligenceStatisticsMulti-swarm optimization

Abstract

fetched live from OpenAlex

The cross-entropy (CE) methodology provides a systematic way to design simple and efficient simulation procedures. The CE method is a generic Monte Carlo technique for solving complicated estimation and optimization problems. In the estimation setting, the CE method can be viewed as an adaptive importance sampling procedure that uses the CE or Kullback-Leibler divergence as a measure of closeness between two sampling distributions. In the optimization setting, the optimization problem is first translated into a rare-event estimation problem and then the CE method for estimation is used as an adaptive algorithm to locate the optimum. This chapter gives examples of CE applied to unconstrained, constrained, and noisy continuous optimization problems. Controlled Vocabulary Terms cross-entropy method; estimation; importance sampling; Monte Carlo methods; probability

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.005
metaresearch head score (Gemma)0.016
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: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.013
Threshold uncertainty score0.045

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.016
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0030.002
Science and technology studies0.0010.001
Scholarly communication0.0030.003
Open science0.0030.003
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0130.004

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.101
GPT teacher head0.424
Teacher spread0.322 · 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
GenreMethods

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
Published2011
Admission routes1
Has abstractyes

Explore more

Same venueWiley series in probability and statisticsSame topicSimulation Techniques and ApplicationsFrench-language works237,207