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

Trend · papers per month

12.5%25.0%37.5%50.0% · Nov 199319922001200920172026
48 results for fairness term

The paper examines how slightly biasing towards under-represented groups in sequential selection processes can lead to long-term fairness.

problem Designing fair sequential decision-making processes for long-term social fairness.
method Proposes Multi-agent Fair-Greedy policy to balance score maximization and fairness.
result Proves convergence to long-term fairness target set by agents when score distributions are identical.

Online TERM improves robustness and fairness in streaming data.

problem Streaming data's lack of worst-case fairness and robustness in ERM.
method Proposes an online TERM formulation to balance average-case accuracy with worst-case fairness and robustness.
result Negative tilting effectively suppresses outlier influence, positive tilting improves recall with minimal precision loss.

Unified framework for fair representation learning in machine learning.

problem Ensuring fairness in machine learning models, especially when biased data representations lead to unfair predictions.
method Integrates nonlinear sufficient dimension reduction with deep learning to construct fair and informative representations, introducing a penalty term to enforce conditional independence between sensitive attributes and learned representations.
result Achieves a superior balance between fairness and utility, significantly outperforming state-of-the-art baselines on various data structures.

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 study fairness in collaborative-filtering recommender systems, which are sensitive to discrimination that exists in historical data. Biased data can lead collaborative-filtering methods to make unfair predictions for users from minority groups. We identify the insufficiency of existing fairness metrics and propose f…

2017-05-24abs ↗pdf ↗

Fairness in machine learning has predominantly been studied in static classification settings without concern for how decisions change the underlying population over time. Conventional wisdom suggests that fairness criteria promote the long-term well-being of those groups they aim to protect. We study how static fairne…

2018-03-12abs ↗pdf ↗

A new fairness metric for decision-making algorithms, conditioning on known fair variables.

problem Fairness issues in decision-making systems.
method Conditional fairness metric, Derivable Conditional Fairness Regularizer (DCFR), adversarial representation.
result Traditional fairness notations are special cases of the new conditional fairness notation.

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.

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 ↗

New study shows how adversaries can bias fair machine learning models even with corrupted data.

problem Fairness concerns in machine learning models under data corruption.
method Study of fairness-aware learning algorithms under worst-case data manipulations.
result Natural learning algorithms optimizing for both accuracy and fairness are order-optimal in terms of corruption ratio and protected groups frequencies.

The paper develops fair machine learning models using causal path-specific effects.

problem Fairness in machine learning models under causal constraints.
method Lagrange multiplier approach for infinite-dimensional functional estimation, closed-form solutions for constrained optimization.
result Theoretical and flexible semiparametric estimation strategies for fair predictions.

Unfair pricing policies have been shown to be one of the most negative perceptions customers can have concerning pricing, and may result in long-term losses for a company. Despite the fact that dynamic pricing models help companies maximize revenue, fairness and equality should be taken into account in order to avoid u…

2018-03-27abs ↗pdf ↗

Revises individual fairness by finding a fair metric for a model.

problem Difficulties in specifying a suitable fairness metric a priori.
method Introduces minimal metrics and applies randomized smoothing from adversarial robustness.
result Adapting minimal metrics to complex models yields interpretable fairness guarantees.

New algorithm improves group fairness in social classification problems by exploiting performativity.

problem Inequities in social classification problems due to performativity.
method Develops algorithmic fairness practices that leverage performativity to achieve stronger group fairness guarantees.
result Achieves stronger group fairness guarantees compared to non-performative settings.

A new method learns fair classifiers without sacrificing accuracy.

problem Designing fair classifiers that do not discriminate based on sensitive attributes.
method A model-agnostic multi-objective architecture using a differentiable relaxation of fairness notions.
result Our method achieves lower loss of accuracy compared to current debiasing algorithms.

The paper tackles fair sharing of exploration costs across groups in online learning.

problem Sharing the cost of exploration fairly across multiple groups in online learning.
method The paper introduces the 'grouped' bandit model and uses axiomatic bargaining theory, specifically the Nash bargaining solution, to formalize fairness.
result The paper derives policies that are optimally fair and regret-optimal, showing that regret-optimal policies can be unfair.

The paper characterizes a fundamental tradeoff between fairness and accuracy in classification problems.

problem Characterizing the inherent tradeoff between fairness and accuracy in classification problems.
method Provided a lower bound on the sum of group-wise errors of any fair classifiers, and constructed an algorithm to achieve optimal accuracy and fairness.
result Lower bounds on the sum of group-wise errors of fair classifiers, showing an inherent tradeoff between fairness and accuracy.

Proposes q-Fair Federated Learning to improve fairness in training models across devices.

problem Naive aggregation in federated learning can lead to unfair accuracy distribution.
method Introduces q-Fair Federated Learning (q-FFL) and q-FedAvg method for efficient optimization.
result q-FFL and q-FedAvg improve fairness, flexibility, and efficiency in federated learning.

New social and economic activities massively exploit big data and machine learning algorithms to do inference on people's lives. Applications include automatic curricula evaluation, wage determination, and risk assessment for credits and loans. Recently, many governments and institutions have raised concerns about the …

2017-10-16abs ↗pdf ↗

New fairness notion helps identify fair auditors for evaluating decision-support systems.

problem Identifying fair auditors to evaluate decision-support systems for bias.
method Introducing a non-comparative fairness notion based on desired system properties.
result The proposed fairness notion provides guarantees in terms of comparative fairness.

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.

The paper develops methods to create fair and transferable representations without subgroup discrimination.

problem Creating fair and transferable representations without discriminating subgroups in the population.
method The approach involves modifying data representations to meet fairness constraints, leveraging task similarities via low rank matrix factorization.
result The learned fair representation transfers well to novel tasks, improving prediction performance and fairness metrics.

A method for learning fair representations for kernel models.

problem Ensuring fairness in machine learning models.
method Using Sufficient Dimension Reduction (SDR) in the context of kernel-based models to construct fair representations in the reproducing kernel Hilbert space (RKHS).
result Demonstrates the effectiveness of model-aware fair representations for kernel models, including support for multiple fairness criteria and continuous/discrete data.

The paper examines fair pricing and hedging stability under small numéraire perturbations.

problem Fair pricing and hedging stability under numéraire perturbations.
method Reformulating the stochastic control problem to show stability and deriving asymptotic formulas.
result Fair price and hedging strategy are stable with small numéraire perturbations.

Proposes Fair Archetypal Analysis to reduce fairness concerns in data representation.

problem Inadvertent encoding of sensitive attributes in Archetypal Analysis.
method Integrates fairness regularization into Archetypal Analysis and its nonlinear extension.
result Reduces group separability without significantly compromising explained variance.

This paper benchmarks algorithms for training fair DNNs, addressing real-world fairness constraints.

problem Training deep neural networks with fairness constraints.
method Benchmarking stochastic approximation algorithms for fairness-constrained DNN training.
result Demonstrates the use of a new benchmark for comparing fairness-improving algorithms.