March 7, 2024, 5:42 a.m. | Ashwin Nayak, Pulkit Sinha

cs.LG updates on arXiv.org arxiv.org

arXiv:2403.03295v1 Announce Type: cross
Abstract: A basic question in the PAC model of learning is whether proper learning is harder than improper learning. In the classical case, there are examples of concept classes with VC dimension $d$ that have sample complexity $\Omega\left(\frac d\epsilon\log\frac1\epsilon\right)$ for proper learning with error $\epsilon$, while the complexity for improper learning is O$\!\left(\frac d\epsilon\right)$. One such example arises from the Coupon Collector problem.
Motivated by the efficiency of proper versus improper learning with quantum samples, Arunachalam, …

abstract arxiv basic case complexity concept cs.cc cs.lg epsilon error examples quant-ph quantum question sample type

Data Engineer

@ Lemon.io | Remote: Europe, LATAM, Canada, UK, Asia, Oceania

Artificial Intelligence – Bioinformatic Expert

@ University of Texas Medical Branch | Galveston, TX

Lead Developer (AI)

@ Cere Network | San Francisco, US

Research Engineer

@ Allora Labs | Remote

Ecosystem Manager

@ Allora Labs | Remote

Founding AI Engineer, Agents

@ Occam AI | New York