Unsupervised Learning of Harmonic Analysis Based on Neural HSMM with Code Quality Templates

• URL: http://arxiv.org/abs/2403.04135v1
• Date: Thu, 7 Mar 2024 01:29:48 GMT
• Title: Unsupervised Learning of Harmonic Analysis Based on Neural HSMM with Code Quality Templates
• Authors: Yui Uehara
• Abstract summary: This paper presents a method of unsupervised learning of harmonic analysis based on a hidden semi-Markov model. We show how to recognize the tonic without prior knowledge, based on the transition probabilities of the Markov model.
• Score: 0.3233195475347961
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper presents a method of unsupervised learning of harmonic analysis based on a hidden semi-Markov model (HSMM). We introduce the chord quality templates, which specify the probability of pitch class emissions given a root note and a chord quality. Other probability distributions that comprise the HSMM are automatically learned via unsupervised learning, which has been a challenge in existing research. The results of the harmonic analysis of the proposed model were evaluated using existing labeled data. While our proposed method has yet to perform as well as existing models that used supervised learning and complex rule design, it has the advantage of not requiring expensive labeled data or rule elaboration. Furthermore, we also show how to recognize the tonic without prior knowledge, based on the transition probabilities of the Markov model.

Related papers

• Supervised Score-Based Modeling by Gradient Boosting [49.556736252628745]
  We propose a Supervised Score-based Model (SSM) which can be viewed as a gradient boosting algorithm combining score matching. We provide a theoretical analysis of learning and sampling for SSM to balance inference time and prediction accuracy. Our model outperforms existing models in both accuracy and inference time.
  arXiv  Detail & Related papers  (2024-11-02T07:06:53Z)
• Data-driven Bayesian State Estimation with Compressed Measurement of Model-free Process using Semi-supervised Learning [57.04370580292727]
  The research topic is: data-driven Bayesian state estimation with compressed measurement. The underlying dynamical model of the states is assumed to be unknown. Two existing unsupervised learning-based data-driven methods fail to address the BSCM problem.
  arXiv  Detail & Related papers  (2024-07-10T05:03:48Z)
• Data-driven Nonlinear Model Reduction using Koopman Theory: Integrated Control Form and NMPC Case Study [56.283944756315066]
  We propose generic model structures combining delay-coordinate encoding of measurements and full-state decoding to integrate reduced Koopman modeling and state estimation. A case study demonstrates that our approach provides accurate control models and enables real-time capable nonlinear model predictive control of a high-purity cryogenic distillation column.
  arXiv  Detail & Related papers  (2024-01-09T11:54:54Z)
• Evaluating Disentanglement in Generative Models Without Knowledge of Latent Factors [71.79984112148865]
  We introduce a method for ranking generative models based on the training dynamics exhibited during learning. Inspired by recent theoretical characterizations of disentanglement, our method does not require supervision of the underlying latent factors.
  arXiv  Detail & Related papers  (2022-10-04T17:27:29Z)
• A quantum learning approach based on Hidden Markov Models for failure scenarios generation [0.6423239719448167]
  We will use the Hidden Quantum Markov Models (HQMMs) to create a generative model. We will show that the quantum approach gives better results compared with the classical approach. We will give a strategy to identify the probable and no-probable failure scenarios of a system.
  arXiv  Detail & Related papers  (2022-03-30T07:27:23Z)
• Learning Hidden Markov Models When the Locations of Missing Observations are Unknown [54.40592050737724]
  We consider the general problem of learning an HMM from data with unknown missing observation locations. We provide reconstruction algorithms that do not require any assumptions about the structure of the underlying chain. We show that under proper specifications one can reconstruct the process dynamics as well as if the missing observations positions were known.
  arXiv  Detail & Related papers  (2022-03-12T22:40:43Z)
• Active Learning of Markov Decision Processes using Baum-Welch algorithm (Extended) [0.0]
  This paper revisits and adapts the classic Baum-Welch algorithm for learning Markov decision processes and Markov chains. We empirically compare our approach with state-of-the-art tools and demonstrate that the proposed active learning procedure can significantly reduce the number of observations required to obtain accurate models.
  arXiv  Detail & Related papers  (2021-10-06T18:54:19Z)
• BERTifying the Hidden Markov Model for Multi-Source Weakly Supervised Named Entity Recognition [57.2201011783393]
  conditional hidden Markov model (CHMM) CHMM predicts token-wise transition and emission probabilities from the BERT embeddings of the input tokens. It fine-tunes a BERT-based NER model with the labels inferred by CHMM.
  arXiv  Detail & Related papers  (2021-05-26T21:18:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.