My Account Log in

1 option

Approaches Addressing Algorithmic Bias and Disclosiveness / Emily Ruth Diana.

Dissertations & Theses @ University of Pennsylvania Available online

View online
Format:
Book
Thesis/Dissertation
Author/Creator:
Diana, Emily Ruth, author.
Contributor:
University of Pennsylvania. Statistics, degree granting institution.
Language:
English
Subjects (All):
Statistics.
Computer science.
Statistics--Penn dissertations.
Penn dissertations--Statistics.
Local Subjects:
Statistics.
Computer science.
Statistics--Penn dissertations.
Penn dissertations--Statistics.
Physical Description:
1 online resource (252 pages)
Contained In:
Dissertations Abstracts International 85-03B.
Place of Publication:
[Philadelphia, Pennsylvania] : University of Pennsylvania, 2022.
Ann Arbor : ProQuest Dissertations & Theses, 2023
Language Note:
English
Summary:
While data science enables rapid societal advancement, deferring decisions to machines does not automatically avoid egregious equity or privacy violations. Without safeguards in the scientific process - from data collection to algorithm design to model deployment - machine learning models can easily inherit or amplify existing biases and vulnerabilities present in society. This dissertation focuses on techniques to encode algorithms with ethical norms and construct frameworks ensuring that statistics and machine learning methods are deployed in a socially responsible manner. In particular, it presents theoretically rigorous and empirically verified techniques to mitigate automated bias and protect individual privacy.We begin with a discussion of two definitional contributions to the algorithmic fairness literature: minimax group fairness and lexicographic fairness. In contrast to the popular fairness goal of achieving equality of certain statistics between groups (such as error rate, false positive rate, or selection rate), the approach of minimax group fairness aims to make the worst-off group as well off as possible. As a natural extension, lexicographic fairness applies this goal recursively. Next, we explore a financial scenario in which clients involved in securities lending are incentivized to lie about their demands to protect their privacy. Levering techniques from the differential privacy literature, we present a resource allocation algorithm that is simultaneously private, approximately optimal, and incentivizes truth-telling. Finally, we consider the setting in which features that we might like to attain fairness or balance with respect to are not available in the majority of our data and introduce a pair of algorithms for the strategic development of proxy attributes under equity constraints.
Notes:
Source: Dissertations Abstracts International, Volume: 85-03, Section: B.
Advisors: Kearns, Michael; Roth, Aaron; Committee members: Dobriban, Edgar; Jensen, Shane.
Department: Statistics.
Ph.D. University of Pennsylvania 2023.
Local Notes:
School code: 0175
ISBN:
9798380385244
Access Restriction:
Restricted for use by site license.
This item is not available from ProQuest Dissertations & Theses.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account