QUANT-PHLGMLJun 16, 2021

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

arXiv:2106.09028v28 citations
AI Analysis

This addresses computational bottlenecks in kernel-based classification for machine learning practitioners, though it appears incremental as it combines existing quantum acceleration with optimized random features.

The paper tackles the computational hardness of sampling optimized random features for kernel-based classification and the failure to achieve exponential error convergence under low-noise conditions. The result is a quantum-accelerated algorithm that achieves exponential error convergence while maintaining the feature reduction benefits of optimized random features.

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes