A quantum algorithm for training wide and deep classical neural networks

• URL: http://arxiv.org/abs/2107.09200v1
• Date: Mon, 19 Jul 2021 23:41:03 GMT
• Title: A quantum algorithm for training wide and deep classical neural networks
• Authors: Alexander Zlokapa, Hartmut Neven, Seth Lloyd
• Abstract summary: We show that conditions amenable to classical trainability via gradient descent coincide with those necessary for efficiently solving quantum linear systems. We numerically demonstrate that the MNIST image dataset satisfies such conditions. We provide empirical evidence for $O(log n)$ training of a convolutional neural network with pooling.
• Score: 72.2614468437919
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Given the success of deep learning in classical machine learning, quantum algorithms for traditional neural network architectures may provide one of the most promising settings for quantum machine learning. Considering a fully-connected feedforward neural network, we show that conditions amenable to classical trainability via gradient descent coincide with those necessary for efficiently solving quantum linear systems. We propose a quantum algorithm to approximately train a wide and deep neural network up to $O(1/n)$ error for a training set of size $n$ by performing sparse matrix inversion in $O(\log n)$ time. To achieve an end-to-end exponential speedup over gradient descent, the data distribution must permit efficient state preparation and readout. We numerically demonstrate that the MNIST image dataset satisfies such conditions; moreover, the quantum algorithm matches the accuracy of the fully-connected network. Beyond the proven architecture, we provide empirical evidence for $O(\log n)$ training of a convolutional neural network with pooling.

Related papers

• Training-efficient density quantum machine learning [2.918930150557355]
  Quantum machine learning requires powerful, flexible and efficiently trainable models. We present density quantum neural networks, a learning model incorporating randomisation over a set of trainable unitaries.
  arXiv  Detail & Related papers  (2024-05-30T16:40:28Z)
• Speed Limits for Deep Learning [67.69149326107103]
  Recent advancement in thermodynamics allows bounding the speed at which one can go from the initial weight distribution to the final distribution of the fully trained network. We provide analytical expressions for these speed limits for linear and linearizable neural networks. Remarkably, given some plausible scaling assumptions on the NTK spectra and spectral decomposition of the labels -- learning is optimal in a scaling sense.
  arXiv  Detail & Related papers  (2023-07-27T06:59:46Z)
• Learning To Optimize Quantum Neural Network Without Gradients [3.9848482919377006]
  We introduce a novel meta-optimization algorithm that trains a emphmeta-optimizer network to output parameters for the quantum circuit. We show that we achieve a better quality minima in fewer circuit evaluations than existing gradient based algorithms on different datasets.
  arXiv  Detail & Related papers  (2023-04-15T01:09:12Z)
• Variational Quantum Neural Networks (VQNNS) in Image Classification [0.0]
  This paper investigates how training of quantum neural network (QNNs) can be done using quantum optimization algorithms. In this paper, a QNN structure is made where a variational parameterized circuit is incorporated as an input layer named as Variational Quantum Neural Network (VQNNs) VQNNs is experimented with MNIST digit recognition (less complex) and crack image classification datasets which converge the computation in lesser time than QNN with decent training accuracy.
  arXiv  Detail & Related papers  (2023-03-10T11:24:32Z)
• Quantum Ridgelet Transform: Winning Lottery Ticket of Neural Networks with Quantum Computation [8.947825738917869]
  Ridgelet transform has been a fundamental mathematical tool in the theoretical studies of neural networks. We develop a quantum ridgelet transform (QRT) which implements the ridgelet transform of a quantum state within a linear runtime $exp(O(D))$ of quantum computation. As an application, we show that one can use QRT as a fundamental subroutine for QML to efficiently find a sparse trainable subnetwork of large shallow wide neural networks.
  arXiv  Detail & Related papers  (2023-01-27T19:00:00Z)
• Implementing arbitrary quantum operations via quantum walks on a cycle graph [8.820803742534677]
  We use a simple discrete-time quantum walk (DTQW) on a cycle graph to model an arbitrary unitary operation $U(N)$. Our model is essentially a quantum neural network based on DTQW.
  arXiv  Detail & Related papers  (2022-10-26T03:51:46Z)
• Accelerating the training of single-layer binary neural networks using the HHL quantum algorithm [58.720142291102135]
  We show that useful information can be extracted from the quantum-mechanical implementation of Harrow-Hassidim-Lloyd (HHL) This paper shows, however, that useful information can be extracted from the quantum-mechanical implementation of HHL, and used to reduce the complexity of finding the solution on the classical side.
  arXiv  Detail & Related papers  (2022-10-23T11:58:05Z)
• Robust Training and Verification of Implicit Neural Networks: A Non-Euclidean Contractive Approach [64.23331120621118]
  This paper proposes a theoretical and computational framework for training and robustness verification of implicit neural networks. We introduce a related embedded network and show that the embedded network can be used to provide an $ell_infty$-norm box over-approximation of the reachable sets of the original network. We apply our algorithms to train implicit neural networks on the MNIST dataset and compare the robustness of our models with the models trained via existing approaches in the literature.
  arXiv  Detail & Related papers  (2022-08-08T03:13:24Z)
• Neural Capacitance: A New Perspective of Neural Network Selection via Edge Dynamics [85.31710759801705]
  Current practice requires expensive computational costs in model training for performance prediction. We propose a novel framework for neural network selection by analyzing the governing dynamics over synaptic connections (edges) during training. Our framework is built on the fact that back-propagation during neural network training is equivalent to the dynamical evolution of synaptic connections.
  arXiv  Detail & Related papers  (2022-01-11T20:53:15Z)
• Why Lottery Ticket Wins? A Theoretical Perspective of Sample Complexity on Pruned Neural Networks [79.74580058178594]
  We analyze the performance of training a pruned neural network by analyzing the geometric structure of the objective function. We show that the convex region near a desirable model with guaranteed generalization enlarges as the neural network model is pruned.
  arXiv  Detail & Related papers  (2021-10-12T01:11:07Z)

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.