Probably Approximate Learning of Sets and Functions
From MaRDI portal
Publication:3210201
DOI10.1137/0220021zbMath0722.68093OpenAlexW2061729190MaRDI QIDQ3210201
Publication date: 1991
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0220021
Related Items (29)
Advanced elementary formal systems. ⋮ Decision lists over regular patterns. ⋮ Embeddings and the trace of finite sets ⋮ First-order \(jk\)-clausal theories are PAC-learnable ⋮ The learnability of voting rules ⋮ Fusion methods for multiple sensor systems with unknown error densities ⋮ Multi-class pattern classification using neural networks ⋮ Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers ⋮ Witness sets for families of binary vectors ⋮ A sufficient condition for polynomial distribution-dependent learnability ⋮ Learning distributions by their density levels: A paradigm for learning without a teacher ⋮ On the complexity of learning from drifting distributions ⋮ Learning nested differences in the presence of malicious noise ⋮ A framework for incremental learning of logic programs ⋮ Learning reliably and with one-sided error ⋮ Measuring teachability using variants of the teaching dimension ⋮ Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions ⋮ Neural networks with quadratic VC dimension ⋮ PAC Learning under Helpful Distributions ⋮ Teaching randomized learners with feedback ⋮ Learning logic programs with structured background knowledge ⋮ Monotone term decision lists ⋮ Theory of Classification: a Survey of Some Recent Advances ⋮ An introduction to some statistical aspects of PAC learning theory ⋮ Learning dynamical systems in a stationary environment ⋮ Exact VC-dimension of Boolean monomials ⋮ Apple tasting. ⋮ Sparse approximate multiquadric interpolation ⋮ Top-down decision tree learning as information based boosting
This page was built for publication: Probably Approximate Learning of Sets and Functions
