Least-Squares Problem Over Probability Measure Space
Abstract
In this work, we investigate the variational problem x = argmin_x D(G\#x, y)\,, where D quantifies the difference between two probability measures, and G is a forward operator that maps a variable x to y=G(x). This problem can be regarded as an analogue of its counterpart in linear spaces (e.g., Euclidean spaces), argminx \|G(x) - y\|2. Similar to how the choice of norm \|·\| influences the optimizer in Rd or other linear spaces, the minimizer in the probabilistic variational problem also depends on the choice of D. Our findings reveal that using a φ-divergence for D leads to the recovery of a conditional distribution of y, while employing the Wasserstein distance results in the recovery of a marginal distribution.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.