Learning with restricted focus of attention
From MaRDI portal
Cites work
- A theory of the learnable
- Constant depth circuits, Fourier transform, and learnability
- Efficient distribution-free learning of probabilistic concepts
- Efficient noise-tolerant learning from statistical queries
- Equivalence of models for polynomial learnability
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Four types of noise in data for PAC learning
- scientific article; zbMATH DE number 193511 (Why is no real title available?)
- scientific article; zbMATH DE number 1256729 (Why is no real title available?)
- scientific article; zbMATH DE number 2077163 (Why is no real title available?)
- Learnability and the Vapnik-Chervonenkis dimension
- Learning Boolean formulas
- Learning by distances
- Learning in the Presence of Malicious Errors
- Learning Integer Lattices
- Learning probabilistic read-once formulas on product distributions
- Noise-tolerant Occam algorithms and their applications to learning decision trees
- On the theory of average case complexity
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Toward efficient agnostic learning
Cited in
(8)- Learning from examples with unspecified attribute values.
- Learning fixed-dimension linear thresholds from fragmented data
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
- On PAC learning algorithms for rich Boolean function classes
- On the complexity of random satisfiability problems with planted solutions
- On the Power of Learning from k-Wise Queries
- Adversarial manifold estimation
- Partial observability and learnability
This page was built for publication: Learning with restricted focus of attention
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1271613)
