← Search

Serena Wang

10 accepted papers

2026

Robust AI Evaluation through Maximal Lotteries

ICML 2026poster

The standard way to evaluate language models on subjective tasks is through pairwise comparisons: an annotator chooses the "better" of two model responses for a given prompt. These comparisons are then aggregated into a single ranking via the Bradley–Terry (BT) framework, forcing heterogeneous prefe…

Cited by 0SourceScholar
2024

On Counterfactual Metrics for Social Welfare: Incentives, Ranking, and Information Asymmetry

AISTATS 2024poster

From the social sciences to machine learning, it is well documented that metrics do not always align with social welfare. In healthcare, Dranove et al. (2003) showed that publishing surgery mortality metrics actually harmed sicker patients by increasing provider selection behavior. Using a principal…

Cited by 3SourcePDFScholar
2023

Robust distillation for worst-class performance: on the interplay between teacher and student objectives

UAI 2023poster

Knowledge distillation is a popular technique that has been shown to produce remarkable gains in average accuracy. However, recent work has shown that these gains are not uniform across subgroups in the data, and can often come at the cost of accuracy on rare subgroups and classes. Robust optimizati…

Cited by 10SourcePDFScholar
2021

Variational refinement for importance sampling using the forward Kullback-Leibler divergence

UAI 2021poster

Variational Inference (VI) is a popular alternative to asymptotically exact sampling in Bayesian inference. Its main workhorse is optimization over a reverse Kullback-Leibler divergence (RKL), which typically underestimates the tail of the posterior leading to miscalibration and potential degeneracy…

Cited by 44SourcePDFScholar
2020

Approximate Heavily-Constrained Learning with Lagrange Multiplier Models

NeurIPS 2020poster

In machine learning applications such as ranking fairness or fairness over intersectional groups, one often encounters optimization problems with an extremely large number of constraints. In particular, with ranking fairness tasks, there may even be a variable number of constraints, e.g. one for eac…

2020

Robust Optimization for Fairness with Noisy Protected Groups

NeurIPS 2020poster

Many existing fairness criteria for machine learning involve equalizing some metric across protected groups such as race or gender. However, practitioners trying to audit or enforce such group-based criteria can easily face the problem of noisy or biased protected group information. First, we study…

2019

Shape Constraints for Set Functions

ICML 2019oral

Set functions predict a label from a permutation-invariant variable-size collection of feature vectors. We propose making set functions more understandable and regularized by capturing domain knowledge through shape constraints. We show how prior work in monotonic constraints can be adapted to set f…

Cited by 25SourcePDFScholar
2019

Training Well-Generalizing Classifiers for Fairness Metrics and Other Data-Dependent Constraints

ICML 2019oral

Classifiers can be trained with data-dependent constraints to satisfy fairness goals, reduce churn, achieve a targeted false positive rate, or other policy goals. We study the generalization performance for such constrained optimization problems, in terms of how well the constraints are satisfied at…

Cited by 125SourcePDFScholar