Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

50101151201 · Jun 202019922001200920172026
48 results for fairness constraints

Paper proposes a modified fairness constraint to address shortcomings of counterfactual fairness.

problem Counterfactual fairness is not a necessary condition for algorithmic fairness.
method Analyzed hypothetical scenario and explicated discrimination to develop causal relevance fairness.
result Causal relevance fairness is a modified constraint that circumvents shortcomings of counterfactual fairness.

Algorithm identifies intended fairness constraints from expert demonstrations for fair clustering.

problem Fair clustering challenges due to incomplete fairness constraints.
method Algorithm identifies fairness metric from expert demonstrations and generates clusters.
result Algorithm identifies and generates fair clusters from limited expert demonstrations.

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…

2018-11-01abs ↗pdf ↗

Algorithm improves movie recommendation efficiency with fairness constraints.

problem Improving movie recommendation efficiency with fairness constraints in combinatorial semi-bandits.
method Adopted Thompson Sampling with beta priors and Bernoulli likelihoods to handle fairness constraints.
result Time-averaged regret upper bounded by $\frac{N}{2η} + O\left(\frac{\sqrt{mNT\ln T}}{T} ight)$, with fairness constraints satisfied.

We reformulate data-dependent constraints to ensure they are always met with high probability.

problem Ensuring fairness and stability in machine learning models with data-dependent constraints.
method Calibrated reformulation of constraints to guarantee satisfaction with a specified probability.
result Our method guarantees that fairness constraints are met at test time with high probability.

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.

The paper tackles fair set-valued classification under demographic parity constraints.

problem Set-valued classification can amplify discriminatory bias, especially in multiclass settings.
method Proposes two strategies: an oracle-based method and a proxy method, both aiming to satisfy demographic parity and expected size constraints.
result Established distribution-free convergence rates and excess-risk bounds for both methods.

Kearns et al. [2018] recently proposed a notion of rich subgroup fairness intended to bridge the gap between statistical and individual notions of fairness. Rich subgroup fairness picks a statistical fairness constraint (say, equalizing false positive rates across protected groups), but then asks that this constraint h…

2018-08-24abs ↗pdf ↗

In this paper, we study correlation clustering under fairness constraints. Fair variants of kk-median and kk-center clustering have been studied recently, and approximation algorithms using a notion called fairlet decomposition have been proposed. We obtain approximation algorithms for fair correlation clustering und…

2020-02-06abs ↗pdf ↗

We address the problem of algorithmic fairness: ensuring that sensitive variables do not unfairly influence the outcome of a classifier. We present an approach based on empirical risk minimization, which incorporates a fairness constraint into the learning problem. It encourages the conditional risk of the learned clas…

2018-02-23abs ↗pdf ↗

Algorithm samples fair rankings to ensure individual fairness while maintaining group fairness.

problem Fair ranking tasks with group fairness constraints and uncertainty in item utilities.
method Efficient algorithm that samples rankings from an individually-fair distribution ensuring group fairness.
result Expected utility of output ranking is at least α times optimal fair solution, where α depends on utilities and constraints.

Fairness-aware classification is receiving increasing attention in the machine learning fields. Recently research proposes to formulate the fairness-aware classification as constrained optimization problems. However, several limitations exist in previous works due to the lack of a theoretical framework for guiding the …

2018-09-13abs ↗pdf ↗

Recently there has been sustained interest in modifying prediction algorithms to satisfy fairness constraints. These constraints are typically complex nonlinear functionals of the observed data distribution. Focusing on the path-specific causal constraints proposed by Nabi and Shpitser (2018), we introduce new theoreti…

2019-10-09abs ↗pdf ↗

Proposes a framework for partially fair machine learning models.

problem Achieving full fairness across all score ranges compromises predictive performance.
method Formulates model training as constrained optimization with difference-of-convex constraints, solvable by IDCA.
result Demonstrates high predictive performance while enforcing partial fairness in specific percentile intervals.

