Search Results for author:
Found 3 papers, 0 papers with code
Learnability is a Compact Property
Furthermore, the learnability of such problems can fail to be a property of finite character: informally, it cannot be detected by examining finite projections of the problem.
Regularization and Optimal Multiclass Learning
We demonstrate that an agnostic version of the Hall complexity again characterizes error rates exactly, and exhibit an optimal learner using maximum entropy programs.
On computable learning of continuous features
We introduce definitions of computable PAC learning for binary classification over computable metric spaces.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
