paper-with-me

홈 › Papers

MESSY Estimation: Maximum-Entropy based Stochastic and Symbolic densitY Estimation

2023-06-07 · Tony Tohme, Mohsen Sadr, Kamal Youcef-Toumi, Nicolas G. Hadjiconstantinou

We introduce MESSY estimation, a Maximum-Entropy based Stochastic and Symbolic densitY estimation method. The proposed approach recovers probability density functions symbolically from samples using moments of a Gradient flow in which the ansatz serves as the driving force. In particular, we construct a gradient-based drift-diffusion process that connects samples of the unknown distribution function to a guess symbolic expression. We then show that when the guess distribution has the maximum entropy form, the parameters of this distribution can be found efficiently by solving a linear system of equations constructed using the moments of the provided samples. Furthermore, we use Symbolic regression to explore the space of smooth functions and find optimal basis functions for the exponent of the maximum entropy functional leading to good conditioning. The cost of the proposed method for each set of selected basis functions is linear with the number of samples and quadratic with the number of basis functions. However, the underlying acceptance/rejection procedure for finding optimal and well-conditioned bases adds to the computational cost. We validate the proposed MESSY estimation method against other benchmark methods for the case of a bi-modal and a discontinuous density, as well as a density at the limit of physical realizability. We find that the addition of a symbolic search for basis functions improves the accuracy of the estimation at a reasonable additional computational cost. Our results suggest that the proposed method outperforms existing density recovery methods in the limit of a small to moderate number of samples by providing a low-bias and tractable symbolic description of the unknown density at a reasonable computational cost.

📄 PDF Abstract BibTeX arXiv:2306.04120

Code (0)

등록된 구현이 없습니다.

Tasks

Density EstimationSymbolic Regression

Methods 이 논문이 사용한 방법론

Random Search Random Search replaces the exhaustive enumeration of all combinations by selecting them randomly. This can be simply applied to the discrete setting described above, but also…

Similar Papers 제목 키워드 기반

FastDSAC: Unlocking the Potential of Maximum Entropy RL in High-Dimensional Humanoid Control

2026-03-13 · Jun Xue, Junze Wang, Shanze Wang, Xinming Zhang 외 arxiv

Scaling Maximum Entropy Reinforcement Learning (RL) to high-dimensional humanoid control remains a fundamental challenge, as the ''curse of dimensionality'' induces severe exploration inefficiency and training instabilit…

Reinforcement LearningContinuous Control

Mind Your Entropy: From Maximum Entropy to Trajectory Entropy-Constrained RL

2025-10-25 · Guojian Zhan, Likun Wang, Pengcheng Wang, Feihong Zhang 외 arxiv

Maximum entropy has become a mainstream off-policy reinforcement learning (RL) framework for balancing exploitation and exploration. However, two bottlenecks still limit further performance improvement: (1) non-stationar…

Reinforcement LearningOpenAI Gym

FLAC: Maximum Entropy RL via Kinetic Energy Regularized Bridge Matching

2026-02-13 · Lei Lv, Yunfei Li, Yu Luo, Fuchun Sun 외 arxiv

Iterative generative policies, such as diffusion models and flow matching, offer superior expressivity for continuous control but complicate Maximum Entropy Reinforcement Learning because their action log-densities are n…

Reinforcement LearningContinuous ControlDensity Estimation

Maximum Entropy Flow Networks

2017-01-12 · Gabriel Loaiza-Ganem, Yuanjun Gao, John P. Cunningham

Maximum entropy modeling is a flexible and popular framework for formulating statistical models given partial knowledge. In this paper, rather than the traditional method of optimizing over the continuous density directl…

Stochastic Optimization

MGD: Moment Guided Diffusion for Maximum Entropy Generation

2026-02-19 · Etienne Lempereur, Nathanaël Cuvelle--Magar, Florentin Coeurdoux, Stéphane Mallat 외 arxiv

Generating samples from limited information is a fundamental problem across scientific domains. Classical maximum entropy methods provide principled uncertainty quantification from moment constraints but require sampling…