Doubly fair dynamic pricing ensures equal prices for different groups over time.

problem Achieving equal prices for different groups in online dynamic pricing.
method Online learning algorithm that balances procedural and substantive fairness.
result Achieves ildeO(T) ilde{O}(\sqrt{T}) regret, zero procedural unfairness, and ildeO(T) ilde{O}(\sqrt{T}) substantive unfairness.

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.

This paper addresses dynamic price discrimination with fairness constraints.

problem Dynamic price discrimination with fairness constraints in online retailing.
method Nonparametric demand models, dynamic pricing policy, regret minimization.
result Optimal dynamic pricing policy with ildeO(T4/5) ilde{O}(T^{4/5}) regret for price fairness.

Proposes a method to enforce fairness in machine learning models without sensitive data.

problem Bias in machine learning models from historical data.
method Infers sensitive attributes from auxiliary features and integrates fairness constraints into model training.
result Mitigates bias while preserving predictive accuracy.

The study connects fairness constraints with optimal transport to derive new insights in classification.

problem Ensuring fairness in classification models without sacrificing performance.
method Using Wasserstein barycenters and optimal transport, the study characterizes optimal classification functions under fairness constraints.
result Maximizing fairness under demographic parity is equivalent to solving a regression problem.

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.

We consider settings in which the right notion of fairness is not captured by simple mathematical definitions (such as equality of error rates across groups), but might be more complex and nuanced and thus require elicitation from individual or collective stakeholders. We introduce a framework in which pairs of individ…

2019-05-25abs ↗pdf ↗

Ditto improves fairness and robustness in federated learning.

problem Fairness and robustness in statistically heterogeneous federated learning networks.
method Personalized federated learning framework (Ditto) with a scalable solver.
result Ditto achieves competitive performance and superior fairness and robustness compared to existing methods.

Learning high-quality node embeddings is a key building block for machine learning models that operate on graph data, such as social networks and recommender systems. However, existing graph embedding techniques are unable to cope with fairness constraints, e.g., ensuring that the learned representations do not correla…

2019-05-25abs ↗pdf ↗

New classifiers ensure fairness by adjusting a base classifier's operating characteristics.

problem Ensuring fairness in binary classification with multiple group constraints.
method Intervening directly on a base classifier's operating characteristics using group-wise ROC convex hulls and post-processing.
result Methods satisfy multiple fairness constraints (DP, EO, PP) with minimal interventions and near-oracle accuracy.

FairTrade uses variational inference to create fair predictions in causal models.

problem Creating fair predictions in machine learning models with causal reasoning.
method FairTrade uses variational inference to account for unobserved confounders and integrates fairness constraints on causal paths.
result Demonstrates the effectiveness of FairTrade in creating fair predictions in both simulated and real-world datasets.

HyperFair integrates fairness in recommender systems using probabilistic soft logic.

problem Ensuring fairness in recommender systems across diverse domains.
method Soft fairness constraints integrated as regularization in a joint inference objective function.
result HyperFair improves fairness of predictions from black-box models and hybrid systems.

Fair machine learning models can be vulnerable to adversarial attacks that reduce their accuracy and fairness.

problem Fairness constraints in machine learning models can compromise their robustness against adversarial attacks.
method Analysis of data poisoning attacks on group-based fair machine learning models, focusing on equalized odds.
result Adversaries can significantly reduce the test accuracy of fair machine learning models and widen their fairness gap.

Classifiers and rating scores are prone to implicitly codifying biases, which may be present in the training data, against protected classes (i.e., age, gender, or race). So it is important to understand how to design classifiers and scores that prevent discrimination in predictions. This paper develops computationally…

2017-10-16abs ↗pdf ↗

Group fairness is an important concern for machine learning researchers, developers, and regulators. However, the strictness to which models must be constrained to be considered fair is still under debate. The focus of this work is on constraining the expected outcome of subpopulations in kernel regression and, in part…

2018-11-25abs ↗pdf ↗