BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UC Berkeley IEOR Department - Industrial Engineering & Operations Research - ECPv5.5.0.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:UC Berkeley IEOR Department - Industrial Engineering & Operations Research
X-ORIGINAL-URL:https://ieor.berkeley.edu
X-WR-CALDESC:Events for UC Berkeley IEOR Department - Industrial Engineering & Operations Research
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20190310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20191103T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20191104T153000
DTEND;TZID=America/Los_Angeles:20191104T163000
DTSTAMP:20210417T174001
CREATED:20191022T231610Z
LAST-MODIFIED:20191023T000118Z
UID:10601-1572881400-1572885000@ieor.berkeley.edu
SUMMARY:Anil Aswani — Optimization Hierarchy for Fair Statistical Decision Problems
DESCRIPTION:Abstract: Data-driven decision-making has drawn scrutiny from policy makers due to fears of potential discrimination\, and a growing literature has begun to develop fair statistical techniques. However\, these techniques are often specialized to one model context and based on ad-hoc arguments\, which makes it difficult to perform theoretical analysis. This paper develops an optimization hierarchy for fair statistical decision problems. Because our hierarchy is based on the framework of statistical decision problems\, this means it provides a systematic approach for developing and studying fair versions of hypothesis testing\, decision-making\, estimation\, regression\, and classification. We use the insight that qualitative definitions of fairness are equivalent to statistical independence between the output of a statistical technique and a random variable that measures attributes for which fairness is desired. We use this insight to construct an optimization hierarchy that lends itself to numerical computation\, and we use tools from variational analysis and random set theory to prove that higher levels of this hierarchy lead to consistency in the sense that it asymptotically imposes this independence as a constraint in corresponding statistical decision problems. We demonstrate numerical effectiveness of our hierarchy using several data sets\, and we conclude by using our hierarchy to fairly perform automated dosing of morphine. \nThis talk is based upon the preprint at https://arxiv.org/abs/1910.08520.
URL:https://ieor.berkeley.edu/event/anil-aswani-optimization-hierarchy-for-fair-statistical-decision-problems/
LOCATION:George B. Dantzig Auditorium – 1174 Etcheverry Hall\, Etcheverry Hall\, Berkeley\, CA\, 94720\, United States
CATEGORIES:Seminar Events
ATTACH;FMTTYPE=image/jpeg:https://ieor.berkeley.edu/wp-content/uploads/2019/10/anil_aswani.jpg
END:VEVENT
END:VCALENDAR