cd /news/artificial-intelligence/calibcache-cache-to-full-feature-dyn… · home › topics › artificial-intelligence › article
[ARTICLE · art-173033] src=arxiv.org ↗ pub= topic=artificial-intelligence verified=true sentiment=↑ positive

CalibCache: Cache-to-Full Feature Dynamics Calibration for Diffusion Transformers

CalibCache, a lightweight offline calibration method for diffusion transformers, cuts FLUX.1-dev LPIPS from 0.563 to 0.429 at cache interval N=5 while delivering a 2.86x denoising speedup over full-compute sampling, according to the arXiv paper 2611.25296v1. The method fits scalar acceleration maps offline by centered least squares from a single pair of full-compute and naive-cache trajectories, then applies them during sampling without extra full-network evaluations or online optimization. Across FLUX.1-dev and Qwen-Image on DrawBench and DiT-XL/2 on ImageNet-256, CalibCache improved fidelity or generation quality over TaylorSeer under 20-step sampling at cache intervals N=3, 4 and 5, and lowered DiT-XL/2 FID from 16.39 to 10.37 relative to TaylorSeer.

recommendation

When caching features for diffusion transformer sampling at short schedules, calibrate second-order feature acceleration offline from one full-compute/naive-cache trajectory pair instead of relying on history-based extrapolation.

more in playbook: Inference and self-hosting
by read1 min views1 publishedNov 20, 2026
arXiv:2611.25296v1 Announce Type: new 
Abstract: Diffusion Transformers generate high-quality images, but iterative sampling remains computationally expensive. Feature caching reduces the number of full network evaluations, yet its approximation error can become more severe under short sampling schedules, where fewer full-compute steps and a coarser sampling grid can make history-based extrapolation less reliable. In this paper, we propose CalibCache, a lightweight offline calibration method that corrects systematic discrepancies between cached and full-compute feature dynamics. Specifically, CalibCache calibrates feature acceleration, defined as the second-order finite difference across sampling steps. Using only a single pair of full-compute and naive-cache trajectories at each setting, CalibCache fits scalar acceleration maps offline by centered least squares. These maps are then applied during sampling without additional full-network evaluations or online optimization. Across FLUX.1-dev and Qwen-Image on DrawBench and DiT-XL/2 on ImageNet-256, CalibCache consistently improves fidelity or generation quality over TaylorSeer under 20-step sampling at cache intervals $N=3,4,5$. At $N=5$, it reduces FLUX.1-dev LPIPS from $0.563$ to $0.429$ while achieving a $2.86\times$ denoising speedup over full-compute sampling, and lowers DiT-XL/2 FID from $16.39$ to $10.37$ relative to TaylorSeer.
── more in #artificial-intelligence 4 stories · sorted by recency
── more on @calibcache 3 stories trending now
sponsored brought to you by zahid.host 4,200+ EU-deployed projects
reading about agents? ship yours in a single git push.

Run your AI side-project on zahid.host

EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain — perfect for shipping the agent you just read about.

$git push zahid main
→ Live at https://your-agent.zahid.host ✓
Get free account → Pricing
from €0/mo · no card required
LIVE [news/calibcache-cache-to-…] indexed:0 read:1min 2026-11-20 · —