analiza aiqbench
APEX addresses the reconstruction-generation trade-off in diffusion models by introducing asynchronous denoising over hierarchical channel groups, enabling extreme compression without increasing token counts. This method achieves superior performance on ImageNet-512 compared to existing approaches under 64x and 128x compression while maintaining efficiency at lower compute budgets.
APEX: Asynchronous Prefix Denoising for Extreme Compression
arXiv:2610.12843v1 Announce Type: cross Abstract: Fewer latent tokens promise cheaper diffusion. Yet aggressive latent compression creates a reconstruction-generation dilemma: adding channels improves reconstruction but makes generation harder. We introduce APEX, short for Asynchronous Prefix denoising for EXtreme compression, which pairs a hierarchical latent space with asynchronous denoising over channel groups. Our autoencoder orders channel prefixes from structure to detail, while one shared denoiser generates them at staggered local times without adding tokens. On ImageNet-512, APEX outperforms existing methods at every evaluated channel count under 64x and 128x compression. At matched training and guided sampling compute, it also outperforms a 256-token model at every evaluated budget, with larger gains at lower compute. Code is available at https://daviddinkevich.github.io/APEX.
Abstract:Fewer latent tokens promise cheaper diffusion. Yet aggressive latent compression creates a reconstruction-generation dilemma: adding channels improves reconstruction but makes generation harder. We introduce APEX, short for Asynchronous Prefix denoising for EXtreme compression, which pairs a hierarchical latent space with asynchronous denoising over channel groups. Our autoencoder orders channel prefixes from structure to detail, while one shared denoiser generates them at staggered local times without adding tokens. On ImageNet-512, APEX outperforms existing methods at every evaluated channel count under 64x and 128x compression. At matched training and guided sampling compute, it also outperforms a 256-token model at every evaluated budget, with larger gains at lower compute. Code is available at this https URL.
Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
arXiv:2610.12843 [cs.CV]
(or arXiv:2610.12843v1 [cs.CV] for this version)
https://doi.org/10.48550/arXiv.2610.12843 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 213 cuvinte
Subiecte conexe

[AINews] not much happened today
Latent Space · 18 sept. 2026

At SIGGRAPH, NVIDIA Advances Graphics and Simulation With Agentic and Physical AI
NVIDIA · 20 iul. 2026
Productionizing TurboQuant on AMD GPUs for KV-Cache-Bound LLM Inference
AMD · 11 iun. 2026
World Action Models in Real Time: An Empirical Study of Smooth Execution via Asynchronous Deployment
arXiv · 4 aug. 2026