arXiv AI By Yewon Kim, Apurva Gandhi, David Chung, Graham Neubig, Chris Donahue

Decomposer: Learning to Decompile Symbolic Music to Programs

Read the original on arXiv AI →

arXiv:2607. 01849v1 Announce Type: cross Abstract: Musical performance involves executing a set of high-level musical instructions, yet recovering those instructions from the performance is a challenging inverse problem.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Jun 26

Pianist Transformer: Towards Expressive Piano Performance Rendering via Scalable Self-Supervised Pre-Training

arXiv:2512. 02652v2 Announce Type: replace-cross Abstract: Existing methods for expressive music performance rendering, a conditional generation task that aims to generate a human-like performance from a symbolic score, rely on supervised learning over small labeled datasets, which limits scaling of both data volume and model size, despite the availability of vast unlabeled music, as in vision and language.

By Hong-Jie You, Jie-Jing Shao, Xiao-Wen Yang, Lin-Han Jia, Lan-Zhe Guo, Yu-Feng Li
arXiv Machine Learning
Jul 17

MIDI-RAE-JEPA: Hierarchical Representation Learning and Generation for Symbolic Music

arXiv:2607. 14537v1 Announce Type: cross Abstract: Rich internal representations of musical structure are essential for music understanding tasks such as machine-assisted music co-writing, yet self-supervised approaches for symbolic music representation remain underexplored, particularly those that encode the hierarchical multiscale nature of musical structures.

By Scott H. Hawley
arXiv AI
Aug 20

Whole-Piece Training for Symbolic Music Language Models via Full-Horizon Compressed Recurrence

The paper introduces Whole-Piece Training for Symbolic Music Language Models using Full-Horizon Compressed Recurrence (FHCR), which maintains the full temporal horizon of recurrent memory while compressing its key-value representation to fit GPU limits. An evaluation diagnostic, KV-Reset Context Utilization (KRCU), demonstrates that full-horizon models retain long-range context beyond local windows, whereas limiting recurrent memory weakens this dependence. FHCR thus preserves long-range context utilization while significantly reducing recurrent memory cost, enabling efficient whole-piece modeling.

By Yungang Yi, Weihua Li, Matthew Kuo, Catherine Shi, Quan Bai
arXiv Machine Learning
Aug 31

How Far Should Tokenization Go? Predictive Effectiveness and Relational Losslessness

The paper proposes the Effectiveness–Losslessness Framework to guide tokenization in domains beyond language, using predictive codelength as a criterion. It introduces two boundaries: the Fact–Token Boundary, where observable structure should be encoded into tokens, and the Token–State Boundary, where context‑dependent relations should remain for model state rather than being pre‑tokenized. Experiments on symbolic music show that making musical time explicit and applying tonal‑frame canonicalization improve predictive performance, while fixed pitch coordinates and reversible BPE can increase predictive code length, indicating that carrier compaction alone does not guarantee better predictions.

By Yi Wang