Quantum Learning Theory Beyond Batch Binary Classification
Arunachalam and de Wolf (2018) showed that the sample complexity of quantum batch learning of boolean functions, in the realizable and agnostic settings, has the same form and order as the corresponding classical sample complexities. In this paper, we extend this, ostensibly surprising, message to batch multiclass learning, online boolean learning, and online multiclass learning. For our online learning results, we first consider an adaptive adversary variant of the classical model of Dawid and Tewari (2022). Then, we introduce the first (to the best of our knowledge) model of online learning with quantum examples.
Code (0)
등록된 구현이 없습니다.
Tasks
Binary ClassificationClassificationLearning TheorySimilar Papers 제목 키워드 기반
Binary Classification with Classical Instances and Quantum Labels
In classical statistical learning theory, one of the most well studied problems is that of binary classification. The information-theoretic sample complexity of this task is tightly characterized by the Vapnik-Chervonenk…
Binary ClassificationClassificationGeneral ClassificationLearning TheoryMulti-class Classification Model Inspired by Quantum Detection Theory
Machine Learning has become very famous currently which assist in identifying the patterns from the raw data. Technological advancement has led to substantial improvement in Machine Learning which, thus helping to improv…
BIG-bench Machine LearningClassificationGeneral ClassificationMulti-class ClassificationProbabilistic Quantum SVM Training on Ising Machine
Quantum computing holds significant potential to accelerate machine learning algorithms, especially in solving optimization problems like those encountered in Support Vector Machine (SVM) training. However, current QUBO-…
Binary ClassificationMulti-class ClassificationNegational Symmetry of Quantum Neural Networks for Binary Pattern Classification
Entanglement is a physical phenomenon, which has fueled recent successes of quantum algorithms. Although quantum neural networks (QNNs) have shown promising results in solving simple machine learning tasks recently, for …
Binary ClassificationClassificationRepresentation LearningEfficient circuit implementation for coined quantum walks on binary trees and application to reinforcement learning
Quantum walks on binary trees are used in many quantum algorithms to achieve important speedup over classical algorithms. The formulation of this kind of algorithms as quantum circuit presents the advantage of being easi…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)