pith. sign in

Letν(h)be the deepest node reached

For each hypothesish∈ H, associate a nodeν(h)obtained by traversingTfrom the root according to the predictions ofh, stopping when no outgoing edge is consistent withh

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

fields

cs.LG 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Learning from Equivalence Queries, Revisited

cs.LG · 2026-04-06 · unverdicted · novelty 6.0

Tight bounds on the number of rounds are obtained for learning from equivalence queries under symmetric counterexample generators in full-information and bandit settings.

citing papers explorer

Showing 1 of 1 citing paper.

  • Learning from Equivalence Queries, Revisited cs.LG · 2026-04-06 · unverdicted · none · ref 5

    Tight bounds on the number of rounds are obtained for learning from equivalence queries under symmetric counterexample generators in full-information and bandit settings.