We investigate the statistical properties of maximum entropy density estimation, both for the complete data case and the incomplete data case. We show that under certain assumptions, the generalization error can be bounded in terms of the complexity of the underlying feature functions. This allows us to establish the universal consistency of maximum entropy density estimation.
No takes yet. Share an insight, caveat, or question.
Wang et al. (2013) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: