Browsing by Author "Kozachinskiy, Alexander"

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    Find a witness or shatter: the landscape of computable PAC learning
    (2023) Delle Rose, Valentino; Kozachinskiy, Alexander; Rojas González, Luis Cristóbal; Steifer, Tomasz
    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 improperly CPAC learnable class is contained in a class which is properly CPAC learnable with polynomial sample complexity. This confirms a conjecture by Agarwal et al (COLT 2021). Secondly, we show that there exists a decidable class of hypothesis which is properly CPAC learnable, but only with uncomputably fast growing sample complexity. This solves a question from Sterkenburg (COLT 2022). Finally, we construct a decidable class of finite Littlestone dimension which is not improperly CPAC learnable, strengthening a recent result of Sterkenburg (2022) and answering a question posed by Hasrati and Ben-David (ALT 2023). Together with previous work, our results provide a complete landscape for the learnability problem in the CPAC setting.
  • Thumbnail Image
    Item
    Three iterations of (d − 1)-WL test distinguish non isometric clouds of d-dimensional points
    (2023) Delle Rose, Valentino; Kozachinskiy, Alexander; Rojas González, Luis Cristóbal; Petrache, Mircea Alexandru; Barceló Baeza, Pablo
    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 neural network architectures, whose capabilities and performance can be understood in terms of the expressive power of this test. Motivated by recent developments in machine learning applications to datasets involving three-dimensional objects, we study when the WL test is {\em complete} for clouds of euclidean points represented by complete distance graphs, i.e., when it can distinguish, up to isometry, any arbitrary such cloud.Our main result states that the (d−1)-dimensional WL test is complete for point clouds in d-dimensional Euclidean space, for any d≥2, and that only three iterations of the test suffice. Our result is tight for d=2,3. We also observe that the d-dimensional WL test only requires one iteration to achieve completeness.