mlsanityData to 14 Oct 2026

High-Order Matching for One-Step Shortcut Diffusion Models

arXiv 2502.00688 ↗First posted 2 Feb 2025cs.CV cs.AI cs.LGcited by 15

On the map: Diffusion models → Flow matching, time series and science

Abstract (arXiv)

One-step shortcut diffusion models [Frans, Hafner, Levine and Abbeel, ICLR 2025] have shown potential in vision generation, but their reliance on first-order trajectory supervision is fundamentally limited. The Shortcut model's simplistic velocity-only approach fails to capture intrinsic manifold geometry, leading to erratic trajectories, poor geometric alignment, and instability-especially in high-curvature regions. These shortcomings stem from its inability to model mid-horizon dependencies or complex distributional features, leaving it ill-equipped for robust generative modeling. In this work, we introduce HOMO (High-Order Matching for One-Step Shortcut Diffusion), a game-changing framework that leverages high-order supervision to revolutionize distribution transportation. By incorporating acceleration, jerk, and beyond, HOMO not only fixes the flaws of the Shortcut model but also achieves unprecedented smoothness, stability, and geometric precision. Theoretically, we prove that HOMO's high-order supervision ensures superior approximation accuracy, outperforming first-order methods. Empirically, HOMO dominates in complex settings, particularly in high-curvature regions where the Shortcut model struggles. Our experiments show that HOMO delivers smoother trajectories and better distributional alignment, setting a new standard for one-step generative models.

Key facts. Cited by 15 papers in the map (data through 14 Oct 2026). Placed in Flow matching, time series and science, one of 14 directions in Diffusion models. Builds on 56 of its 115 references that are in the map. First posted on arXiv 2 Feb 2025.

Builds on

56 of 115 references.

Closest ancestors · 5

Same direction, newest first

  1. 2024Flow matching achieves almost minimax optimal convergence31 May
  2. 2023Flow Matching for Scalable Simulation-Based Inference26 May
  3. 2023Multisample Flow Matching: Straightening Flows with Minibatch Couplings28 Apr
  4. 2022Flow Matching for Generative Modeling6 Oct
  5. 2022Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flow7 Sep

Other references · 51

  1. 2023GPT-4 Technical Reportcited by 18,396
  2. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  3. 2020Denoising Diffusion Implicit Modelscited by 9,781
  4. 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,326
  5. 2021On the Opportunities and Risks of Foundation Modelscited by 4,033
  6. 2022Scaling Instruction-Finetuned Language Modelscited by 3,024
  7. 2023Sparks of Artificial General Intelligence: Early experiments with GPT-4cited by 2,592
  8. 2021Show Your Work: Scratchpads for Intermediate Computation with Language Modelscited by 886
  9. 2023LLaMA-Adapter: Efficient Fine-tuning of Language Models with Zero-init Attentioncited by 781
  10. 2023LLaMA-Adapter V2: Parameter-Efficient Visual Instruction Modelcited by 602
  11. 2018FFJORD: Free-form Continuous Dynamics for Scalable Reversible Generative Modelscited by 594
  12. 2023On the Importance of Noise Scheduling for Diffusion Modelscited by 194
