Museformer: Transformer with Fine- and Coarse-Grained Attention for Music Generation
Abstract
Symbolic music generation aims to generate music scores automatically.
A recent trend is to use Transformer or its variants in music generation, which is, however, suboptimal, because the full attention cannot efficiently model the typically long music sequences (e.g., over 10 , 000 tokens), and the existing models fall short in generating music repetition structures.
In this paper, we propose Museformer, a
Transformer with a novel fine- and coarse-grained attention for music generation.
Specifically, with the fine-grained attention, a token of a specific bar directly attends to all the tokens of the bars that are most relevant to music structures (e.g., the previous 1st, 2nd, 4th and 8th bars, selected via similarity statistics); with the coarse-grained attention, a token only attends to the summarization of the other bars rather than each token of them so as to reduce the computational cost.
The advantages are two-fold.
First, it can capture both music structure-related correlations via the fine-grained attention, and other contextual information via the coarse-grained attention.
Second, it is efficient and can model over 3 × longer music sequences compared to its full-attention counterpart.
Both objective and subjective experimental results demonstrate its ability to generate long music sequences with high quality and better structures.
Introduction
Symbolic music generation aims at generating music scores automatically and has drawn more and more attention in recent years [1–3].
Since music can be represented in organized sequences of discrete tokens just like text, Transformer-based models, which have been demonstrated to work well on text generation [4, 5], are increasingly applied in music generation [3, 6–11] and have made great success.
While the self-attention mechanism empowers Transformer to capture the complex correlations in music, there are two ubiquitous challenges to solve for this task: 1) Long sequence modeling .
Music sequences are typically very long, especially for multi-instrument polyphonic music where the lengths can usually exceed 10 , 000 .
The quadratic complexity of full attention limits its scalability to that length.
2) Music structure modeling .
Music has its unique structures, where a piece can usually repeat some patterns of a previous piece, occasionally with some variations, after either a short or a long distance (see Figure 1 for an example).
Successfully generating reasonable structures would make the music more realistic just like human-made music.
[Figure]
Pno.
Piano
Synth.
[Equation]
[Figure]
[Equation]
[Figure]
   
[Figure]
 
