Learning with restricted focus of attention
From MaRDI portal
Publication:1271613
DOI10.1006/jcss.1998.1569zbMath0945.68531OpenAlexW2010549883MaRDI QIDQ1271613
Shai Ben-David, Eli Dichterman
Publication date: 27 September 2000
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1998.1569
Related Items (11)
On the Complexity of Random Satisfiability Problems with Planted Solutions ⋮ On the Power of Learning from k-Wise Queries ⋮ On PAC learning algorithms for rich Boolean function classes ⋮ Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces ⋮ Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization ⋮ Adversarial manifold estimation ⋮ Learning from examples with unspecified attribute values. ⋮ Learning figures with the Hausdorff metric by fractals -- towards computable binary classification ⋮ Partial observability and learnability ⋮ A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry ⋮ Learning fixed-dimension linear thresholds from fragmented data
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Four types of noise in data for PAC learning
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Equivalence of models for polynomial learnability
- On the theory of average case complexity
- Learning probabilistic read-once formulas on product distributions
- Efficient distribution-free learning of probabilistic concepts
- Toward efficient agnostic learning
- Learning by distances
- Noise-tolerant Occam algorithms and their applications to learning decision trees
- Learning in the Presence of Malicious Errors
- Constant depth circuits, Fourier transform, and learnability
- Learnability and the Vapnik-Chervonenkis dimension
- A theory of the learnable
- Learning Integer Lattices
- Learning Boolean formulas
- Efficient noise-tolerant learning from statistical queries
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
This page was built for publication: Learning with restricted focus of attention
