Vapnik-Chervonenkis Classes of Definable Sets
From MaRDI portal
(Redirected from Publication:4024901)
Recommendations
Cited in
(46)- Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes
- Approximation and learning of convex superpositions
- PAC-learning from general examples
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
- Toward classifying unstable theories
- dp-rank and forbidden configurations
- VC density of definable families over valued fields
- Uniformly supported approximate equilibria in families of games
- On VC-density in VC-minimal theories
- Interpreting nowhere dense graph classes as a classical notion of model theory
- Continuous and random Vapnik-Chervonenkis classes
- Approximating volumes and integrals in o-minimal and p-minimal theories
- Vapnik-Chervonenkis density in some theories without the independence property. I
- A paper that created three new fields: Teoriya Veroyatnosteĭ i Ee Primeneniya 16(2), 1971, pp. 264-279
- Structures having o-minimal open core
- Vapnik-Chervonenkis density in some theories without the independence property. II
- A remark on Vapnik-Chervonienkis classes
- Pseudovaluation domains with vapnik-chervonenkis classes of definable sets
- Stability theory, permutations of indiscernibles, and embedded finite models
- Weakly o-minimal structures and real closed fields
- Computability of validity and satisfiability in probability logics over finite and countable models
- Definably amenable NIP groups
- THICKET DENSITY
- The dynamical hierarchy for Roelcke precompact Polish groups
- MODEL THEORY AND COMBINATORICS OF BANNED SEQUENCES
- A unified approach to structural limits and limits of graphs with bounded tree-depth
- Ramsey growth in some NIP structures
- Existence of modeling limits for sequences of sparse structures
- MODEL THEORY AND MACHINE LEARNING
- Externally definable sets and dependent pairs. II
- Model theory in algebra, analysis and arithmetic: a preface
- Regularity lemmas for stable graphs
- On Vapnik‐Chervonenkis density over indiscernible sequences
- scientific article; zbMATH DE number 5270689 (Why is no real title available?)
- THE WEAK VOPĚNKA PRINCIPLE FOR DEFINABLE CLASSES OF STRUCTURES
- Ranks based on strong amalgamation Fraïssé classes
- From undecidability of non-triviality and finiteness to undecidability of learnability
- Neural network learning and quantum gravity
- Glivenko-Cantelli classes and \textit{NIP} formulas
- Model theory and agnostic online learning via excellent sets
- Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks
- The generic multiverse is not going away
- Aggregate operators in constraint query languages
- Universal definability of Mal'tsev classes
- Vapnik-Chervonenkis density on indiscernible sequences, stability, and the maximum property
- Compression schemes, stable definable families, and o-minimal structures
This page was built for publication: Vapnik-Chervonenkis Classes of Definable Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4024901)