Noise in Classification

DOI10.1017/9781108637435.022MaRDI QIDQ5027282zbMATH OpenOpenAlexFDO

Authors Maria-Florina Balcan, Nika Haghtalab

Publication date 4 February 2022

Full work available at URL https://arxiv.org/abs/2010.05080, https://www.cambridge.org/core/books/beyond-the-worstcase-analysis-of-algorithms/noise-in-classification/B5DF64FC79F1C9D929F29306CC57B505

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Recommendations

• A polynomial-time algorithm for learning noisy linear threshold functions
• Uniform-Distribution Learnability of Noisy Linear Threshold Functions with Restricted Focus of Attention
• Efficient noise-tolerant learning from statistical queries
• On learning from queries and counterexamples in the presence of noise

Cited in

(3)

• Class noise vs. attribute noise: A quantitative study of their impacts
• Sorting from Noisier Samples
• The full landscape of robust mean testing: sharp separations between oblivious and adaptive contamination

This page was built for publication: Noise in Classification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5027282)