BEGIN:VCALENDAR
VERSION:2.0
METHOD:PUBLISH
CALSCALE:GREGORIAN
PRODID:-//WordPress - MECv7.0.0//EN
X-ORIGINAL-URL:https://phervietnam.org/
X-WR-CALNAME:PHERVIETNAM
X-WR-CALDESC:USAID Partnership for Higher Education Reform Project
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-PUBLISHED-TTL:PT1H
X-MS-OLK-FORCEINSPECTOROPEN:TRUE
BEGIN:VEVENT
CLASS:PUBLIC
UID:MEC-90794e3b050f815354e3e29e977a88ab@phervietnam.org
DTSTART:20230504T030000Z
DTEND:20230504T110000Z
DTSTAMP:20230504T040200Z
CREATED:20230504
LAST-MODIFIED:20240113
PRIORITY:5
SEQUENCE:11
TRANSP:OPAQUE
SUMMARY:Webinar: Collaborative Learning with Limited Communication
DESCRIPTION:Speaker: Prof. Qin Zhang (Indiana University Bloomington)\nQin Zhang is an associate professor in the Department of Computer Science at Indiana University Bloomington. He received his Ph.D. from the Hong Kong University of Science and Technology. Prior to IUB, he spent a couple of years as a postdoc at Theory Group, IBM Almaden Research Center, and the Center for Massive Data Algorithmics, Aarhus University.\nHe is interested in algorithms for big data (in particular, communication-efficient distributed computation and streaming/sketching algorithms) and the theoretical foundations of machine learning (in particular, collaborative learning and distributed learning). He has published extensively in premier conferences in theory/algorithms, databases, machine learning, and data mining. He is the recipient of several NSF grants (including a CAREER Award) and the Best Paper Award at SPAA 2017.\nTitle of the Talk: Collaborative Learning with Limited Communication\nAbstract: In this talk, I will introduce my recent work on collaborative (reinforcement) learning (CL), in which multiple agents work together to learn an objective function. We are particularly interested in a scenario in which agent communication is very expensive. Our goal is to identify the tradeoffs between the speedup of the collaboration and the communication cost among the agents. We convey the following messages using a basic problem in bandit theory as a vehicle: (1) adaptive CL is more powerful than non-adaptive CL; (2) CL with non-IID data is harder than that with IID data; and (3) problems incomparable in the single-agent learning model can be separated in the CL model.\n
URL:https://phervietnam.org/events/webinar-collaborative-learning-with-limited-communication/
CATEGORIES:Research & Innovation,VIAN Webinar and Training Courses,Vietnam International Academic Network
ATTACH;FMTTYPE=image/jpeg:https://phervietnam.org/wp-content/uploads/2023/08/Webinar-Collaborative-Learning-with-Limited-Communication.jpg
END:VEVENT
END:VCALENDAR