Papers for

audio software engineers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Small transformer improves music key detection in local apps

Deployment-constrained key estimation with a DSP-guided transformer reranker

Abstract: Local music applications estimate key during library import and benefit from an analyzer that is small, fast, and runs in-process. We start from a compact chroma-template key analyzer that fits this budget but lags behind learned references. Learned systems reach higher accuracy, but their installed model and runtime dependencies can occupy tens to hundreds of megabytes. We present key lime, a 21.5k-parameter DSP-guided transformer reranker with a 115 KB model artifact and a 76.7 MB installed footprint, including the extracted ONNX Runtime. It adds 0.32 ms per track to deterministic DSP scoring. Trained from labels on 4,040 FMAK tracks, with 449 tracks for validation and 1,000 disjoint FMAKv2 tracks held out for evaluation, it improves MIREX from 61.08 to 73.55 +/- 0.46 and exact accuracy from 52.30 to 67.07 +/- 0.65 over three seeds (mean +/- population SD). It approaches a same-manifest local madmom KeyCNN reference at 74.16 MIREX. A 12-parameter circular input stage matches the accuracy range of a 468-parameter linear input projection.

Mon 2 NovSoundMachine Learning
The gist
Figuring out the key of a song is important for music apps that organize your library. The authors improved a small, fast system that runs directly on your device to identify a song's key better than earlier simple methods. They combined a basic signal processing approach with a tiny transformer model to enhance accuracy while keeping the system lightweight and fast. This approach works well on diverse music tracks and comes close to larger, more complex methods.
Open → 2611.02408v1

Large audio language models show model-specific sound hallucination patterns

Does Location Matter? A Black-Box Causal Audit Reveals Model-Dependent Audio Grounding in LALM Hallucination

Abstract: Large audio-language models (LALMs) frequently exhibit object hallucination, affirming absent sounds. The dominant mitigation, Audio-Aware Decoding (AAD), contrasts logits under real audio against an all-zero "blank" waveform, flagged by prior review as out-of-distribution. We introduce a black-box causal test that isolates the claimed evidence itself: localize a claim's evidence region via CLAP similarity, remove it by spectral gating, and compare against a random-window control across a 2x2x2 grid on three LALMs. On Qwen2-Audio-7B, localized ablation's raw AUROC trails blank's (0.613 vs. 0.721); this is a duration confound, not a localization failure, since blank removes the entire clip versus the grid's 2-4 s. Holding duration fixed, localization beats random removal at every cell on both models. Raw detection value remains model-dependent, especially on Audio Flamingo 3. The same evidence corrects decoding: contrastive decoding combining blank and language-prior contrasts, gated and ensembled, raises Qwen2-Audio accuracy from 57.1% to 71.9%, beating AAD alone. A unified causal-grounding profile does not transfer between models, indicating different grounding regimes. The source code and a detailed report of our findings, including identified limitations, are available at https://github.com/khalooei/causa.

Fri 9 OctArtificial IntelligenceMachine LearningSound
The gist
Some advanced audio-language computer models sometimes imagine sounds that aren’t really there, called hallucinations. The authors tested a new way to find out if these imagined sounds come from specific parts of the audio or just random places. They found that the location in the audio does matter, but it depends on the model. Their method also improved the model’s accuracy better than previous tricks. This helps understand and reduce errors when machines listen and talk about sounds.
Open → 2610.13112v1

Tracing key components controlling emotion in AI speech synthesis

Tracing a Sparse Emotion-Control Circuit in LLM-Based Text-to-Speech

Abstract: LLM-based text-to-speech (TTS) models can generate emotionally expressive speech, but how reference emotion is routed through the model and realized in decoded speech remains unclear. We introduce two emotion-sensitive metrics for matched neutral and emotional syntheses---a codec trajectory score and a late residual direction score---and use them to score activation-patching interventions. Under controlled matched-reference conditions, this analysis identifies a sparse source-to-readout component-level circuit: 23--27 attention heads and MLPs per emotion, roughly 5% of the components considered, recover or suppress 74--88% of the late emotion-readout shift on held-out cases. The circuit combines a shared component backbone with emotion-specific components; cross-emotion activation swaps reduce the target readout in 47 of 48 cases. In decoded speech, the same intervention produces consistent changes in pitch, energy, and spectral brightness over 24 matched pairs per emotion. A readout-matched residual-direction baseline produces only 17--27% of the intervention's pitch effect, showing that internal readout movement alone does not explain the decoded acoustic changes. These results trace a compact causal route from reference-derived prefix information to emotion-relevant properties of generated speech.

