← Search

Zhenhuan Yang

6 accepted papers

2025

Preserving AUC Fairness in Learning with Noisy Protected Groups

ICML 2025poster

The Area Under the ROC Curve (AUC) is a key metric for classification, especially under class imbalance, with growing research focus on optimizing AUC over accuracy in applications like medical image analysis and deepfake detection. This leads to fairness in AUC optimization becoming crucial as bias…

2023

Minimax AUC Fairness: Efficient Algorithm with Provable Convergence

AAAI 2023technical

The use of machine learning models in consequential decision making often exacerbates societal inequity, in particular yielding disparate impact on members of marginalized groups defined by race and gender. The area under the ROC curve (AUC) is widely used to evaluate the performance of a scoring fu…

2022

Differentially private SGDA for minimax problems

UAI 2022poster

Stochastic gradient descent ascent (SGDA) and its variants have been the workhorse for solving minimax problems. However, in contrast to the well-studied stochastic gradient descent (SGD) with differential privacy (DP) constraints, there is little work on understanding the generalization (utility…

2021

Simple Stochastic and Online Gradient Descent Algorithms for Pairwise Learning

NeurIPS 2021poster

Pairwise learning refers to learning tasks where the loss function depends on a pair of instances. It instantiates many important machine learning tasks such as bipartite ranking and metric learning. A popular approach to handle streaming data in pairwise learning is an online gradient descent (OG…

2021

Stability and Differential Privacy of Stochastic Gradient Descent for Pairwise Learning with Non-Smooth Loss

AISTATS 2021poster

Pairwise learning has recently received increasing attention since it subsumes many important machine learning tasks (e.g. AUC maximization and metric learning) into a unifying framework. In this paper, we give the first-ever-known stability and generalization analysis of stochastic gradient descent…

Cited by 23SourcePDFScholar
2021

Stability and Generalization of Stochastic Gradient Methods for Minimax Problems

ICML 2021oral

Many machine learning problems can be formulated as minimax problems such as Generative Adversarial Networks (GANs), AUC maximization and robust estimation, to mention but a few. A substantial amount of studies are devoted to studying the convergence behavior of their stochastic gradient-type algori…