כתבה
arXiv cs.AI ·
The Golden Path Hypothesis: Reusable Schedules in Diffusion Caching
תקציר מקורי באנגליתarXiv:2609.39343v1 Announce Type: new Abstract: Diffusion caching accelerates generation by replacing transformer computation with cached or predicted features at selected denoising steps. We introduce the Golden Path Hypothesis (GPH): under fixed inference conditions, prompt-independent cache schedules can achieve final-output quality comparable to the best prompt-specific schedules across prompts. We investigate the GPH across ten caching methods, four image and video models, and three cache ratios. Prompt-adaptive methods repeatedly select a small number of schedules, and reusing their most frequent schedules on new prompts closely matches the quality of prompt-specific choices. Exhaustive evaluation of 1.4 million schedules on four examples further identifies prompt-independent schedul
קרא במקור המקורי
arxiv.org
פתח כתבה מקורית