Copyright© 2012, D-Wave Systems Inc. 1 Quantum Boltzmann Machine Mohammad Amin D-Wave Systems Inc.

Slides:



Advertisements
Similar presentations
Deep Learning Bing-Chen Tsai 1/21.
Advertisements

Stochastic Neural Networks Deep Learning and Neural Nets Spring 2015.
CS590M 2008 Fall: Paper Presentation
Monte Carlo Simulation of Prompt Neutron Emission During Acceleration in Fission T. Ohsawa Kinki University Japanese Nuclear Data Committee IAEA/CRP on.
Nathan Wiebe, Ashish Kapoor and Krysta Svore Microsoft Research ASCR Workshop Washington DC Quantum Deep Learning.
Stacking RBMs and Auto-encoders for Deep Architectures References:[Bengio, 2009], [Vincent et al., 2008] 2011/03/03 강병곤.
CS 678 –Boltzmann Machines1 Boltzmann Machine Relaxation net with visible and hidden units Learning algorithm Avoids local minima (and speeds up learning)
1 Optimization Algorithms on a Quantum Computer A New Paradigm for Technical Computing Richard H. Warren, PhD Optimization.
Jun Zhu Dept. of Comp. Sci. & Tech., Tsinghua University This work was done when I was a visiting researcher at CMU. Joint.
Structure learning with deep neuronal networks 6 th Network Modeling Workshop, 6/6/2013 Patrick Michl.
Adiabatic Quantum Computation with Noisy Qubits Mohammad Amin D-Wave Systems Inc., Vancouver, Canada.
Monte Carlo Simulation Methods - ideal gas. Calculating properties by integration.
Lattice regularized diffusion Monte Carlo
Schrödinger’s Elephants & Quantum Slide Rules A.M. Zagoskin (FRS RIKEN & UBC) S. Savel’ev (FRS RIKEN & Loughborough U.) F. Nori (FRS RIKEN & U. of Michigan)
Chapter 14 Simulation. Monte Carlo Process Statistical Analysis of Simulation Results Verification of the Simulation Model Computer Simulation with Excel.
1 Assessment of Imprecise Reliability Using Efficient Probabilistic Reanalysis Farizal Efstratios Nikolaidis SAE 2007 World Congress.
Introduction to Monte Carlo Methods D.J.C. Mackay.
Ising Models for Neural Data John Hertz, Niels Bohr Institute and Nordita work done with Yasser Roudi (Nordita) and Joanna Tyrcha (SU) Math Bio Seminar,
1 IE 607 Heuristic Optimization Simulated Annealing.
1 A Discriminative Approach to Topic- Based Citation Recommendation Jie Tang and Jing Zhang Presented by Pei Li Knowledge Engineering Group, Dept. of Computer.
Chapter 7 Other Important NN Models Continuous Hopfield mode (in detail) –For combinatorial optimization Simulated annealing (in detail) –Escape from local.
Alignment and classification of time series gene expression in clinical studies Tien-ho Lin, Naftali Kaminski and Ziv Bar-Joseph.
Learning Multiplicative Interactions many slides from Hinton.
Chapter 14 Monte Carlo Simulation Introduction Find several parameters Parameter follow the specific probability distribution Generate parameter.
Number of Blocks per Pole Diego Arbelaez. Option – Number of Blocks per Pole Required magnetic field tolerance of ~10 -4 For a single gap this can be.
Probabilistic Mechanism Analysis. Outline Uncertainty in mechanisms Why consider uncertainty Basics of uncertainty Probabilistic mechanism analysis Examples.
CSC2535: Computation in Neural Networks Lecture 11: Conditional Random Fields Geoffrey Hinton.
Ran El-Yaniv and Dmitry Pechyony Technion – Israel Institute of Technology, Haifa, Israel Transductive Rademacher Complexity and its Applications.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Quantum Computing Preethika Kumar
The Boltzmann Machine Psych 419/719 March 1, 2001.
Learning Lateral Connections between Hidden Units Geoffrey Hinton University of Toronto in collaboration with Kejie Bao University of Toronto.
Yaomin Jin Design of Experiments Morris Method.
CSC321: 2011 Introduction to Neural Networks and Machine Learning Lecture 11: Bayesian learning continued Geoffrey Hinton.
Monte Carlo Methods in Statistical Mechanics Aziz Abdellahi CEDER group Materials Basics Lecture : 08/18/
A. Betâmio de Almeida Assessing Modelling Uncertainty A. Betâmio de Almeida Instituto Superior Técnico November 2004 Zaragoza, Spain 4th IMPACT Workshop.
Geoffrey Hinton CSC2535: 2013 Lecture 5 Deep Boltzmann Machines.
Markov Random Fields Probabilistic Models for Images
Adiabatic quantum computation and stoquastic Hamiltonians B.M. Terhal IQI, RWTH Aachen A review of joint work with S. Bravyi, D.P.DiVincenzo and R. Oliveira.
CIAR Second Summer School Tutorial Lecture 1a Sigmoid Belief Nets and Boltzmann Machines Geoffrey Hinton.
CSC 2535 Lecture 8 Products of Experts Geoffrey Hinton.
Advanced methods of molecular dynamics 1.Monte Carlo methods 2.Free energy calculations 3.Ab initio molecular dynamics 4.Quantum molecular dynamics 5.Trajectory.
CSC2535 Lecture 4 Boltzmann Machines, Sigmoid Belief Nets and Gibbs sampling Geoffrey Hinton.
CSC321: Introduction to Neural Networks and Machine Learning Lecture 18 Learning Boltzmann Machines Geoffrey Hinton.
Javier Junquera Importance sampling Monte Carlo. Cambridge University Press, Cambridge, 2002 ISBN Bibliography.
Asymptotic Behavior of Stochastic Complexity of Complete Bipartite Graph-Type Boltzmann Machines Yu Nishiyama and Sumio Watanabe Tokyo Institute of Technology,
Determining the Complexity of the Quantum Adiabatic Algorithm using Monte Carlo Simulations A.P. Young, University of California Santa Cruz
Monte Carlo Linear Algebra Techniques and Their Parallelization Ashok Srinivasan Computer Science Florida State University
Ka-fu Wong © 2007 ECON1003: Analysis of Economic Data Lesson0-1 Supplement 2: Comparing the two estimators of population variance by simulations.
CSC321: Introduction to Neural Networks and Machine Learning Lecture 17: Boltzmann Machines as Probabilistic Models Geoffrey Hinton.
Deep Belief Network Training Same greedy layer-wise approach First train lowest RBM (h 0 – h 1 ) using RBM update algorithm (note h 0 is x) Freeze weights.
ICTP School and Workshop on Structure and Function of complex Networks (16-28 May 2005) Structural correlations and critical phenomena of random scale-free.
Beginner’s Guide to Quantum Computing Graduate Seminar Presentation Oct. 5, 2007.
Quantum Boltzmann Machine
Some Slides from 2007 NIPS tutorial by Prof. Geoffrey Hinton
Learning Deep Generative Models by Ruslan Salakhutdinov
Energy models and Deep Belief Networks
Statistical Quality Control, 7th Edition by Douglas C. Montgomery.
FORA: Simple and Effective Approximate Single­-Source Personalized PageRank Sibo Wang, Renchi Yang, Xiaokui Xiao, Zhewei Wei, Yin Yang School of Information.
Theoretical Investigations at
Restricted Boltzmann Machines for Classification
CSC321: Neural Networks Lecture 19: Boltzmann Machines as Probabilistic Models Geoffrey Hinton.
Multimodal Learning with Deep Boltzmann Machines
Structure learning with deep autoencoders
Deep Belief Nets and Ising Model-Based Network Construction
Regulation Analysis using Restricted Boltzmann Machines
Boltzmann Machine (BM) (§6.4)
Computational approaches for quantum many-body systems
CSC 578 Neural Networks and Deep Learning
A quantum machine learning algorithm based on generative models
Presentation transcript:

