arXiv Analytics

Sign in

arXiv:math-ph/0212005AbstractReferencesReviewsResources

Why Maximum Entropy? A Non-axiomatic Approach

M. Grendar, Jr., M. Grendar

Published 2002-12-02Version 1

Ill-posed inverse problems of the form y = X p where y is J-dimensional vector of a data, p is m-dimensional probability vector which cannot be measured directly and matrix X of observable variables is a known J,m matrix, J < m, are frequently solved by Shannon's entropy maximization (MaxEnt). Several axiomatizations were proposed to justify the MaxEnt method (also) in this context. The main aim of the presented work is two-fold: 1) to view the concept of complementarity of MaxEnt and Maximum Likelihood (ML) tasks from a geometric perspective, and consequently 2) to provide an intuitive and non-axiomatic answer to the 'Why MaxEnt?' question.

Comments: 4 pages, MaxEnt 2001
Journal: In: Bayesian inference and Maximum Entropy methods in Science and Engineering, R. L. Fry (ed.), AIP (Melville), 375-379, 2002
Categories: math-ph, math.MP, math.ST, stat.TH
Subjects: 62B10, 94A17
Related articles: Most relevant | Search more
arXiv:1607.02259 [math-ph] (Published 2016-07-08)
Maximum Entropy and Sufficiency
arXiv:math-ph/0008017 (Published 2000-08-07)
Maximum entropy, fluctuations and priors
arXiv:1505.06579 [math-ph] (Published 2015-05-25)
Zamolodchikov tetrahedral equation and higher Hamiltonians of 2d quantum integrable systems