Protocols for learning classifiers on distributed data

Journal of Machine Learning Research

Volumn 22, Issue , 2012, Pages 282-290

  Daumé, Hal ^a   Phillips, Jeff M ^b   Saha, Avishek ^b   Venkatasubramanian, Suresh ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b Department of Electrical and Computer Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

ACTIVE LEARNING; APPROXIMATION ERRORS; CORE PROBLEMS; DATA DISTRIBUTED; DISTRIBUTED DATA; LEARNING CLASSIFIERS; SAMPLING-BASED; TWO WAY PROTOCOLS;

CLASSIFICATION (OF INFORMATION);

EID: 84954221698     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (20)

1. http://metaoptimize.com/qa/questions/1885/supposeyour-training-and-test-set-are-generated-by-a-cunningadversary, 2010.
2. Martin Anthony and Peter L. Bartlett. Neural Network Learning: Theoretical Foundations. Cambridge University Press, New York, NY, USA, 1st edition, 2009.
3. Eric Bauer and Ron Kohavi. An empirical comparison of voting classification algorithms: Bagging, boosting, and variants. Machine Learning, 36(1-2), 1999.
4. Ron Bekkerman, Mikhail Bilenko, and John Langford. Scaling up machine learn-ing: Parallel and distributed approaches. www.cs.umass.edu/ ronb/scalingaip-machineJeaniing.htm, 2011.
5. Nicolo Cesa-Bianchi, Claudio Gentile, and Francesco Orabona. Robust bounds for classification via selective sampling. In ICML, Montreal, Canada, 2009.
6. Michael Collins. Discriminative training methods for hidden markov models: theory and experiments with per-ceptron algorithms. In EMNLP, Stroudsburg, USA, 2002.
7. Ofer Dekel, Claudio Gentile, and Karthik Sridharan. Robust selective sampling from single and multiple teachers. In COLT, Haifa, Israel, 2010.
8. Sally Floyd and Manfred Warmuth. Sample compression, learnability, and the vapnik-chervonenkis dimension. Machine Learning, 50:269-304, 1995.
9. Sariel Har-Peled. Geometric Approximation Algorithms. American Mathematical Society, 2011. ISBN 0-8218-4911-5.
10. David P. Helmbold and Manfred K. Warmuth. On weak learning. Journal of Computer and System Sciences, 50: 551-573, 1995.
11. Daniel Hsu and John Langford. The end of the beginning of active learning. http://hunch.net/?p=1800, 2011.
12. Zengfeng Huang, Ke Yi, Yunhao Liu, and Guihai Chen. Optimal sampling algorithms for frequency estimation in distributed data. In The 30th IEEE International Conference on Computer Communications, 2011.
13. Michael Kearns and Umesh Vazirani. An introduction to computational learning theory. MIT Press, Cambridge, MA, USA, 1994. ISBN 0262111934.
14. Pavel Laskov and Richard Lippmann. Machine learning in adversarial environments. Machine Learning, 81(2), 2010.
15. Aleksandar Lazarevic and Zoran Obradovic. The distributed boosting algorithm. In KDD, San Francisco, USA, 2001.
16. Gideon Mann, Ryan McDonald, Mehryar Mohri, Nathan Silberman, and Dan Walker. Efficient large-scale distributed training of conditional maximum entropy models. In NIPS, Vancouver, Canada, 2009.
17. Ryan McDonald, Keith Hall, and Gideon Mann. Distributed training strategies for the structured perceptron. In NAACL HLT, Los Angeles, California, 2010.
18. Joel B. Predd, Sanjeev R. Kulkarni, and H. Vincent Poor. Distributed learning in wireless sensor networks. IEEE Signal Processing Magazine, 2006.
19. Burr Settles. Active learning literature survey. In Computer Sciences Technical Report 1648, University of Wisconsin-Madison, 2009.
20. Jeffrey Scott Vitter. Random sampling with a reservoir. ACM Transactions on Mathematical Software, 11:37-57, 1985.