pith. sign in

hub Mixed citations

Rectified Flow: A Marginal Preserving Approach to Optimal Transport

Mixed citation behavior. Most common role is background (60%).

31 Pith papers citing it
Background 60% of classified citations
abstract

We present a flow-based approach to the optimal transport (OT) problem between two continuous distributions $\pi_0,\pi_1$ on $\mathbb{R}^d$, of minimizing a transport cost $\mathbb{E}[c(X_1-X_0)]$ in the set of couplings $(X_0,X_1)$ whose marginal distributions on $X_0,X_1$ equals $\pi_0,\pi_1$, respectively, where $c$ is a cost function. Our method iteratively constructs a sequence of neural ordinary differentiable equations (ODE), each learned by solving a simple unconstrained regression problem, which monotonically reduce the transport cost while automatically preserving the marginal constraints. This yields a monotonic interior approach that traverses inside the set of valid couplings to decrease the transport cost, which distinguishes itself from most existing approaches that enforce the coupling constraints from the outside. The main idea of the method draws from rectified flow, a recent approach that simultaneously decreases the whole family of transport costs induced by convex functions $c$ (and is hence multi-objective in nature), but is not tailored to minimize a specific transport cost. Our method is a single-object variant of rectified flow that guarantees to solve the OT problem for a fixed, user-specified convex cost function $c$.

hub tools

citation-role summary

background 3 method 2

citation-polarity summary

clear filters

representative citing papers

Building Normalizing Flows with Stochastic Interpolants

cs.LG · 2022-09-30 · conditional · novelty 8.0 · 2 refs

Normalizing flows are constructed by learning the velocity of a stochastic interpolant via a quadratic loss derived from its probability current, yielding an efficient ODE-based alternative to diffusion models.

Generative Modeling by Value-Driven Transport

cs.LG · 2026-05-21 · unverdicted · novelty 7.0

A control-theoretic linear program yields value-driven transport policies for generative modeling with straight paths and simulation-free training.

Asymmetric Flow Models

cs.CV · 2026-05-13 · unverdicted · novelty 7.0 · 2 refs

AsymFlow uses rank-asymmetric velocity prediction to reach 1.57 FID on ImageNet 256x256 and enables finetuning of latent flow models into superior pixel-space text-to-image generators.

Action-to-Action Flow Matching

cs.RO · 2026-02-07 · unverdicted · novelty 7.0

A2A flow matching starts action generation from prior proprioceptive actions in latent space to enable single-step high-quality predictions in robotic policies.

On The Hidden Biases of Flow Matching Samplers

stat.ML · 2025-12-18 · unverdicted · novelty 7.0

Empirical flow matching introduces coupled biases from plug-in estimation, including altered statistical targets, non-gradient minimizers, and non-unique dynamics via flux-null fields, with base distribution controlling kinetic energy tails.

ACID: Action Consistency via Inverse Dynamics for Planning with World Models

cs.RO · 2026-07-02 · unverdicted · novelty 6.0

ACID improves decision-time planning in world models by adding per-step action consistency residuals from an inverse dynamics model to the planning cost via an adaptive weight, yielding better performance with less compute across manipulation and navigation tasks.

SynthICL: Scalable In-context Imitation Learning with Synthetic Data

cs.RO · 2026-06-06 · unverdicted · novelty 6.0

SynthICL trains flow-matching transformer policies for in-context imitation learning entirely from synthetic RGB data and reports 79% average success on 16 unseen real manipulation tasks with one test-time demonstration.

Discrete Flow Matching: Convergence Guarantees Under Minimal Assumptions

cs.LG · 2026-05-09 · unverdicted · novelty 6.0

Discrete flow matching on Z_m^d achieves non-asymptotic KL bounds for early-stopped targets and explicit TV convergence to the true target under an approximation error assumption, with improved scaling in dimension d and vocabulary size m.

Efficient Diffusion Distillation via Embedding Loss

cs.CV · 2026-04-24 · unverdicted · novelty 6.0

Embedding Loss aligns feature distributions via MMD in random network embeddings to boost one-step diffusion distillation, reaching SOTA FID of 1.475 on CIFAR-10 unconditional generation.

citing papers explorer

Showing 0 of 0 citing papers after filters.

No citing papers match the current filters.