We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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 evaluation time, given that they are satisfied at training time. To improve generalization performance, we frame the problem as a two-player game where one player optimizes the model parameters on a training dataset, and the other player enforces the constraints on an independent validation dataset. We build on recent work in two-player constrained optimization to show that if one uses this two-dataset approach, then constraint generalization can be significantly improved. As we illustrate experimentally, this approach works not only in theory, but also in practice.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1807.00028")
get_code_for_paper("1807.00028")
have("1807.00028")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1807.00028.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1807.00028)
Connect an agent — have() is free.