Model theory and agnostic online learning via excellent sets
From MaRDI portal
Publication:6629474
Cites work
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- scientific article; zbMATH DE number 878896 (Why is no real title available?)
- Adversarial laws of large numbers and optimal regret in online classification
- Classification theory and the number of non-isomorphic models
- Encoding orders and trees in binary relations
- MODEL THEORY AND MACHINE LEARNING
- NOTES ON THE STABLE REGULARITY LEMMA
- On the density of families of sets
- On uniform definability of types over finite sets for NIP formulas
- Online learning via sequential complexities
- Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks
- Private PAC learning implies finite Littlestone dimension
- Regularity lemmas for stable graphs
- Regularity partitions and the topology of graphons
- Sequential complexities and uniform martingale laws of large numbers
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
- Stable arithmetic regularity in the finite field model
- THICKET DENSITY
- The Algorithmic Aspects of the Regularity Lemma
- The stable regularity lemma revisited
- The weighted majority algorithm
- Understanding machine learning. From theory to algorithms
- Vapnik-Chervonenkis Classes of Definable Sets
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)
