BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.16.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CMSA
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20231105T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20231108T153000
DTEND;TZID=America/New_York:20231108T163000
DTSTAMP:20260721T205504
CREATED:20240222T113928Z
LAST-MODIFIED:20240222T113941Z
UID:10002810-1699457400-1699461000@cmsa.fas.harvard.edu
SUMMARY:Fitting ellipsoids to random points
DESCRIPTION:Probability Seminar \nSpeaker: Antoine Maillard (ETH Zürich) \nTitle: Fitting ellipsoids to random points \nAbstract: We consider the problem of exactly fitting an ellipsoid (centered at 0) to n standard Gaussian random vectors in dimension d\, for very large n and d. This problem has connections to questions in statistical learning and theoretical computer science\, and is conjectured to undergo a sharp transition: with high probability\, it has a solution if n < d^2/4\, while it is not satisfiable if n > d^2/4. In this talk we will discuss the origin of this conjecture\, and highlight some recent progress\, in three different directions: \n\nA proof that the problem is feasible for n < d^2 / C\, for some (large) constant C\, significantly improving over previously-known bounds.\nA non-rigorous characterization of the conjecture\, as well as significant generalizations\, using analytical methods of statistical physics.\nA rigorous proof of a satisfiability transition exactly at n = d^2 / 4 in a slightly relaxed version of the problem\, the first rigorous result characterizing the expected phase transition in ellipsoid fitting. The proof is inspired by the non-rigorous characterization discussed above.\n\nThis talk is based on the three manuscripts: arXiv:2307.01181\, arXiv:2310.01169\, arXiv:2310.05787\, which are joint works with A. Bandeira\, Tim Kunisky\, Shahar Mendelson and Elliot Paquette.
URL:https://cmsa.fas.harvard.edu/event/probability-11823/
LOCATION:Virtual
CATEGORIES:Probability Seminar
END:VEVENT
END:VCALENDAR