BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:49@lincs.fr
DTSTART;TZID=Europe/Paris:20160629T140000
DTEND;TZID=Europe/Paris:20160629T150000
DTSTAMP:20170313T170914Z
URL:https://www.lincs.fr/events/a-minimax-optimal-algorithm-for-crowdsourc
 ing/
SUMMARY:A Minimax Optimal Algorithm for Crowdsourcing
DESCRIPTION:We consider the problem of accurately estimating the
 reliability of workers based on noisy labels they provide\, which is a
 fundamental question in crowdsourcing. We propose a novel lower bound on
 the minimax estimation error which applies to any estimation procedure. We
 further propose Triangular Estimation (TE)\, an algorithm for estimating
 the reliability of workers. TE has low complexity\, may be implemented in a
 streaming setting when labels are provided by workers in real time\, and
 does not rely on an iterative procedure. We further prove that TE is
 minimax optimal and matches our lower bound. We conclude by assessing the
 performance of TE and other state-of-the-art algorithms on both synthetic
 and real-world data sets.Joint work with Thomas Bonald (Telecom ParisTech)
CATEGORIES:Seminars,Youtube
LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\,
 France
GEO:48.8283983;2.3568972000000485
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\,
 Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room
 40:geo:48.8283983,2.3568972000000485
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20160327T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR