Quantum machine learning: a classical perspective

C Ciliberto, M Herbster, AD Ialongo… - … of the Royal …, 2018 - royalsocietypublishing.org
Recently, increased computational power and data availability, as well as algorithmic
advances, have led machine learning (ML) techniques to impressive results in regression …

Recent advances in algorithmic high-dimensional robust statistics

I Diakonikolas, DM Kane - arxiv preprint arxiv:1911.05911, 2019 - arxiv.org
Learning in the presence of outliers is a fundamental problem in statistics. Until recently, all
known efficient unsupervised learning algorithms were very sensitive to outliers in high …

Quantum variational algorithms are swamped with traps

ER Anschuetz, BT Kiani - Nature Communications, 2022 - nature.com
One of the most important properties of classical neural networks is how surprisingly
trainable they are, though their training algorithms typically rely on optimizing complicated …

Selection of relevant features and examples in machine learning

AL Blum, P Langley - Artificial intelligence, 1997 - Elsevier
In this survey, we review work in machine learning on methods for handling data sets
containing large amounts of irrelevant information. We focus on two key issues: the problem …

Exponentially tighter bounds on limitations of quantum error mitigation

Y Quek, D Stilck França, S Khatri, JJ Meyer, J Eisert - Nature Physics, 2024 - nature.com
Quantum error mitigation has been proposed as a means to combat unwanted and
unavoidable errors in near-term quantum computing without the heavy resource overheads …

The merged-staircase property: a necessary and nearly sufficient condition for sgd learning of sparse functions on two-layer neural networks

E Abbe, EB Adsera… - Conference on Learning …, 2022 - proceedings.mlr.press
It is currently known how to characterize functions that neural networks can learn with SGD
for two extremal parametrizations: neural networks in the linear regime, and neural networks …

[BOOK][B] An introduction to computational learning theory

MJ Kearns, U Vazirani - 1994 - books.google.com
Emphasizing issues of computational efficiency, Michael Kearns and Umesh Vazirani
introduce a number of central topics in computational learning theory for researchers and …

What can we learn privately?

SP Kasiviswanathan, HK Lee, K Nissim… - SIAM Journal on …, 2011 - SIAM
Learning problems form an important category of computational tasks that generalizes many
of the computations researchers apply to large real-life data sets. We ask, What concept …

Efficient noise-tolerant learning from statistical queries

M Kearns - Journal of the ACM (JACM), 1998 - dl.acm.org
In this paper, we study the problem of learning in the presence of classification noise in the
probabilistic learning model of Valiant and its variants. In order to identify the class of …

Noise-tolerant learning, the parity problem, and the statistical query model

A Blum, A Kalai, H Wasserman - Journal of the ACM (JACM), 2003 - dl.acm.org
We describe a slightly subexponential time algorithm for learning parity functions in the
presence of random classification noise, a problem closely related to several cryptographic …