Research map / Optimization / Nonconvex and smooth optimization
Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goals
Andrew Cotter, Heinrich Jiang, Maya Gupta, Serena Wang, Taman Narayan, Seungil You, Karthik Sridharan
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Optimizing Generalized Rate Metrics with Three Players (NeurIPS 2019 · similarity 0.88)
- Near-Optimal Solutions of Constrained Learning Problems (ICLR 2024 · similarity 0.88)
- Nonconvex Optimization for Regression with Fairness Constraints (ICML 2018 · similarity 0.86)
- Position: Adopt Constraints Over Fixed Penalties in Deep Learning (NeurIPS 2026 · similarity 0.85)
- Learning with Statistical Equality Constraints (NeurIPS 2025 · similarity 0.84)
- Learning Equilibria in Adversarial Team Markov Games: A Nonconvex-Hidden-Concave Min-Max Optimization Problem (NeurIPS 2024 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
