arXiv Machine Learning
Optimal Quantum-Classical Separations for Exact Learning
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Jul 31
Quantum Speedups for Stochastic Optimization with Heavy-Tailed Noise
arXiv:2607. 25492v2 Announce Type: replace Abstract: We study stochastic optimization with heavy-tailed gradient noise.
arXiv Machine Learning
Sep 25
Bandit Multiclass PAC Learning: Corrected Lower Bounds, Exact Families, and a Confidence Direct-Sum Phenomenon
The paper revisits realizable multiclass PAC learning with bandit feedback, correcting a previously claimed lower bound on sample complexity. It introduces a new anchored dimension, “aBDS,” and establishes a constant‑free three‑part lower bound, while also providing tighter upper bounds that eliminate dependence on the total label count. The authors demonstrate that the optimal sample complexity can vary dramatically even among classes with identical dimensional profiles, revealing a confidence direct‑sum phenomenon and a rank‑saturation phase transition.
arXiv Statistics ML
3d ago
Advantage of Sample Complexity in Quantum PAC Learning Requires Inverse Access to State-Preparation Unitaries
The paper investigates whether having only forward access to a state-preparation unitary—without its inverse—can reduce the number of queries needed for quantum PAC learning. By analyzing worst-case scenarios over all compatible unitaries and finite dimensions, the authors prove that the optimal forward-only query complexities for realizable and agnostic learning are θ((d+log(1/δ))/ε) and θ((d+log(1/δ))/ε²), respectively, matching classical and quantum-copy bounds. These results demonstrate that forward-only access offers no asymptotic advantage over classical data or quantum copies, highlighting the essential role of inverse access for any improvement in the realizable setting.
arXiv Machine Learning
Aug 17
Quantum Multi-Armed Bandits and Linear Bandits: Lower Bounds and Algorithms
arXiv:2608. 14319v1 Announce Type: new Abstract: We study quantum multi-armed bandits (QMAB) and quantum linear bandits (QLB) in the model of Wan et al.
arXiv Machine Learning
Jun 11
Quantum Occam Learning: Sample-Supported Expressibility for Circuit-Based Quantum Learning
arXiv:2606. 12211v1 Announce Type: cross Abstract: A central principle in quantum machine learning is that an ansatz should be expressive enough to represent the quantum data of interest.
arXiv Machine Learning
Aug 26
Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
arXiv:2510.06848v3 Announce Type: replace-cross Abstract: Bell sampling is a simple yet powerful tool based on measuring two copies of a quantum state in the Bell basis, and has found applications in...