Skip to content
Sagan

Paper

PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting

Unreadunread

AI summary

arXiv:2605. 25678v1 Announce Type: new Abstract: We study the problem of multiclass PAC learning with bandit feedback in the realizable setting.