AI Paper Atlas

Research map / Learning theory and algorithms / Fairness

Nonconvex Optimization for Regression with Fairness Constraints

Junpei Komiyama, Akiko Takeda, Junya Honda, Hajime Shimao

ICML 2018 · Learning theory and algorithms › Fairness · approach: Post-processing and transport for fairness · 60 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Kernel extension (random Fourier features, dimension 10x original) of the fair regressor vs linear regressorfair least-squares regression with CoD constraint · COMPAS and LSACRMSE as function of fairness level epsilonImproved
Kernel-rff-full (kernelizing both s and u) vs Kernel-rff-half (kernelizing only u) (ablation)fair regressor with CoD constraint · LSACRMSE as function of fairness level epsilonImproved
Kernel-rff-full vs Kernel-rff-half (ablation)fair regressor with CoD constraint · C&C, COMPAS, NLSYRMSE as function of fairness level epsilonNo clear effect
Stricter fairness level (lower epsilon, i.e. more fair constraint)fair regressor with CoD constraint · all four datasets (C&C, COMPAS, NLSY, LSAC)RMSEHurt
Convex QCQP reformulation vs SDP-based solution (running time comparison)fair regressor with CoD constraint · preliminary experiment (Appendix B)running timeNo clear effect

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy