0
$\begingroup$

I have been looking for theoretical papers studying this question of the fundamental hardness of PAC active learning algorithms. I found a few papers studying the problem from a fixed perspective (particular hypothesis class) but not agnostic with respect to the hypothesis class and the realizable distribution. Can you suggest some papers or seminar talk that studies the problem from a general perspective?

Improve this question
$\endgroup$
1
  • $\begingroup$ probably should ask on cstheory stack exchange $\endgroup$
    – mathworker21
    Commented Oct 20, 2023 at 8:08

0

Reset to default

Browse other questions tagged or ask your own question.