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.

169,291 papers · 148 categories

Trend · papers per month

2.4%4.8%7.1%9.5% · Sep 199619922001200920182026
48 results for fair alternative

The study aims to prevent unfair content presentation in recommender systems.

problem Over- and under-presentation of content leads to biased user preference estimates.
method Two models are considered: one that ignores systematic and limited exposure, and another that conditions on limited exposure.
result Ignoring systematic presentations overestimates promoted options and underestimates censored alternatives.

LDA-XGB1 balances fairness and accuracy in lending models.

problem Fair lending practices and model interpretability in binary classification.
method Biobjective optimization using binning and information value, leveraging XGBoost.
result Achieves effective balance between accuracy, fairness, and interpretability.

A new algorithm balances fairness in clustering to avoid discrimination.

problem Clustering data can unfairly discriminate against different demographic groups.
method Designing a stochastic alternating balance fair k-means algorithm (SAfairKM) that alternates between k-means updates and group swap updates.
result The algorithm efficiently constructs well-spread and high-quality Pareto fronts on synthetic and real datasets.

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.

ARL improves fairness without protected features, showing AUC improvements for worst-case groups.

problem Training fairness in ML without known protected features.
method Adversarially Reweighted Learning (ARL) using non-protected features and task labels.
result ARL improves Rawlsian Max-Min fairness with notable AUC improvements for worst-case groups.

This paper studies fairness and privacy in federated learning, proposing algorithms to balance both.

problem Joint impact of differential privacy and fairness in federated classification.
method Proposes FDP-Fair and CDP-Fair algorithms for demographic disparity constrained classification under federated differential privacy.
result Established theoretical guarantees on privacy, fairness, and excess risk control.

This paper introduces individual fairness in clustering using ff-divergence.

problem Ensuring fair clustering by treating similar individuals similarly.
method Uses ff-divergence to measure statistical similarity and assigns individuals to probability distributions over cluster centers.
result Provides an algorithm with provable approximation guarantee for clustering with individual fairness constraints.

Researchers study fairness-accuracy tradeoffs in predictive models for multiple groups.

problem Understanding the tradeoff between fairness and accuracy in models serving multiple demographic groups.
method Characterizing the fairness-accuracy (FA) Pareto frontier, approximating it from limited data, and bounding the worst-case gap.
result Derivation of worst-case-optimal estimators and uniform finite-sample bounds for the entire FA frontier.

Paper introduces individual fairness for machine learning tasks.

problem Fairness in algorithmic decision making for machine learning tasks.
method Probabilistic mapping of user records into a low-rank representation that reconciles individual fairness and classifier utility.
result Substantial improvements over prior work for individual fairness in machine learning tasks.

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.

The paper proposes a method to improve fairness in machine learning models without refitting.

problem Mitigating biases in machine learning models that disadvantage certain groups.
method Infinitesimal jackknife-based approach to drop selected training data points.
result The intervention improves fairness without significantly reducing predictive performance.

This research tackles group fairness in predictive process monitoring by ensuring predictions are independent of sensitive group membership.

problem Predictive models using biased historical data can perpetuate unfair behavior in new cases.
method Investigates independence through metrics like ΔDP and a composite loss function balancing predictive performance and fairness.
result Proposes and validates a composite loss function for training models that balance fairness and performance.

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.

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.

Unified framework improves fair classification by selecting representative data points.

problem Improving fair classification outcomes in the presence of unintentional biases.
method Develops a unified framework to jointly optimize accuracy and fairness, recasting as mixed-integer convex programs.
result The framework can be used to enhance classification fairness by selecting more representative data points.

We relax demographic parity in regression by enforcing parity at quantile levels and score thresholds.

problem Enforcing full distributional fairness in regression can lead to substantial accuracy loss.
method Introduce (\ell, Z)-fair predictor, derive closed-form solutions, and develop post-processing algorithm.
result The risk gap to the continuous optimum vanishes as the grid is refined, and we enable targeted fairness corrections.

Generative model improved using Liouville PDE-based sliced-Wasserstein flow.

problem Improving generative models for fair regression.
method Transformed sliced-Wasserstein flow into Liouville PDE-based formalism, handling density estimation with normalizing flows of neural ODE.
result Outperforms in convergence and fairness with reduced variance.

Add antidote data to improve polarization and fairness in recommender systems.

problem Improving the social desirability of recommender system outputs.
method Formalize antidote data problem, develop optimization-based solutions, and propose measures for polarization and fairness.
result A modest budget for antidote data can lead to significant improvements in the polarization or fairness of recommendations.

Procedure for determining less discriminatory alternatives in AI audits with limited resources.

problem Difficulty in proving less discriminatory alternatives in AI audits due to resource constraints.
method Closed-form upper bound for loss-fairness Pareto frontier, enabling claimants to fit PFs without training large models.
result A scaling law for loss-fairness Pareto frontiers, allowing claimants to determine if an LDA exists with limited resources.

New auction design uses statistical learning to reduce costs and improve fairness.

problem Designing efficient multi-item auctions with reduced implementation costs and fairness.
method Nonparametric density estimation for credible intervals, two new strategies.
result Strategies consistently outperform alternative methods in revenue maximization and cost reduction.

The paper examines fairness issues in decision-making systems when protected class labels are unobserved.

problem Fairness assessment challenges when protected class labels are unavailable.
method Decomposes biases in estimating outcome disparity via threshold-based imputation and proposes a weighted estimator.
result Threshold-based imputation generally overestimates disparities, while the weighted estimator has a simpler negative bias.

New features generated from kernel methods are minimally dependent on sensitive features.

problem Generating fair features in the presence of sensitive and non-sensitive features.
method Relaxed Maximum Mean Discrepancy criterion, Hilbert-space-valued conditional expectation, plug-in approach.
result Closed-form solution for minimizing dependencies between new and sensitive features.

Proposes a compensation mechanism for improving individual forecast confidence.

problem Difficult to assess the quality of individual probabilistic forecasts and their utilities.
method Compensation mechanism based on fair bets and online learning.
result The proposed mechanism cannot be exploited and ensures forecasted utility matches actual utility.

Study finds actuarial unfairness in China's pension system, proposing income-dependent annuitization rules.

problem Actuarial fairness in China's NDC pension system when mortality differs across income groups.
method Developed a mortality-differentiated Lee-Carter framework with group-specific baseline mortality schedules and a common period effect, estimated using national and subgroup data.
result Substantial actuarial unfairness in the current age-only divisor, with a reverse transfer from poorer to richer retirees.

This work addresses fairness in ML models by training and evaluating attribute classifiers under uncertain and incomplete data.

problem Challenges in fairness metrics due to uncertain and incomplete data.
method Developed a theoretical and empirical analysis to understand and improve bias estimation in the data-scarce regime.
result The test accuracy of the attribute classifier is not always correlated with its effectiveness in bias estimation.