The generalized cross entropy method, with applications to probability density estimation
From MaRDI portal
Publication:631482
DOI10.1007/s11009-009-9133-7zbMath1207.94041OpenAlexW2004191624WikidataQ56157776 ScholiaQ56157776MaRDI QIDQ631482
Zdravko I. Botev, Dirk P. Kroese
Publication date: 14 March 2011
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://espace.library.uq.edu.au/view/UQ:200564/UQ200564_preprint.pdf
kernel smoothingMonte Carlo simulationcalculus of variationsinformation theorybandwidth selectionfunctional optimizationstatistical modelingcross entropy
Related Items
Multifidelity Preconditioning of the Cross-Entropy Method for Rare Event Simulation and Failure Probability Estimation, Systemic risk in the European sovereign and banking system, Dependence assessment based on generalized relative complexity: application to sampling network design, Marginal Likelihood Estimation with the Cross-Entropy Method, Comparison of cell state models derived from single-cell RNA sequencing data: graph versus multi-dimensional space, Simulation and estimation of extreme quantiles and extreme probabilities, Piecewise Polynomial Approximation of Probability Density Functions with Application to Uncertainty Quantification for Stochastic PDEs, Calibration of a radiation quality model for sparse and uncertain data, Sequential Monte Carlo for rare event estimation, Efficient Monte Carlo simulation via the generalized splitting method, Information content of high-order associations of the human gut microbiota network, Non-asymptotic bandwidth selection for density estimation of discrete data
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Non-asymptotic bandwidth selection for density estimation of discrete data
- An asymptotically efficient solution to the bandwidth problem of kernel density estimation
- An asymptotically optimal window selection rule for kernel density estimates
- On Kullback-Leibler loss and density estimation
- An entropy criterion for assessing the number of clusters in a mixture model
- Bandwidth selection for kernel density estimation
- A simple root \(n\) bandwidth selector
- Exact mean integrated squared error
- Variable kernel density estimation
- Reducing bias in curve estimation by use of weights.
- Bias reduction in kernel density estimation by smoothed empirical transformations
- Model specification: The views of Fisher and Neyman, and later developments
- Progress in data-based bandwidth selection for kernel density estimation
- On bandwidth variation in kernel estimates. A square root law
- Smoothing methods in statistics
- Possible generalization of Boltzmann-Gibbs statistics.
- Bandwidth selection: Classical or plug-in?
- A stochastic minimum cross-entropy method for combinatorial optimization and rare-event estimation
- A class of measures of informativity of observation channels
- Sequential Monte Carlo Methods in Practice
- Penalty Functions and Duality in Stochastic Programming Via ϕ-Divergence Functionals
- Marginal Likelihood from the Gibbs Output
- Information Theory and Statistical Mechanics
- Density Estimation With Confidence Sets Exemplified by Superclusters and Voids in the Galaxies
- A comparative study of some kernel-based nonparametric density estimators
- Cross-validation in nonparametric estimation of probabilities and probability densities
- Duality Relationships for Entropy-Like Minimization Problems
- Dual Methods in Entropy Maximization. Application to Some Problems in Crystallography
- An improvement of the NEC criterion for assessing the number of clusters in a mixture model
- Local Regression and Likelihood
- Nonparametric Importance Sampling
- On Information and Sufficiency
