aiqbench analysis
This research addresses a critical bottleneck in token-based audio generation by proposing geometric iterative retrieval to enhance the resynthesis of coarse codec tokens. By leveraging the inherent hierarchy of Residual Vector Quantization layers for continuous codebook space decomposition, the method outperforms traditional discrete prediction and single-step regression baselines in restoring speech and music fidelity. The work represents a significant advancement in optimizing neural audio codecs, directly improving the quality limits of current generative audio systems.
Geometric Iterative Retrieval for Neural Audio Codec Resynthesis
arXiv:2608.19141v1 Announce Type: cross Abstract: Neural audio codecs based on Residual Vector Quantization (RVQ) have become the dominant discrete representation for token-based general audio generation, yet resynthesizing high-quality audio from coarse codec tokens remains an open problem and bounds the fidelity of every system that generates them. Prior work has framed resynthesis as a choice between discrete token prediction and continuous regression. We argue that this dichotomy is incomplete and introduce geometric iterative retrieval, a paradigm that uses the RVQ layer hierarchy itself as a natural iterative decomposition in continuous codebook space. Rather than classifying over discrete vocabularies or regressing to a single target vector, our method performs contrastive retrieval in the codebook's geometric space. We evaluate our method on codec restoration tasks across speech and music, and show improvements over both single-pass token prediction and one-step regression baselines.
Abstract:Neural audio codecs based on Residual Vector Quantization (RVQ) have become the dominant discrete representation for token-based general audio generation, yet resynthesizing high-quality audio from coarse codec tokens remains an open problem and bounds the fidelity of every system that generates them. Prior work has framed resynthesis as a choice between discrete token prediction and continuous regression. We argue that this dichotomy is incomplete and introduce geometric iterative retrieval, a paradigm that uses the RVQ layer hierarchy itself as a natural iterative decomposition in continuous codebook space. Rather than classifying over discrete vocabularies or regressing to a single target vector, our method performs contrastive retrieval in the codebook's geometric space. We evaluate our method on codec restoration tasks across speech and music, and show improvements over both single-pass token prediction and one-step regression baselines.
Sound (cs.SD); Machine Learning (cs.LG)
arXiv:2608.19141 [cs.SD]
(or arXiv:2608.19141v1 [cs.SD] for this version)
https://doi.org/10.48550/arXiv.2608.19141 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.
Full text under the publisher's open licence · 230 words
Related coverage
GS-Codec: A Gaussian-Splatting Bottleneck for Neural Audio Coding
arXiv · Oct 7, 2026
Masked Autoregressive Speech Enhancement with Continuous Neural Audio Codec Representations
arXiv · Sep 5, 2026
PairAlign: A Framework for Sequence Tokenization via Self-Alignment with Applications to Audio Tokenization
arXiv · Jun 9, 2026
Teffic-Audio: Tell Fact from Fiction
arXiv · Aug 17, 2026