2 citations · 2 across the 16 of their papers we have counts for
3 papers · 1 filter
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…
Three iterations of -WL test distinguish non isometric clouds of -dimensional points
Valentino Delle Rose, Alexander Kozachinskiy, Cristóbal Rojas +2
The Weisfeiler--Lehman (WL) test is a fundamental iterative algorithm for checking isomorphism of graphs. It has also been observed that it underlies the design of several graph ne…
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…