✦ LIBER ✦

On Agnostic Learning of Parities, Monomials, and Halfspaces

✍ Scribed by Feldman, Vitaly; Gopalan, Parikshit; Khot, Subhash; Ponnuswami, Ashok Kumar

Book ID: 118180869
Publisher: Society for Industrial and Applied Mathematics
Year: 2009
Tongue: English
Weight: 486 KB
Volume: 39
Category: Article
ISSN: 0097-5397
DOI: 10.1137/070684914

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Agnostic Learning of Monomials by Halfsp

Agnostic Learning of Monomials by Halfspaces Is Hard

✍ Feldman, Vitaly; Guruswami, Venkatesan; Raghavendra, Prasad; Wu, Yi 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 425 KB

On multiple-instance learning of halfspa

On multiple-instance learning of halfspaces

✍ D.I. Diochnos; R.H. Sloan; Gy. Turán 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 143 KB

Learning intersections and thresholds of

Learning intersections and thresholds of halfspaces

✍ Adam R. Klivans; Ryan O'Donnell; Rocco A. Servedio 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 410 KB

Hardness of Learning Halfspaces with Noi

Hardness of Learning Halfspaces with Noise

✍ Guruswami, Venkatesan; Raghavendra, Prasad 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 318 KB

On the hardness of learning intersection

On the hardness of learning intersections of two halfspaces

✍ Subhash Khot; Rishi Saket 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 232 KB

The regularized least squares algorithm

The regularized least squares algorithm and the problem of learning halfspaces

✍ Ha Quang Minh 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 168 KB