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/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20211031T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210129T140000
DTEND;TZID=Europe/Paris:20210129T151500
DTSTAMP:20260723T041904
CREATED:20210409T113354Z
LAST-MODIFIED:20210409T114330Z
UID:12586-1611928800-1611933300@crest.science
SUMMARY:Roberto Oliveira IMPA (Brésil) - "Sample average approximation with heavier tails"
DESCRIPTION:Rennes Statistics Seminar\nTime: 2:00 pm\nDate: 29th of January 2021\nPlace: ENSAI-Campus de Ker Lann-35172 Bruz-France \n\nRoberto Oliveira IMPA (Brésil) – “Sample average approximation with heavier tails” \nAbstract: Consider an “ideal” optimization problem where constraints and objective function are defined in terms of expectations over some distribution P. The sample average approximation (SAA) — a fundamental idea in stochastic optimization — consists of replacing the expectations by an average over a sample from P. A key question is how much the solutions of the SAA differ from those of the original problem. Results by Shapiro from many years ago consider what happens asymptotically when the sample size diverges\, especially when the solution of the ideal problem lies on the boundary of the feasible set. In joint work with Philip Thompson\, we consider what happens with finite samples. As we will see\, our results improve upon the nonasymptotic state of the art in various ways: we allow for heavier tails\, unbounded feasible sets\, and obtain bounds that (in favorable cases) only depend on the geometry of the feasible set around the optimal solution. Our results combine “localization” and “fixed-point” type arguments by Mendelson with chaining-type inequalities. One of our contributions is showing what can be said when the SAA constraints are random. \nOrganizers:\nAdrien SAUMARD (CREST – ENSAI)\nSponsors:\nCREST \n\n
URL:https://crest.science/event/roberto-oliveira-impa-bresil-sample-average-approximation-with-heavier-tails/
ATTACH;FMTTYPE=:
END:VEVENT
END:VCALENDAR