11 citations · 26 across the 26 of their papers we have counts for
Showing 2026 · stat.MLShow all
2 papers · 2 filters
stat.ML2026
Classification Fields: Arbitrarily Fine Recursive Hierarchical Clustering From Few Examples
Yicen Li, Ruiyang Hong, Anastasis Kratsios +2
Classical clustering methods usually return either a finite partition of the observed data or a finite dendrogram over it. This finite-sample view is inadequate when the hierarchy…
stat.ML2026
Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity
Anastasis Kratsios, Gregory Cousins, Haitz Sáez de Ocáriz Borde +2
We show that, in a precise sense, a broad class of feedforward neural networks learn (have finite sample complexity) in the PAC model: every fixed finite feedforward architecture w…