AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Revisiting Perceptron: Efficient and Label-Optimal Learning of Halfspaces

NeurIPS 2017 · Learning theory and algorithms › Sample complexity · approach: Learning halfspaces under noise · 20 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use AP instead of the prior bounded-noise algorithm in the comparison tableActive halfspace learning · Uniform unit sphere, bounded noiselabel complexityHelped
Use AP instead of prior active algorithms with unspecified-degree polynomial timeActive halfspace learning · Uniform unit sphere, adversarial noiserunning timeHelped
Select examples from a positive-margin band [b/2,b] rather than querying only near-zero-margin examplesModified Perceptron update · Uniform unit sphere, bounded and adversarial noiseangle to target halfspaceHelped
Convert AP to passive learning PP by rejection-sampling labeled examples from the data distributionHalfspace learning · Uniform unit sphere, bounded noisesample complexityHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy