Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2603.00209

Moment-based Piecewise Polynomial Probability Density Estimation with Quantile-Based Binning

Meltem Turan·Joakim Munkhammar
View original source ↗Read source document ↗Export metadata ↓

Abstract

Accurate reconstruction of probability density functions (PDFs) from data is essential in engineering applications. Classical global moment-based polynomial approximations often suffer from oscillations, instability in the tails, and sensitivity to the choice of support. This work proposes a quantile-based piecewise polynomial density reconstruction approach that combines equal-probability binning with local moment-matched polynomials within each bin. Two variants are considered: piecewise monomial and piecewise Lagrange polynomials with Chebyshev nodes. The numbers of bins and polynomial degrees are selected by a proposed grid search approach guided by the Kolmogorov-Smirnov (K-S) test statistic under non-negativity constraints. Across several benchmark distributions, the proposed methods reduce K-S errors by about $80$-$96\%$ relative to standard monomial and Lagrange polynomial approaches, and by about $83$-$97\%$ compared with spline density estimation. For real-world household electricity consumption and solar irradiance data, the piecewise approaches achieve K-S test statistic performance comparable to kernel density estimation while offering improved control over tail behavior and oscillations. Overall, the results demonstrate that quantile-based localization substantially enhances the robustness and fidelity of moment-based polynomial PDF reconstruction.

Explore related subjects

math.GM

Keep this discovery

BibTeXRIS

Meltem Turan, Joakim Munkhammar. 2026-02-27. Moment-based Piecewise Polynomial Probability Density Estimation with Quantile-Based Binning. https://arxiv.org/abs/2603.00209

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