Lebesgue decomposition in action via semidefinite relaxations
Jean-Bernard Lasserre (LAAS-MAC)

TL;DR
This paper introduces a numerical scheme using semidefinite relaxations to decompose a measure into absolutely continuous and singular parts based solely on finite moments, without prior support knowledge.
Contribution
It provides a novel method to compute Lebesgue decompositions from moments using semidefinite programming, with convergence guarantees.
Findings
Convergent sequences of moments for the decomposed measures.
No prior support information needed for the decomposition.
Applicable to measures with densities in $L_\infty(\lambda)$.
Abstract
Given all (finite) moments of two measures and on , we provide a numerical scheme to obtain the Lebesgue decomposition with and . When has a density in then we obtain two sequences of finite moments vectorsof increasing size (the number of moments) which converge to the moments of and respectively, as the number of moments increases. Importantly, {\it no} \`a priori knowledge on the supports of and is required.
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.
Taxonomy
TopicsProbabilistic and Robust Engineering Design · Markov Chains and Monte Carlo Methods · Mathematical Approximation and Integration