Sun 4 OctSoundArtificial Intelligence
The gist
Text-to-speech models can add emotions to computer-generated speech, but it's unclear how these emotions work inside the models. The authors developed new ways to measure emotion signals and tested which parts of the model control emotional expression. They found a small set of components responsible for creating emotional changes in speech and showed these cause real acoustic differences like pitch and tone. This helps us understand how emotions are turned into voice in AI systems.
Open → 2610.05080v1

Audio language models improved by reducing hallucinations through preference learning

Hallucination Reduction for LLM-Based Audio Understanding via Multimodal Direct Preference Optimization

Abstract: Large Audio Language Models (LALMs) are prone to hallucinating and over-relying on text priors when simultaneously presented with audio and text inputs. To mitigate these hallucinations, we propose utilizing the multimodal Direct Preference Optimization (mDPO) objective, which forces the model to ground its generation in the acoustic input by contrasting intact and distorted audio counterparts. We extend this preference learning framework to the audio domain by applying a variety of acoustic perturbations. Evaluating the Qwen2-Audio backbone across the DCASE 2025 Challenge and AH Existence datasets, we demonstrate that extending mDPO to LALMs significantly enhances temporal reasoning in the complex DCASE dataset, and improves performance on basic existence verification in the AH benchmark. We identify temporal reversal, frequency masking, and random noise as the most effective perturbations. Ultimately, our approach achieves an absolute accuracy improvement of 14.0% on the DCASE 2025 dataset and 27.4% on AH Existence.

Fri 2 OctSound
The gist
Large models that understand sound and text together sometimes imagine things that aren't there, especially when mixing audio with written words. The authors found a way to train these models better by making them compare normal sounds with altered versions, so they focus more on the actual audio. This method helped improve the model's ability to understand when sounds happen and whether certain sounds exist in a clip. They showed this improvement on two different audio analysis tasks with big accuracy gains.
Open → 2610.04004v1

Correlation loss improves merging speech and music encoders

Correlation-Based Distillation Yields More Mergeable Speech-Music Encoders

Abstract: A single compact encoder for both speech and music removes the need to maintain a separate model per domain. A practical recipe distils a speech teacher and a music teacher into two small students, then merges them into one model. Two merging algorithms exist: interpolating the student weights from a shared initialisation, or permuting their channels into alignment before averaging. Prior work fixed the distillation loss in both, leaving open whether the loss itself affects how well the students merge. We show that it does. Holding architecture and evaluation fixed, we replace the DistilHuBERT loss \Lkd{} with a correlation-based loss \Lcl{}. Under weight interpolation, \Lcl{} students stay closer to their own better endpoint in $17$ of $18$ comparisons and lead on the speech tasks at every interpolated weight. Under activation permutation, they need fewer channels rearranged at three layers, their matched channels correlate more strongly, and they again lead on speech. The two merging algorithms share no mechanism, yet both improve under the same loss substitution. This suggests that the gain lies in the representation \Lcl{} produces rather than in either algorithm.

Fri 2 OctSound
The gist
Combining separate models for speech and music into one makes it simpler to handle both kinds of audio. The researchers found a better way to teach these small models so that when combined, they work more smoothly together. They showed that changing the way the model learns — using a correlation-based loss instead of the previous loss — helps the merged model perform better on speech tasks and makes the merging process easier. This improvement works for two different merging techniques, suggesting the key is in how the model represents sounds.
Open → 2610.02836v1

Large audio language models struggle to combine capabilities accurately

When Capabilities Fail to Compose: Diagnosing the Compositionality Gap in Large Audio-Language Models

