Learning in the Presence of Malicious Errors
From MaRDI portal
Publication:3137710
DOI10.1137/0222052zbMath0789.68118OpenAlexW1968998685MaRDI QIDQ3137710
Publication date: 10 October 1993
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0222052
Related Items (41)
Stronger data poisoning attacks break data sanitization defenses ⋮ Best Arm Identification for Contaminated Bandits ⋮ DNA sequencing and string learning ⋮ Learning conjunctions with noise under product distributions ⋮ On domain-partitioning induction criteria: worst-case bounds for the worst-case based ⋮ Toward efficient agnostic learning ⋮ Learning to Recognize Three-Dimensional Objects ⋮ Can PAC learning algorithms tolerate random attribute noise? ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Learning fallible deterministic finite automata ⋮ An experimental evaluation of simplicity in rule learning ⋮ Watermarking Cryptographic Capabilities ⋮ Robust multivariate mean estimation: the optimality of trimmed mean ⋮ Knowing what doesn't matter: exploiting the omission of irrelevant data ⋮ Learning nested differences in the presence of malicious noise ⋮ Data poisoning against information-theoretic feature selection ⋮ Recursive reasoning-based training-time adversarial machine learning ⋮ On the difficulty of approximately maximizing agreements. ⋮ Learning under \(p\)-tampering poisoning attacks ⋮ Learning Kernel Perceptrons on Noisy Data Using Random Projections ⋮ Incentive compatible regression learning ⋮ Machine learning in adversarial environments ⋮ The security of machine learning ⋮ Robust Estimators in High-Dimensions Without the Computational Intractability ⋮ Four types of noise in data for PAC learning ⋮ Classic learning ⋮ Learning nested differences in the presence of malicious noise ⋮ Maximizing agreements with one-sided error with applications to heuristic learning ⋮ Maximizing agreements with one-sided error with applications to heuristic learning ⋮ Robust logics ⋮ Boosting in the Presence of Outliers: Adaptive Classification With Nonconvex Loss Functions ⋮ An Improved Branch-and-Bound Method for Maximum Monomial Agreement ⋮ Specification and simulation of statistical query algorithms for efficiency and noise tolerance ⋮ Learning with unreliable boundary queries ⋮ Learning with restricted focus of attention ⋮ Robust and efficient mean estimation: an approach based on the properties of self-normalized sums ⋮ Exact Learning of Discretized Geometric Concepts ⋮ PAC learning with nasty noise. ⋮ Improved lower bounds for learning from noisy examples: An information-theoretic approach ⋮ On the robustness of randomized classifiers to adversarial examples ⋮ Maximizing agreements and coagnostic learning
This page was built for publication: Learning in the Presence of Malicious Errors
