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,742 papers · 148 categories

Trend · papers per month

3.4%6.7%10.1%13.4% · Jun 201919922001200920172026
48 results for fairness testing

Proposes measuring fairness through multiple stakeholder-curated stress tests.

problem Limited power of rigid fairness metrics and lack of stakeholder involvement in fairness discussions.
method Shift focus from fairness metrics to stress tests curated by stakeholders.
result Machine's performance under multiple stress tests reflects fairness.

Propensity score matching improves fairness in machine learning models.

problem Bias in training data affects fairness metrics in machine learning models.
method Propensity score matching to evaluate and mitigate bias in test data.
result FairMatch significantly reduces bias in test data without sacrificing predictive performance.

Framework certifies fairness of machine learning models interactively and privately.

problem Certifying fairness of machine learning models in privacy-preserving scenarios.
method Interactive test with cryptographic techniques for fairness certification.
result Empirical evaluation of fairness for various models and definitions.

Fairness is a critical trait in decision making. As machine-learning models are increasingly being used in sensitive application domains (e.g. education and employment) for decision making, it is crucial that the decisions computed by such models are free of unintended bias. But how can we automatically validate the fa…

2018-07-02abs ↗pdf ↗

Statistical tests for fairness in admissions data reveal hidden patterns.

problem Simpson's paradox in admissions data hides true gender bias.
method Introduces a new statistical test based on Pearl's instrumental-variable inequalities.
result Statistical tests for fairness coincide with causal notions for the Berkeley admissions case.

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.

Develops fair classifiers robust to training distribution perturbations.

problem Ensuring fairness in classifiers robust to training data perturbations.
method Formulates a min-max objective function to minimize distributionally robust training loss while maintaining fairness for perturbed distributions. Uses an iterative online learning algorithm to find a fair and robust classifier.
result Our classifier maintains fairness and accuracy for a wide range of perturbations compared to state-of-the-art fair classifiers.

The paper discusses fairness in bank stress tests, comparing various methods to address institutional differences.

problem Fair aggregation of bank-specific stress test models into a common model.
method Comparing various notions of regression fairness, including estimating and discarding centered bank fixed effects.
result The method of estimating and discarding centered bank fixed effects is preferable for linear models, improving forecast accuracy and equal treatment.

We study the problem of learning fair prediction models for unseen test sets distributed differently from the train set. Stability against changes in data distribution is an important mandate for responsible deployment of models. The domain adaptation literature addresses this concern, albeit with the notion of stabili…

2019-11-02abs ↗pdf ↗

The paper tackles individual fairness in ML models, developing statistical methods to detect bias.

problem Detecting and measuring violations of individual fairness in machine learning models.
method Formalizing the problem as adversarial attack, developing inference tools for the adversarial cost function.
result Statistical methods to assess and test hypotheses of model fairness with non-coverage error rate control.

We propose an approach to fair classification that enforces independence between the classifier outputs and sensitive information by minimizing Wasserstein-1 distances. The approach has desirable theoretical properties and is robust to specific choices of the threshold used to obtain class predictions from model output…

2019-07-28abs ↗pdf ↗

New framework for interpreting disaggregated fairness evaluations using causal models.

problem Misinterpretation of disaggregated fairness evaluations due to data representativeness and selection bias.
method Causal graphical models to characterize fairness properties and metric stability under different data generating processes.
result Disaggregated evaluations are unreliable without explicit assumptions regarding bias mechanisms.

Proposes a fair machine learning framework robust to distribution shifts without causal graph knowledge.

problem Fairness issues in machine learning models under distribution shifts.
method Stochastic distributionally robust optimization with Exponential Renyi Mutual Information (ERMI) fairness measure.
result First stochastic framework for fair learning robust to distribution shifts without causal graph knowledge.

We consider the problem of improving fairness when one lacks access to a dataset labeled with protected groups, making it difficult to take advantage of strategies that can improve fairness but require protected group labels, either at training or runtime. To address this, we investigate improving fairness metrics for …

2018-06-28abs ↗pdf ↗

Motivated by settings in which predictive models may be required to be non-discriminatory with respect to certain attributes (such as race), but even collecting the sensitive attribute may be forbidden or restricted, we initiate the study of fair learning under the constraint of differential privacy. We design two lear…

