mlsanityData to 14 Oct 2026

Gaussian Process Regression for Maximum Entropy Distribution

arXiv 2308.06149 ↗First posted 11 Aug 2023stat.ML cs.LG math-phcited by 0

Not on the map. Why?

Abstract (arXiv)

Maximum-Entropy Distributions offer an attractive family of probability densities suitable for moment closure problems. Yet finding the Lagrange multipliers which parametrize these distributions, turns out to be a computational bottleneck for practical closure settings. Motivated by recent success of Gaussian processes, we investigate the suitability of Gaussian priors to approximate the Lagrange multipliers as a map of a given set of moments. Examining various kernel functions, the hyperparameters are optimized by maximizing the log-likelihood. The performance of the devised data-driven Maximum-Entropy closure is studied for couple of test cases including relaxation of non-equilibrium distributions governed by Bhatnagar-Gross-Krook and Boltzmann kinetic equations.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 39 references that are in the map. First posted on arXiv 11 Aug 2023.

Builds on

2 of 39 references.

References · 2

  1. 2016GPflow: A Gaussian process library using TensorFlowcited by 140
  2. 2018Kernel Flows: from learning kernels from data into the abysscited by 49

Built on by

Not cited yet.