atlas

Research map / Learning theory and algorithms / Sample complexity

Robustly Learning a Single Neuron via Sharpness

ICML 2023 · Learning theory and algorithms › Sample complexity · approach: Robust and surrogate-loss learning bounds · 0 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 sharpness of the convex surrogate to analyze mini-batch SGDSingle-neuron learning with adversarial label noise · Structured distributions satisfying margin and concentration assumptionsL2^2 loss: O((B^2\alpha^2/(\rho^2 \mu^2)))\opt +\epsHelped
Use the proposed approach rather than the prior convex-surrogate methodSingle-neuron learning on logconcave distributions · Logconcave distributionssample complexity: \Omega(1/\eps^2) versus \polylog(1/\eps)Helped
Require anti-concentration only in an optimal-solution direction and allow inverse-polynomial tailsDistributional assumptions for single-neuron learning · Heavy-tailed and structured discrete distributionsapplicabilityHelped
Replace strong convexity requirements with sharpnessConvex surrogate for robust neuron learning · Heavy-tailed and discrete distributionsapplicabilityHelped
Use refined stochastic-gradient variance scaling with opt + ||w - w*||2^2Mini-batch SGD on the surrogate · Surrogate optimizationsample complexity: \polylog(1/\eps) rather than \frac{1}{\epsilon}Helped

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