A novel sequential method for building upper and lower bounds of moments of distributions
Solal Martin, Emilie Chouzenoux, Victor Elvira

TL;DR
This paper introduces a sequential method using majorization-minimization to efficiently compute and refine bounds on distribution moments, ensuring guaranteed inequalities in both one- and multi-dimensional cases.
Contribution
The paper presents a novel sequential approach for constructing bounds on distribution moments that guarantees inequalities and converges under mild conditions.
Findings
Method effectively refines bounds in numerical examples
Approach guarantees majoration/minoration inequalities
Generalizes to multi-dimensional integrals with power diagrams
Abstract
Approximating integrals is a fundamental task in probability theory and statistical inference, and their applied fields of signal processing, and Bayesian learning, as soon as expectations over probability distributions must be computed efficiently and accurately. When these integrals lack closedform expressions, numerical methods must be used, from the Newton-Cotes formulas and Gaussian quadrature, to Monte Carlo and variational approximation techniques. Despite these numerous tools, few are guaranteed to preserve majoration/minoration inequalities, while this feature is fundamental in certain applications in statistics. In this paper, we focus on the integration problem arising in the estimation of moments of scalar unnormalized distributions. We introduce a sequential method for constructing upper and lower bounds on the sought integral. Our approach leverages the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
