Learning Restricted Boltzmann Machines with greedy quantum search

• URL: http://arxiv.org/abs/2309.14196v1
• Date: Mon, 25 Sep 2023 14:56:30 GMT
• Title: Learning Restricted Boltzmann Machines with greedy quantum search
• Authors: Liming Zhao, Aman Agrawal, and Patrick Rebentrost
• Abstract summary: We extend scope to the quantum computing domain and propose corresponding quantum algorithms for this problem. Our study demonstrates that the proposed quantum algorithms yield a speedup compared to the classical algorithms for learning the structure of these two classes of RBMs.
• Score: 2.98017021422101
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Restricted Boltzmann Machines (RBMs) are widely used probabilistic undirected graphical models with visible and latent nodes, playing an important role in statistics and machine learning. The task of structure learning for RBMs involves inferring the underlying graph by using samples from the visible nodes. Specifically, learning the two-hop neighbors of each visible node allows for the inference of the graph structure. Prior research has addressed the structure learning problem for specific classes of RBMs, namely ferromagnetic and locally consistent RBMs. In this paper, we extend the scope to the quantum computing domain and propose corresponding quantum algorithms for this problem. Our study demonstrates that the proposed quantum algorithms yield a polynomial speedup compared to the classical algorithms for learning the structure of these two classes of RBMs.

Related papers

• Higher-order topological kernels via quantum computation [68.8204255655161]
  Topological data analysis (TDA) has emerged as a powerful tool for extracting meaningful insights from complex data. We propose a quantum approach to defining Betti kernels, which is based on constructing Betti curves with increasing order.
  arXiv  Detail & Related papers  (2023-07-14T14:48:52Z)
• A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
  We focus on the case of learning with a single qubit, using data re-uploading techniques. We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
  arXiv  Detail & Related papers  (2022-11-23T18:25:32Z)
• Quantum algorithm for Markov Random Fields structure learning by information theoretic properties [5.263910852465186]
  We propose a quantum algorithm for structure learning of an $r$-wise Markov Random Field on quantum computers. Our work demonstrates the potential merits of quantum computation over classical computation in solving some problems in machine learning.
  arXiv  Detail & Related papers  (2022-08-24T09:00:56Z)
• Noisy Quantum Kernel Machines [58.09028887465797]
  An emerging class of quantum learning machines is that based on the paradigm of quantum kernels. We study how dissipation and decoherence affect their performance. We show that decoherence and dissipation can be seen as an implicit regularization for the quantum kernel machines.
  arXiv  Detail & Related papers  (2022-04-26T09:52:02Z)
• MGAE: Masked Autoencoders for Self-Supervised Learning on Graphs [55.66953093401889]
  Masked graph autoencoder (MGAE) framework to perform effective learning on graph structure data. Taking insights from self-supervised learning, we randomly mask a large proportion of edges and try to reconstruct these missing edges during training.
  arXiv  Detail & Related papers  (2022-01-07T16:48:07Z)
• Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
  Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
  arXiv  Detail & Related papers  (2021-11-19T12:35:26Z)
• Boltzmann machines as two-dimensional tensor networks [7.041258064903578]
  We show that RBM and DBM can be exactly represented as a two-dimensional tensor network. This representation gives an understanding of the expressive power of RBM and DBM. Also provides an efficient tensor network contraction algorithm for the computing partition function of RBM and DBM.
  arXiv  Detail & Related papers  (2021-05-10T06:14:49Z)
• On the mapping between Hopfield networks and Restricted Boltzmann Machines [0.0]
  We show an exact mapping between Hopfield networks (HNs) and Restricted Boltzmann Machines (RBMs) We outline the conditions under which the reverse mapping exists, and conduct experiments on the MNIST dataset. We discuss extensions, the potential importance of this correspondence for the training of RBMs, and for understanding the performance of deep architectures which utilize RBMs.
  arXiv  Detail & Related papers  (2021-01-27T23:49:48Z)
• Exact representations of many body interactions with RBM neural networks [77.34726150561087]
  We exploit the representation power of RBMs to provide an exact decomposition of many-body contact interactions into one-body operators. This construction generalizes the well known Hirsch's transform used for the Hubbard model to more complicated theories such as Pionless EFT in nuclear physics.
  arXiv  Detail & Related papers  (2020-05-07T15:59:29Z)

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.