38 more
  1. 2023An Over-parameterized Exponential Regressioncited by 45
  2. 2023TokenCompose: Text-to-Image Diffusion with Token-level Supervisioncited by 40
  3. 2024On Statistical Rates and Provably Efficient Criteria of Latent Diffusion Transformers (DiTs)cited by 40
  4. 2024Improved Noise Schedule for Diffusion Trainingcited by 39
  5. 2023Randomized and Deterministic Attention Sparsification Algorithms for Over-parameterized Feature Dimensioncited by 37
  6. 2024LazyDiT: Lazy Learning for the Acceleration of Diffusion Transformerscited by 37
  7. 2023An Iterative Algorithm for Rescaled Hyperbolic Functions Regressioncited by 35
  8. 2024How Far Are We From AGI: Are LLMs All We Need?cited by 31
  9. 2023A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Timecited by 30
  10. 2024Circuit Complexity Bounds for RoPE-based Transformer Architecturecited by 26
  11. 2024Numerical Pruning for Efficient Autoregressive Modelscited by 25
  12. 2024Unraveling the Smoothness Properties of Diffusion Models: A Gaussian Mixture Perspectivecited by 24
  13. 2023GradientCoin: A Peer-to-Peer Decentralized Large Language Modelscited by 23
  14. 2023Dolfin: Diffusion Layout Transformers without Autoencodercited by 23
  15. 2024Score-based Generative Diffusion Models for Social Recommendationscited by 23
  16. 2024Multi-Layer Transformers Gradient Can be Approximated in Almost Linear Timecited by 22
  17. 2024Bypassing the Exponential Dependency: Looped Transformers Efficiently Learn In-context by Multi-step Gradient Descentcited by 22
  18. 2024Fundamental Limits of Prompt Tuning Transformers: Universality, Capacity and Efficiencycited by 22
  19. 2024On Statistical Rates of Conditional Diffusion Transformers: Approximation, Estimation and Minimax Optimalitycited by 22
  20. 2024The Computational Limits of State-Space Models and Mamba via the Lens of Circuit Complexitycited by 21
  21. 2024A Tighter Complexity Analysis of SparseGPTcited by 19
  22. 2024Looped ReLU MLPs May Be All You Need as Practical Programmable Computerscited by 19
  23. 2024HSR-Enhanced Sparse Attention Accelerationcited by 19
  24. 2024Differential Privacy Mechanisms in Neural Tangent Kernel Regressioncited by 14
  25. 2025On Computational Limits and Provably Efficient Criteria of Visual Autoregressive Models: A Fine-Grained Complexity Analysiscited by 14
  26. 2025On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspectivecited by 14
  27. 2022Taylor-Lagrange Neural Ordinary Differential Equations: Toward Fast Training and Evaluation of Neural ODEscited by 13
  28. 2022A Nearly Optimal Size Coreset Algorithm with Nearly Linear Timecited by 13
  29. 2024RoPE Attention Can Be Trained in Almost Linear Timecited by 13
  30. 2023A Unified Scheme of ResNet and Softmaxcited by 12
  31. 2024On Fine-Grained I/O Complexity of Attention Backward Passescited by 11
  32. 2023A Theoretical Analysis Of Nearest Neighbor Search On Approximate Near Neighbor Graphcited by 10
  33. 2025Circuit Complexity Bounds for Visual Autoregressive Modelcited by 10
  34. 2023Federated Empirical Risk Minimization via Second-Order Methodcited by 9
  35. 2023Is Solving Graph Neural Tangent Kernel Equivalent to Training Graph Neural Network?cited by 8
  36. 2024Quantum Speedups for Approximating the John Ellipsoidcited by 6
  37. 2024An Investigation of Noise Robustness for Flow-Matching-Based Zero-Shot TTScited by 4
  38. 2024Advancing the Understanding of Fixed Point Iterations in Deep Neural Networks: A Detailed Analytical Studycited by 4

50 most cited of 51 All 51 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 14; 2026: 1.

15 papers.

Sort:

By area:

Similar, not cited

Close in wording, no citation either way

  1. 2024Metric Flow Matching for Smooth Interpolations on the Data Manifold
  2. 2026Flow Matching is Adaptive to Manifold Structures
  3. 2025Shortcutting Pre-trained Flow Matching Diffusion Models is Almost Free Lunch
  4. 2025From Navigation to Refinement: Revealing the Two-Stage Nature of Flow-based Diffusion Models through Oracle Velocity
  5. 2026Beckmann Transport Models: From Autonomous Flows to One-Step Maps
  6. 2026Tracking High-order Evolutions via Cascading Low-rank Fitting
  7. 2026InjectFlow: Weak Guides Strong via Orthogonal Injection for Flow Matching
  8. 2025Diff2Flow: Training Flow Matching Models via Diffusion Model Alignment