8 citations · 11 across the 19 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
math.CO2026
Stable Regularity Lemmas: Efficient Algorithms and Essentially Tight Littlestone Bounds
Leonardo N. Coregliano, Fernando G. Jeronimo
In this paper, we determine the precise asymptotics of the number of parts of stable regularity equipartitions in terms of the Littlestone dimension: every graph of Littlestone…
cs.LG2026
High-arity Sample Compression
Leonardo N. Coregliano, William Opich
Recently, a series of works have started studying variations of concepts from learning theory for product spaces, which can be collected under the name high-arity learning theory.…
math.LO2026
Some model-theoretic consequences of high-arity uniform convergence, part I
Leonardo N. Coregliano, Maryanthe Malliaris
We show that certain families of sets in (or ) which are neither definable nor have bounded VC-dimension are nonetheless uniformly approximately defina…