OTCache: Optimal Transport for Geometry-Aware Caching in Diffusion Models

• URL: http://arxiv.org/abs/2606.31026v1
• Date: Tue, 30 Jun 2026 01:46:54 GMT
• Title: OTCache: Optimal Transport for Geometry-Aware Caching in Diffusion Models
• Abstract summary: OTCache is a training-free framework for accelerating diffusion sampling via caching schedule prediction.<n>We show that OTCache consistently improves generation fidelity over state-of-the-art caching baselines.
• Score: 11.053622780931306
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose OTCache, a training-free framework for accelerating diffusion sampling via caching schedule prediction. Existing graph-based caching methods reduce redundant computation by optimizing shortest-path objectives, but rely on an additive independence assumption, which often breaks down in the low NFE regime. To address this issue, OTCache models caching schedules across inference budgets as a smooth evolution in policy space, inspired by Optimal Transport (OT). The framework consists of three stages: (1) obtaining a high-fidelity \textbf{reference schedule} using a graph-based caching method under a conservative budget; (2) performing a lightweight anchor search under an extreme low-budget setting via Optuna optimization with an end-to-end perceptual objective; and (3) predicting schedules for target budgets via quantile interpolation between the reference and anchor policies using continuous warping representations. Experiments on FLUX.1 [dev], Qwen-Image, and HunyuanVideo show that OTCache achieves 4.5x, 4.7x, and 3.66x acceleration, respectively, while consistently improving generation fidelity over state-of-the-art caching baselines. This work provides a new perspective on accelerating diffusion models through Optimal-Transport-inspired schedule modeling. Code:https://github.com/UnicomAI/OTCache

Related papers

• From Local Mismatch to Global Impact: Optimizing Cache Reuse Policy for Efficient Diffusion [29.046432574690602]
  Cache-based acceleration has emerged as a promising solution, but existing policies on local similaritys are misaligned with final generation quality.<n>This discrepancy stems from the non-uniform propagation and accumulation of errors along the denoising trajectory.<n>We propose Global Cache Cache (GCache) to address this problem.<n>GCache consistently outperforms prior caching strategies for both video and image generation.
  arXiv  Detail & Related papers  (2026-08-13T10:08:47Z)
• ReCache: Learning Budget-Aware Caching Schedules for Diffusion Models via REINFORCE [40.4732814295941]
  ReCache learns the recomputation schedule that maximizes generation quality.<n>It trains via policy gradients, sidestepping backpagation through full diffusion inference.<n>It consistently outperforms scheduling baselines.
  arXiv  Detail & Related papers  (2026-06-04T11:59:56Z)
• WorldCache: Content-Aware Caching for Accelerated Video World Models [50.7543797435026]
  We present textbfWorldCache, a Perception-Constrained Dynamic CaCache framework.<n>WorldCache improves both when and how to reuse features.<n>On Cosmos-2.5-2B evaluated on PAI-Bench, WorldCache achieves textbf$2.3times$ inference speedup while preserving textbf99.4% of baseline quality.
  arXiv  Detail & Related papers  (2026-03-23T17:59:54Z)
• SenCache: Accelerating Diffusion Model Inference via Sensitivity-Aware Caching [75.02865981328509]
  Caching reduces computation by reusing previously computed model outputs across timesteps.<n>We propose Sensitivity-Aware Caching (SenCache), a dynamic caching policy that adaptively selects caching timesteps on a per-sample basis.<n>SenCache achieves better visual quality than existing caching methods under similar computational budgets.
  arXiv  Detail & Related papers  (2026-02-27T17:36:09Z)
• Denoising as Path Planning: Training-Free Acceleration of Diffusion Models with DPCache [8.614492355393578]
  We propose DPCache, a training-free acceleration framework that formulates diffusion acceleration as a global path planning problem.<n> DPCache employs dynamic programming to select an optimal sequence of key timesteps that minimizes the total path cost while preserving trajectory fidelity.<n>Experiments on DiT, FLUX, and HunyuanVideo demonstrate that DPCache achieves strong acceleration with minimal quality loss.
  arXiv  Detail & Related papers  (2026-02-26T06:13:33Z)
• MeanCache: From Instantaneous to Average Velocity for Accelerating Flow Matching Inference [11.934900617930774]
  MeanCache is a training-free caching framework for efficient Flow Matching inference.<n>We demonstrate that MeanCache achieves 4.12X and 4.56X and 3.59X acceleration, respectively, while consistently outperforming state-of-the-art caching baselines in generation quality.
  arXiv  Detail & Related papers  (2026-01-27T08:35:50Z)
• DiCache: Let Diffusion Model Determine Its Own Cache [62.954717254728166]
  DiCache is a training-free adaptive caching strategy for accelerating diffusion models at runtime.<n>Online Probe Profiling Scheme leverages a shallow-layer online probe to obtain an on-the-fly indicator for the caching error in real time.<n> Dynamic Cache Trajectory Alignment approximates the deep-layer feature output from multi-step historical caches.
  arXiv  Detail & Related papers  (2025-08-24T13:30:00Z)
• Less is Enough: Training-Free Video Diffusion Acceleration via Runtime-Adaptive Caching [57.7533917467934]
  EasyCache is a training-free acceleration framework for video diffusion models.<n>We conduct comprehensive studies on various large-scale video generation models, including OpenSora, Wan2.1, and HunyuanVideo.<n>Our method achieves leading acceleration performance, reducing inference time by up to 2.1-3.3$times$ compared to the original baselines.
  arXiv  Detail & Related papers  (2025-07-03T17:59:54Z)
• Timestep Embedding Tells: It's Time to Cache for Video Diffusion Model [55.64316746098431]
  Timestep Embedding Aware Cache (TeaCache) is a training-free caching approach that estimates and leverages the fluctuating differences among model outputs across timesteps.<n>TeaCache achieves up to 4.41x acceleration over Open-Sora-Plan with negligible degradation of visual quality.
  arXiv  Detail & Related papers  (2024-11-28T12:50:05Z)
• DeepCache: Accelerating Diffusion Models for Free [65.02607075556742]
  DeepCache is a training-free paradigm that accelerates diffusion models from the perspective of model architecture. DeepCache capitalizes on the inherent temporal redundancy observed in the sequential denoising steps of diffusion models. Under the same throughput, DeepCache effectively achieves comparable or even marginally improved results with DDIM or PLMS.
  arXiv  Detail & Related papers  (2023-12-01T17:01:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.