Constrained Optimization of Nonconvex Problems and its Applications in Fairness in Machine Learning
Loading...
No Access Until
Permanent Link(s)
Collections
Other Titles
Author(s)
Abstract
Fairness is an important concern in machine learning. One way to characterize the problem is to minimize some objective function, representing a quantity like loss, under constraints that represent fairness conditions like demographic parity. Previous papers show how a two-player approach to optimizing the Lagrangian can be computationally efficient and provably converge to a good, constraint-satisfying solution on convex objective functions. This work analyzes the convergence of the two-player framework in previous works on nonconvex functions, in particular those that satisfy the PL inequality.
Journal / Series
Volume & Issue
Description
26 pages
Sponsorship
Date Issued
2021-12
Publisher
Keywords
Constrained Optimization; Fairness; Machine Learning
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Sridharan, Karthik
Committee Co-Chair
Committee Member
Townsend, Alex John
Degree Discipline
Computer Science
Degree Name
M.S., Computer Science
Degree Level
Master of Science
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
dissertation or thesis