no code implementations • 8 Feb 2023 • Niki Hasrati, Shai Ben-David
Finally, we consider online learning with no requirements for optimality, and show, under a weaker notion of computability, that the finiteness of the Littlestone dimension no longer characterizes whether a class is c-online learnable with finite mistake bound.
