A Convex Framework for Fair Regression
نویسندگان
چکیده
We introduce a flexible family of fairness regularizers for (linear and logistic) regression problems. These regularizers all enjoy convexity, permitting fast optimization, and span the range from group fairness to strong individual fairness. We study the accuracy-fairness trade-off on any given dataset, and we measure the severity of this trade-off via a numerical quantity we call the Price of Fairness (PoF). The centerpiece of our results is an extensive comparative study of the PoF across six different datasets in which fairness is a primary consideration.
منابع مشابه
Fuzzy convergence structures in the framework of L-convex spaces
In this paper, fuzzy convergence theory in the framework of $L$-convex spaces is introduced. Firstly, the concept of $L$-convex remote-neighborhood spaces is introduced and it is shown that the resulting category is isomorphic to that of $L$-convex spaces. Secondly, by means of $L$-convex ideals, the notion of $L$-convergence spaces is introduced and it is proved that the category of $L$-con...
متن کاملA Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem. At each step of ALS algorithms two convex least square problems should be solved, which causes high com...
متن کاملIterative Process for an α- Nonexpansive Mapping and a Mapping Satisfying Condition(C) in a Convex Metric Space
We construct one-step iterative process for an α- nonexpansive mapping and a mapping satisfying condition (C) in the framework of a convex metric space. We study △-convergence and strong convergence of the iterative process to the common fixed point of the mappings. Our results are new and are valid in hyperbolic spaces, CAT(0) spaces, Banach spaces and Hilbert spaces, simultaneously.
متن کاملA Scheduling Framework for UWB & Cellular Networks
The max-min fair scheduling problem in wireless ad-hoc networks is a non-convex optimization problem. A general framework is presented for this optimization problem and analyzed to obtain a dual problem, which involves solving a series of optimization sub-problems. In the limit of infinite bandwidth ( ), the scheduling solution reduces to simultaneous transmission (spread spectrum) on all links...
متن کاملSpeech Enhancement by Modified Convex Combination of Fractional Adaptive Filtering
This paper presents new adaptive filtering techniques used in speech enhancement system. Adaptive filtering schemes are subjected to different trade-offs regarding their steady-state misadjustment, speed of convergence, and tracking performance. Fractional Least-Mean-Square (FLMS) is a new adaptive algorithm which has better performance than the conventional LMS algorithm. Normalization of LMS ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1706.02409 شماره
صفحات -
تاریخ انتشار 2017