no code implementations • 5 Jan 2023 • Shima Bab Hadiashar, Ashwin Nayak, Pulkit Sinha
In this paper, we derive optimal lower bounds for quantum sample complexity in both the PAC and agnostic models via an information-theoretic approach.
Learning Theory PAC learning