arXiv Machine Learning By Shai Ben-David, Steve Hanneke, Farnam Mansouri, Amirreza Shaeiri

Near-Optimal Sample Complexity of Deterministic Agnostic PAC Learning

Read the original on arXiv Machine Learning →

arXiv:2611. 13210v1 Announce Type: cross Abstract: We study the problem of agnostic PAC learning under deterministic labels, where the examples are labeled by an arbitrary deterministic function, which need not belong to the concept class $C$.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.