Support Vector Machine (SVM) is a popular supervised Machine Learning (ML) method that is widely used for classification and regression problems. Recently, a method to train SVMs on a D-Wave 2000Q Quantum Annealer (QA) was proposed for binary classification of some biological data. First, ensembles of weak quantum SVMs are generated by training each classifier on a disjoint training subset that can be fit into the QA. Then, the computed weak solutions are fused for making predictions on unseen data. In this work, the classification of Remote Sensing (RS) multispectral images with SVMs trained on a QA is discussed. Furthermore, an open code repository is released to facilitate an early entry into the practical application of QA, a new disruptive compute technology.
Support Vector Machine (SVM) is a popular supervised Machine Learning (ML) method that is widely used for classification and regression problems. Recently, a method to train SVMs on a D-Wave 2000Q Quantum Annealer (QA) was proposed for binary classification of some biological data. First, ensembles of weak quantum SVMs are generated by training each classifier on a disjoint training subset that can be fit into the QA. Then, the computed weak solutions are fused for making predictions on unseen data. In this work, the classification of Remote Sensing (RS) multispectral images with SVMs trained on a QA is discussed. Furthermore, an open code repository is released to facilitate an early entry into the practical application of QA, a new disruptive compute technology.
Kernel-based support vector machines (SVMs) are supervised machine learning algorithms for classification and regression problems. We introduce a method to train SVMs on a D-Wave 2000Q quantum annealer and study its performance in comparison to SVMs trained on conventional computers. The method is applied to both synthetic data and real data obtained from biology experiments. We find that the quantum annealer produces an ensemble of different solutions that often generalizes better to unseen data than the single global minimum of an SVM trained on a conventional computer, especially in cases where only limited training data is available. For cases with more training data than currently fits on the quantum annealer, we show that a combination of classifiers for subsets of the data almost always produces stronger joint classifiers than the conventional SVM for the same parameters.
In recent years, the development of quantum annealers has enabled experimental demonstrations and has increased research interest in applications of quantum annealing, such as in quantum machine learning and in particular for the popular quantum SVM. Several versions of the quantum SVM have been proposed, and quantum annealing has been shown to be effective in them. Extensions to multiclass problems have also been made, which consist of an ensemble of multiple binary classifiers. This work proposes a novel quantum SVM formulation for direct multiclass classification based on quantum annealing, called Quantum Multiclass SVM (QMSVM). The multiclass classification problem is formulated as a single Quadratic Unconstrained Binary Optimization (QUBO) problem solved with quantum annealing. The main objective of this work is to evaluate the feasibility, accuracy, and time performance of this approach. Experiments have been performed on the D-Wave Advantage quantum annealer for a classification problem on remote sensing data. The results indicate that, despite the memory demands of the quantum annealer, QMSVM can achieve accuracy that is comparable to standard SVM methods and, more importantly, it scales much more efficiently with the number of training examples, resulting in nearly constant time. This work shows an approach for bringing together classical and quantum computation, solving practical problems in remote sensing with current hardware.
In recent years, the development of quantum annealers has enabled experimental demonstrations and has increased research interest in applications of quantum annealing, such as in quantum machine learning and in particular for the popular quantum Support Vector Machine (SVM). Several versions of the quantum SVM have been proposed, and quantum annealing has been shown to be effective in them. Extensions to multiclass problems have also been made, which consist of an ensemble of multiple binary classifiers. This work proposes a novel quantum SVM formulation for direct multiclass classification based on quantum annealing, called Quantum Multiclass SVM (QMSVM). The multiclass classification problem is formulated as a single quadratic unconstrained binary optimization problem solved with quantum annealing. The main objective of this work is to evaluate the feasibility, accuracy, and time performance of this approach. Experiments have been performed on the D-Wave Advantage quantum annealer for a classification problem on remote sensing data. Results indicate that, despite the memory demands of the quantum annealer, QMSVM can achieve an accuracy that is comparable to standard SVM methods, such as the one-versus-one (OVO), depending on the dataset (compared to OVO: 0.8663 vs 0.8598 on Toulouse, 0.8123 vs 0.8521 on Potsdam). More importantly, it scales much more efficiently with the number of training examples, resulting in nearly constant time (compared to OVO: 85.72s vs 248.02s on Toulouse, 58.89s vs 580.17s on Potsdam). This work shows an approach for bringing together classical and quantum computation, solving practical problems in remote sensing with current hardware.
Machine Learning (ML) techniques are employed to analyze and process big Remote Sensing (RS) data, and one well-known ML technique is a Support Vector Machine (SVM). An SVM is a quadratic programming (QP) problem, and a D-Wave quantum annealer (D-Wave QA) promises to solve this QP problem more efficiently than a conventional computer. However, the D-Wave QA cannot solve directly the SVM due to its very few input qubits. Hence, we use a coreset ("core of a dataset") of given EO data for training an SVM on this small D-Wave QA. The coreset is a small, representative weighted subset of an original dataset, and any training models generate competitive classes by using the coreset in contrast to by using its original dataset. We measured the closeness between an original dataset and its coreset by employing a Kullback-Leibler (KL) divergence measure. Moreover, we trained the SVM on the coreset data by using both a D-Wave QA and a conventional method. We conclude that the coreset characterizes the original dataset with very small KL divergence measure. In addition, we present our KL divergence results for demonstrating the closeness between our original data and its coreset. As practical RS data, we use Hyperspectral Image (HSI) of Indian Pine, USA.
Machine Learning (ML) techniques are employed to analyze and process big Remote Sensing (RS) data, and one well-known ML technique is a Support Vector Machine (SVM). An SVM is a quadratic programming (QP) problem, and a D-Wave quantum annealer (D-Wave QA) promises to solve this QP problem more efficiently than a conventional computer. However, the D-Wave QA cannot solve directly the SVM due to its very few input qubits. Hence, we use a coreset ("core of a dataset") of given EO data for training an SVM on this small D-Wave QA. The coreset is a small, representative weighted subset of an original dataset, and any training models generate competitive classes by using the coreset in contrast to by using its original dataset. We measured the closeness between an original dataset and its coreset by employing a Kullback-Leibler (KL) divergence measure. Moreover, we trained the SVM on the coreset data by using both a D-Wave QA and a conventional method. We conclude that the coreset characterizes the original dataset with very small KL divergence measure. In addition, we present our KL divergence results for demonstrating the closeness between our original data and its coreset. As practical RS data, we use Hyperspectral Image (HSI) of Indian Pine, USA
The increasing complexity and volume of remote sensing data necessitate advanced computational techniques for efficient and accurate image classification. This study explores the efficacy of Quantum Annealing based Support Vector Machines (QASVM) in comparison to classical Support Vector Machines (SVM) for classifying cloud features in remote sensing images. Quantum annealing, leveraging principles of quantum mechanics, promises to solve optimization problems more efficiently and accurately than classical methods, particularly in high-dimensional data spaces typical of remote sensing applications. Our experimental framework involved the classification of cloud features using a comprehensive dataset of Indian Nano Satellite (INS-2B) Nano-MX satellite imagery. The QA-SVM is implemented on a D-Wave quantum annealer based on the Adiabatic Quantum Computation (AQC) model, while the classical SVM utilizes a traditional computing setup. Performance metrics, including overall accuracy and F1 score, are evaluated. The results demonstrated that QA-SVM achieved higher overall accuracy and F1 score compared to its classical counterpart on the Nano-MX test image. It is found that the overall accuracy of QA-SVM is increased by 6.7% while the F1 score is increased by 4.5% with respect to classical SVM. This performance gain is attributed to the quantum annealer’s ability to explore a vast solution space more effectively, avoiding local minima that often hinder classical SVMs.