BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Department of Statistics - ECPv5.3.2.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Department of Statistics
X-ORIGINAL-URL:https://stat.wisc.edu
X-WR-CALDESC:Events for Department of Statistics
BEGIN:VTIMEZONE
TZID:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:20200308T080000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:20201101T070000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20201007T160000
DTEND;TZID=America/Chicago:20201007T170000
DTSTAMP:20210301T070303
CREATED:20200812T183643Z
LAST-MODIFIED:20200921T134240Z
UID:3864-1602086400-1602090000@stat.wisc.edu
SUMMARY:Statistics Seminar
DESCRIPTION:Title: Randomly Collected\, Worst Case Data \nPresenter: Professor Gregory Valiant \nAbstract: I’ll discuss a new framework for statistical estimation that leverages knowledge of how samples are collected but makes no distributional assumptions on the data values. Specifically\, consider a population of elements 1\,..\,n with corresponding data values x1\,..\,xn. After observing the values indexed by a sample subset of indices\, A\, the goal will be to estimate some statistic of the entire set x1\,..\,xn. We make no assumptions on the values x1\,…\,xn\, and instead assume that the sample indices are drawn according to a known distribution\, P over subsets of 1\,..\,n. How can the distribution\, P\, be leveraged to minimize the worst-case expected error of the estimator\, where the expectation is with respect to P and the worst-case is with respect to the data values x1\,..\,xn? For which distributions\, P\, is this error small? Within this general framework we give an efficient near-optimal algorithm for mean estimation\, leveraging a surprising connection to the Grothendieck problem. We also discuss this framework in several specific settings where membership in a sample may be correlated with data values\, such as when probabilities of sampling vary as in “importance sampling”\, when individuals are recruited into a sample through their social networks as in “snowball/chain sampling” or when samples have chronological structure. This talk is based on joint works with Mingda Qiao\, and with Justin Chen and Paul Valiant. \nLink: https://uwmadison.webex.com/meet/pr923156234
URL:https://stat.wisc.edu/event/statistics-seminar-5-2020-10-07/
END:VEVENT
END:VCALENDAR