Boosting and Hard-Core Set Construction
By Adam R. Klivans, Rocco A. Servedio. 2003
59 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Vitaly Feldman
- Elad Hazan
- Sanjeev Arora
- Zeyuan Allen-Zhu
- Satyen Kale
- Yuanzhi Li
- Subhash Khot
- Parikshit Gopalan
In Computational Theory and Mathematics
- Elad Hazan
- Vitaly Feldman
- Sanjeev Arora
- Satyen Kale
- Subhash Khot
- Parikshit Gopalan
- Ashok Kumar Ponnuswami
- Prasad Raghavendra
Citations in the corpus
- The Multiplicative Weights Update Method: a Meta-Algorithm and Applications (2012, methodology): “We describe the boosting algorithm of [45] now.”
- Learning DNF Expressions from Fourier Spectrum (2012, methodology): “A similar approach was used in the subsequent improvements to Jackson’s algorithm (Klivans and Servedio, 2003, Bshouty et al., 2004, Feldman, 2007).”
- On Agnostic Learning of Parities, Monomials, and Halfspaces (2009, methodology): “p-smooth). In Jackson’s result [Jac97], Freund’s boost-by-majority algorithm [Fre90] is used to produce distribution functions bounded by O( (2+ )) (for arbitrarily small constant ). More recently, Klivans and Servedio have observed [ KS03 ] that a later algorithm by Freund [Fre92] produces distribu”