BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a88de6c04471
DTSTART;TZID=America/Toronto:20260807T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260807T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-michael-friedlander-measure-cone-randomness
SUMMARY:Tutte Colloquium -Michael Friedlander-The Measure of a Cone:\nRando
 mness and exactness in convex optimization
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Michael Friedlander\n\nAFFILIATION:\n University of 
 British Columbia.\n\nLOCATION:\n MC 5501\n\nABSTRACT: Conic geometry enco
 des combinatorial properties of a convex\nprogram. Under a probabilistic 
 model of the data\, these combinatorial\nproperties become random events.
  Their likelihood is the measure of a\ncone. We illustrate this view with
  a dual pair of questions. First\,\nhow much can a linear program be regu
 larized before its solution\nchanges? With random costs\, the answer turn
 s on the Gaussian measure\nof the solution's normal cone. Second\, how ma
 ny measurements are\nneeded to separate a superposition of structured sig
 nals? Here\, each\nsignal's complexity is the statistical dimension of its
  descent cone.\nA convex program recovers the components once the measure
 ment count\nexceeds the total complexity.\n\nBased on joint work with Sha
 rvaj Kubal\, Yaniv Plan\, and Matthew Scott\;\nZhenan Fan\, Halyun Jeong\
 , and Babhru Joshi\; and Ives Macêdo and Ting\nKei Pong.
DTSTAMP:20260821T232532Z
END:VEVENT
END:VCALENDAR