Open Problem: Is There an Online Learning Algorithm That Learns Whenever Online Learning Is Possible?

20 July 2021

Papers citing "Open Problem: Is There an Online Learning Algorithm That Learns Whenever Online Learning Is Possible?"

6 / 6 papers shown

Title
Contextual Bandits and Optimistically Universal Learning Moise Blanchard Steve Hanneke Patrick Jaillet OffRL 19 1 0 31 Dec 2022
Universally Consistent Online Learning with Arbitrarily Dependent Responses Steve Hanneke 13 10 0 11 Mar 2022
Universal Regression with Adversarial Responses Moise Blanchard Patrick Jaillet 21 6 0 09 Mar 2022
Universal Online Learning with Unbounded Losses: Memory Is All You Need Moise Blanchard Romain Cosson Steve Hanneke 20 10 0 21 Jan 2022
Universal Online Learning: an Optimistically Universal Learning Rule Moise Blanchard 19 11 0 16 Jan 2022
Universal Online Learning with Bounded Loss: Reduction to Binary Classification Moise Blanchard Romain Cosson 28 10 0 29 Dec 2021