On maximum entropy and minimum KL-divergence optimization by Gröbner basis methods
From MaRDI portal
Publication:387708
DOI10.1016/J.AMC.2012.05.052zbMATH Open1278.94033arXiv0804.1083OpenAlexW2057387596MaRDI QIDQ387708FDOQ387708
Authors: Ambedkar Dukkipati 
Publication date: 23 December 2013
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Abstract: We show that various formulations (e.g., dual and Kullback-Csiszar iterations) of estimation of maximum entropy (ME) models can be transformed to solving systems of polynomial equations in several variables for which one can use celebrated Grobner bases methods. Posing of ME estimation as solving polynomial equations is possible, in the cases where feature functions (sufficient statistic) that provides the information about the underlying random variable in the form of expectations are integer valued.
Full work available at URL: https://arxiv.org/abs/0804.1083
Recommendations
- An algebraic implicitization and specialization of minimum KL-divergence models
- Computational algebraic methods in efficient estimation
- The maximum likelihood degree
- Algebraic statistics and contingency table problems: log-linear models, likelihood estimatio, and disclosure limitation
- scientific article; zbMATH DE number 1894280
Measures of information, entropy (94A17) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cites Work
- Title not available (Why is that?)
- Probability Densities with Given Marginals
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraic Statistics for Computational Biology
- Title not available (Why is that?)
- Information Theory and Statistical Mechanics
- Generalized Iterative Scaling for Log-Linear Models
- I-divergence geometry of probability distributions and minimization problems
- Information Theory and Statistics: A Tutorial
- Prior Probabilities
- Properties of cross-entropy minimization
- Algebraic algorithms for sampling from conditional distributions
- Solving the likelihood equations
- Title not available (Why is that?)
- Lifting standard bases in filtered structures
- Gröbner bases for ideals in Laurent polynomial rings and their application to systems of difference equations
- Contingency tables with given marginals
- A geometric interpretation of Darroch and Ratcliff's generalized iterative scaling
- An algebraic implicitization and specialization of minimum KL-divergence models
- Properties of Gröbner bases under specializations
Cited In (4)
- Probabilistic knowledge representation using the principle of maximum entropy and Gröbner basis theory
- An algebraic implicitization and specialization of minimum KL-divergence models
- On the computability of continuous maximum entropy distributions with applications
- Computational algebraic methods in efficient estimation
This page was built for publication: On maximum entropy and minimum KL-divergence optimization by Gröbner basis methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q387708)
