Elastic Time: Dynamic Frame Rate Bottlenecks for Neural Audio Coding
summary
The gist
The gist The Elastic Time method introduces a dynamic frame-rate bottleneck that converts fixed-frame-rate autoencoders into dynamic ones by learning a lightweight latent predictor to decide which
In short
Elastic Time introduces a method to make fixed-frame-rate autoencoders dynamic by learning a lightweight predictor. This predictor determines which latent frames can be skipped during inference, allowing for efficient rate control and frame skipping. The technique uses chunking based on latent predictability to achieve scalable models without external supervision.
Key concepts
- Lightweight Predictor
- This is a small model trained to predict future latent frames using past context. It learns the short-term dynamics of the latent space, enabling the system to anticipate which frames are redundant and can be safely dropped during inference for faster processing.
- Chunk Procedure
- The process of partitioning a long sequence of latents into variable-length segments based on a predictability criterion. The goal is to identify segments where most frames can be approximated by an 'anchor' frame, which are then candidates for removal or skipping.
- Boundary Selection
- Deciding where to split the latent sequence into these variable-length chunks. Two methods are used: a fast greedy procedure and an exact dynamic program (DP) that calculates a cost function based on predicted reconstruction error to find the optimal split points.
Terminology used across episodes
This episode discusses
- Elastic Time: Dynamic Frame Rate Bottlenecks for Neural Audio Coding · Paper Radio
- SpectroStream: A Versatile Neural Codec for General Audio
- Moshi: a speech-text foundation model for real-time dialogue
- SoundStorm: Efficient Parallel Audio Generation
- Back to Ear: Perceptually Driven High Fidelity Music Reconstruction
- SALAD-VAE: Semantic Audio Compression with Language-Audio Distillation
- Beyond Fixed Frames: Dynamic Character-Aligned Speech Tokenization
- Dynamic Chunking for End-to-End Hierarchical Sequence Modeling
- GLU Variants Improve Transformer
- Moisesdb: A dataset for source separation beyond 4-stems
- Muon is Scalable for LLM Training
The paper
Elastic Time: Dynamic Frame Rate Bottlenecks for Neural Audio Coding · Read on arXiv
University of Illinois Urbana-Champaign · Massachusetts Institute of Technology
Neural audio autoencoders have become a core component of compression, feature extraction, and generation. However, while existing systems support variable bitrate, the vast majority of models still operate at a fixed latent frame-rate, allocating equal temporal budget to regions with very different information density, which can result in unnecessarily long sequences. We introduce Elastic Time, a dynamic frame-rate bottleneck that converts fixed-frame-rate autoencoders to dynamic ones. Our method learns a lightweight latent predictor used to decide which frames can be skipped and later reconstructed, enabling efficient greedy boundary selection at inference. Experiments show our method enables deployment-time rate control while improving efficiency-quality tradeoffs relative to baselines. Overall, we provide a flexible mechanism for adjusting temporal resolution in audio autoencoders, potentially facilitating more efficient downstream modeling for generation and long-context tasks.
DOI: 10.21437/Interspeech.2026-3031
Transcript
Introduction to the show: ident: AI Radio. Generated commentary on the latest Artificial Intelligence papers.
Tom: Today's paper: "Elastic Time: Dynamic Frame Rate Bottlenecks for Neural Audio Coding".
Jane: The gist The Elastic Time method introduces a dynamic frame-rate bottleneck that converts fixed-frame-rate autoencoders into dynamic ones by learning a lightweight latent predictor to decide which frames can be…
Tom: First, who's behind it and why it matters.
Paper summary: Tom: So, to summarize Elastic Time: Dynamic Frame Rate Bottlenecks for Neural Audio Coding, they claim that existing neural audio autoencoders often use a fixed latent frame rate which means they allocate equal temporal budget across parts of the audio that have very different information density.
Jane: And this usually results in unnecessarily long sequences when you need high fidelity but only need a certain level of detail in specific sections.
Lu: The authors introduce Elastic Time as a dynamic frame-rate bottleneck that converts those fixed-frame-rate autoencoders into dynamic ones by learning a lightweight latent predictor to decide which frames can be skipped and later reconstructed.
Meng: So they are adding this predictor to the existing structure without having to modify the number of latent dimensions, which is smart because it keeps the underlying model structure intact.
Lalam: The goal is enabling efficient greedy boundary selection at inference time, allowing for a per-sample target kept length N, which corresponds to a kept fraction rho equal to N divided by T.
Tom: It really matters because this method enables deployment-time rate control while improving the efficiency-quality tradeoffs relative to baselines.
Conclusion: Jane: Looking at the title, Elastic Time suggests a system that can adjust its temporal resolution based on content, which is really about making models adaptive to the input itself.
Tom: And the authors are Dimitrios Bralios and Paris Smaragdis and Minje Kim from Illinois Urbana-Champaign and MIT; they've shown how this dynamic frame-rate approach works by using a learned latent predictor.
Lu: What this means for us is that we can potentially deploy these audio models much more efficiently because the computational load scales with the actual information present in the audio, not just a fixed number of frames.
Meng: Practically, it means less time on inference for users who don't need every single frame at maximum resolution and better fidelity where it matters most.
Lalam: This research gives us a flexible mechanism for adjusting temporal resolution in audio processing without needing external semantic supervision to dictate the changes.
More episodes
- 2610.15391-DC-Flow: Target-Conditioned Cyclic Peptide Design via Delayed-Coupling Flow Matching
- 2610.15379-LiveAnon: Improving Privacy and Utility in Streaming Speaker Anonymization with Codec Language Models
- 2610.15097-Anchors Enhance Controllability and Reasoning of Diffusion Language Models
- 2610.15398-GA-SVD: Generation-aware Singular Value Decomposition for LLM Compression
- 2610.15106-RELAGRAM: Recursive Latent Graph Model for the Capacitated Vehicle Routing Problem
- 2610.15159-Beyond Adjacent Layers: Graph-Guided Layer Fusion for Compressing Large Language Models
- 2610.15185-DeltaNet-PC: Test-Time Memory Without Backpropagation Through Time
- 2610.15246-ObsSpec: Accelerating Agentic Reinforcement Learning with Observation Speculation
- 2610.15388-Approximation in Contrastive Representation Learning
- 2610.15427-Riemannian Graph Tokenizer for Structural Knowledge Transfer