Improved algorithms for collaborative PAC learning

Advances in Neural Information Processing Systems

Volumn 2018-December, Issue , 2018, Pages 7631-7639

  Nguyên, Huy Lê ^a   Zakynthinou, Lydia ^a  

^a Northeastern University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOWER BOUNDS; PAC LEARNING; SAMPLE COMPLEXITY; UPPER BOUND;

LEARNING ALGORITHMS;

EID: 85064828096     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Martin Anthony and Peter L. Bartlett. Neural Network Learning: Theoretical Foundations. Cambridge University Press, New York, NY, USA, 1st edition, 2009.
2. Maria-Florina Balcan, Avrim Blum, Shai Fine, and Yishay Mansour. Distributed learning, communication complexity and privacy. In Proceedings of the 25th Conference on Computational Learning Theory (COLT), pages 26.1-26.22, 2012.
3. Jonathan Baxter. A Bayesian/information theoretic model of learning to learn via multiple task sampling. Machine Learning, 28(1):7-39, July 1997.
4. Jonathan Baxter. A model of inductive bias learning. Journal of Artificial Intelligence Research, 12(1):149-198, March 2000.
5. Avrim Blum, Nika Haghtalab, Ariel D. Procaccia, and Mingda Qiao. Collaborative PAC learning. In Proceedings of the 30th Annual Conference on Neural Information Processing Systems (NIPS), pages 2389-2398, 2017.
6. Jiecao Chen, Qin Zhang, and Yuan Zhou. Tight bounds for collaborative PAC learning via multiplicative weights. CoRR, abs/1805.09217, 2018.
7. Ofer Dekel, Ran Gilad-Bachrach, Ohad Shamir, and Lin Xiao. Optimal distributed online prediction. In Proceedings of the 28th International Conference on Machine Learning (ICML), pages 713-720, 2011.
8. Chelsea Finn, Pieter Abbeel, and Sergey Levine. Model-agnostic meta-learning for fast adaptation of deep networks. In Proceedings of the 34th International Conference on Machine Learning (ICML), pages 1126-1135, 2017.
9. Christos Koufogiannakis and Neal E. Young. A nearly linear-time PTAS for explicit fractional packing and covering linear programs. Algorithmica, 70(4):648-674, December 2014.
10. Yishay Mansour, Mehryar Mohri, and Afshin Rostamizadeh. Domain adaptation: Learning bounds and algorithms. In Proceedings of the 22nd Conference on Computational Learning Theory (COLT), pages 19-30, 2009.
11. Yishay Mansour, Mehryar Mohri, and Afshin Rostamizadeh. Domain adaptation with multiple sources. In Proceedings of the 23rd Annual Conference on Neural Information Processing Systems (NIPS), pages 1041-1048, 2009.
12. Michael Mitzenmacher and Eli Upfal. Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis. Cambridge University Press, 2nd edition, 2017.
13. L. G. Valiant. A theory of the learnable. Commun. ACM, 27(11):1134-1142, November 1984.
14. Jialei Wang, Mladen Kolar, and Nathan Srebro. Distributed multi-task learning. In Proceedings of the 19th International Conference on Artificial Intelligence and Statistics (AISTATS), pages 751-760, 2016.