Exponential Error Convergence in Data Classification with Optimized Random Features: Acceleration by Quantum Machine Learning

Abstract

Classification is a common task in machine learning. Random features (RFs) stand as a central technique for scalable learning algorithms based on kernel methods, and more recently proposed optimized random features, sampled depending on the model and the data distribution, can significantly reduce and provably minimize the required number of features. However, existing research on classification using optimized RFs has suffered from computational hardness in sampling each optimized RF; moreover, it has failed to achieve the exponentially fast error-convergence speed that other state-of-the-art kernel methods can achieve under a low-noise condition. To overcome these slowdowns, we here construct a classification algorithm with optimized RFs accelerated by means of quantum machine learning (QML) and study its runtime to clarify overall advantage. We prove that our algorithm can achieve the exponential error convergence under the low-noise condition even with optimized RFs; at the same time, our algorithm can exploit the advantage of the significant reduction of the number of features without the computational hardness owing to QML. These results discover a promising application of QML to acceleration of the leading kernel-based classification algorithm without ruining its wide applicability and the exponential error-convergence speed.

arXiv comment42 pages, no figure

References in corpus (16)

• Quantum Machine Learning
• Supervised learning with quantum enhanced feature spaces
• Quantum support vector machine for big data classification
• Quantum random access memory
• Quantum machine learning: a classical perspective
• Architectures for a quantum random access memory
• Generalization Properties of Learning with Random Features
• Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning
• Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees
• Learning with SGD and Random Features
• But How Does It Work in Theory? Linear SVM with Random Features
• Sublinear quantum algorithms for training linear and kernel-based classifiers
• Exponential convergence of testing error for stochastic gradient methods
• Learning with Optimized Random Features: Exponential Speedup by Quantum Machine Learning without Sparsity and Low-Rank Assumptions
• On Sampling Random Features From Empirical Leverage Scores: Implementation and Theoretical Guarantees
• Exponential Convergence Rates of Classification Errors on Learning with SGD and Random Features

Cited by in corpus (1)

• Fock State-enhanced Expressivity of Quantum Machine Learning Models