Back to search

Cornell University

Constrained Optimization of Nonconvex Problems and its Applications in Fairness in Machine Learning

Abstract

dc:description.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.

Degree

thesis:*
Name thesis:degree_name
M.S., Computer Science
Level thesis:degree_level
Master of Science
Discipline thesis:degree_discipline
Computer Science
Grantor
Cornell University
Year dc:date.issued
2021

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Du, Zhuangjin
Chair dc:contributor.chair
  • Sridharan, Karthik
Committee member dc:contributor.committeemember
  • Townsend, Alex John

Subjects

dc:subject × 3

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Dc Identifier Bibid
15312653
Dc Identifier Other
ProQuest Submission ID: 11340
ProQuest Publication ID: 28770122

Chain of custody

source
Harvested from
Cornell University
Base URL
ecommons.cornell.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Du, Zhuangjin. Constrained Optimization of Nonconvex Problems and its Applications in Fairness in Machine Learning. Master of Science thesis, Cornell University, 2021. https://hdl.handle.net/1813/110792