Skip to content

OmniCache: Multidimensional Hierarchical Feature Caching For Diffusion Models

Jul 2026 · arXiv.org · Vol abs/2607.23844 · 0 citations · 40 references
Computer Science

TL;DR

OmniCache is proposed, a unified hierarchical caching framework that performs multidimensional feature reuse through Token Cache, Frame Cache, Block Cache, and Layered Cache that reuses spatial features in temporal layers and temporal features in spatial layers, while Layered Cache captures cross-step redundancy at the model-layer level.

Abstract

High-resolution image and video diffusion models, including SD3, FLUX, and recent video diffusion transformers, have substantially improved generative quality but remain expensive at inference time because they repeatedly evaluate attention-heavy denoisers over many sampling steps. We address this inefficiency by exploiting redundancy in intermediate diffusion features rather than changing model weights or retraining. We identify four complementary redundancy sources in image and video generation: intra-frame, inter-frame, motion, and denoising-step redundancy. Based on this analysis, we propose OmniCache, a unified hierarchical caching framework that performs multidimensional feature reuse through Token Cache, Frame Cache, Block Cache, and Layered Cache. Unlike token-merging baselines that average matched features, OmniCache uses similarity matching to select cacheable features, skips redundant computation, and restores positionally consistent cached activations, preserving feature order and spatial-temporal structure. The resulting framework reuses spatial features in temporal layers and temporal features in spatial layers, while Layered Cache captures cross-step redundancy at the model-layer level. Across SD3, SVD-XT, and Latte, OmniCache reduces inference latency by up to 35%, 25%, and 28%, respectively, while maintaining visual fidelity and motion coherence in a training-free setting.

View source

Similar papers

Preprint Aug 2026

LinCa: Accelerating Diffusion Models via Learnable Decomposed Feature Caching

LinCa decomposes cached features into sub-components with distinct continuity properties via a lightweight invertible network and applies differentiated prediction orders matched to each component, forming a unified Decompose-Predict-Reconstruct pipeline.

Jin-Shan Liu, Hao-Ran Qin, Xiao-Bing Tu et al. · 0 citations
Conference Jul 2026

AST-ToMe: adaptive step-aware thresholding for efficient temporal-spatial feature reuse in diffusion models

The exceptional generative capabilities of modern diffusion models are fundamentally bottlenecked by the quadratic computational complexity of their attention mechanisms. While recent feature caching strategies attempt to accelerate inference by skipping layers at static intervals, they fail to account for the non-line...

Shu-Zhi Zheng · 0 citations
Conference Jul 2026

Unified Adaptive Quantization and Representation-Aware Caching for Diffusion Models

Diffusion models achieve strong performance in generative modeling but incur high memory and computational costs due to large model parameters and iterative denoising procedures, limiting deployment in resource-constrained environments. This paper presents a unified framework to improving inference latency and memory e...

Deepanshi Sharma, Rudra Pratap, Shivam Jaiswal et al. · 0 citations
Jul 2026

TRaM-VSR: Importance-Aware Token Routing and Merging for One-Step Diffusion Video Super-Resolution

TRaM-VSR, a Token Routing and Merging framework for adaptive token allocation, leveraging both context-aware video priors and network-level priors accelerates inference significantly while preserving state-of-the-art reconstruction quality and robust temporal consistency is proposed.

Sicheng Gao, Zhuyun Zhou, Yixuan Liu et al. · 0 citations
Jul 2026

FlashDiff: Efficient Regional Execution and Scheduling for Diffusion Model Serving

FlashDiff is a diffusion serving system that improves inference efficiency through adaptive regional execution and scheduling that reduces end-to-end serving latency by 30-97% and improves throughput by 1.2-2.2x.

Yaqi Qiao, Ping He, Songru Xie et al. · 0 citations
Preprint Jul 2026

HyperVAttention: Efficient Sparse Attention with Spatio-Temporal Clustering for Video Diffusion

Experiments show that HVA establishes a new Pareto frontier for training-free sparse attention in video diffusion, reducing end-to-end latency by up to $2.13\times while improving fidelity over existing training-free sparse attention baselines.

Dongyeun Lee, A. Zandieh, V. Mirrokni et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.