mlsanityData to 7 Oct 2026

Noise in Classification

arXiv 2010.05080 ↗First posted 10 Oct 2020cs.LG cs.DS stat.MLcited by 10

Not on the map. Why?

Abstract (arXiv)

This chapter considers the computational and statistical aspects of learning linear thresholds in presence of noise. When there is no noise, several algorithms exist that efficiently learn near-optimal linear thresholds using a small amount of data. However, even a small amount of adversarial noise makes this problem notoriously hard in the worst-case. We discuss approaches for dealing with these negative results by exploiting natural assumptions on the data-generating process.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 10 Oct 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 0; 2023: 3; 2024: 2; 2025: 3.

10 papers.