Quantum Multiple Kernel Learning
- URL: http://arxiv.org/abs/2011.09694v1
- Date: Thu, 19 Nov 2020 07:19:41 GMT
- Title: Quantum Multiple Kernel Learning
- Authors: Seyed Shakib Vedaie, Moslem Noori, Jaspreet S. Oberoi, Barry C.
Sanders, Ehsan Zahedinejad
- Abstract summary: Kernel methods play an important role in machine learning applications due to their conceptual simplicity and superior performance.
One approach to enhancing the expressivity of kernel machines is to combine multiple individual kernels.
We propose quantum MKL, which combines multiple quantum kernels.
- Score: 1.9116668545881028
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Kernel methods play an important role in machine learning applications due to
their conceptual simplicity and superior performance on numerous machine
learning tasks. Expressivity of a machine learning model, referring to the
ability of the model to approximate complex functions, has a significant
influence on its performance in these tasks. One approach to enhancing the
expressivity of kernel machines is to combine multiple individual kernels to
arrive at a more expressive combined kernel. This approach is referred to as
multiple kernel learning (MKL). In this work, we propose an MKL method we refer
to as quantum MKL, which combines multiple quantum kernels. Our method
leverages the power of deterministic quantum computing with one qubit (DQC1) to
estimate the combined kernel for a set of classically intractable individual
quantum kernels. The combined kernel estimation is achieved without explicitly
computing each individual kernel, while still allowing for the tuning of
individual kernels in order to achieve better expressivity. Our simulations on
two binary classification problems---one performed on a synthetic dataset and
the other on a German credit dataset---demonstrate the superiority of the
quantum MKL method over single quantum kernel machines.
Related papers
- Neural auto-designer for enhanced quantum kernels [59.616404192966016]
We present a data-driven approach that automates the design of problem-specific quantum feature maps.
Our work highlights the substantial role of deep learning in advancing quantum machine learning.
arXiv Detail & Related papers (2024-01-20T03:11:59Z) - Quantum Kernel Machine Learning With Continuous Variables [0.0]
The popular qubit framework has dominated recent work on quantum kernel machine learning.
There is no comparative framework to understand these concepts for continuous variable (CV) quantum computing platforms.
arXiv Detail & Related papers (2024-01-11T03:49:40Z) - A Unified Framework for Trace-induced Quantum Kernels [0.0]
Quantum kernel methods are promising candidates for achieving a practical quantum advantage for certain machine learning tasks.
In this work we combine all trace-induced quantum kernels into a common framework.
We show numerically that models based on local projected kernels can achieve comparable performance to the global fidelity quantum kernel.
arXiv Detail & Related papers (2023-11-22T17:50:00Z) - Quantum-Classical Multiple Kernel Learning [0.0]
Kernel methods in machine learning is one area where such improvements could be realized in the future.
Small and noisy quantum computers can evaluate classically-parametric quantum kernels that capture unique notions of similarity in data.
We consider pairwise combinations of classical, quantum-quantum, quantum-classical and QC kernels in the context of multiple kernel (MKL)
We show this approach to be effective for enhancing various metrics performance in an MKL setting.
arXiv Detail & Related papers (2023-05-28T12:29:04Z) - Multiple Kernel Clustering with Dual Noise Minimization [56.009011016367744]
Multiple kernel clustering (MKC) aims to group data by integrating complementary information from base kernels.
In this paper, we rigorously define dual noise and propose a novel parameter-free MKC algorithm by minimizing them.
We observe that dual noise will pollute the block diagonal structures and incur the degeneration of clustering performance, and C-noise exhibits stronger destruction than N-noise.
arXiv Detail & Related papers (2022-07-13T08:37:42Z) - Noisy Quantum Kernel Machines [58.09028887465797]
An emerging class of quantum learning machines is that based on the paradigm of quantum kernels.
We study how dissipation and decoherence affect their performance.
We show that decoherence and dissipation can be seen as an implicit regularization for the quantum kernel machines.
arXiv Detail & Related papers (2022-04-26T09:52:02Z) - Importance of Kernel Bandwidth in Quantum Machine Learning [3.528111249547925]
We show how optimizing the bandwidth of a quantum kernel can improve the performance of the kernel method from a random guess to being competitive with the best classical methods.
We reproduce negative results and show, through extensive numerical experiments using multiple quantum kernels and classical datasets, that if the kernel bandwidth is optimized, the performance instead improves with growing qubit count.
arXiv Detail & Related papers (2021-11-09T23:23:23Z) - Kernel Continual Learning [117.79080100313722]
kernel continual learning is a simple but effective variant of continual learning to tackle catastrophic forgetting.
episodic memory unit stores a subset of samples for each task to learn task-specific classifiers based on kernel ridge regression.
variational random features to learn a data-driven kernel for each task.
arXiv Detail & Related papers (2021-07-12T22:09:30Z) - Kernel Identification Through Transformers [54.3795894579111]
Kernel selection plays a central role in determining the performance of Gaussian Process (GP) models.
This work addresses the challenge of constructing custom kernel functions for high-dimensional GP regression models.
We introduce a novel approach named KITT: Kernel Identification Through Transformers.
arXiv Detail & Related papers (2021-06-15T14:32:38Z) - Covariant quantum kernels for data with group structure [1.51714450051254]
We introduce a class of quantum kernels that can be used for data with a group structure.
We apply this method to a learning problem on a coset-space that embodies the structure of many essential learning problems on groups.
arXiv Detail & Related papers (2021-05-07T17:38:58Z) - SimpleMKKM: Simple Multiple Kernel K-means [49.500663154085586]
We propose a simple yet effective multiple kernel clustering algorithm, termed simple multiple kernel k-means (SimpleMKKM)
Our criterion is given by an intractable minimization-maximization problem in the kernel coefficient and clustering partition matrix.
We theoretically analyze the performance of SimpleMKKM in terms of its clustering generalization error.
arXiv Detail & Related papers (2020-05-11T10:06:40Z)
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.