A hypothesis class is learnable in this online precision-recall feedback model if and only if it has finite VC dimension, with algorithms achieving regret bounds in realizable and agnostic settings despite ERM failing.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.LG 2years
2026 2verdicts
UNVERDICTED 2roles
method 1polarities
use method 1representative citing papers
A dynamic pruning reduction from agnostic to realizable online learning via weak-consistency oracles achieves O(T^{d_VC+1}) query complexity with near-optimal regret and supplies matching upper and lower bounds on the regret-oracle tradeoff.
citing papers explorer
-
Online Set Learning from Precision and Recall Feedback
A hypothesis class is learnable in this online precision-recall feedback model if and only if it has finite VC dimension, with algorithms achieving regret bounds in realizable and agnostic settings despite ERM failing.
-
Regret-Oracle Complexity Tradeoffs in Agnostic Online Learning
A dynamic pruning reduction from agnostic to realizable online learning via weak-consistency oracles achieves O(T^{d_VC+1}) query complexity with near-optimal regret and supplies matching upper and lower bounds on the regret-oracle tradeoff.