paper-with-me

홈 › Papers

LACE: Layer-Wise Compression for Dynamic Frame Rate Codecs

2026-09-15 · Thanapat Trachu, Samuele Cornell, William Chen, Shinji Watanabe arxiv

Neural audio codecs are a key component in speech language modeling. However, their high frame rates lead to long sequence lengths, increasing computational costs. Dynamic frame rate codecs mitigate this by reducing the effective frame rate using a compression step to merge multiple frames together. However, most prior methods either operate on single-codebook codecs or apply a single compression step before multi-layer quantization. This forces all quantization layers to share the same segmentation boundaries, despite the residual embeddings at different quantization layers exhibiting different rates of change over time. We propose LACE (Layer-Adaptive Codec Encoding), a dynamic frame rate codec that applies an independent compression step at each quantization layer, enabling layer-specific segmentation boundaries. To use LACE tokens in downstream text-to-speech (TTS), we further introduce union alignment and boundary anchor mechanisms to make durations consistent across layers while preserving compression benefits. Experiments on LibriTTS show that LACE offers a better rate-quality tradeoff than prior dynamic frame rate methods on the reconstruction task and improves TTS inference efficiency while maintaining competitive synthesis quality. Our code is released as part of the ESPnet3 codec recipe.

📄 PDF Abstract BibTeX arXiv:2609.17509

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

LACE-SVD: Loss-Aware SVD with Cumulative Error Correction for LLM Compression

2026-07-03 · Zhuowen Liu, Longkun Hao, Shiyu Feng, Xiaowen Chang 외 arxiv

The rapid growth in the parameter scale of large language models (LLMs) has created a strong demand for efficient compression techniques. As a hardware-agnostic and highly compatible approach, low-rank compression has be…

LAVa: Layer-wise KV Cache Eviction with Dynamic Budget Allocation

2025-09-11 · Yiqun Shen, Song Yuan, Zhengze Zhang, Xiaoliang Wang 외 arxiv

KV Cache is commonly used to accelerate LLM inference with long contexts, yet its high memory demand drives the need for cache compression. Existing compression methods, however, are largely heuristic and lack dynamic bu…

Code Completion

ScaleOT: Privacy-utility-scalable Offsite-tuning with Dynamic LayerReplace and Selective Rank Compression

2024-12-13 · Kai Yao, Zhaorui Tan, Tiandi Ye, Lichun Li 외

Offsite-tuning is a privacy-preserving method for tuning large language models (LLMs) by sharing a lossy compressed emulator from the LLM owners with data owners for downstream task tuning. This approach protects the pri…

Knowledge DistillationPrivacy Preserving

Layer-wise dynamic rank for compressing large language models

2025-09-30 · Zhendong Mi, Bian Sun, Grace Li Zhang, Shaoyi Huang arxiv

Large language models (LLMs) have rapidly scaled in size, bringing severe memory and computational challenges that hinder their deployment. Singular Value Decomposition (SVD)-based compression has emerged as an appealing…

A Generic Network Compression Framework for Sequential Recommender Systems

2020-04-21 · Yang Sun, Fajie Yuan, Min Yang, Guoao Wei 외

Sequential recommender systems (SRS) have become the key technology in capturing user's dynamic interests and generating high-quality recommendations. Current state-of-the-art sequential recommender models are typically …

Recommendation SystemsSequential Recommendation