Abstract: Large audio-language models (LALMs) perform strongly on individual audio tasks, but whether these capabilities can be reliably composed remains underexplored. We conduct a controlled diagnostic study of capability composition in LALMs, requiring models to integrate audio-attribute recognition, cue-conditioned segment selection, and downstream ASR or question answering. We construct two-utterance inputs with distinct acoustic cues to evaluate composition across environmental sound, gender, and emotion cues, with ASR, Math QA, and Factual QA as downstream tasks. Across four open-source LALMs, compositional QA accuracy decreases in 39 of 40 model-task-cue settings, by an average of 26.7 percentage points. ASR exhibits a similarly consistent degradation, with WER increasing in 39 of 40 settings by an average of 28.5 percentage points, while the magnitude of degradation varies across models, cue types, and cue salience. We further probe these failures through output format, positional preference, and chain-of-thought (CoT) analyses. Our study reveals a systematic gap between possessing individual audio capabilities and reliably composing them.

Tue 29 SeptSound
The gist
Large audio-language models can do separate tasks well, like recognizing sounds or answering questions from audio. However, this study found that when the models try to combine these tasks—for example, recognizing sound attributes while answering questions—their performance drops significantly. The authors tested this with different types of sounds and questions and found consistent errors. This shows that current models still have trouble juggling multiple audio understanding skills at once.
Open → 2609.36921v1

Pretrained speech models enable flexible emotion editing without new training

SEmoEdit: Probing and Harnessing the Editability of Pre-trained Speech Flows

Abstract: Existing training-based speech emotion editing methods often require substantial task-specific training and can be unstable. This motivates us to investigate whether the pretrained generative dynamics of large-scale text-to-speech (TTS) models can be directly manipulated for training-free emotion editing. To answer this question, we probe the editability of pretrained flow-matching and hybrid TTS models by constructing a controlled test set and systematically diagnosing editing effects along the generative trajectory. Our analysis reveals that pretrained TTS models are substantially editable in emotion, but such editability is architecture- and trajectory-dependent and can be disrupted by early flow-matching steps, while cross-speaker emotion transport carries additional acoustic attributes beyond emotion. To address these limitations, we propose SEmoEdit, the first training-free framework that formulates emotion editing as dynamic velocity transport between source and target emotions, enabling robust, flow-based speech emotion editing directly within pretrained TTS models. SEmoEdit unifies three core operations: emotion replacement, emotion erasure, and continuous emotion interpolation, requiring neither parameter updates nor task-specific optimization. To systematically evaluate these capabilities, we introduce SEmoEditBench, a dataset comprising 600 editing cases, and conduct extensive experiments across state-of-the-art (SOTA) models and backbones. Our results show that SEmoEdit is highly effective and broadly applicable, outperforming existing training-based and activation-steering methods. Ultimately, this work reveals that pretrained speech flows possess rich, latent emotion-editing capabilities, providing useful guidance for real applications. Code, benchmark, and Audio samples are available at https://github.com/imxtx/SEmoEdit.

Mon 28 SeptSoundArtificial Intelligence
The gist
Editing the emotions in recorded speech usually requires lots of specialized training, which can be unstable. The authors explore whether large pre-trained text-to-speech models can be adjusted directly to change emotions without extra training. They find these models can indeed be changed to edit emotions but depend on the model type and editing steps to avoid unwanted effects. To make this practical, they created SEmoEdit, a method that edits speech emotions smoothly using the model's own internal flow, without retraining. They also built a benchmark dataset to test this approach and showed it outperforms other methods.
Open → 2609.34648v1

Language models gain audio skills without retraining their brain

Symbiotic Architecture for Post-Hoc Audio Extension of Frozen Language Models

Abstract: This paper proposes an architecture for equipping large language models (LLMs) with audio-understanding capabilities without fine-tuning their weights. The proposed symbiotic architecture employs an injector module that writes audio-conditioned vectors directly into the target LLM's short-term memory, i.e., the key-value (KV) cache, enabling the LLM to behave as an audio language model (ALM). The architectural advantages are twofold. First, it improves the scalability of ALMs: because the proposed method bypasses the LLM during audio injection, the injection cost is governed by the injector width rather than the backbone width, and can therefore scale more slowly than the cost of full-backbone prefilling. Second, since the training scheme does not update the LLM weights, the original capabilities of the LLM are preserved without the risk of degradation from fine-tuning. The effectiveness of the proposed method is evaluated on both audio-understanding tasks (automatic speech recognition, audio question answering, and acoustic scene classification) and text-only tasks. We confirm that, while activating fewer parameters during audio prefilling, our architecture outperforms the conventional method with a frozen LLM and approaches the performance of a fine-tuned ALM, all while preserving the backbone LLM's original text-only task performance by construction.

