The paper proves opt_ag,weak(F, eta) = O((k ln k) opt_std(F) + k eta), matching the known lower bound, and develops a new operation-caps model for mistake-bounded online learning.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Mistake-bounded online learning with operation caps
The paper proves opt_ag,weak(F, eta) = O((k ln k) opt_std(F) + k eta), matching the known lower bound, and develops a new operation-caps model for mistake-bounded online learning.