SearcharxivSearch

arXiv · 2509.21714

MusicWeaver: Programmable Long-Form Music Generation with Provably Local Editing

Abstract

Music generation systems produce increasingly realistic audio, yet they expose no interface between a creator's structural intent and the rendered sound. Form can only be steered through prompts, while local revisions require regenerating entire pieces. We recast music creation as program-guided generation, using an explicit, human-interpretable program layer between intent and audio. We present MusicWeaver, which decomposes generation into planning and rendering. The planning stage predicts a structured plan, a multi-level song program encoding musical form, motif recurrence, and bar-level attributes. The rendering stage synthesizes audio conditioned on this plan. We formalize editing as an algebra of typed plan operations, including section replacement, insertion, deletion, motif retagging, and attribute changes, and prove that they preserve plan validity. To realize edits, we propose Projected Diffusion Inpainting, which guarantees that audio outside the edited span is preserved exactly across repeated revisions. For rendering, we design a Global-Local Diffusion Transformer with Motif Memory Retrieval that executes minute-scale plans and produces section returns that are consistent yet varied. Our framework also supports plan induction, recovering an editable program from an existing recording, and a natural-language editor that compiles free-form instructions into validated operation sequences. We introduce plan-faithfulness and edit-fidelity measures and validate them against human judgments. Experiments on generation conditioned on text, video, and their combination show state-of-the-art structural coherence and editability, while edit quality remains stable over sequential revisions where prior methods degrade.

Explore related subjects

Keep this discovery

BibTeXRIS

Xuanchen Wang, Heng Wang, Weidong Cai. 2025-09-26. MusicWeaver: Programmable Long-Form Music Generation with Provably Local Editing. https://arxiv.org/abs/2509.21714

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Xiaomi-CocktailASR-1 Technical Report

Recently, large language model (LLM) based ASR models have achieved significant progress, yet they generally lack support for multi-speaker scenarios, where the cocktail party problem remains a critical bottleneck for further advancing ASR. Existing TS-ASR methods, including end-to-end architectures with speaker embeddings and latest LLM-based explorations suffer from degraded single-speaker performance and the inability to reject when the target speaker is absent. In this paper, we propose Xiaomi-CocktailASR-1, an LLM-based end-to-end TS-ASR architecture. By utilizing reference speech as voiceprint prompts, it directly transcribes the target speaker's speech without requiring speech separation. Xiaomi-CocktailASR-1 maintains competitive performance in single-speaker scenarios, comparable to mainstream ASR models. It also features a negative sample rejection capability, outputting empty text when the target speaker is absent from the mixed speech. Additionally, Xiaomi-CocktailASR-1 supports a Chain-of-Thought (CoT) reasoning mode to provide explicit reasoning steps. Extensive experiments on various synthetic and real-world multispeaker benchmarks demonstrate that Xiaomi-CocktailASR-1 achieves state-of-the-art performance, effectively addressing the cocktail party problem through a unified architecture that balances multispeaker and single-speaker recognition accuracy, along with rejection capability.

cs.SD

EConv-TasNet: Efficient Conv-TasNet for Effective Speech Separation

Conv-TasNet has served as a strong baseline for time-domain speech separation, and many studies have extended it with advanced architectures such as dual-path networks, U-Nets, and attention mechanisms. However, these methods often introduce high computational cost and complexity, limiting their deployment in resource-constrained scenarios. To address this issue, we propose eConv-TasNet, an efficient variant of Conv-TasNet that improves both effectiveness and efficiency without relying on resource-intensive modules. The proposed model consists of a group-wise early-splitting (GES) module and a multi-group feature aggregation (MGFA) module. GES generates discriminative speaker embeddings at intermediate stages, while MGFA progressively aggregates these group-level representations for refined mask estimation. Experimental results show that eConv-TasNet reduces model size by 22.4%, accelerates inference by 18.9%, and improves SI-SNRi by 14.0%-28.0% across three public benchmarks. Moreover, it achieves competitive performance compared with state-of-the-art methods while requiring significantly fewer parameters and lower inference cost. These results demonstrate a favorable efficiency-effectiveness trade-off for edge deployment.

cs.SD