Copyright© 2012, D-Wave Systems Inc. 1 Quantum Boltzmann Machine Mohammad Amin D-Wave Systems Inc.

Copyright© 2012, D-Wave Systems Inc. 2 Does D-Wave Return Boltzmann Samples? Copyright© 2015, D-Wave Systems Inc. Correlation between D-Wave and SA equilibrated at  Hen et al., arXiv:

Copyright© 2012, D-Wave Systems Inc. 3 Copyright© 2015, D-Wave Systems Inc. Quantum Machine Learning Can we do with D-Wave

Copyright© 2012, D-Wave Systems Inc. 4 Copyright© 2015, D-Wave Systems Inc. Jason Rolfe Emile Hoskinson Trevor Lanting Yuki Sato Monte Carlo Roger Melko Bohdan Kulchytskyy Collaborators Brandon Denis Evgeny Andriyash Quantum Machine Learning

Copyright© 2012, D-Wave Systems Inc. 5 Boltzmann Machine Copyright© 2015, D-Wave Systems Inc. z i z visible hidden z a   z   z i  Boltzmann distribution: Ising Hamiltonian:

Copyright© 2012, D-Wave Systems Inc. 6 Training Ising Hamiltonian Parameters Copyright© 2015, D-Wave Systems Inc. Clamped averageUnclamped average Gradients can be estimated using sampling!

