Skip to content

Author

Amirreza Shaeiri

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Nov 2026

Near-Optimal Sample Complexity of Deterministic Agnostic PAC Learning

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$. This model captures misspecification without stochastic label noise and lies between the realizable and fully agnostic settings...

S. Ben-David, Steve Hanneke, Farnam Mansouri et al. · 0 citations
#machine learning Preprint Nov 2026

PAC Learning with Multiple Correct Answers

The main finding is that demonstrations can be much harder than full sets, and even than bandit feedback, both in which classes can be learned and in how many examples are needed.

Steve Hanneke, Farnam Mansouri, Alireza F. Pour et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.