atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

Learning General Halfspaces with Adversarial Label Noise via Online Gradient Descent

ICML 2022 · Learning theory and algorithms › Matrix and tensor methods · approach: Nonconvex low-rank and sparse optimization

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
Replace the prior sophisticated polynomial-time general-halfspace learner with online projected gradient descent on a sequence of localized ramp surrogate losseslearning general halfspaces with adversarial label noise under Gaussian marginals · theoretical guarantee (Gaussian marginal, adversarial label noise)0-1 error guarantee (C·ε, C universal constant)Helped
Use online gradient descent with T = O(log^4(1/ε)) iterations on localized ramp losses instead of the prior poly(d/ε) algorithmgeneral halfspace learner · sample complexity and runtimesample complexity Õ(d/ε^2 log(1/δ)) and near-linear runtime in NHelped
Estimate the threshold t from empirical label mean via t' = Φ^{-1}((1 - E[y])/2) instead of assuming it is knownonline gradient descent learner · theoretical analysis (Claim 4.7 / C.9)additional error introducedNo clear effect

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