Paper

Near-Optimal Sample Complexity of Deterministic Agnostic PAC Learning · ByteTrail