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

zbMath1448.90087arXiv1809.04198MaRDI QIDQ5214272

Taman Narayan, Seungil You, Andrew Cotter, Karthik Sridharan, Serena Wang, Heinrich Jiang, Maya R. Gupta

Publication date: 7 February 2020

Full work available at URL: https://arxiv.org/abs/1809.04198

zbMATH Keywords

fairnessconstrained optimizationchurnnon-convexnon-zero-sum gameswap regret

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (3)

Regrets of proximal method of multipliers for online non-convex optimization with long term constraints ⋮ Unnamed Item ⋮ Provably training overparameterized neural network classifiers with non-convex constraints

Uses Software

• UCI-ml
• PDE-Net

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interpretable classifiers using rules and Bayesian analysis: building a better stroke prediction model
• Equilibria of continuous two-person games
• Bounded isotonic regression
• Mirror descent and nonlinear projected subgradient methods for convex optimization.
• Nonparametric Estimation under Shape Constraints
• A Neyman–Pearson Approach to Statistical Learning
• Generalized Additive and Index Models with Shape Constraints
• Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
• A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points
• Shape constrained additive models

This page was built for publication: Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goals