Sample and Map from a Single Convex Potential: Generation using Conjugate Moment Measures
The canonical approach in generative modeling is to split model fitting into two blocks: define first how to sample noise (e.g. Gaussian) and choose next what to do with it (e.g. using a single map or flows). We explore in this work an alternative route that ties sampling and mapping. We find inspiration in moment measures, a result that states that for any measure ρ, there exists a unique convex potential u such that ρ = ∇u♯e-u. While this does seem to tie effectively sampling (from log–concave distribution e-u) and action (pushing particles through ∇u), we observe on simple examples (e.g…
In 1991, Brenier proved a theorem that generalizes the polar decomposition for square matrices -- factored as PSD ×times× unitary -- to any vector field F:Rd→RdF:mathbb{R}^drightarrow mathbb{R}^dF:Rd→Rd. The theorem, known as the polar factorization theorem, states that any field FFF can be recovered as the composition of the gradient of…
This paper considers the learning of logical (Boolean) functions with focus on the generalization on the unseen (GOTU) setting, a strong case of out-of-distribution generalization. This is motivated by the fact that the rich combinatorial nature of data in certain reasoning tasks (e.g., arithmetic/logic) makes representative data sampling challenging, and…