FPGA-Based QBoost with Large-Scale Annealing Processor and Accelerated Hyperparameter Search

QBoost is a recently proposed machine learning algorithm, designed to exploit the benefits of emerging annealing processors which solve NP hard problems in combinatorial optimization a hundred times faster than conventional CPUs. In this paper, we present the first FPGA-based implementation of QBoost, incorporating a large-scale annealing processor with 2704 spins. In contrast to previous implementations, based on quantum annealers, we utilize the flexibility of FPGAs for implementing a fast, integrated QBoost engine which combines the annealing processor and the modules of the hyperparameter search on a single FPGA. As opposed to quantum annealers, this accelerates the time required for scanning the hyperparameter space from the order of hours to a single second.

[1]  S. V. N. Vishwanathan,et al.  Robust Classification with Adiabatic Quantum Optimization , 2012, ICML.

[2]  J. Friedman Greedy function approximation: A gradient boosting machine. , 2001 .

[3]  Masanao Yamaoka,et al.  Implementation and Evaluation of FPGA-based Annealing Processor for Ising Model by use of Resource Sharing , 2017, Int. J. Netw. Comput..

[4]  Hartmut Neven,et al.  Training a Large Scale Classifier with the Quantum Adiabatic Algorithm , 2009, ArXiv.

[5]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[6]  E. Farhi,et al.  A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem , 2001, Science.

[7]  Ken-ichi Kawarabayashi,et al.  A coherent Ising machine for 2000-node optimization problems , 2016, Science.

[8]  Kazuyuki Aihara,et al.  A fully programmable 100-spin coherent Ising machine with all-to-all connections , 2016, Science.

[9]  Ryan Babbush,et al.  Construction of non-convex polynomial loss functions for training a binary classifier with quantum annealing , 2014, ArXiv.

[10]  Óscar Promio Muñoz Quantum Annealing in the transverse Ising Model , 2018 .

[11]  Vasil S. Denchev,et al.  Training a Binary Classifier with the Quantum Adiabatic Algorithm , 2008, 0811.0416.

[12]  Yoav Freund,et al.  A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.

[13]  Vicky Choi,et al.  Minor-embedding in adiabatic quantum computation: I. The parameter setting problem , 2008, Quantum Inf. Process..

[14]  Leo Breiman,et al.  Random Forests , 2001, Machine Learning.

[15]  Andrew Lucas,et al.  Ising formulations of many NP problems , 2013, Front. Physics.

[16]  M. W. Johnson,et al.  Quantum annealing with manufactured spins , 2011, Nature.

[17]  Supratik Mukhopadhyay,et al.  Deploying a quantum annealing processor to detect tree cover in aerial imagery of California , 2017, PloS one.

[18]  Yoshua Bengio,et al.  Gradient-based learning applied to document recognition , 1998, Proc. IEEE.

[19]  Hiroyuki Mizuno,et al.  A 20k-Spin Ising Chip to Solve Combinatorial Optimization Problems With CMOS Annealing , 2016, IEEE Journal of Solid-State Circuits.