2018-12-06abs ↗pdf ↗

We develop a theory which applies to any market dynamics that satisfy a fair market assumption on the nullity of the average profit of simple market making strategies. We show that for any such fair market, there exists a martingale fair price which corresponds to the average liquidation value (at the ask or the bid) o…

2015-06-08abs ↗pdf ↗

CST detects discrimination by comparing protected and non-protected individuals with a counterfactual.

problem Detecting discrimination in classifiers using legal fairness conditions.
method Operationalizes fairness given the difference using counterfactual reasoning.
result CST uncovers more discrimination cases than traditional situation testing.

Proposes a fairness criterion for multi-objective optimization in classification.

problem Ensuring fairness in classification models across different groups.
method Formulates a minimax Pareto fairness criterion and provides an optimization algorithm.
result Demonstrates improved fairness compared to existing methods on various real-world datasets.

FairVIC improves fairness in neural networks without sacrificing accuracy.

problem Mitigating bias in automated decision-making systems, particularly in deep learning models.
method Integrates variance, invariance, and covariance terms into the loss function during training to abstract fairness concepts.
result Significant improvements in fairness across all tested metrics without compromising accuracy.

The paper provides CI for test unfairness of group-fairness-aware classifiers trained with online SGD.

problem Ensuring fairness in machine learning models trained with stochastic gradient descent.
method Developed an online multiplier bootstrap method to estimate CI for test unfairness of DI and DM-aware linear classifiers.
result Asymptotic Central Limit Theorem holds for CI estimation of DI and DM-aware models.

The paper connects counterfactual fairness to robust prediction and group fairness using causal context.

problem The challenge of ensuring fairness in AI systems when counterfactuals cannot be directly observed.
method Using causal context to bridge counterfactual fairness, robust prediction, and group fairness.
result Counterfactual fairness is equivalent to group fairness metrics in specific contexts.

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.

The paper explores intersectional fairness in machine learning, proving bounds on it.

problem Intersectional fairness in machine learning, especially when multiple protected attributes are involved.
method Statistical analysis and bounds on intersectional fairness, leveraging marginal fairness.
result Theoretical bounds on intersectional fairness can be computed from marginal fairness and other statistical quantities.

COMMOD debiases models with minimal and interpretable changes.

problem Inconsistent and costly model updates in fair machine learning.
method Introduced COMMOD, a novel algorithm for algorithmic fairness that minimizes changes and makes them interpretable.
result COMMOD achieves comparable performance to state-of-the-art debiasing methods while making minimal and interpretable changes.

Develops a new fairness learning approach for multi-task regression models.

problem Fairness in multi-task regression models with biased datasets.
method Uses rank-based non-parametric independence test (Mann Whitney U statistic) and reformulates as non-convex optimization problem.
result Outperforms state-of-the-art methods on fairness metrics.

Paper examines fairness of data augmentation methods, finding vanilla Mixup outperforms Fair Mixup.

problem Improving fairness in classification models with limited minority data.
method Uses multicalibration to rigorously evaluate and improve data augmentation methods for classification fairness.
result Vanilla Mixup outperforms Fair Mixup and baseline methods in fairness and accuracy, especially with small minority groups.

Machine learning algorithms have been increasingly deployed in critical automated decision-making systems that directly affect human lives. When these algorithms are only trained to minimize the training/test error, they could suffer from systematic discrimination against individuals based on their sensitive attributes…

2019-06-28abs ↗pdf ↗

We consider the problem of learning representations that achieve group and subgroup fairness with respect to multiple sensitive attributes. Taking inspiration from the disentangled representation learning literature, we propose an algorithm for learning compact representations of datasets that are useful for reconstruc…

2019-06-06abs ↗pdf ↗

We tackle the problem of algorithmic fairness, where the goal is to avoid the unfairly influence of sensitive information, in the general context of regression with possible continuous sensitive attributes. We extend the framework of fair empirical risk minimization to this general scenario, covering in this way the wh…

2019-01-29abs ↗pdf ↗

This paper provides a comprehensive survey of Machine Learning Testing (ML testing) research. It covers 144 papers on testing properties (e.g., correctness, robustness, and fairness), testing components (e.g., the data, learning program, and framework), testing workflow (e.g., test generation and test evaluation), and …

2019-06-19abs ↗pdf ↗