Fri 25 SeptSoundComputation and Language
The gist
Large language models can understand text very well but need extra training to handle sounds like speech or environmental noise. This paper shows how an added module can feed audio information into the model's short-term memory without changing the main model itself. This keeps the original text abilities intact while enabling new audio tasks like speech recognition and sound classification. The authors demonstrate that their approach performs nearly as well as retraining the whole model but is more efficient and avoids messing up the original skills.
Open → 2609.30784v1

Frozen audio watermarkers boosted with learned decoders for better message recovery

No Time to Collapse: Unlocking Robustness and Multiplexed Capacity in Frozen Audio Watermarkers

Abstract: Modern neural audio watermarking systems typically embed a message repeatedly across time and then collapse the resulting temporal evidence into a single payload using averaging, voting, or another fixed aggregation rule. We argue that this temporal collapse limits both robustness and the recovery of multiple payloads, and that the limitation can be addressed without retraining the underlying watermarker. We freeze a pretrained watermarker's encoder and detector and train only a low-latency Conformer-based decoder. The decoder consumes the detector's temporal soft outputs, which a system-specific adapter pools into a sequence of window-level representations, and predicts the embedded message. On three frozen watermarkers (AURA, AudioSeal, and WavMark), the learned decoder improves recovery of attacked messages and yields higher detection AUROC point estimates on all three. Under controlled full- and partial-coverage multiplexing, it improves joint-exact recovery of two alternating payload words by 9.7-48.0, 6.9-17.3, and 8.2-14.2 percentage points, respectively, under one to three chained attacks on feasible clips.

Thu 24 SeptSound
The gist
Watermarking audio means hiding secret messages inside sounds so they can be detected later. Usually, these systems repeat messages over time and then combine all the clues into one final message, which can weaken the ability to recover the message accurately. The authors show that by keeping the original watermark system fixed and training a new small part to better interpret all the clues together, they can recover hidden messages more reliably and even get multiple messages back from the same audio. This improves performance on tests with attacks that distort the audio.
Open → 2609.29737v1

Bowed-string model improves control of violin bow force and motion

Learned Bow Control on a Measured Bowed-String Model: a Revised Minimum-Bow-Force Law, a Recurrent Controller, and the Domain of a Supervision Ceiling

Abstract: A finite-difference bowed-string model with implicitly resolved Stribeck friction is presented, with a regime diagnostic, the Schelleng bow-force limits on four strings, and a comparison of learned bow controllers. Implicit resolution is necessary, and quantitatively so: a lagged contact force cannot capture the string on a discrete grid, so no stick phase forms at any bow force. With friction, impedance and quality factor taken from published measurement rather than fitted, all four strings return a stick fraction of 89.1% against an ideal 90%. Schelleng's maximum bow force is recovered on every string. The minimum is not: it follows $Z v_b β^{-1}$ rather than the predicted $Z^2 v_b β^{-2}$, reducing both squared dependences to first powers. Six controllers at matched capacity, over four strings and twenty seeds each, place a gated recurrent network ahead of a feedforward one, by most under a mid-stroke disturbance. The feedforward network completes more strokes only from a start the model's own playability map places outside the Helmholtz region. A minimal gated variant fails because gates computed from the input alone cannot clear a latched state. Training loss selects neither the capacity nor the context length, and no learned controller improves on the lookup rule that generated its labels. That bound has a domain. Regressing the controller's score on the rule's gives a slope of 0.32, more than ten standard errors below unity, so the controller overtakes the rule where the rule fails and is bounded by it where it holds. Under a rigid finger stop the plant is provably invariant, so transfer loss between pitches belongs to the controller alone and is traced to one feature. A regime classifier without a stick test labels small-amplitude periodic slipping as Helmholtz motion, and a harmonicity measure rates a string the bow never grips above Helmholtz motion.

Mon 14 SeptMachine LearningSound
The gist
Playing a violin well depends on how the bow interacts with the string. The authors created a computer model that more accurately simulates this interaction, especially the friction and the forces needed to keep the bow ‘stuck’ to the string while playing. They also trained neural network controllers to manage bowing, finding some could react better in certain conditions than traditional rules. Their approach helps understand the limits of bow control, which could assist makers of digital musical instruments or music technology. The paper includes tests on different strings and explains why some traditional assumptions about bow force may be wrong.
Open → 2609.14990v1