## A PTAS for Agnostically Learning Halfspaces

author: Amit Daniely, Einstein Institute of Mathematics, The Hebrew University of Jerusalem
published: Aug. 20, 2015,   recorded: July 2015,   views: 24
Categories

# Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.

# Description

We present a PTAS for agnostically learning halfspaces w.r.t. the uniform distribution on the $d$ dimensional sphere. Namely, we show that for every $\mu>0$ there is an algorithm that runs in time $\poly\left(d,\frac{1}{\epsilon}\right)$, and is guaranteed to return a classifier with error at most $(1+\mu)\opt+\epsilon$, where $\opt$ is the error of the best halfspace classifier. This improves on Awasthi, Balcan and Long who showed an algorithm with an (unspecified) constant approximation ratio. Our algorithm combines the classical technique of polynomial regression (e.g. LMN89, KKMS05), together with the new localization technique of ABL14.