Articles under category:
Learning
Learning
|
ToC Library Graduate Surveys 1 (2008) 20 pages
A Brief Introduction to Fourier Analysis on the Boolean Cube by Ronald de Wolf |
|
Vol 22, Article 5 (pp 1-40)
PAC Verification of Statistical Algorithms by Saachi Mutreja and Jonathan Shafer |
|
Vol 16, Article 6 (pp 1-20)
Sharp Bounds for Population Recovery by Anindya De, Ryan O'Donnell, and Rocco A. Servedio |
|
Vol 15, Article 1 (pp 1-55)
Testing $k$-Monotonicity: The Rise and Fall of Boolean Functions by Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, and Karl Wimmer |
|
Vol 14, Article 13 (pp 1-17)
On the Hardness of Learning With Errors with Binary Secrets by Daniele Micciancio |
|
Vol 14, Article 9 (pp 1-55)
[CCC16 Spec Issue]
Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits by Ruiwen Chen, Rahul Santhanam, and Srikanth Srinivasan |
|
Vol 12, Article 1 (pp 1-61)
[APRX-RND13 Spec Issue]
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy by Amos Beimel, Kobbi Nissim, and Uri Stemmer |
|
Vol 10, Article 20 (pp 535-570)
Learning $k$-Modal Distributions via Testing by Constantinos Daskalakis, Ilias Diakonikolas, and Rocco A. Servedio |
|
Vol 5, Article 13 (pp 257-282)
Optimal Cryptographic Hardness of Learning Monotone Functions by Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, and Hoeteck Wee |
|
Vol 2, Article 10 (pp 185-206)
Learning Restricted Models of Arithmetic Circuits by Adam Klivans and Amir Shpilka |
|
Vol 2, Article 8 (pp 147-172)
On Learning Random DNF Formulas Under the Uniform Distribution by Jeffrey C. Jackson and Rocco A. Servedio |