SearcharxivSearch

arXiv · 2509.04899

Encoding of musical structures in hidden units of restricted Boltzmann machines

Abstract

Restricted Boltzmann machines (RBMs) are energy-based models originating from statistical physics, in which hidden units mediate the probability distribution of high-dimensional visible configurations. In this study, we use symbolic music as a structured non-physical dataset and investigate how musical regularities are encoded in the hidden layer of a Bernoulli-Bernoulli RBM. Musical scores by J.~S.~Bach are converted into binary piano-roll representations and used to train the model in an unsupervised manner. We then analyze the visible-layer patterns induced by individual hidden units by activating hidden units separately and computing the corresponding expected visible configurations. The trained RBM reconstructs piano-roll-like inputs and assigns lower energies to piano-roll configurations than to most non-musical binary images, indicating that the learned energy function captures statistical features of the piano-roll dataset. The hidden units mainly encode local temporal and pitch-statistical structures, such as sparse piano-roll-like textures, rather than directly separable musical concepts such as melodies, chords, or keys. We also analyze hidden-layer representations using t-SNE and find that transposed versions of the same musical pieces are not necessarily mapped to nearby regions in the hidden space. This behavior indicates that the trained RBM does not robustly capture transposition equivalence, which is naturally explained by the lack of translational invariance in standard RBM architectures. Samples from the trained RBM show local pitch organization, whereas iterative continuation reveals limited long-range coherence. These results provide a statistical-physics case study of how a simple spin model represents structured creative data and clarify both the usefulness and limitations of standard RBMs as interpretable models of musical structure.

Explore related subjects

Keep this discovery

BibTeXRIS

Mutsumi Kobayashi, Hiroshi Watanabe. 2025-09-05. Encoding of musical structures in hidden units of restricted Boltzmann machines. https://arxiv.org/abs/2509.04899

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