Pages that link to "Item:Q5248508"
From MaRDI portal
The following pages link to Efficient noise-tolerant learning from statistical queries (Q5248508):
Displayed 37 items.
- On universal learning algorithms (Q287154) (← links)
- Learning unions of high-dimensional boxes over the reals (Q294744) (← links)
- Classification with asymmetric label noise: consistency and maximal denoising (Q315419) (← links)
- Grey-box steganography (Q393133) (← links)
- Four types of noise in data for PAC learning (Q673611) (← links)
- Unconditional lower bounds for learning intersections of halfspaces (Q1009217) (← links)
- General bounds on statistical query learning and PAC learning with noise via hypothesis boosting (Q1271468) (← links)
- On the learnability and usage of acyclic probabilistic finite automata (Q1271548) (← links)
- Specification and simulation of statistical query algorithms for efficiency and noise tolerance (Q1271551) (← links)
- Learning with restricted focus of attention (Q1271613) (← links)
- Approximating hyper-rectangles: Learning and pseudorandom sets (Q1278043) (← links)
- Noise-tolerant parallel learning of geometric concepts (Q1281499) (← links)
- Learning with queries corrupted by classification noise (Q1304475) (← links)
- Simple learning algorithms using divide and conquer (Q1355381) (← links)
- Learning an intersection of a constant number of halfspaces over a uniform distribution (Q1356892) (← links)
- Learning nested differences in the presence of malicious noise (Q1390947) (← links)
- New lower bounds for statistical query learning (Q1780448) (← links)
- PAC learning with nasty noise. (Q1853516) (← links)
- Learning fixed-dimension linear thresholds from fragmented data (Q1854473) (← links)
- Learning fallible deterministic finite automata (Q1900974) (← links)
- A computational learning theory of active object recognition under uncertainty (Q1943411) (← links)
- \(P\)-sufficient statistics for PAC learning \(k\)-term-DNF formulas through enumeration (Q1978498) (← links)
- An improved algorithm for learning sparse parities in the presence of noise (Q2034402) (← links)
- Four heads are better than three (Q2038021) (← links)
- On the noise estimation statistics (Q2238618) (← links)
- Hardness of learning problems over Burnside groups of exponent 3 (Q2339133) (← links)
- Learning from positive and unlabeled examples (Q2581364) (← links)
- Real-valued multiple-instance learning with queries (Q2581754) (← links)
- On the Evolution of Monotone Conjunctions: Drilling for Best Approximations (Q2830270) (← links)
- Grey-Box Steganography (Q3010419) (← links)
- Generalized Learning Problems and Applications to Non-commutative Cryptography (Q3092369) (← links)
- How to deal with malicious users in privacy‐preserving distributed data mining (Q3497744) (← links)
- Algorithmic Stability for Adaptive Data Analysis (Q4997321) (← links)
- (Q5092467) (← links)
- Robust logics (Q5918074) (← links)
- Gaining degrees of freedom in subsymbolic learning (Q5941074) (← links)
- Agnostic learning of geometric patterns (Q5943123) (← links)