Comparing the effects of Boltzmann machines as associative memory in Generative Adversarial Networks between classical and quantum sampling
arXiv:2203.15220 · doi:10.7566/JPSJ.91.074008
Abstract
We investigate the quantum effect on machine learning (ML) models exemplified by the Generative Adversarial Network (GAN), which is a promising deep learning framework. In the general GAN framework the generator maps uniform noise to a fake image. In this study, we utilize the Associative Adversarial Network (AAN), which consists of a standard GAN and an associative memory. Further, we set a Boltzmann Machine (BM), which is an undirected graphical model that learns low-dimensional features extracted from a discriminator, as the memory. Owing to difficulty calculating the BM's log-likelihood gradient, it is necessary to approximate it by using the sample mean obtained from the BM, which has tentative parameters. To calculate the sample mean, a Markov Chain Monte Carlo (MCMC) is often used. In a previous study, this was performed using a quantum annealer device, and the performance of the "Quantum" AAN was compared to that of the standard GAN. However, its better performance than the standard GAN is not well understood. In this study, we introduce two methods to draw samples: classical sampling via MCMC and quantum sampling via quantum Monte Carlo (QMC) simulation, which is quantum simulation on the classical computer. Then, we compare these methods to investigate whether quantum sampling is advantageous. Specifically, calculating the discriminator loss, the generator loss, inception score and Fréchet inception distance, we discuss the possibility of AAN. We show that the AANs trained by both MCMC and QMC are more stable during training and produce more varied images than the standard GANs. However, the results indicate no difference in sampling by QMC simulation compared to that by MCMC.
15 pages, 12 figures
References in corpus (7)
- Quantum Annealing for Combinatorial Clustering
- Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization
- Item Listing Optimization for E-commerce Websites based on Diversity
- Benchmark test of Black-box optimization using D-Wave quantum annealer
- Simulated quantum annealing as a simulator of non-equilibrium quantum dynamics
- Fair Sampling by Simulated Annealing on Quantum Annealer
- Teacher-student learning for a binary perceptron with quantum fluctuations
Cited by in corpus (9)
- Efficient Algorithm for Binary Quadratic Problem by Column Generation and Quantum Annealing
- Nonnegative/Binary Matrix Factorization for Image Classification using Quantum Annealing
- Exploration of new chemical materials using black-box optimization with the D-wave quantum annealer
- Individual subject evaluated difficulty of adjustable mazes generated using quantum annealing
- Hybrid Algorithm of Linear Programming Relaxation and Quantum Annealing
- Online calibration scheme for training restricted Boltzmann machines with quantum annealing
- Subgradient Method using Quantum Annealing for Inequality-Constrained Binary Optimization Problems
- Optimization of Connection Patterns between Mobile Phones and Base Stations using Quantum Annealing
- Efficient Construction of Feasible Solutions in Column Generation using Quantum Annealing