Although many Transformer variants in natural language processing (NLP) [12] have been proposed to handle long sequences (the first challenge), they cannot well model the music structures (the second challenge).
According to the basic principles of these models, we can classify them into two types.
The first type is called local focusing .
Models of this type, e.g., Transformer-XL [13] and Longformer [14], mainly focus on part of the input sequence, and drop the rest tokens to reduce the cost.
However, the parts that they focus on cannot contain many of the essential ranges important to music structures, and directly dropping the rest tokens may lead to losing some important information.
The second type is called global approximation .
Models of this type such as Linear Transformer [15] utilize linearized attention or sequence compression over the whole input sequence to approximate the token pair-wise attention.
While the approximation effectively reduces the complexity, they cannot precisely capture the correlations between related parts and accordingly fall short in generating repetition structures.
We will review more existing long-sequence Transformers in §2.
Directly applying these models to music generation is suboptimal, and it is desirable to design an efficient model that can well model long music sequences as well as their structures.
In this paper, we propose to unify the above two types of models, which can well fit the characteristics of music.
Our motivation is based on the observation that the importance is not uniformly distributed over the music sequence, and thus we do not need to treat all the tokens equally.
Intuitively, to generate music with repetition structures, the most important information the model should directly refer to when generating a music bar, lies in those bars that tend to be repeated in the current bar.
We call these bars structure-related bars .
For the other bars that are less important, approximation should do the trick.
To this end, the proposed fine- and coarse-grained attention takes two different schemes towards different bars: with the fine-grained attention, tokens of the structure-related bars are directly attended to, to well learn the structure-related correlations; with the coarse-grained attention, information of the other bars are captured via summarization [16], rather than attending to each token of them, to decrease the computation and space complexity, and meanwhile retain the necessary information of these bars.
The structure-related bars are selected according to the statistics on human-made music.
They are not necessarily the most recent and consecutive bars but can include distant ones, to cater to long-term structures in music.
Our main contributions in this paper are summarized as follows:
• We propose Museformer, a Transformer model with a novel fine- and coarse-grained attention for music generation.
It captures the correlations of structure-related bars via fine-grained attention for learning the music structures, as well as the necessary and concentrated information of the other bars through their summarization via coarse-grained attention.
• We propose to select the structure-related bars based on similarity statistics on human-made music, which can help decrease the perplexity and generate music that exhibits better structures.
• The computation complexity and space complexity are reduced greatly to nearly linear in practice, which enables Museformer to scale up to long music sequences.
• Experimental results show that Museformer can generate music of full-song length with high quality
and better structures.
Related Work 2.1 Symbolic Music Generation
Symbolic music generation aims to exploit machines to compose music scores automatically.
It has been attracting more and more people to work on it, and the solutions continuously evolve from rule-based models [1] to probabilistic models [17, 18, 2] to deep learning models [6–11].
In recent years, the Transformer-based models have achieved great success in many text generation tasks [4, 5], thus have also been increasingly applied in the similar music generation tasks.
Huang et al.
[3] apply Transformer in symbolic music generation for the first time and show that it can achieve better performance compared to previous deep learning models such as recurrent neural networks.
While Transformer shows promising results in music generation, the quadratic complexity of the attention mechanism limits its applications on the typically long music sequences.
To resolve this problem, researchers on symbolic music generation come up with different solutions.
One popular solution is to design a new representation method to represent musical information in fewer tokens, such as compound word [19] and OctupleMIDI [20].
While this solution indeed decreases the lengths of music sequences to a certain extent, full-song music sequences are still too long for Transformer to handle.
Another solution is to use a long-sequence Transformer variant as the backbone.
For example,
Huang and Yang [21] use Transformer-XL [13], and Hsiao et al.
[19] use Linear Transformer [15].
Although these models can process long sequences, they are initially designed for NLP tasks and cannot well model the music structures.
We will introduce and discuss more about the long-sequence
Transformers in the following section.
2.2 Long-Sequence Transformers
Many Transformer variants have been proposed to tackle long-sequence tasks [12], which in general can be categorized into the following types.
1) Recurrent Transformer, which encodes sequences chunk by chunk [13, 22, 23]. 2)
Sparse attention, which sparsifies the attention layout with either predefined patterns [14, 24, 25, 16, 26], or with content-based patterns [27–31]. 3)
Linearized attention, which replaces the exponent of the inner product of features with the multiplication of feature maps [15, 32–34].
4) Compression-based attention, which reduces the number of queries or key-value pairs by compressing the contextual representations [35–37].
In addition, some models also try to combine multiple techniques, such as Compressive Transformer [22] that combines recurrent and compression-based methods, Poolingformer [36] and Transformer-LS [38] that combine sparse attention and compression-based methods.
Existing works on music generation directly adopt some of those long-sequence Transformers to process long music sequences, but it is suboptimal due to the unique structures of music.
In general, music has many repeating or similar pieces, many of which are distant from each other, and the distance is measured by time units such as bar or beat instead of the number of tokens.
Therefore, the receptive fields of the existing recurrent Transformers or sparse attention methods cannot cover the many ranges of structure-related content.
Although the linearized or compression-based attention can cover the whole sequence, they do not precisely capture the correlation between each pair of tokens and may fall short in generating repeating or similar music pieces.
Museformer
In order to well model long music sequences as well as their music structures, we propose Museformer.
The general idea is that we do not need to focus on the whole sequence with the same importance level given that the complexity of pair-wise full attention is unacceptably high, but instead we combine two different attention schemes – fine-grained attention for the structure-related bars, and coarse-grained attention for the other bars.
Museformer basically follows the original Transformer architecture [39], and a novel fine- and coarse-grained attention (FC-Attention) is designed to replace the original self-attention module to tackle the challenges in long music sequence modeling.
Museformer takes a music token sequence X
= X 1 , . .
, X b as input, where b denotes the number of music bars, and the i -th bar X i = x i, 1 , . . .
, x i, | X i | contains | X i | tokens.
For the i -th bar where i = 1 , . .
, b , we insert a summary token
s i after it to facilitate local information aggregation in
FC-Attention.
The summary token sequence is denoted by S
= s 1 , . . .
, s b .
After the insertion, the
1 s 1 s 2 s 2 s 3 s 3 s …… …… …… 1 , 1 x 1 , 1 x 1 , 2 x 1 , 2 x 1 , 3 x 1 , 3 x 1,1 x
1,1 x 1,2 x 1,2 x 1,3 x 1,3 x 2 , 1 x 2 , 1 x 2,1 x 2,1 x 2,2 x 2,2 x 3,1 x 3,1 x 3,2 x 3,2 x 3 , 2 x 3 , 2 x 3 , 1 x 3 , 1 x 1 s 1 s 1 s 1 s
s 2 s 3 s
[Figure]
s
[Figure]
s
[Figure]
s 2 ,
[Figure]
x 2 ,
[Figure]
x
[Figure]
s
[Figure] [Figure]
𝑠
[Figure]
𝑠
[Figure]
[Figure]
overall token sequence becomes X 1 , s 1 · · · , X b , s b .
The embedding layer embeds the overall token sequence into a vector space, and concatenates bar embeddings and beat embeddings as the positional information [10], followed by a linear projection.
The Museformer layers then model the contextual representation, and the hidden state output by the last layer is fed into a softmax classifier to predict the next token.
In the following part, we first give a brief formulation to the attention mechanism (§3.1).
Then, we introduce the details of FC-Attention (§3.2), followed by the selection of the structure-related bars (§3.3).
Finally, we discuss the merits of Museformer (§3.4).
3.1 Preliminary: Attention
The attention mechanism [39] is the basis of FC-Attention.
It receives two sequential inputs, namely source X ∈ R n src × d and target X ′ ∈ R n tgt × d , where n src and n tgt are the sequence lengths of source and target respectively, d is the embedding dimension.
It computes contextual representation for each x ′
i ∈ R 1 × d in target X ′
as
[Equation]
where W Q , W K , W V ∈ R
d × d are the trainable parameters.
In practice, we employ the multi-head version of attention, but omit it from the equation for simplicity.
3.2 Fine- and Coarse-Grained Attention
The basic idea of FC-Attention is that, instead of directly attending to all the tokens which causes the quadratic complexity, a token of a specific bar only directly attends to the structure-related bars that are essential for generating structured music (fine-grained attention), and for the other bars, the token only attends to their summary tokens to obtain concentrated information (coarse-grained attention).
To achieve this, we first summarize the local information of each bar through the summarization step, and then aggregate the fine-grained and coarse-grained information through the aggregation step.
Figure 2 visualizes the process.
Summarization In the summarization step, we aggregate the information of each bar into the corresponding summary token.
For the i -th bar, given the representation of summary token s i ∈ R 1 × d , and that of the music tokens X i =
[ x i, 1 , . . .
, x i, | X i | ] ∈ R | X i |× d , the summarization of this bar is
[Equation]
(2) where Attn ( · ) is defined in Equation 1, [ · ] is the concatenation operation.
In this step, each summary token attends to music tokens of its corresponding bar as well as the summary token itself.
[Figure]
[Figure]
Aggregation In the aggregation step, we aggregate the information of the tokens belonging to the structure-related bars or within the current bar, as well as the summarization of the other bars, so as to update the contextual representations of music tokens.
The updated representation for x i,j is
[Equation]
(3) where R ( i ) is the set of the indices of the structure-related bars with respect to the i -th bar, and ¯ R ( i ) is the set of the indices of other previous bars.
X R ( i ) is the matrix formed by stacking { X i | i ∈
R
( i ) } .
Similarly, ˜ S ¯ R ( i ) is the matrix formed by stacking { ˜ s i | i ∈
¯ R ( i ) } .
X i,k ≤ j is the matrix formed by stacking { x i,k
| x i,k ∈ X i , k ≤ j } .
In other words, the music token x i,j only attends to those music tokens that belong to the structure-related bars, and its previous tokens within the current bar.
For the other bars, it only attends to their summary tokens.
3.3 Structure-Related Bar Selection
Considering that the structure-related bars are expected to contain those bars that are most likely to be repeated by the current bar to be generated, we propose to pinpoint them by similarity statistics, and the bars with high similarities should be selected.
Specifically, for each song in the training set, we calculate the similarity between each pair of the bars, which is defined as
[Equation]
where N ( i ) is the set of music notes within the i -th bar, and two notes are considered equal when their pitches, duration, and onset positions within their bars are all the same.
The value of l i,j ranges from 0 .
to 1 .
If two bars are exactly the same, this value equals 1 . 0 .
We then calculate the average similarity of those bar pairs whose intervals are t over the training set D , which is formulated as
[Equation]
In this paper, we call the distribution of the similarity with respect to the bar intervals the similarity distribution, and show that of the training data in Figure 3.
As we can see, it shows an obvious periodical pattern – a music bar tends to be more similar to its previous 2 bars, and also to the previous 4 -th bar or its multipliers in most cases.
We further conduct the similarity statistics on different datasets involving music of various genres and styles.
The results shown in Appendix A interestingly indicate that this pattern is universally applicable to the music of the great diversity.
We believe that it can be regarded as a general rule applicable to most music in our daily life.
Based on the statistical results, we carefully select 8 bars – the previous 1st, 2nd, 4th, 8th, 12th, 16th, 24th, and 32nd bars, as the default structured-related bars, since they can cover the most similar bars in most cases.
The number of selected structure-related bars is a trade-off between efficiency and information richness.
One can select more or other bars according to the computation resources and the specific similarity distribution of the used dataset.
We have to admit that the selected bars cannot always cater to any song, but as long as it covers the most cases, it can already enable Museformer to generate music with better structures.
3.4 Merits of Museformer
We explain why Museformer is suitable for the music generation task.
First, the receptive fields of the fine-grained attention comply with the characteristics of music and can cover most of the structure-related information.
Unlike previous models that adopt fixed token-level patterns [14, 38] or learn content-based patterns [27, 31], which may not cover the most important ranges to be referred to for generating music structures, we directly use the structure-related bars derived from human-made music.
These bars can include both neighboring ones and distant ones, which enables Museformer to generate both short-term and long-term music structures.
Second, the coarse-grained attention can preserve necessary information for generating better music.
In general, FC-Attention can be categorized into sparse attention, but unlike the conventional sparse attention that simply drops a large amount of information, which may limit the model’s capability especially for music where mutual connections abound, the coarse-grained attention preserves the information of the other bars so as to provide rich clues for generation.
Third, The combination of the fine- and coarse-grained attention enables Museformer to handle long music sequences efficiently.
Compared to the number of all the music tokens, the number of tokens in the structure-related bars and the summary tokens is much smaller, so the memory consumption and the running time are greatly reduced.
It is essential for this task where sequences are quite long.
Experiments 4.1 Experiment Settings
We give a brief introduction to the experiment settings.
Please refer to Appendix B for more details.
Dataset and Music Representation
We conduct our experiments on the widely-used Lakh MIDI (LMD) dataset [40], which contains multi-instrument music in the format of MIDI.
After preprocessing, the final dataset contains 29 , 940 songs ( 1 , 727 hours), each song contains 95 bars on average.
Following [10], various instruments are merged into the 6 basic ones namely square synthesizer, piano, guitar, string, bass and drum, with the square synthesizer playing the melody.
We use a
REMI-like representation method [21] to transfer MIDIs into token sequences, where the musical information (instrument, bar line, note position, pitch, duration, etc.) is represented in separate tokens (see Figure 1 for an example).
Each song is represented by 15 , 042 tokens on average, and each bar is represented by 158 tokens on average.
We randomly split all the songs by 8 / 1 / 1 for training/validation/test, respectively.
Implementation Museformer is implemented with PyTorch 2 and fairseq 3 .
For efficient computation of FC-Attention, we write CUDA kernels to construct the attention layouts for each sample, and then transfer the layouts into a blocksparse form and compute with SparTA 4 [41].
Model
and
Training
Configurations
The core parameters of Museformer include layer number = 4 , hidden size = 512 , number of attention heads = 8 , and FFN hidden size = 2 , 048 .
During training, the batch size is set to 4 songs.
Following [39], we use the Adam optimizer with β 1 = 0 .
9 , β 2 = 0 .
98 and ε = 10 − 9 , and the learning rate is warmed up over the first 16 , 000 steps linearly to a peak value of 5 × 10 − 4 , and then decreases based on the inverse square root of the steps.
The
L2 weight decay is set to 0 .
During inference, we use top- k sampling with k = 8 .
Generation continues until the end-of-sentence token is generated or it reaches the maximum length of 20 , 480 .
Compared Models We compare Museformer with 4 representative Transformer-based models, most of which have been adopted in music generation:
• Music Transformer [3]: a vanilla Transformer with a memory-efficient “skewing” relative position embedding implementation.
• Transformer-XL [13]: a recurrent Transformer that encodes the sequence chunk by chunk and uses the gradient-stopped representations of previous chunks as the memory.
• Longformer [14]: a model with a sliding window sparse attention.
• Linear Transformer [15]: a model that uses a kernel-based attention of linear complexity.
All the compared models are set with comparable hyper-parameters as Museformer.
For Music
Transformer that uses the full attention and thus cannot model long sequences at once due to memory limit, we chunk each song into multiple samples during training, and apply the model to generate long sequences during validation and inference to test its generalization on long music sequences.
Objective Evaluation We use the following objective metrics to evaluate the models:
• Perplexity (PPL) : a common metric to measure whether a generative model can correctly predict future tokens.
The smaller, the better.
To see the models’ performances on different lengths, it is calculated on the first 1 , 024 , 5 , 120 , or 10 , 240 tokens of each sample.
• Similarity Error (SE) : the error between the similarity distribution of training data and generated music, to evaluate the models’ ability to generate music with realistic structures.
It is defined as
[Equation]
where ˆ
L t and L t are the average similarities (defined in Equation 5) of the generated music
and the
training data respectively.
We set T = 40 in our experiments,
and ˆ
L t
is calculated on
generated music
pieces
for
each model
The smaller the value is, the more similar the structures of the generated music are to human-made music.
Subjective Evaluation The most canonical way to evaluate a music generation model is human listening test.
We apply each model to randomly generate 100 music pieces, and invite 10 people, where 7 of them have music-related learning experiences, to score these music pieces.
Specifically, for each participant, we randomly construct 5 groups, where each group contains 5 music pieces that are generated by Museformer and the 4 compared models, respectively.
Participants are asked to score these music pieces from 1 (lowest) to 10 (highest) over the following subjective metrics:
• Musicality : whether it is pleasant and interesting, and real enough just like human-made music.
• Short-term structure : whether it shows good structures in neighboring content, such as good repetitions and reasonable development.
• Long-term structure : whether it shows good structures in long distance, such as song-level repetitions and long-distance connections.
• Overall : an overall score.
We also calculate preference score based on this overall score, which is defined as the ratio of winning times (obtaining the highest overall score within a group).
4.2 Comparison with Previous Models
Table 1 shows the results of the objective evaluation.
As we can see: 1) Music Transformer achieves a comparable PPL as other models on short music sequences ( 1 , 024 tokens), but undergoes a severe deterioration on longer sequences, which implies that a model trained on short music sequences cannot well generalize to long music sequences.
Accordingly, an appropriate long-sequence Transformer model is needed for modeling the long music sequences.
Although the receptive field of Linear
Transformer can cover the whole sequence, its PPLs show no superiority compared to other models, which may be because that the kernel-based attention falls short in accurately capturing the complex correlations of music.
The proposed Museformer can consistently achieve the best PPLs on various sequence lengths, especially on a larger length, which demonstrates the effectiveness of
[Table]
[Table]
Museformer on the music generation task.
The results on SE demonstrate that the music generated by Museformer has the structures that are most similar to the human-made music.
We provide the similarity distribution for each model and more discussion in Appendix C.
Furthermore, we present the results of the subjective evaluation in Table 2, which show that Museformer achieves the best performance.
Specifically, 1) Museformer gets the highest scores on all the metrics.
On the structure-related metrics, especially the long-term structure, Museformer exceeds other models by a large gap, indicating that the proposed FC-Attention can empower the model to capture the correlations in distant bars.
We further do pairwise comparisons over the subjective evaluation results.
Table 3 shows the number of wins/ties/losses based on the overall scores, as well as the p -values of the Wilcoxon signed rank test.
Museformer obtains more wins than the compared models, and the p -values indicate that Museformer achieves statistically significant improvements ( p < 0 . 05 ).
4.3 Ablation Study
We verify the effectiveness of the Museformer components as follows: 1) To see the effectiveness of the coarse-grained attention, we compare Museformer with the setting w/o coarse-grained , where each music token attends to the music tokens in the structure-related bars and its previous ones in the current bars, and no summary token of any bar.
To see the effectiveness of the structure-related bar
[Table]
[Figure]
selection for the fine-grained attention, we compare Museformer with the setting w/o bar selection , where we use the most recent 8 bars for the fine-grained attention instead of the structure-related bars selected via the similarity statistics.
From the results presented in the bottom block of Table 1, we can observe that: 1) Museformer consistently achieves better performances on both PPLs and SE compared to the two ablation settings, which demonstrates the effectiveness of the coarse-grained attention and the structure-related bar selection.
The coarse-grained attention preserves the necessary information of the bars other than the structured-related bars, and can consistently help decrease the PPLs. 3)
The contribution of the structure-related bar selection increases as the sequences get longer.
This is reasonable because that in a longer music sequence, there tends to be more bars and more long-term structures, and the fine-grained attention can directly capture the correlations in the distant structure-related bars, which helps make more accurate predictions.
4) Embodied on SE, the bar selection is contributory to the structures of generated music.
Please refer to Appendix C for more details.
In addition to the above two settings, we have also tried disabling the fine-grained attention for previous bars, where a music token only directly attends to its previous tokens within its bar, and attends to all the previous bars via the summary tokens.
The result indicates that only summarized information and no precise token-level information for the previous bars is insufficient for the model to generate coherent music.
4.4 Complexity Analysis
Suppose the sequence length is n , the average bar number is b , the average bar length is m , and the number of selected structure-related bars is k .
For FC-Attention, the time complexity of the summarization step is O ( n ) , and that of the aggregation step is O (cid:0) ( km + b ) n (cid:1) , so the overall complexity is O (cid:0) ( km + b ) n (cid:1) =
O (cid:0) ( km + n/m ) n (cid:1) .
Although the complexity is still proportional to the square of n , the typically large divider m (usually exceeds 100 ) greatly reduces the complexity.
Thus, the specific complexity is between linear and quadratic.
Note that the computation of FCAttention depends on the input content, i.e., the number of bars and the number of tokens in each individual bar, the complexity cannot be precisely formulated, and the efficiency in real applications is more noteworthy.
To see the efficiency of FC-Attention in real applications, we train Museformer and its full attention counterpart on the validation set, and record their memory consumption and running time.
With batch size = 1 , we increase the maximum sequence length until we use up the 32 GB memory of an Nvidia
V100 GPU, and record the peak memory consumption 5 and the running time for one-epoch training.
Figure 4 shows the results.
We observe that, the memory consumption of Museformer increases at a nearly linear rate with respect to the maximum sequence length, and can process over 3 × longer music sequences than its full attention counterpart, making it capable of generating full-song music.
Museformer also achieves faster training time when the maximum sequence length is greater than around 5 , 000 , which is common for music sequences.
4.5 Case Study
Figure 5 shows a snippet of a song generated by Museformer.
As we can see, on the Strings track, the 13th - 16th bars repeat the 9th - 12th bars with an interval of 4 bars, which is a short-term structure.
The 25th - 32nd bars repeat the 9th - 16th bars with an interval of 16 bars, and there are reasonable variations in the 27th bar compared to the 11th bar, which shows a long-term structure.
This case demonstrates that Museformer can generate music with both short-term and long-term structures, and not only exact repetitions but also some variations.
In addition to the two exhibited tracks, other tracks, such as piano and drum, have more variations on the two similar segments, which creates reasonable development of music.
Please refer to our demo page for more information.
[Figure]
[Equation]
Conclusion
To solve the long sequence modeling and music structure modeling challenges in symbolic music generation, we propose Museformer with a novel fine- and coarse-grained attention.
The fine-grained attention is applied to the structure-related bars for learning the structure-related correlations, and the coarse-grained attention is applied to the summarization of the other bars for getting a sketch of them.
We propose to select the structure-related bars via bar-pair similarity statistics.
Experimental results show that Museformer is efficient and can generate music with good quality and structures.
Museformer is not perfect yet, and we would like to discuss about its limitations and possible future explorations.
First, since Museformer takes random samplings during inference and does not receive manual control, it can hardly ensure every generated music piece to be well-structured in an expected way.
Techniques to enhance its reliability and controllability can be further explored.
Furthermore, the musicality and creativity of the generated music is still far behind that of the human-made music, which remains a problem to all the existing music generation models.
We believe that more sophisticated music representation and large models trained on large-scale data can help alleviate this problem.
Finally, we anticipate Museformer’s adaptation to more tasks and domains.
It can be easily and reasonably applied on music understanding tasks.
For NLP tasks, since natural languages do not have the periodical patterns as music, how to determine the semantically related sentences, paragraphs, or documents is an interesting challenge to solve.
Acknowledgments
This work is supported by National Natural Science Foundation of China (No. 61872172).
We thank the SparTA group, the scorers in the subjective evaluation, and many other people for their kind help.
Checklist
For all authors... (a) Do the main claims made in the abstract and introduction accurately reflect the paper’s contributions and scope?
[Yes] (b) Did you describe the limitations of your work?
[Yes] (c) Did you discuss any potential negative societal impacts of your work?
[N/A] We do not see any potential negative societal impacts of our work.
(d) Have you read the ethics review guidelines and ensured that your paper conforms to them?
[Yes] 2.
If you are including theoretical results... (a) Did you state the full set of assumptions of all theoretical results?
[N/A] (b) Did you include complete proofs of all theoretical results?
[N/A] 3.
If you ran experiments... (a) Did you include the code, data, and instructions needed to reproduce the main experimental results (either in the supplemental material or as a URL)?
[Yes] (b) Did you specify all the training details (e.g., data splits, hyperparameters, how they were chosen)?
[Yes] (c) Did you report error bars (e.g., with respect to the random seed after running experiments multiple times)?
[N/A] (d) Did you include the total amount of compute and the type of resources used (e.g., type of GPUs, internal cluster, or cloud provider)?
[Yes] 4.
If you are using existing assets (e.g., code, data, models) or curating/releasing new assets... (a) If your work uses existing assets, did you cite the creators?
[Yes] (b) Did you mention the license of the assets?
[N/A] (c) Did you include any new assets either in the supplemental material or as a URL?
[N/A] (d) Did you discuss whether
and how consent was obtained from people whose data you’re using/curating?
[N/A] (e) Did you discuss whether the data you are using/curating contains personally identifiable information or offensive content?
[N/A] 5.
If you used crowdsourcing or conducted research with human subjects... (a) Did you include the full text of instructions given to participants and screenshots, if applicable?
[Yes] (b) Did you describe any potential participant risks, with links to Institutional Review Board (IRB) approvals, if applicable?
[N/A] (c) Did you include the estimated hourly wage paid to participants and the total amount spent on participant compensation?
[N/A]
A Similarity Statistics on Different Datasets
We conduct the similarity statistics introduced in §3.3 on the whole LMD dataset that we use, and exhibit the results in Figure 6.
We can observe that the periodical structure pattern, that a music bar tends to be more similar to its previous 2 bars
[Figure]
and also to the previous 4 -th bar or its multipliers in most cases, is also satisfied on this set of music.
Specifically, this rule holds on all of the instrument tracks except the drum track.
This makes sense because the percussive instruments usually play a same rhythmic pattern over and over throughout a song
[Figure]
To see the structure pattern of music of different genres
[Figure]
we conduct the same similarity statistics on the Top-MAGD dataset
[Figure]
which annotates altogether 13 music genres to the songs.
Figure 7 shows that although different genres have their specific distributions, the general pattern is still applicable to all of these genres.
[Figure]
i
[Figure]
i t y
[Figure]
To see whether the pattern still holds on other style of music
[Figure]
we conduct the statistics on the
Symphony dataset [42]
[Figure]
and exhibit the distribution in Figure 8.
Since it is not easy to tell the melody tracks for the symphony music
[Figure]
the reported result is calculated over all the tracks.
Due to the existence of some instruments that play more repetitions
[Figure]
e
[Figure]
g., drums, the differences among the similarities over the intervals are not that significant
[Figure]
but it still presents the same tendency.
40 Interval (
[Figure]
S i m il a r i t y ( % )
B Details of Experiment Settings B.1 Dataset Construction
We use the LMD dataset [40] in our experiments, and perform the following cleaning and processing to ensure the data quality:
• Track Compression : We first compress various tracks into 6 tracks [10], namely square synthesizer, piano, guitar, string, bass and drum, with the square synthesizer playing the melody.
• Note Position and Duration Normalization : To ensure that the bar splitting is correct and the duration of notes recorded in MIDI files conforms to the musically perfect duration (e.g., quarter notes held for exact 1 beat, 8 -th notes held for exact half a beat), we use MuseScore 7 to normalize the note position and duration.
• Data Filtering : Since this dataset is crawled from the Internet and contains many samples of low quality, we use a set of heuristic rules presented in Table 4 to filter them out and keep the samples of good quality and reasonable lengths.
• Pitch Normalization : We normalize the pitches to transfer the tonality to “C major” or “A minor”.
[Table]
Duplication Remove the duplicated samples that have the same duration and the same numbers of bars, notes, distinct note positions, and instruments.
To remove
the duplicated samples.
[Table]
Only keep the samples of time signature 4/4.
[Table]
remove musicallycomplicatedorerroneoussamples
Only keep the samples that have at least 2 instruments and have the square synthesizer (the melody track).
Only keep the samples whose tempo values (the performance speed) are not less than 24 and not larger than 200.
Only keep the samples whose pitch values are not less than(A0) and not larger than 108 (C8).
Only keep the samples with maximum note duration not longer than 16 beats (4 bar).
Remove the samples that contain 4 or more empty bars, or the pitch/duration
values are the same for all the notes.
We then represent each MIDI file into a sequence of tokens using a REMI-like [21] method.
The bar lines are inferred automatically based on the time signature and the note onset positions.
The statistics of the number of tokens and the number of bars are shown in Figure 9.
The average number
[Figure]
R a t i o ( % )
[Figure]
of tokens
is 15 , 042 , the average number of bars is 95 , and the average number of tokens per bar is 158 .
Most samples are longer than 10 , 000 tokens, making it essential to design Museformer for efficiently modeling the long music sequences.
B.2 Implementation Details
Museformer is equipped with a dynamic sparse attention mechanism, which requires constructing distinct attention layouts for each sample according to the token ranges of bars.
Since the dynamic sparse attention layout is not regular as sliding windows [14, 25] or fixed-length blocks [24], it is very challenging to leverage the GPU parallel computation techniques to speed up training and decrease the memory consumption.
Note that we cannot pad each bar into a fixed-length sequence because the lengths of bars vary drastically and it would introduce a lot of padding tokens that lead to unacceptable sequence lengths.
To achieve an efficient implementation, we utilize a blocksparse method that splits the attention layouts into fixed-size square blocks, and only computes those blocks where there is at least one query-key/value pair expects computation.
In our implementation, all the summary tokens of the input bars are put before the music tokens to facilitate the computation, and thus the summarization step and the aggregation step in FC-Attention can be transferred into computing summary-to-all (summary tokens attending to summary tokens and music tokens) and music-to-all (music tokens attending to summary tokens and music tokens) attention, respectively, and their attention layouts are shown in Figure 10.
We take the following 3 steps to compute each of the two attention processes: 1) attention layout generation to generate the full attention layout according to the bar ranges; 2) layout block-sparsification to transfer the full layout into a blocksprase layout; 3) blocksparse computation to compute the blocksparse multiplications and softmax operations.
Attention Layout Generation
According to the bar splitting of each sample, we fill “true” on the corresponding areas of a Boolean tensor to construct the attention layout (shown on the left part of
Figure 10).
To speed up the construction, we collect the begin and end indices of the bars ahead of time, and write a CUDA kernel to fill it for all the bars simultaneously.
Layout Block-Sparsification As visualized in Figure 10, the full attention layouts are blocksparsified with a fixed-size square (the block size set to 32 in our experiments), and diminished into the blocksparse layouts.
Blocksparse Computation We leverage SparTA [41] to compute the blocksparse multiplications and softmax operations of attention.
It only computes for the shaded areas on the blocksparse layouts in Figure 10.
Since the attention layouts are the same for all the layers and heads in our setting, we only construct the attention layouts once for each sample, and cache them as well as the SparTA kernels for reuse, which saves a lot of
memory
and time.
[Figure]
B.3 Detailed Model and Training Configurations
For Museformer and all the compared models, the basic model and training configurations introduced in §4.1 are set same.
For Museformer that involves two separate attention processes (summarization and aggregation), to make the parameter size comparable with other models, the projection matrices for projecting the targets (i.e., queries) are shared for the two attention computation, and we add different biases for summary tokens and music tokens respectively.
It is the same for projecting the sources (i.e., keys and values), except that we use different projection parameters for ˜ S N ( i ) in
Equation 3.
All the models have comparable amount of trainable parameters:
Museformer 16 .
1 M,
Music Transformer 16 .
6 M, Transformer-XL 13 .
9 M, Longformer 15 .
3 M, Linear Transformer 13 .
2 M, with acceptable differences due to different architectures and implementations.
All the models are trained on 4 Nvidia V100 32 GB GPUs with fp16.
Since in Museformer, a token directly attends to the tokens of 8 previous bars (the selected structure-related bars) and the current bar via the fine-grained attention, for a fair comparison, we set the window sizes for Longformer to 1 , 408 , which is approximately the number of tokens that 9 bars contain.
For Music Transformer that uses full attention and cannot process long sequences at once, we chunk the input sequence into blocks of fixed size 1 , 408 , and manipulate the batch size and the update frequency to ensure that the it is updated the comparable number of times within each epoch as other models.
For Transformer-XL, the chunk size and the memory size are also set to 1 , 408 .
During inference, all the models are applied to generate sequences not shorter than 2 , 048 and not longer than 20 , 480 , until the end-of-sentence token is generated.
The top- k sampling is used, and k is set to 8 .
C Similarity Distributions of Generated Music
Compared to other models (the compared models and the ablation settings), the music generated by
Museformer has the similarity distribution most similar to that of the training data, as its SE reported in Table 1 is the smallest.
However, the value of SE may not comprehensively represent the structural characteristics, so we further display and discuss about the specific distributions in this section.
Figure 11 shows the similarity distributions.
We can observe that: 1) The distribution of Museformer is very similar to that of the training data (shown in Figure 3).
The quantity is close, and the contour shows the same periodical pattern, i.e., the previous 2 bars, the previous 4 -th bar as well as its multipliers, have relatively large similarities.
The distributions of Music Transformer and Linear
Transformer show no periodical pattern.
It implies that the Music Transformer model trained on short sequences cannot generate well-structured music of long lengths, and Linear Transformer cannot well capture the structure-related correlations even though its receptive field covers the whole sequence.
The distributions of Transformer-XL and Longformer show the tendency of the periodical pattern, and the similarity decreases as the interval increases in general.
It indicates that the two models whose receptive fields only contain the most recent content have the ability to generate periodical repetitions of short distances, but fall short for long-term structures.
It seems that compared to the quantity of the similarity, the contour (i.e., the periodical pattern) is more relevant to the human scoring on the structure-related metrics.
The distributions of Transformer-XL and Longformer show the pattern, and their subjective scores on short-term and long-term structures (shown in Table 2) are relatively high, and are higher than Music Transformer and Linear Transformer whose distributions fail to show the periodical pattern.
However, the quantity of the similarity may also influence human decisions.
For example, the quantities of the similarities of Transformer-XL is relatively high, which indicates that too many repetitions are generated.
For these samples, human scorers sometimes think them annoying and eventually give lower scores on musicality.
The ablation setting, Museformer w/o coarse-grained, has slightly larger SE compared to Museformer, and its distribution clearly shows the periodical pattern.
Thus, the coarse-grained attention does not contribute a lot on the music structures.
The distribution of Museformer w/o bar selection shows the tendency of the periodical pattern, and the similarity decreases in general as the interval increases, similar to those of Transformer-XL and
Longformer.
It indicates that the structure-related bars are contributory to generating music with both short-term and long-term structures.
[Figure]
[Figure] [Figure]
i
[Figure]
i m il a r i t
y
[Figure]
r i t
[Figure]
i
[Figure]
il a r i t y ( % )
[Figure]
o
[Figure]