Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

FOCS
2005
IEEE

favoriteEmaildiscussreport

94views Theoretical Computer Science» more FOCS 2005»

Agnostically Learning Halfspaces

13 years 10 months ago

Agnostically Learning Halfspaces

Download ttic.uchicago.edu

Adam Tauman Kalai, Adam R. Klivans, Yishay Mansour

Real-time Traffic

FOCS 2005 | Theoretical Computer Science |

claim paper

Related Content

» Agnostic Learning of Monomials by Halfspaces Is Hard

» Agnostic Boosting

» Hardness of Learning Halfspaces with Noise

» Learning Halfspaces with Malicious Noise

» Learning Geometric Concepts via Gaussian Surface Area

» Maximum Margin Coresets for Active and Noise Tolerant Learning

» On the Power of Membership Queries in Agnostic Learning

» Unconditional lower bounds for learning intersections of halfspaces

» A bound on the label complexity of agnostic active learning

Post Info
More Details (n/a)

Added	24 Jun 2010
Updated	24 Jun 2010
Type	Conference
Year	2005
Where	FOCS
Authors	Adam Tauman Kalai, Adam R. Klivans, Yishay Mansour, Rocco A. Servedio

Comments (0)