Author

Markus Engelund Mathiasen

View on Semantic Scholar

1 paper 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 Aug 2026

An Optimal Agnostic PAC Algorithm

This paper settles the sample complexity of agnostic PAC learning up to universal constants at every fixed $L^*$, matching the lower bounds of Devroye, Gyorfi, and Lugosi.

Markus Engelund Mathiasen, Jian Qian, Nikita Zhivotovskiy · 0 citations