Efficient numerical approximation of maximum entropy estimates
From MaRDI portal
Recommendations
- An efficient algorithm to compute maximum entropy densities
- Approximation of probability density functions by the multilevel Monte Carlo maximum entropy method
- DETERMINATION OF UNBIASED RECONSTRUCTIONS
- Asymptotic efficiency of maximum entropy estimates
- An efficient algorithm to generate maximum entropy distributions
Cites work
- An efficient algorithm to compute maximum entropy densities
- Calculation of maximum entropy densities with application to income distribution
- Information Theory and Statistical Mechanics
- Information-based complexity and nonparamteric worst-case system identification
- Solution of the general moment problem via a one-parameter imbedding
- The MinMax information measure
Cited in
(22)- Maximum entropy estimation of density and regression functions
- Maximum entropy reconstruction using derivative information. II: Computational results
- Efficient global maximum likelihood estimation through kernel methods
- Fourier-Legendre approximation of a probability density from discrete data
- Asymptotic efficiency of maximum entropy estimates
- Optimization and large scale computation of an entropy-based moment closure
- Rules of proof for maximal entropy inference
- Determining maximal entropy functions for objective Bayesian inductive logic
- A fast Newton algorithm for entropy maximization in phase determination
- Parallel Monte Carlo for entropy-robust estimation
- An efficient algorithm to generate maximum entropy distributions
- DETERMINATION OF UNBIASED RECONSTRUCTIONS
- An efficient algorithm to compute maximum entropy densities
- A new reliability based optimization of tuned mass damper parameters using energy approach
- Maximum a posteriori density estimation and the sparse grid combination technique
- Objective Bayesian Nets for Integrating Consistent Datasets
- Approximate profile maximum likelihood
- Estimation and optimization of MLE maximum entropy probability density
- A simple parameter-free entropy correction for approximate Riemann solvers
- Choice of approximation bases used in computational functional algorithms for approximating probability densities for a given sample
- A decidable class of inferences in first-order objective Bayesian inductive logic
- Best probability density function for random sampled data
This page was built for publication: Efficient numerical approximation of maximum entropy estimates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5485934)
