Model theory and agnostic online learning via excellent sets

DOI10.1090/TRAN/9235MaRDI QIDQ6629474FDOQ6629474

S. Moran, M. Malliaris

Publication date: 30 October 2024

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Mathematics Subject Classification ID

Model theory (03Cxx) Combinatorics (05-XX)

Cites Work

• On the density of families of sets
• Understanding Machine Learning
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The weighted majority algorithm
• Classification theory and the number of non-isomorphic models
• Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
• Regularity partitions and the topology of graphons
• Vapnik-Chervonenkis Classes of Definable Sets
• The Algorithmic Aspects of the Regularity Lemma
• Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks
• On uniform definability of types over finite sets for NIP formulas
• Sequential complexities and uniform martingale laws of large numbers
• Title not available (Why is that?)
• Encoding orders and trees in binary relations
• THICKET DENSITY
• Regularity lemmas for stable graphs
• Stable arithmetic regularity in the finite field model
• MODEL THEORY AND MACHINE LEARNING
• Private PAC learning implies finite Littlestone dimension
• The stable regularity lemma revisited
• NOTES ON THE STABLE REGULARITY LEMMA
• Adversarial laws of large numbers and optimal regret in online classification

This page was built for publication: Model theory and agnostic online learning via excellent sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6629474)