activity
20172022
most citedDeep Lattice Networks and Partial Monotonic Functions

57 citations · 69 across the 6 of their papers we have counts for

collaborators
Showing 2018Show all

7 papers · 1 filter

cs.LG2018

Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goals

Andrew Cotter, Heinrich Jiang, Serena Wang +4

We show that many machine learning goals, such as improved fairness metrics, can be expressed as constraints on the model's predictions, which we call rate constraints. We study th…

cs.LG2018

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

Andrew Cotter, Maya Gupta, Heinrich Jiang +5

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 gene…

cs.LG2018

Proxy Fairness

Maya Gupta, Andrew Cotter, Mahdi Milani Fard +1

We consider the problem of improving fairness when one lacks access to a dataset labeled with protected groups, making it difficult to take advantage of strategies that can improve…

cs.LG2018

Quit When You Can: Efficient Evaluation of Ensembles with Ordering Optimization

Serena Wang, Maya Gupta, Seungil You

Given a classifier ensemble and a set of examples to be classified, many examples may be confidently and accurately classified after only a subset of the base models in the ensembl…

cs.LG2018

Interpretable Set Functions

Andrew Cotter, Maya Gupta, Heinrich Jiang +4

We propose learning flexible but interpretable functions that aggregate a variable-length set of permutation-invariant feature vectors to predict a label. We use a deep lattice net…

stat.ML2018

To Trust Or Not To Trust A Classifier

Heinrich Jiang, Been Kim, Melody Y. Guan +1

Knowing when a classifier's prediction can be trusted is useful in many applications and critical for safely using AI. While the bulk of the effort in machine learning research has…