Maximum entropy estimation via Gauss-LP quadratures
More Info
expand_more
expand_more
Abstract
We present an approximation method to a class of parametric integration problems that naturally appear when solving the dual of the maximum entropy estimation problem. Our method builds up on a recent generalization of Gauss quadratures via an infinite-dimensional linear program, and utilizes a convex clustering algorithm to compute an approximate solution which requires reduced computational effort. It shows to be particularly appealing when looking at problems with unusual domains and in a multi-dimensional setting. As a proof of concept we apply our method to an example problem on the unit disc.
Files
1_s2.0_S2405896317326149_main.... (.pdf)
(.pdf | 0.783 Mb)