1 citations · 2 across the 12 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.LG2023
Simple online learning with consistent oracle
Alexander Kozachinskiy, Tomasz Steifer
We consider online learning in the model where a learning algorithm can access the class only via the \emph{consistent oracle} -- an oracle, that, at any moment, can give a functio…
cs.CC2023
Find a witness or shatter: the landscape of computable PAC learning
Valentino Delle Rose, Alexander Kozachinskiy, Cristobal Rojas +1
This paper contributes to the study of CPAC learnability -- a computable version of PAC learning -- by solving three open questions from recent papers. Firstly, we prove that every…