The DOI matches its Crossref record.
Finding temporal structure in music: blues improvisation with LSTM recurrent networks
Abstract
We consider the problem of extracting essential ingredients of music signals, such as a well-defined global temporal structure in the form of nested periodicities (or meter). We investigate whether we can construct an adaptive signal processing device that learns by example how to generate new instances of a given musical style. Because recurrent neural networks (RNNs) can, in principle, learn the temporal structure of a signal, they are good candidates for such a task. Unfortunately, music composed by standard RNNs often lacks global coherence. The reason for this failure seems to be that RNNs cannot keep track of temporally distant events that indicate global music structure. Long short-term memory (LSTM) has succeeded in similar domains where other RNNs have failed, such as timing and counting and the learning of context sensitive languages. We show that LSTM is also a good mechanism for learning to compose music. We present experimental results showing that LSTM successfully learns a form of blues music and is able to compose novel (and we believe pleasing) melodies in that style. Remarkably, once the network has found the relevant structure, it does not drift from it: LSTM is able to play the blues with good timing and proper structure as long as one is willing to listen.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Supervised Sequence Labelling with Recurrent Neural Networks
Graves, A. (2012) · Studies in Computational Intelligence · doi:10.1007/978-3-642-24797-2 · Cited by 3,120
A review on the long short-term memory model
Van Houdt, G., Mosquera, C., & Nápoles, G. (2020) · Artificial Intelligence Review · doi:10.1007/s10462-020-09838-1 · Cited by 1,991
Generating Focused Molecule Libraries for Drug Discovery with Recurrent Neural Networks
Segler, M. H. S., Kogej, T., Tyrchan, C., & Waller, M. P. (2018) · ACS Central Science · doi:10.1021/acscentsci.7b00512 · Cited by 1,537
Fault diagnosis of rolling bearings with recurrent neural network-based autoencoders
Liu, H., Zhou, J., Zheng, Y., Jiang, W., & Zhang, Y. (2018) · ISA Transactions · doi:10.1016/j.isatra.2018.04.005 · Cited by 606
Recent Advances in Recurrent Neural Networks
Salehinejad, H., Sankar, S., Barfett, J., Colak, E., & Valaee, S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1801.01078 · Cited by 562
Boulanger-Lewandowski, N., Bengio, Y., & Vincent, P. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.6392 · Cited by 459
C-RNN-GAN: Continuous recurrent neural networks with adversarial training
Mogren, O. (2016) · arXiv · doi:10.48550/arxiv.1611.09904 · Cited by 386
Advances in De Novo Drug Design: From Conventional to Machine Learning Methods
Mouchlis, V. D., Afantitis, A., Serra, A., Fratello, M., Papadiamantis, A. G., Aidinis, V., Lynch, I., Greco, D., & Melagraki, G. (2021) · International Journal of Molecular Sciences · doi:10.3390/ijms22041676 · Cited by 353
Travel time prediction with LSTM neural network
Duan, Y., L.V., Y., & Wang, F.-Y. (2016) · 2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC) · doi:10.1109/itsc.2016.7795686 · Cited by 336
MidiNet: A Convolutional Generative Adversarial Network for Symbolic-domain Music Generation
Yang, L.-C., Chou, S.-Y., & Yang, Y. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.10847 · Cited by 283
An End-to-End Neural Network for Polyphonic Piano Music Transcription
Sigtia, S., Benetos, E., & Dixon, S. (2016) · IEEE/ACM Transactions on Audio, Speech, and Language Processing · doi:10.1109/taslp.2016.2533858 · Cited by 280
Recurrent Neural Networks for Short-Term Load Forecasting: An Overview and Comparative Analysis
Bianchi, F. M., Maiorino, E., Kampffmeyer, M. C., Rizzi, A., & Jenssen, R. (2017) · SpringerBriefs in Computer Science · doi:10.1007/978-3-319-70338-1 · Cited by 280
Novice-AI Music Co-Creation via AI-Steering Tools for Deep Generative Models
Louie, R., Coenen, A., Huang, C. Z., Terry, M., & Cai, C. J. (2020) · Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems · doi:10.1145/3313831.3376739 · Cited by 271
“Research has demonstrated the potential for modeling and synthesizing music, ranging from single-voice sequences [13] and multi-part music [19, 34], to music with variable parts at each time step [4] and music with long-term structure over minutes [30, 37, 26].”
Background
Metadata
- Authors
- Eck, D., & Schmidhuber, J.
- Venue
- Proceedings of the 12th IEEE Workshop on Neural Networks for Signal Processing
- Publisher
- IEEE
- Published
- 2003-06-25
- Pages
- 747-756
- OpenAlex
- W2137619888
- Cited by
- 236
- References
- 0
- FWCI
- 4.71
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.