The uniform hardcore Lemma via approximate Bregman projections

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 1193-1200

  Barak, Boaz ^a   Hardt, Moritz ^a   Kale, Satyen ^b  

^a Princeton University   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION; MACHINE LEARNING;

BOOSTING ALGORITHM; BREGMAN PROJECTION; COMPLEXITY THEORY; DENSITY MEASURES; DISTANCE FUNCTIONS; KULLBACK LEIBLER DIVERGENCE; MULTIPLICATIVE UPDATES; ONLINE LEARNING;

BOOLEAN FUNCTIONS;

EID: 70349161954     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.129     Document Type: Conference Paper

References (17)

1. Yair Censor and Stavros A. Zenios. Parallel Optimization - Theory, Algorithms, and Applications. Oxford University Press, 1997.
2. Yoav Freund. Boosting a weak learning algorithm by majority. In Proc. 3rd COLT, 1990.
3. Yoav Freund and Robert E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119-139, August 1997.
4. Mark Herbster and Manfred K. Warmuth. Tracking the best linear predictor. Journal of Machine Learning Research, 1:281-309, 2001. (Pubitemid 33687205)
5. Thomas Holenstein. Key agreement from weak bit agreement. In Proc. 37th ACM STOC, 2005.
6. Thomas Holenstein. Pseudorandom generators from one-way functions: A simple construction for any hardness. In Proc of 3rd TCC. Springer, 2006.
7. Russell Impagliazzo. Hard-core distributions for somewhat hard problems. In Proc 36th IEEE FOCS, 1995.
8. Russell Impagliazzo, Ragesh Jaiswal, and Valentine Kabanets. Approximately list-decoding direct product codes and uniform hardness amplification. In Proc. 47th IEEE FOCS, 2006.
9. Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, and Avi Wigderson. Uniform direct product theorems: Simplified, optimized and derandomized. In Proc. 40th ACM STOC, 2008.
10. Satyen Kale. Boosting and hard-core set constructions: a simplified approach. Electronic Colloquium on Computational Complexity (ECCC), (131), 2007.
11. Adam R. Klivans and Rocco A. Servedio. Boosting and hard-core set construction. Machine Learning, 51(3):217-238, 2003.
12. Robert E. Schapire. The strength of weak learnability. Machine Learning, 5:197-227, 1990.
13. Rocco A. Servedio. Smooth boosting and learning with malicious noise. Journal of Machine Learning Research, 4:633-648, 2003.
14. Luca Trevisan. List-decoding using the XOR lemma. In Proc of 44th IEEE FOCS, 2003.
15. Luca Trevisan. On uniform amplification of hardness in NP. In Proc 37th ACM STOC, 2005.
16. Manfred K. Warmuth and Dima Kuzmin. Randomized pea algorithms with regret bounds that are logarithmic in the dimension. In In Proc of NIPS, 2006.
17. Andrew C. Yao. Theory and applications of trapdoor functions (extended abstract). In 23rd FOCS, pages 80-91. IEEE, 1982. (Pubitemid 13468547)