A Biconvex Formulation for Stable Transport of Mixture Models with a Unique Solution
Optimal transport (OT) provides a principled framework for mapping between probability distributions. Despite extensive progress, applying OT to large-scale data remains computationally demanding, and the resulting pointwise transport plans are often difficult to interpret. We introduce Optimal Mixture Transport (OMT), a scalable framework that shifts the transport paradigm from individual samples to mixtures of subpopulations, reformulating the transport problem as a strictly biconvex optimization with a unique global minimizer. We further establish theoretical guarantees on the stability of the OMT map, showing that bounded perturbations of the underlying distributions lead to bounded changes in the transport plan. By formulating subpopulations as exponential-family distributions, OMT decouples computational complexity from the sample size, scaling solely with the number of mixture components. We demonstrate the effectiveness and practicality of OMT on a wide range of synthetic benchmarks and real-world datasets, including image data and large-scale single-cell RNA sequencing measurements.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Disciplined Biconvex Programming
We introduce disciplined biconvex programming (DBCP), a modeling framework for specifying and solving biconvex optimization problems. Biconvex optimization problems arise in various applications, including machine learni…
Fast PINN Eigensolvers via Biconvex Reformulation
Eigenvalue problems have a distinctive forward-inverse structure and are fundamental to characterizing a system's thermal response, stability, and natural modes. Physics-Informed Neural Networks (PINNs) offer a mesh-free…
Sparse Domain Transfer via Elastic Net Regularization
Transportation of samples across different domains is a central task in several machine learning problems. A sensible requirement for domain transfer tasks in computer vision and language domains is the sparsity of the t…
feature selectionStable Global Weighting of Flow Mixtures using Simplex Exponential Moving Average
Normalising flows provide a powerful variational family for approximate inference, yet individual architectures often fail to generalise across heterogeneous posterior geometries. We revisit mixture-based flow formulatio…
Constrained Least Squares, SDP, and QCQP Perspectives on Joint Biconvex Radar Receiver and Waveform design
Joint radar receive filter and waveform design is non-convex, but is individually convex for a fixed receiver filter while optimizing the waveform, and vice versa. Such classes of problems are fre- quently encountered in…