Attribute-efficient learning in query and mistake-bound models
From MaRDI portal
Cites work
- An explicit construction of short monotone formulae for the monotone symmetric functions
- Attribute-efficient learning in query and mistake-bound models
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- scientific article; zbMATH DE number 1261820 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- Learning Boolean functions in an infinite attribute space
- Learning in the presence of finitely or infinitely many irrelevant attributes
- Learning read-once formulas with queries
- Optimal depth, very small size circuits for symmetric functions in \(AC^ 0\)
- Parity, circuits, and the polynomial-time hierarchy
- Queries and concept learning
- Storing a Sparse Table with 0 (1) Worst Case Access Time
Cited in
(11)- Attribute-efficient learning in query and mistake-bound models
- On parallel attribute-efficient learning.
- More efficient PAC-learning of DNF with membership queries under the uniform distribution
- Identification of partial disjunction, parity, and threshold functions
- Revising threshold functions
- Learning attribute-efficiently with corrupt oracles
- Exact learning from an honest teacher that answers membership queries
- Computational sample complexity and attribute-efficient learning
- Approximating the number of relevant variables in a parity implies proper learning
- Theory revision with queries: Horn, read-once, and parity formulas
- Learning conditional preference networks
This page was built for publication: Attribute-efficient learning in query and mistake-bound models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1271616)