Copyright© 2012, D-Wave Systems Inc. 7 Question: Copyright© 2015, D-Wave Systems Inc. Ising Hamiltonian Transverse Ising Hamiltonian

Copyright© 2012, D-Wave Systems Inc. 8 Moving to Quantum Copyright© 2015, D-Wave Systems Inc. Hamiltonian (Energy):  

Copyright© 2012, D-Wave Systems Inc. 9 Matrix Representation Copyright© 2015, D-Wave Systems Inc. Partition function:  

Copyright© 2012, D-Wave Systems Inc. 10 Matrix Representation Copyright© 2015, D-Wave Systems Inc. Boltzmann probability:  

Copyright© 2012, D-Wave Systems Inc. 11 Matrix Representation Copyright© 2015, D-Wave Systems Inc. Boltzmann probability: visibles = v visibles ≠ v Projection operator Identity matrix

Copyright© 2012, D-Wave Systems Inc. 12 Transverse Ising Hamiltonian Copyright© 2015, D-Wave Systems Inc. non-diagonal matrix classical Ising Hamiltonian (diagonal matrix)

Copyright© 2012, D-Wave Systems Inc. 13 Quantum Boltzmann Distribution Copyright© 2015, D-Wave Systems Inc. Boltzmann distribution: Projection operator Identity matrix

Copyright© 2012, D-Wave Systems Inc. 14 Gradient Descent - Classical Copyright© 2015, D-Wave Systems Inc. Clamped average Unclamped average  = Classically:

Copyright© 2012, D-Wave Systems Inc. 15 Gradient Descent - Quantum Copyright© 2015, D-Wave Systems Inc. ≠ Gradient cannot be estimated using sampling! Clamped average Unclamped average ≠

Copyright© 2012, D-Wave Systems Inc. 16 Two Useful Properties of Trace Copyright© 2015, D-Wave Systems Inc. Golden-Thompson inequality: For Hermitian matrices A and B

Copyright© 2012, D-Wave Systems Inc. 17 Finding lower bounds Copyright© 2015, D-Wave Systems Inc. Golden-Thompson inequality

Copyright© 2012, D-Wave Systems Inc. 18 Finding lower bounds Copyright© 2015, D-Wave Systems Inc. Golden-Thompson inequality Lower bound for log-likelihood

Copyright© 2012, D-Wave Systems Inc. 19 Calculating the Gradients Copyright© 2015, D-Wave Systems Inc. Minimize the upper bound ???? Unclamped average

Copyright© 2012, D-Wave Systems Inc. 20 Clamped Hamiltonian Copyright© 2015, D-Wave Systems Inc. Infinite energy penalty for states different from v for Visible qubits are clamped to their classical values given by the data

Copyright© 2012, D-Wave Systems Inc. 21 Estimating the Steps Copyright© 2015, D-Wave Systems Inc. Clamped averageUnclamped average We can now use sampling to estimate the steps

Copyright© 2012, D-Wave Systems Inc. 22 Training  a Copyright© 2015, D-Wave Systems Inc. for all visible qubits, thus cannot be estimated from measurements Two problems: Minimizing the upper bound:  cannot be trained using the bound

Copyright© 2012, D-Wave Systems Inc. 23 Example: 10-Qubit QBM Copyright© 2015, D-Wave Systems Inc. Graph: fully connected (K10), fully visible

Copyright© 2012, D-Wave Systems Inc. 24 Example: 10-Qubit QBM Copyright© 2015, D-Wave Systems Inc. Training set: M -modal distribution

Copyright© 2012, D-Wave Systems Inc. 25 Example: 10-Qubit QBM Copyright© 2015, D-Wave Systems Inc. Training set: M -modal distribution Random spin orientation Single qubit: = 90% aligned = 10% not aligned

Copyright© 2012, D-Wave Systems Inc. 26 Example: 10-Qubit QBM Copyright© 2015, D-Wave Systems Inc. Training set: M -modal distribution Random spin orientation Single mode: Hamming distance between v and S k Bernoulli distribution

