Skip to content

BRACE: Taming Sharp Irregularities via Barycentric Rational Forecasting for Fast Diffusion Transformers Inference

Aug 2026 · 0 citations · 43 references
Computer Science

TL;DR

The proposed Barycentric Rational Forecasting with Chebyshev Enhancement (BRACE) maintains a local sliding window to cache sparse historical features and leverages adapted Chebyshev weights to formulate a barycentric rational function, directly aggregating these raw features to ensure numerical stability.

Abstract

Diffusion Transformers (DiTs) have demonstrated exceptional performance in high-fidelity image and video generation. To alleviate their massive computational overhead, temporal feature caching has been proposed to bypass redundant computations. However, existing cache-then-forecast methods driven by derivative-based polynomials often cause severe quality degradation under high acceleration due to unstable long-step predictions. To address this bottleneck, we propose Barycentric Rational Forecasting with Chebyshev Enhancement (BRACE). Motivated by the observation that DiT feature trajectories are globally smooth yet frequently exhibit sharp irregularities and local non-smoothness, BRACE shifts the paradigm from derivative-driven polynomial extrapolation to feature-driven rational forecasting. Specifically, it maintains a local sliding window to cache sparse historical features and leverages adapted Chebyshev weights to formulate a barycentric rational function, directly aggregating these raw features to ensure numerical stability. Extensive experiments demonstrate that BRACE achieves state-of-the-art quality-efficiency trade-offs across various DiT architectures with negligible computational overhead.

View source

Similar papers

Preprint Aug 2026

ChebBooster: A Training-Free Approach for Efficient Diffusion Transformer Inference via Chebyshev-Inspired Extrapolation

CebBooster is proposed, a training-free extrapolation framework based on Chebyshev polynomial theory that achieves stable and efficient acceleration for DiTs and outperforming existing training-free baselines under diverse generation tasks and resolutions.

Cheng-Jie Lu, Tianchi Deng, Zheng He et al. · 0 citations
Preprint Aug 2026

Memory-Efficient Training-Free Acceleration of Diffusion Transformers with BaryCache

This work proposes a training-free acceleration method that performs stepwise forecasting for DiT sampling using a Barycentric Extrapolator and provides a favorable trade-off between memory usage and perceptual quality, while delivering up to 3.30x end-to-end sampling speedup compared with baseline DiT inference.

Cheng-Jie Lu, Tianchi Deng, Zheng He et al. · 0 citations
#machine learning Preprint Sep 2026

Accelerating Diffusion Transformers with Gaussian Process Rectified Feature Cache

A statistical observation that the residuals between the features of full computation steps using caching methods and reference full-compute trajectory locally exhibit a zero-mean Gaussian distribution is presented, and a plug-and-play GP-Refiner correction framework is proposed.

Zhi-Rong Shen, Rui-Xin Huang, Chang Zou et al. · 0 citations
Preprint Aug 2026

APT: Accelerating Diffusion Transformers via Attention Probability-Guided Pruning and Quantization

APT, a software-hardware co-designed accelerator for high-resolution DiTs that leverages attention probabilities as a unified importance metric to jointly optimize computation through fine-grained pruning and adaptive precision scaling, and is evaluated on SOTA DiT models including PixArt, Stable Diffusion 3, and FLUX.

Sungyeob Yoo, Seeyeon Kim, Joonyong Park 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
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

Related blog posts

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