AIMech AI

Cross-entropy rare-event importance sampling

Algorithms AIMech:CrossEntropyImportanceSampling DRAFT
A rare-event probability estimation algorithm that fits a parametric importance-sampling proposal by cross-entropy minimization toward the nominal distribution conditioned on the event. Its multilevel construction uses likelihood-ratio-weighted pilot fits at adaptive score thresholds, then a new sample from the fitted proposal to estimate the fixed nominal event probability.
Identity Notes & Concept Scope Fresh collection at actual merged base c056d16ecdad4e240beaaf5cf04b36d7b34fe052 inspected 754 maintained and 442 pinned AIO identities. Four fixed-string word-boundary searches included ignored and hidden files across all four recorded checkouts, retaining 13,592 occurrences in 773 content groups. Root read all 505 probe-bearing passage sets, all 22 complete candidate-bearing contexts, four complete long HTML scalar lines, all seven normalized context matches, and all 12 selected full frontier objects. All 909 main and 393 nested objects were mechanically queried; this is not a manual read of all frontier bodies. The same-author context assessment supplies exact occurrence reconstruction and dispositions. No competing candidate identity was found within this bounded current collection. Reuse existing owner 244 for fixed-nominal rare-event proposal fitting followed by fresh final importance sampling. Current CrossEntropyOptimization explicitly uses unit elite weights, whereas this algorithm uses nominal/current likelihood-ratio fitting; AIS bridge-path weighting is also distinct. Shared tutorial citations do not establish an existing complete identity.

Claims & Grounded Evidence

6 Claims
Mechanism #fixed-nominal-event-and-ideal-proposal
For a fixed nominal density or mass function f(x;u), score S and target gamma, the estimand is ell=P_u(S(X)>=gamma). An admissible proposal is positive almost everywhere that the event-weighted nominal density is positive. When ell>0, the ideal proposal g*(x)=I{S(x)>=gamma} f(x;u)/ell gives a constant likelihood-ratio contribution ell, but depends on the unknown probability. This ideal motivates proposal fitting rather than supplying a directly available zero-variance solution.
Mechanism #forward-kl-weighted-proposal-fit
Where the objectives are defined, minimizing KL(g* || f(.;v)) is equivalent to maximizing E_u[I{S(X)>=gamma} log f(X;v)]. With pilot draws from f(.;w), its empirical counterpart maximizes the sum of I{S(X_i)>=gamma} [f(X_i;u)/f(X_i;w)] log f(X_i;v). The nominal parameter u remains fixed while the proposal changes. This is the indicated KL direction and an event- and likelihood-ratio-weighted fit, not an unweighted elite fit or a generic variance-minimization objective.
Mechanism #multilevel-pilot-thresholds
Starting from v_0=u, draw a pilot sample under the preceding fitted proposal and sort its scores increasingly. The stated finite-sample level is min(gamma, S_(ceil((1-rho)N))) for a usable sample size and 0<rho<1. Fit the event-weighted likelihood using that same pilot sample at the current level, retain the original nominal density in its likelihood ratios, and repeat while the capped level is below gamma. These pilot levels temporarily replace the target event for fitting; they do not change the final estimand.
Mechanism #exponential-mean-fit-example
For the source example of independent exponential coordinates parametrized by positive means, each fitted mean is the corresponding event- and likelihood-ratio-weighted coordinate average. This formula requires positive total usable weight and a result in the admissible positive-mean domain. It is an example-specific closed form; a different exponential family or parametrization requires its own sufficient statistics and likelihood fit.
Mechanism #fresh-final-likelihood-ratio-estimate
After adaptation ends at T, the source generates a new sample from f(.;v_T) and estimates ell by the ordinary average M^-1 sum_j I{S(Y_j)>=gamma} f(Y_j;u)/f(Y_j;v_T). This is not division by the sum of importance weights. Conditional on the learned proposal, a fixed positive M of conditionally independent draws with the stated proposal law and valid event support gives conditional expectation ell, and hence unconditional expectation ell. This qualification does not require the fit to be an exact KL optimum.
Scope #probability-estimation-versus-optimization
The selected static formulation estimates a fixed nominal event probability after proposal adaptation. The tutorial separately defines cross-entropy optimization by repeatedly redefining the associated search problem and setting the fitting weights W to 1. Shared parametric fitting does not identify the rare-event estimator with that optimizer, its FACE controller, self-normalized importance sampling or a classifier cross-entropy loss.

