BEGIN:VCALENDAR
PRODID:-//planitpurple.northwestern.edu//iCalendar Event//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
CLASS:PUBLIC
BEGIN:VTIMEZONE
TZID:America/Chicago
TZURL:http://tzurl.org/zoneinfo-outlook/America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
SEQUENCE:0
DTSTART;TZID=America/Chicago:20260730T130000
DTEND;TZID=America/Chicago:20260730T150000
DTSTAMP:20260730T004709Z
SUMMARY:Shuwen Chai Prospectus July 30: Inference with Inherent Structure: Random Graphs and Beyond
UID:643572@northwestern.edu
TZID:America/Chicago
DESCRIPTION:Modern inference problems often involve randomly generated data with structure that is not directly observed. In network data\, the structure may take the form of hidden communities or unknown correspondences between vertices across correlated observations of the same underlying network. In statistical models\, a low-dimensional parameter of interest may be obscured by an unknown and potentially high-dimensional component of the data distribution. Ignoring this structure can lead to overly pessimistic conclusions\, while modeling every unknown component explicitly may be infeasible. A central challenge is therefore to identify structural properties that enable inference without requiring complete knowledge of the data-generating process.    This thesis develops algorithmic and statistical methods for inference in various structured probabilistic models. One direction concerns the recovery of latent combinatorial structure in random graphs\, including graph matching and community detection in correlated and growing network models such as correlated stochastic block models and the preferential attachment block model. We establish recovery guarantees\, including guarantees without computational constraints\, and develop efficient algorithms. A second direction concerns inference under structured distributional uncertainty\, including the construction of optimal adaptive confidence intervals in the Gaussian mean-shift contamination model and the estimation of watermark proportions in language-model-generated text. Together\, these results show how structures under random observations help design provable algorithms for recovering hidden objects and estimating parameters. 
LOCATION:Mudd Hall ( formerly Seeley G. Mudd Library)\, 3501\, 2233 Tech Drive\, Evanston\, IL 60208
TRANSP:OPAQUE
URL:https://planitpurple.northwestern.edu/event/643572
CREATED:20260723T050000Z
STATUS:CONFIRMED
LAST-MODIFIED:20260723T050000Z
PRIORITY:0
BEGIN:VALARM
TRIGGER:-PT10M
ACTION:DISPLAY
DESCRIPTION:Reminder
END:VALARM
END:VEVENT
END:VCALENDAR