Newsroom
Algorithmic Fairness
-
FDS Colloquium: Jamie Tucker-Foltz (Yale), “Random Redistricting via Random Walks”
Abstract: A widely-used method for assessing fairness in political redistricting is to generate a massive ensemble of “random” redistricting maps to develop a statistical baseline, i.e., a null model for what an unbiased map-maker would produce. State-of-the-art algorithms accomplish this task by sampling random spanning trees on the underlying graph of geographical subunits and removing…
-
FDS Colloquium: Cynthia Dwork (Harvard), “Outcome Indistinguishability and its Diverse Applications”
Abstract: Outcome Indistinguishability, a notion from algorithmic fairness with roots in complexity theory, frames learning not as loss minimization – the dominant paradigm in supervised machine learning — but instead as satisfaction of a collection of “indistinguishability” constraints. Outcome Indistinguishability considers two alternate worlds on individual-outcome pairs: in the natural world, individuals’ outcomes are generated by…
-
FDS Colloquium: Bhramar Mukherjee (Yale), “Analysis of “Big” Real-World Health Care Data: Promises and Perils”
Speaker: Bhramar Mukherjee, Ph.D.Senior Associate Dean of Public Health Data Science and Data EquityAnna M.R Lauder Professor of BiostatisticsProfessor of Epidemiology (Chronic Diseases) and of Statistics and Data ScienceYale University Optional Zoom link: https://yale.zoom.us/j/94323793445 Analysis of “Big” Real-World Health Care Data: Promises and Perils Abstract: Using administrative patient-care data such as Electronic Health Records and…



