FCA improves fair clustering by optimizing utility and fairness.
problem Balancing fairness and utility in clustering.
method FCA alternates between aligning data and optimizing cluster centers in an aligned space.
result FCA achieves a superior trade-off between fairness and utility.
The study analyzes the conflict between group fairness and individual fairness in machine learning.
problem The conflict between group fairness (optimal statistical parity) and individual fairness in machine learning.
method Established sufficient conditions for the compatibility between optimal statistical parity and individual fairness requirements.
result Identified regions along the Pareto frontier that satisfy individual fairness requirements.
The paper tackles fair classification with multiple sensitive features.
problem Existing fair classification methods often consider a single sensitive feature, but in practice, individuals are defined by multiple sensitive features.
method Characterizes Bayes-optimal fair classifiers for multiple sensitive features under various fairness measures, proposing in-processing and post-processing algorithms.
result Bayes-optimal fair classifiers for multiple sensitive features are instance-dependent thresholding rules that rely on a weighted sum of group membership probabilities.
A novel multi-objective optimization framework improves insurance pricing fairness.
problem Exacerbated trade-offs between competing fairness criteria in insurance pricing using machine learning.
method Proposes a novel multi-objective optimization framework using NSGA-II to jointly optimize accuracy and fairness criteria.
result Consistently achieves a balanced compromise between accuracy and fairness, outperforming single-model approaches.
Unified approach for fair classification with overlapping groups.
problem Ensuring fairness across multiple overlapping groups in prediction problems.
method Probabilistic population analysis leading to Bayes-optimal classifier, unifying existing methods.
result Outperforms baselines in fairness-performance tradeoff on real datasets.
Abstract reviews mathematical fairness in machine learning.
problem Ensuring fairness in machine learning models.
method Independence-based approach to fairness definitions and methodologies.
result Optimal fair classifiers and predictors under equality of odds are derived.
FanG-HPO optimizes machine learning models for fairness and low energy consumption.
problem Bias in machine learning models and high energy consumption in hyperparameter optimization.
method Combines multi-objective and multiple information source Bayesian optimization.
result FanG-HPO identifies fair and energy-efficient machine learning models.
Bayesian optimization framework for fair machine learning models.
problem Bias in machine learning models and lack of adaptability of fairness techniques.
method General constrained Bayesian optimization framework.
result BO can optimize ML models for fairness without model-specific constraints.
The paper tackles the trade-off between fairness and accuracy in machine learning models.
problem Ensuring fairness in machine learning often reduces model accuracy.
method The paper introduces formal tools for reconciling the fairness-accuracy tension using Pareto optimality from multi-objective optimization.
result The Chebyshev scalarization scheme is superior for finding Pareto optimal solutions compared to the linear scalarization scheme.
BADR framework optimizes fairness metrics efficiently.
problem Fairness-inefficient models in machine learning.
method Bilevel Adaptive Rescalarisation procedure.
result BADR framework recovers optimal Pareto-efficient models.
Proposes a method to create fair ITRs that balance value and fairness.
problem Fairness issues in ITRs that can lead to unfair advantages or disadvantages.
method Optimal transport theory to transform optimal ITRs into fair ITRs.
result Established a theoretical upper bound on value loss for improved trade-off ITRs.
Unified framework for Bayes-optimal classifiers under group fairness.
problem Mitigating disparate impacts from algorithmic predictions in high-stakes decision-making.
method Unified framework based on Neyman-Pearson argument for deriving Bayes-optimal classifiers under group fairness constraints.
result Proposes FairBayes method that directly controls disparity and achieves optimal fairness-accuracy tradeoff.
New algorithm ensures fair matching in resource allocation.
problem Ensuring fairness in matching algorithms for scarce resources.
method Introduces a modified Sinkhorn algorithm and two relaxation strategies for group fairness in Optimal Transport.
result Demonstrates improved matching quality and fairness trade-off.
Develops a framework for fair semi-supervised learning.
problem Balancing fairness and accuracy in semi-supervised learning.
method Formulates a framework as an optimization problem, incorporating classifier loss, label propagation loss, and fairness constraints.
result Achieves fair semi-supervised learning with better accuracy-fairness trade-off than fair supervised learning.
The paper explores fair regression and classification under demographic parity constraints.
problem Ensuring fairness in regression and classification models under demographic parity constraints.
method Characterizes the optimal fair regression function using a barycenter problem with optimal transport costs and studies the connection between fair classification and regression.
result The optimal fair regression function is derived from the solution to a barycenter problem with optimal transport costs, and the optimal fair cost-sensitive classifiers can be derived by applying thresholds to this function.
OTF uses optimal transport to measure classifier fairness.
problem Measuring and reducing unfairness in classifier predictions.
method Introduces Optimal Transport to Fairness (OTF) to quantify and reduce unfairness.
result OTF improves the balance between classifier performance and fairness.
This work optimizes model performance while ensuring fairness through AUC constraints.
problem Ensuring fairness in machine learning models, especially for protected populations.
method Formulates fairness-aware machine learning model training as AUC optimization subject to fairness constraints, solves using stochastic first-order methods.
result Demonstrates effectiveness of the approach on real-world data under different fairness metrics.
New method for fair regression using optimal transport.
problem Learning fair regression models under counterfactual fairness constraints.
method Causal uncertainty view, optimal transport, post-processing method.
result High-probability fairness guarantees with O(n−1/3) decay. Meta-theorems validate fair regression algorithms under demographic parity constraints.
problem Regression under demographic parity constraints.
method Meta-theorems and post-processing methods.
result Fair minimax optimal regression can be achieved through post-processing.
Algorithm ensures fair ranking by minority groups alongside majority groups.
problem Ensuring fair ranking of items from minority groups alongside majority groups.
method Optimal transport-based regularizer for individual fairness and efficient optimization algorithm.
result Certifiably individually fair LTR models are achieved.
DFL framework improves action and outcome fairness in policy learning.
problem Fairness in policy learning, especially action and outcome fairness.
method Integrates action and outcome fairness into a multi-objective optimization problem using a lexicographic weighted Tchebyshev method.
result DFL framework improves both action and outcome fairness with minimal value reduction.
Proposes FACT, a diagnostic for understanding group fairness trade-offs.
problem Group fairness notions often conflict with each other, requiring a cost in model performance.
method Characterizes trade-offs via the fairness-confusion tensor and optimizes accuracy and fairness objectives.
result Demonstrates the use of FACT on synthetic and real datasets to understand accuracy-fairness trade-offs.
Optimal LDP mechanisms reduce data unfairness in classification.
problem Reducing data unfairness in classification models.
method Developed a closed-form optimal mechanism for binary attributes and a tractable framework for multi-valued attributes.
result Optimal LDP mechanisms improve fairness in classification while maintaining accuracy close to non-private models.
Paper optimizes PCA for fairness using MMD and Stiefel manifold optimization.
problem Fair principal component analysis (PCA) to minimize MMD between protected classes.
method Formulates fair PCA as non-convex optimization over Stiefel manifold, solves using REPMS with theoretical guarantees.
result Our approach outperforms prior work in fairness, explained variance, and runtime.
Advocates focusing on utility functions to avoid unfair outcomes.
problem Unfair outcomes from fairness criteria in optimizing policies.
method Defines value of information fairness and proposes modifying utility functions.
result Value of information fairness leads to better answers than existing fairness notions.
Extends ML fairness to handle minority groups over time.
problem Limitations of existing fairness criteria.
method Performative Distributionally Robust Optimization.
result Improves fairness for minority groups over time.
Project fair estimators while maintaining accuracy.
problem Making estimators fair without sacrificing accuracy.
method Optimal transport tools to find closest fair estimator.
result Efficiently constructs fair estimators with quantified cost.
Develops methods for fair classification under linear disparity constraints.
problem Disparate impacts of machine learning algorithms on protected groups.
method Bayes-optimal fair classification methods via pre-, in-, and post-processing.
result Explicit forms of Bayes-optimal fair classifiers under linear disparity measures.
The paper develops a method to achieve fairness in predictions using Wasserstein barycenters.
problem Learning a fair real-valued function independent of sensitive attributes.
method Establishing a connection between fair regression and optimal transport theory, deriving a close form expression for the optimal fair predictor as the Wasserstein barycenter of sensitive groups.
result The optimal fair predictor's distribution is the Wasserstein barycenter of sensitive groups' distributions, offering an intuitive interpretation and a simple post-processing algorithm.
Optimization algorithms affect fairness in deep learning models, especially with adaptive methods like RMSProp.
problem The impact of optimization algorithms on fairness in deep learning models, particularly under imbalance.
method Stochastic differential equation analysis of optimization dynamics in an analytically tractable setup.
result RMSProp, an adaptive optimizer, converges to fairer minima than SGD under severe imbalance.
Paper characterizes fairness vs. accuracy tradeoff in classification.
problem Mitigating bias in machine learning models.
method Characterizes the tradeoff between fairness and accuracy, provides a post-processing algorithm.
result Post-processing algorithm yields optimal fair classifier when score is Bayes optimal.
The paper proposes a happiness-based fairness framework using linear programming.
problem Fairness in decision-making outcomes.
method Linear programming to compute optimal, fair post-processing strategies.
result Unified and extended fairness definitions with practical strengths across diverse scenarios.
Paper proposes a federated learning framework for relative fairness.
problem Traditional fairness in federated learning overlooks performance disparities between client subgroups.
method Uses a minimax problem approach to minimize relative unfairness, introducing a fairness index based on loss ratios.
result Empirical evaluations confirm the framework's effectiveness in maintaining model performance while reducing disparity.
In this paper, we study counterfactual fairness in text classification, which asks the question: How would the prediction change if the sensitive attribute referenced in the example were different? Toxicity classifiers demonstrate a counterfactual fairness issue by predicting that "Some people are gay" is toxic while "…
Framework tests group fairness in machine learning models.
problem Detecting biases in machine learning classifiers.
method Optimal transport projections to audit group fairness.
result Statistical test for various fairness notions efficiently computed.
New methods ensure fairness in noisy protected groups.
problem Noisy or biased protected group information complicates fairness audits.
method Robust optimization techniques to enforce fairness on true groups.
result Robust approaches achieve better true group fairness guarantees.
Integrates fairness guarantees into deep learning models.
problem Ensuring fairness in deep learning models.
method Integrates a differentiable fairness layer into neural models and uses an online primal-dual algorithm for provable fairness guarantees.
result Guarantees a chosen notion of output parity in deep learning models.
In classification models fairness can be ensured by solving a constrained optimization problem. We focus on fairness constraints like Disparate Impact, Demographic Parity, and Equalized Odds, which are non-decomposable and non-convex. Researchers define convex surrogates of the constraints and then apply convex optimiz…
A new algorithm COVA-FC improves subgroup-fair clustering efficiency.
problem Challenges in making cluster assignments independent of sensitive attributes in subgroups.
method Defining a subgroup-fairness gap, deriving a covariance-based surrogate, and introducing a continuous relaxation for efficient optimization.
result COVA-FC achieves competitive cost-fairness trade-offs and improves computational efficiency.
Proposes Pareto efficient fairness for supervised learning models.
problem Ensuring fairness in machine learning models without sacrificing accuracy.
method Formulates a bilevel optimization problem to find Pareto efficient classifiers.
result Guaranteed solution on Pareto frontier for convex and non-convex objectives.
A method for fair representation learning through bi-level optimization and implicit differentiation.
problem Ensuring fair predictors invariant across sub-groups.
method Bi-level optimization with inner-loop for invariant predictors, implicit path alignment for efficiency.
result Consistently better trade-off in prediction performance and fairness measurement.
We identify and optimize the fairness-accuracy tradeoff through TAF Curves and FAUC metrics.
problem Balancing fairness and accuracy in machine learning models for high-stakes decisions.
method Developed TAF Curves and FAUC metric to quantify the tradeoff, and introduced FairStacks framework to expand the Pareto frontier.
result FairStacks framework expands the empirical Pareto frontier and improves the FAUC for model ensembles.
This work addresses local fairness in machine learning models.
problem Ensuring fairness within subregions of feature space, not just global averages.
method Introduces ROAD, a Distributionally Robust Optimization (DRO) approach with adversarial learning.
result Achieves Pareto dominance in local fairness and accuracy across datasets.
Simplifies fair PCA with fast, efficient solution.
problem Learning fair low-rank approximations of data.
method Conceptually simple approach with analytic solution.
result Faster and similar results to existing fair PCA methods.
Paper develops a fair pricing algorithm for dynamic settings with uncertain demand.
problem Fair pricing in dynamic, uncertain demand scenarios.
method Contextual bandit algorithm with dynamic pricing and demand learning.
result Achieves optimal regret bound with fairness constraints.
The study tests and optimizes fairness in credit scoring models.
problem Discrimination in credit scoring models based on protected attributes.
method Formal testing and variable identification to optimize fairness and performance.
result Guidance on monitoring and improving algorithmic fairness in credit scoring.
The paper tackles fair correlation clustering with new algorithms and analysis.
problem Fair variants of correlation clustering under various constraints.
method Introducing a novel combinatorial optimization problem for fairlet decomposition.
result Approximation algorithms for fair correlation clustering under multiple fairness constraints.
Most systems and learning algorithms optimize average performance or average loss -- one reason being computational complexity. However, many objectives of practical interest are more complex than simply average loss. This arises, for example, when balancing performance or loss with fairness across people. We prove tha…