Copyright© 2012, D-Wave Systems Inc. 27 Example: 10-Qubit QBM Copyright© 2015, D-Wave Systems Inc. Training set: M -modal distribution Random spin orientation Multi-mode: We use p = 0.9, M = 8

Copyright© 2012, D-Wave Systems Inc. 28 Exact Diagonalization Results Copyright© 2015, D-Wave Systems Inc. Classical BM Bound gradient  Exact gradient  is trained   final  KL-divergence:

Copyright© 2012, D-Wave Systems Inc. 29 Training Trajectories Copyright© 2015, D-Wave Systems Inc.

Copyright© 2012, D-Wave Systems Inc. 30 Scaling with Size Copyright© 2015, D-Wave Systems Inc. KL classical  KL quantum averaged over 100 problems

Copyright© 2012, D-Wave Systems Inc. 31 Adding Hidden Variables Copyright© 2015, D-Wave Systems Inc. Clamped averageUnclamped average Computationally expensive for large training sets

Copyright© 2012, D-Wave Systems Inc. 32 Quantum RBM Copyright© 2015, D-Wave Systems Inc. Clamped averageUnclamped average Can be easily calculated

Copyright© 2012, D-Wave Systems Inc. 33 Quantum RBM Copyright© 2015, D-Wave Systems Inc. Effective bias applied to the hiddens:

Copyright© 2012, D-Wave Systems Inc. 34 Example: 10-Qubit QRBM Copyright© 2015, D-Wave Systems Inc. Graph: 8 visibles fully connected (K8) 2 hiddens unconnected

Copyright© 2012, D-Wave Systems Inc. 35 Exact Diagonalization Results Copyright© 2015, D-Wave Systems Inc. Classical positive phase Quantum positive phase

Copyright© 2012, D-Wave Systems Inc. 36 Training Trajectories Copyright© 2015, D-Wave Systems Inc.

Copyright© 2012, D-Wave Systems Inc. 37 Sampling from Conditional Probability Copyright© 2015, D-Wave Systems Inc. Classical BM:  Joint distribution

Copyright© 2012, D-Wave Systems Inc. 38 Sampling from Conditional Probability Copyright© 2015, D-Wave Systems Inc. Classical BM: x clamped to data  Conditional distribution

Copyright© 2012, D-Wave Systems Inc. 39 Sampling from Conditional Probability Copyright© 2015, D-Wave Systems Inc. QBM: ≠ x clamped to data  Conditional distribution

Copyright© 2012, D-Wave Systems Inc. 40 Conditional Distribution Copyright© 2015, D-Wave Systems Inc. projection operators Clamped Hamiltonian Classical BM:

Copyright© 2012, D-Wave Systems Inc. 41 Conditional Distribution Copyright© 2015, D-Wave Systems Inc. projection operators Clamped Hamiltonian QBM: ≠ ? Generative supervised learning can be challenging ≠

Copyright© 2012, D-Wave Systems Inc. 42 Example: 11-Qubit QBM Copyright© 2015, D-Wave Systems Inc. Graph (K11): 8 input qubits 3 output qubits

Copyright© 2012, D-Wave Systems Inc. 43 Exact Diagonalization Results Copyright© 2015, D-Wave Systems Inc. QBM trained by joint distribution Joint distribution

Copyright© 2012, D-Wave Systems Inc. 44 Exact Diagonalization Results Copyright© 2015, D-Wave Systems Inc. Conditional distribution QBM trained by joint distribution

Copyright© 2012, D-Wave Systems Inc. 45 Using D-Wave as a QBM Copyright© 2015, D-Wave Systems Inc. Amin, PRA 92, (2015) Boltzmann distribution Open quantum simulation of 16 qubit QA

Copyright© 2012, D-Wave Systems Inc. 46 Residual Energy vs Annealing Time Copyright© 2015, D-Wave Systems Inc. Frustrated loops (  ) 50 random problems, 100 samples per problem per annealing time Bimodal ( J , h  )

Copyright© 2012, D-Wave Systems Inc. 47 Conclusions: Copyright© 2015, D-Wave Systems Inc. A QBM can use quantum Boltzmann distribution for machine learning Supervised learning with QBM should be done with care A quantum annealer can provide fast samples for QBM training A QBM can be trained by sampling

Copyright© 2012, D-Wave Systems Inc. 48 Copyright© 2015, D-Wave Systems Inc. Please talk to any of us or visit