BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//jEvents 2.0 for Joomla//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:STANDARD
DTSTART:20211107T010000
RDATE:20220313T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20221106T010000
RDATE:20230312T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20231105T010000
RDATE:20240310T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20241103T010000
RDATE:20250309T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20251102T010000
RDATE:20260308T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20261101T010000
RDATE:20270314T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20271107T010000
RDATE:20280312T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20281105T010000
RDATE:20290311T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20210823T104500
RDATE:20211107T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20220313T030000
RDATE:20221106T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20230312T030000
RDATE:20231105T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20240310T030000
RDATE:20241103T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20250309T030000
RDATE:20251102T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20260308T030000
RDATE:20261101T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20270314T030000
RDATE:20271107T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20280312T030000
RDATE:20281105T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:e16e842e4bf2a83ba74ffb2dbfcdf03a
CATEGORIES:Mathematical Physics Seminar
CREATED:20220808T105622
SUMMARY:Algorithmic spin glass theory
LOCATION:Zoom
DESCRIPTION:Abstract: Mean field spin glasses are high-dimensional random functions wit
 h special exchangeability properties. These models were originally motivate
 d by the study of disordered magnetic materials. However, it soon become cl
 ear that a large number of random optimization problems of interest in comp
 uter science and statistics fit this framework. Parisi's replica symmetry b
 reaking (RSB) theory allows to determine the asymptotics of the optimal val
 ue of these problems. Can RSB shed light on relevant algorithmic questions 
 as well?\nHere is a specific formalization of this question: Is there a pol
 ynomial time algorithm that outputs a feasible solution of these optimizati
 on problems whose value is, with high probability, within a factor rho of t
 he optimum?\nI will survey recent rigorous work that points at a remarkably
  precise answer for \nthis question. Time permitting, I will talk about the
  problem of sampling from the Sherrington-Kirkpatrick\nBoltzmann measure.\n
 [Based on joint work with Ahmend El Alaoui and Mark Sellke.]\n
X-ALT-DESC;FMTTYPE=text/html:<p>Abstract: Mean field spin glasses are high-dimensional random functions 
 with special exchangeability properties. These models were originally motiv
 ated by the study of disordered magnetic materials. However, it soon become
  clear that a large number of random optimization problems of interest in c
 omputer science and statistics fit this framework. Parisi's replica symmetr
 y breaking (RSB) theory allows to determine the asymptotics of the optimal 
 value of these problems. Can RSB shed light on relevant algorithmic questio
 ns as well?<br />Here is a specific formalization of this question: Is ther
 e a polynomial time algorithm that outputs a feasible solution of these opt
 imization problems whose value is, with high probability, within a factor r
 ho of the optimum?<br />I will survey recent rigorous work that points at a
  remarkably precise answer for <br />this question. Time permitting, I will
  talk about the problem of sampling from the Sherrington-Kirkpatrick<br />B
 oltzmann measure.<br />[Based on joint work with Ahmend El Alaoui and Mark 
 Sellke.]</p>
CONTACT:Andrea Montanari - Stanford University
DTSTAMP:20260827T221427
DTSTART;TZID=America/New_York:20220824T104500
DTEND;TZID=America/New_York:20220824T114500
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR