paper-with-me

홈 › Papers

Simultaneous Learning of Optimal Transports for Training All-to-All Flow-Based Condition Transfer Model

2025-04-04 · Kotaro Ikeda, Masanori Koyama, Jinzhe Zhang, Kohei Hayashi, Kenji Fukumizu

In this paper, we propose a flow-based method for learning all-to-all transfer maps among conditional distributions, approximating pairwise optimal transport. The proposed method addresses the challenge of handling continuous conditions, which often involve a large set of conditions with sparse empirical observations per condition. We introduce a novel cost function that enables simultaneous learning of optimal transports for all pairs of conditional distributions. Our method is supported by a theoretical guarantee that, in the limit, it converges to pairwise optimal transports among infinite pairs of conditional distributions. The learned transport maps are subsequently used to couple data points in conditional flow matching. We demonstrate the effectiveness of this method on synthetic and benchmark datasets, as well as on chemical datasets where continuous physical properties are defined as conditions.

📄 PDF Abstract BibTeX arXiv:2504.03188

Code (0)

등록된 구현이 없습니다.

Tasks

All

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

Two-Parameter Flows for Learning Population Dynamics of Physical Systems

2026-05-25 · Paul Schwerdtner, Tobias Blickhan, Benjamin Peherstorfer arxiv

This work addresses the problem of learning the dynamics of high-dimensional probability densities over time using unlabeled samples, without assuming access to trajectory information. We introduce two-parameter flows th…

ArticFlow: Generative Simulation of Articulated Mechanisms

2025-11-22 · Jiong Lin, Jinchen Ruan, Hod Lipson arxiv

Recent advances in generative models have produced strong results for static 3D shapes, whereas articulated 3D generation remains challenging due to action-dependent deformations and limited datasets. We introduce ArticF…

3D Generation

Transport, Don't Generate: Deterministic Geometric Flows for Combinatorial Optimization

2026-02-11 · Benjy Friedmann, Nadav Dym arxiv

Recent advances in Neural Combinatorial Optimization (NCO) have been dominated by diffusion models that treat the Euclidean Traveling Salesman Problem (TSP) as a stochastic $N \times N$ heatmap generation task. In this p…

Causality--Δ: Jacobian-Based Dependency Analysis in Flow Matching Models

2026-02-02 · Reza Rezvan, Gustav Gille, Moritz Schauer, Richard Torkar arxiv

Flow matching learns a velocity field that transports a base distribution to data. We study how small latent perturbations propagate through these flows and show that Jacobian-vector products (JVPs) provide a practical l…

Stein Variational Gradient Descent as Gradient Flow

2017-04-25 · NeurIPS 2017 12 · Qiang Liu

Stein variational gradient descent (SVGD) is a deterministic sampling algorithm that iteratively transports a set of particles to approximate given distributions, based on an efficient gradient-based update that guarante…