BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CREST - ECPv5.1.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CREST
X-ORIGINAL-URL:https://crest.science
X-WR-CALDESC:Events for CREST
BEGIN:VTIMEZONE
TZID:Europe/Helsinki
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20260329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20261025T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Helsinki:20260209T140000
DTEND;TZID=Europe/Helsinki:20260209T153000
DTSTAMP:20260709T214313
CREATED:20260202T101337Z
LAST-MODIFIED:20260203T152324Z
UID:18778-1770645600-1770651000@crest.science
SUMMARY:Alexandra CARPENTIER (Universität Potsdam) - Statistical and computational challenges in unsupervised learning: focus on ranking
DESCRIPTION:Statistical Seminar: Every Monday at 2:00 pm.\nTime: 2:00 pm – 3:00 pm\nDate: 9th Febuary\nPlace: 3001 \n  \nAlexandra CARPENTIER (Universität Potsdam) – Statistical and computational challenges in unsupervised learning: focus on ranking \n  \n  \n Abstract:  \nRanking problems are prevalent in modern statistical\, machine learning\, and computer science literature. This includes a variety of practical situations ranging from ranking experts/workers in crowd-sourced data\, ranking players in a tournament or equivalently sorting objects based on pairwise comparisons. A main challenge in this field is to construct an estimator of the rank of the experts\, based on incomplete and noisy data. \nIn this talk\, we focus on understanding the problem of ranking both from an informational – namely\, characterizing the fundamental statistical thresholds for optimal estimation – and a computational – namely\, also characterising the fundamental limits of computationally efficient estimation – perspective. A core question for these problems is on whether statistical optimality is compatible with computational efficiency. \nTo do that\, we first consider the simpler sub-problem of sub-matrix detection and estimation\, which is useful to apprehend the more complex problem of ranking – and we will particularly focus on computational lower bounds. Based on results for this problem\, we explain how they can be used to solve the more challenging problem of ranking. \n  \n  \n  \nOrganizers: \nAnna KORBA (CREST)\, Vincent DIVOL (CREST) \, Jaouad MOURTADA (CREST) \n  \n  \nSponsors:\nCREST-CMAP \n
URL:https://crest.science/event/alexandra-carpentier-universitat-potsdam-tba/
CATEGORIES:Seminars,Statistics
ATTACH;FMTTYPE=:
END:VEVENT
END:VCALENDAR