Papers › Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flow

Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flow

7 Sep 2022arXiv:2209.03003archive 2025-07-28

Xingchao Liu, Chengyue Gong, Qiang Liu

We present rectified flow, a surprisingly simple approach to learning (neural) ordinary differential equation (ODE) models to transport between two empirically observed distributions π_0 and π_1, hence providing a unified solution to generative modeling and domain transfer, among various other tasks involving distribution transport. The idea of rectified flow is to learn the ODE to follow the straight paths connecting the points drawn from π_0 and π_1 as much as possible. This is achieved by solving a straightforward nonlinear least squares optimization problem, which can be easily scaled to large models without introducing extra parameters beyond standard supervised learning. The straight paths are special and preferred because they are the shortest paths between two points, and can be simulated exactly without time discretization and hence yield computationally efficient models. We show that the procedure of learning a rectified flow from data, called rectification, turns an arbitrary coupling of π_0 and π_1 to a new deterministic coupling with provably non-increasing convex transport costs. In addition, recursively applying rectification allows us to obtain a sequence of flows with increasingly straight paths, which can be simulated accurately with coarse time discretization in the inference phase. In empirical studies, we show that rectified flow performs superbly on image generation, image-to-image translation, and domain adaptation. In particular, on image generation and translation, our method yields nearly straight flows that give high quality results even with a single Euler discretization step.

PaperPDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 8 code samples harvested from 4 repositories linked to this paper: 6 ran (of which 3 constructed an object rather than computing a result; 6 with no instrument failure: 3 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 1 sample from 1 repository, 1 ran (1 with no instrument failure; 0 where Syntology's instrument failed); community (archive-listed): 7 samples from 3 repositories, 5 ran (5 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

No sample is linked to this paper from 2 of its repositories that Syntology harvested for other papers:

Levels written on 2026-09-22 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

gnobitab/RectifiedFlow officialmentioned on GitHubjaxSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 unverified report
sangyun884/fast-ode mentioned on GitHubpytorchSyntology: 5 samples, 5 ran (0 instrument-failed) · 0 unverified report
shivammehta25/Matcha-TTS mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Flow Matching for Generative Modeling (arXiv:2210.02747; that paper's own run record: 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified; the one sample that ran constructed an object rather than computing a result) and Matcha-TTS: A fast TTS architecture with conditional flow matching (arXiv:2309.03199; that paper's own run record: 2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
MaximeVandegar/Papers-in-100-Lines-of-Code pytorchSyntology: 1 sample, 0 ran · 1 unverified report
leffff/FlowModels pytorchSyntology: 1 sample, 0 ran · 1 unverified report
leffff/flow-matching-experiments pytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Text-to-Image Rectified Flow as Plug-and-Play Priors (arXiv:2406.03293; that paper's own run record: 6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 2 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

8 samples harvested: 6 ran (of which 3 constructed an object rather than computing a result; 6 with no instrument failure: 3 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

3ran · honoured contract
3ran
2unverified

Licence: 6 of the 8 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 4 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

gnobitab/RectifiedFlow official repository 1 sample, 1 ran (0 instrument-failed) · 0 unverified
RectifiedFlow ImageGeneration/sde_lib.py ran no licence file found · pointer only · 7fa3874fe6727844 · report fixture: returned RectifiedFlow · level recorded 2026-09-22
sangyun884/fast-ode community (archive-listed) 5 samples, 5 ran (0 instrument-failed) · 0 unverified
BaseFlow flows.py ran no licence file found · pointer only · b6254a5689d5af5a · report fixture: returned BaseFlow · level recorded 2026-09-22
RectifiedFlow flows.py ran no licence file found · pointer only · 58ff86add41b30c1 · report fixture: returned RectifiedFlow · level recorded 2026-09-22
alpha in 5 papers flows.py ran · honoured contract fingerprinted no licence file found · pointer only · 5d55915705d80ae7 · report fixture: signature t:Tensor/2/float · returned Tensor · level recorded 2026-09-22
d_1_minus_alpha_sq_dt flows.py ran · honoured contract fingerprinted no licence file found · pointer only · db9529b774b23cb2 · report fixture: signature t:Tensor/2/float · returned Tensor · level recorded 2026-09-22
dalpha_dt flows.py ran · honoured contract fingerprinted no licence file found · pointer only · dc0efae5b0e9861f · report fixture: signature t:Tensor/2/float · returned Tensor · level recorded 2026-09-22
MaximeVandegar/Papers-in-100-Lines-of-Code community (archive-listed) 1 sample, 0 ran · 1 unverified
train_rectified_flow Flow_Straight_and_Fast_Learning_to_Generate_and_Transfer_Data_with_Rectified_Flow/flow_straight_and_fast.py unverified MIT (permissive) · 4d0eea3b30504749 · report
leffff/FlowModels community (archive-listed) 1 sample, 0 ran · 1 unverified
flow_matching_loss flow_models/losses.py unverified MIT (permissive) · 1ca3feb264ebba6f · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. Siblings are assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another.

4 assemblies on this paper: 4 harvested, 0 generated, listed in 1 groups (siblings lifted in one batch form one group).

4 sibling assemblies for Rectified Flow (harvested), lifted in the same batch on 2026-09-09: alternative readings kept side by side; none replaces or supersedes another.

harvested Assembly for Rectified Flow (graph method: Rectified Flow). 5 bricks; individually on a fixture: 5 ran (of which 2 constructed an object rather than computing a result; 5 with no instrument failure: 3 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. The assembly has not been run end-to-end.

one of 4 siblings

  1. RectifiedFlow entry · level 1 · ran · 58ff86add41b30c1
  2. BaseFlow helper · level 1 · ran · b6254a5689d5af5a
  3. alpha helper · level 1 · ran · honoured contract · 5d55915705d80ae7
  4. d_1_minus_alpha_sq_dt helper · level 1 · ran · honoured contract · db9529b774b23cb2
  5. dalpha_dt helper · level 1 · ran · honoured contract · dc0efae5b0e9861f

harvested Assembly for Rectified Flow (graph method: Rectified Flow). 1 brick; individually on a fixture: 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result. The assembly has not been run end-to-end.

one of 4 siblings

  1. RectifiedFlow entry · level 1 · ran · 7fa3874fe6727844

harvested Assembly for Rectified Flow (graph method: Rectified Flow). 1 brick; individually on a fixture: 0 ran · 1 unverified. The assembly has not been run end-to-end.

one of 4 siblings

  1. train_rectified_flow entry · level 0 · unverified · 4d0eea3b30504749

harvested Assembly for Rectified Flow (graph method: Rectified Flow). 1 brick; individually on a fixture: 0 ran · 1 unverified. The assembly has not been run end-to-end.

one of 4 siblings

  1. flow_matching_loss entry · level 0 · unverified · 1ca3feb264ebba6f

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2209.03003") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Domain AdaptationImage GenerationImage-to-Image TranslationTranslation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections