Efficient noise-tolerant learning from statistical queries
From MaRDI portal
(Redirected from Publication:5248508)
Efficient noise-tolerant learning from statistical queries (scientific article; zbMATH DE number 6434252)
Efficient noise-tolerant learning from statistical queries (scientific article; zbMATH DE number 6434252)
Cited in
(44)- Unconditional lower bounds for learning intersections of halfspaces
- General bounds on statistical query learning and PAC learning with noise via hypothesis boosting
- On the learnability and usage of acyclic probabilistic finite automata
- Specification and simulation of statistical query algorithms for efficiency and noise tolerance
- Learning with restricted focus of attention
- Approximating hyper-rectangles: Learning and pseudorandom sets
- Noise-tolerant parallel learning of geometric concepts
- Learning with queries corrupted by classification noise
- Simple learning algorithms using divide and conquer
- Learning an intersection of a constant number of halfspaces over a uniform distribution
- Learning nested differences in the presence of malicious noise
- New lower bounds for statistical query learning
- PAC learning with nasty noise.
- Learning fixed-dimension linear thresholds from fragmented data
- Learning fallible deterministic finite automata
- A computational learning theory of active object recognition under uncertainty
- \(P\)-sufficient statistics for PAC learning \(k\)-term-DNF formulas through enumeration
- An improved algorithm for learning sparse parities in the presence of noise
- Four heads are better than three
- On the noise estimation statistics
- Hardness of learning problems over Burnside groups of exponent 3
- Learning from positive and unlabeled examples
- Real-valued multiple-instance learning with queries
- On the evolution of monotone conjunctions: drilling for best approximations
- On universal learning algorithms
- Learning unions of high-dimensional boxes over the reals
- Grey-box steganography
- Generalized learning problems and applications to non-commutative cryptography. (Extended abstract)
- Classification with asymmetric label noise: consistency and maximal denoising
- How to deal with malicious users in privacy‐preserving distributed data mining
- Grey-box steganography
- Algorithmic stability for adaptive data analysis
- scientific article; zbMATH DE number 7561745 (Why is no real title available?)
- Robust logics
- Gaining degrees of freedom in subsymbolic learning
- Agnostic learning of geometric patterns
- Limits of preprocessing
- Four types of noise in data for PAC learning
- Gradient descent fails to learn high-frequency functions and modular arithmetic
- Efficient private algorithms for learning large-margin halfspaces
- A generalized Neyman-Pearson criterion for optimal domain adaptation
- Counterexamples to the low-degree conjecture
- Separating pseudorandom codes from local oracles
- Almost pairwise independence and resilience to deep learning attacks
This page was built for publication: Efficient noise-tolerant learning from statistical queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248508)