⚠️ Curated Limitations & Negative Results

Artificial Intelligence Ontology (AIO) Grounding

Explicit AIO Snapshot Assessment: No Match

Rationale: No inspected AIO target supplies an informative correspondence for this complete non-neural adaptive sampling procedure without adding optional model, task or network requirements. Individual mathematical substeps and possible machine-learning applications do not alone identify the whole algorithm.

Search Scope: Fresh collection at actual merged base c056d16ecdad4e240beaaf5cf04b36d7b34fe052 inspected 754 maintained and 442 pinned AIO identities. Four fixed-string word-boundary searches included ignored and hidden files across all four recorded checkouts, retaining 13,592 occurrences in 773 content groups. Root read all 505 probe-bearing passage sets, all 22 complete candidate-bearing contexts, four complete long HTML scalar lines, all seven normalized context matches, and all 12 selected full frontier objects. All 909 main and 393 nested objects were mechanically queried; this is not a manual read of all frontier bodies. The same-author context assessment supplies exact occurrence reconstruction and dispositions. No competing candidate identity was found within this bounded current collection. The historical scientific assessment examined 14 exact pinned AIO class contexts and 53 incident-edge rows; this current identity pass does not claim a new full ontology reading. Retain those explicit target-specific no-match reasons and the unchanged pinned snapshot. No ontology-wide or source-family saturation is asserted.
Examined AIO Candidate Rejection Reason
AIO:EvolutionaryLLM The exact class denotes a large language model; its related evolutionary-algorithms synonym does not identify a general probability estimator or FACE optimizer.
AIO:TrainingStrategy Neither fixed-nominal rare-event estimation nor generic FACE search inherently preprocesses or trains a machine-learning model.
AIO:MachineLearningTask Parametric proposal/search fitting is an internal algorithm operation, not sufficient to equate the whole procedure with the pinned learning-task class.
AIO:MetaLearning Adaptive sample allocation or likelihood fitting does not inherently use metadata about machine-learning experiments.
AIO:ActiveLearning Evaluating event/performance scores does not inherently query labels for predictive learning.
AIO:ReinforcementLearning Policy-learning applications are possible but are not required by these generic procedures; score feedback alone does not establish this task identity.
AIO:RandomForest No predictive decision-tree ensemble is a mandatory mechanism.
AIO:EvaluationBias A possible sampling or finite-estimation limitation is not an identity relation to a testing-population/metric bias concept.
AIO:MarkovChain Neither construction requires target-invariant Markov transition kernels or the pinned network representation. Encoding a stochastic algorithm state as a Markov process is too generic to identify its defining mechanism.
AIO:MathematicalFunction The pinned class is a generic mathematical rule and is not restricted to scalar inputs or outputs. Mere mathematical describability of the complete adaptive sampling, fitting and termination procedure supplies no sufficiently specific named-rule correspondence at the chosen algorithm scope.
AIO:BayesianNetwork A particular sampling family may be graphical; no DAG is inherent to the generic algorithm.
AIO:ProbabilisticGraphicalModel The pinned graph-expressed conditional-dependence task is optional representation, not the whole method.
AIO:RestrictedBoltzmannMachine No hidden-layer energy model or restricted Boltzmann family is mandatory.
AIO:ExponentialFunction Exponential densities and optional performance transforms are examples. A mandatory scalar exponential update is not part of either generic construction, unlike the specifically selected xNES/SNES rules.

Evidence Sources & Primary Literature

1 Source
Source ID Publication / Document Type / Access Reference & Checksum
deboer2005
Pieter-Tjerk de Boer, Dirk P. Kroese, Shie Mannor, Reuven Y. Rubinstein
primary paper
full_text
ID: https://people.smp.uq.edu.au/DirkKroese/ps/aortut.pdf
sha256:f68c734c2789…

Curation Provenance

Curator: Codex
Method: ai_assisted
Model: GPT-6
Created: 2026-10-15T11:59:01Z
Updated: 2026-10-15T11:59:01Z
Source File: data/curated/CrossEntropyImportanceSampling.yaml