P-sufficient statistics for PAC learning k-term-DNF formulas through enumeration
From MaRDI portal
Publication:1978498
DOI10.1016/S0304-3975(98)00215-1zbMATH Open0939.68056MaRDI QIDQ1978498FDOQ1978498
Authors: Claudio Gentile, B. Apolloni 
Publication date: 4 June 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
computational complexitynonparametric statisticsBoolean functionconcept learningsufficient statisticslearning by examples
Cites Work
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- On the density of families of sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Learnability and the Vapnik-Chervonenkis dimension
- A formal theory of inductive inference. Part I
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Constant depth circuits, Fourier transform, and learnability
- A theory of the learnable
- A general lower bound on the number of examples needed for learning
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient noise-tolerant learning from statistical queries
- Title not available (Why is that?)
- Computational limitations on learning from examples
- Fast learning of \(k\)-term DNF formulas with queries.
- Some Principles of the Theory of Testing Hypotheses
- PAC learning of concept classes through the boundaries of their items
- Title not available (Why is that?)
- Learning Monotone Boolean Functions by Uniformly Distributed Examples
- Title not available (Why is that?)
This page was built for publication: \(P\)-sufficient statistics for PAC learning \(k\)-term-DNF formulas through enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978498)
