An agnostic PAC learner attains excess risk L* + C(√(L*d'/n) + d'/n) with d' = d + log(1/δ), matching known lower bounds up to constants.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
An Optimal Agnostic PAC Algorithm
An agnostic PAC learner attains excess risk L* + C(√(L*d'/n) + d'/n) with d' = d + log(1/δ), matching known lower bounds up to constants.