Learnability in Valiant's model holds exactly when positive samples admit poly-size adaptive query-compression certification, strictly between PAC and query-free variants, with a poly(d) sample/query algorithm for d-dimensional halfspaces.
The true sample complexity of active learning
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
What is Learnable in Valiant's Theory of the Learnable?
Learnability in Valiant's model holds exactly when positive samples admit poly-size adaptive query-compression certification, strictly between PAC and query-free variants, with a poly(d) sample/query algorithm for d-dimensional halfspaces.