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

305989118 · Jun 202019922001200920172026
48 results for fair credits allocation

Federated Machine Learning (FML) creates an ecosystem for multiple parties to collaborate on building models while protecting data privacy for the participants. A measure of the contribution for each party in FML enables fair credits allocation. In this paper we develop simple but powerful techniques to fairly calculat…

2019-09-17abs ↗pdf ↗

FedCM measures contributions in real-time for federated learning.

problem Fairly allocating contributions in federated learning systems.
method FedCM calculates impact based on current and previous rounds with attention aggregation.
result FedCM is more sensitive to data quality and quantity in real-time.

The paper explores fairness in credit scoring using machine learning.

problem The lack of research on fair machine learning in credit scoring.
method Revisits statistical fairness criteria, catalogs algorithmic options, and empirically compares fairness processors.
result Multiple fairness criteria can be approximately satisfied at once, and fair processors deliver a good balance between profit and fairness.

In this paper we develop a novel methodology for estimation of risk capital allocation. The methodology is rooted in the theory of risk measures. We work within a general, but tractable class of law-invariant coherent risk measures, with a particular focus on expected shortfall. We introduce the concept of fair capital…

2019-02-26abs ↗pdf ↗

New framework for fair online allocation in continuous time with deadlines.

problem Fair allocation under deadlines in continuous-time online learning.
method Continuous-time utility maximization, dual ascent optimization for time averages.
result Achieves ildeO(B1/2) ilde{O}(B^{-1/2}) regret bound in the absence of statistical knowledge.

Unified framework connects credit risk metrics with information theory.

problem Disconnection between industry-standard metrics and statistical theory.
method Unified information-theoretic framework, proving IV equals PSI, deriving standard errors, formalizing trade-off, automated binning with XGBoost.
result Unified framework connects IV and PSI, providing statistical foundation for metrics.

Paper proposes OPF policy for fair resource allocation with sublinear regret.

problem Fair resource allocation in an online setting against an unrestricted adversary.
method Online Proportional Fair (OPF) policy achieving approximate sublinear regret.
result OPF policy achieves cαc_α-approximate sublinear regret with cα1.445c_α \leq 1.445.

CCI combines Bayesian and gradient boosting to create fair, reliable credit risk scores.

problem Tackles high-stakes lending decisions with changing data distributions and fairness constraints.
method Combines Bayesian neural risk scorer and fairness-constrained gradient boosting with shift-aware fusion.
result CCI achieves best trade-off between discrimination, calibration, stability, and fairness.

The paper explores fairness metrics in automated decision-making and their limitations.

problem Discrimination in automated resource allocation decisions.
method Analysis of fairness metrics and distributive justice principles.
result Prominent fairness metrics fail to address egalitarian and sufficiency concerns in resource allocation.

The paper tackles fair policy targeting by optimizing allocation rules to minimize unfairness.

problem Discrimination in individualized treatments of social welfare programs.
method Formulated as a mixed-integer linear program, solved using off-the-shelf algorithms, derived regret bounds and small sample guarantees.
result Designs fair and efficient treatment allocation rules within the Pareto frontier.

The paper critiques ε-fairness, showing it can lead to unfair outcomes and proposes a utility-based approach.

problem The limitations of probabilistic fairness metrics in real-world contexts.
method Utility-based approach to measure fairness, addressing the issue of unavailable data on false negatives.
result A utility-based approach uncovers necessary actions to achieve true fairness, contrasting with traditional probability-based evaluations.

Simulations of infectious disease spread have long been used to understand how epidemics evolve and how to effectively treat them. However, comparatively little attention has been paid to understanding the fairness implications of different treatment strategies -- that is, how might such strategies distribute the expec…

2019-11-01abs ↗pdf ↗

Whereas previous post-processing approaches for increasing the fairness of predictions of biased classifiers address only group fairness, we propose a method for increasing both individual and group fairness. Our novel framework includes an individual bias detector used to prioritize data samples in a bias mitigation a…

2018-12-14abs ↗pdf ↗

Monotonic neural additive models simplify machine learning for credit scoring.

problem Complex machine learning methods make models less transparent and fair.
method Introducing monotonic neural additive models that simplify neural networks while maintaining regulatory compliance.
result Monotonic neural additive models achieve similar accuracy to complex neural networks but are more transparent and fair.

Federated learning involves training statistical models in massive, heterogeneous networks. Naively minimizing an aggregate loss function in such a network may disproportionately advantage or disadvantage some of the devices. In this work, we propose q-Fair Federated Learning (q-FFL), a novel optimization objective ins…

2019-05-25abs ↗pdf ↗

Fair k-means algorithm ensures equitable costs for different groups.

problem K-means clustering can result in biased outcomes for subgroups of data.
method Presented a fair k-means objective and algorithm (Fair-Lloyd) to choose cluster centers that provide equitable costs for different groups.
result Fair-Lloyd algorithm ensures all groups have equal costs in the output k-clustering, with negligible increase in running time.

The paper explains the fair basis in bond-CDS trading during financial crises.

problem Large basis trading losses during financial crises are not explained by reduced form models.
method Dynamic spread model with bond repo financing, economic capital approach.
result Unhedged and unhedgeable residual jump to default risk exists, affecting fair basis level.

Settings such as lending and policing can be modeled by a centralized agent allocating a resource (loans or police officers) amongst several groups, in order to maximize some objective (loans given that are repaid or criminals that are apprehended). Often in such problems fairness is also a concern. A natural notion of…

2018-08-30abs ↗pdf ↗

Study develops a smart contract framework for efficient and fair resource allocation.

problem Lack of rigorous economic foundation in decentralized coordination and smart contract implementations.
method Mechanism design framework with provable convergence guarantees for decentralized price adjustment.
result Proves stability and robustness of the proposed mechanism under various perturbations.

New sampling methods improve Shapley values for explaining machine learning predictions.

problem Computational limitations in calculating Shapley values for complex models.
method Asymptotic normality results and paired-sampling approximations (KernelSHAP and PermutationSHAP).
result Paired-sampling PermutationSHAP provides exact results for interactions of maximal order two and has the additive recovery property.

The paper reconciles two conflicting fairness criteria in algorithmic risk scores.

problem How to reconcile calibration and equal error rates in algorithmic risk scores.
method Derive necessary and sufficient conditions for existence of calibrated scores achieving equal error rates, then present an algorithm to find the most accurate score subject to both criteria.
result The method can eliminate error disparities while maintaining calibration and improve profit in credit lending.

This work reviews and tests risk allocation strategies in finance, highlighting Shapley allocation's advantages.

problem Risk allocation in financial institutions with non-additive risk measures and layered structures.
method Systematic review of risk allocation strategies, testing in simplified and realistic settings, including Basel 2.5 and FRTB.
result Shapley allocation offers the best compromise between simplicity, mathematical properties, and computational cost.

UDJ-FL framework achieves multiple distributive justice-based fairness metrics in federated learning.

problem Ensuring fairness in federated learning across different client data distributions.
method UDJ-FL framework uses aleatoric uncertainty-based client weighing and fair resource allocation techniques.
result UDJ-FL achieves egalitarian, utilitarian, Rawls' difference principle, and desert-based fairness metrics.

In our previous paper, "A Unified Approach to Systemic Risk Measures via Acceptance Set" (\textit{Mathematical Finance, 2018}), we have introduced a general class of systemic risk measures that allow for random allocations to individual banks before aggregation of their risks. In the present paper, we prove the dual re…

2018-03-27abs ↗pdf ↗

The paper shows how to audit fairness in decisions with hidden risk factors.

problem Estimating fairness in decisions influenced by hidden, unobservable risk factors.
method Derives unbiased estimates of risk using historical data and audits existing decision-making systems.
result One can compute meaningful bounds on treatment rates for high-risk individuals, even with hidden confounders.

Algorithm allocates perishable resources online to minimize envy and inefficiency.

problem Online allocation of perishable resources to minimize envy and inefficiency.
method Algorithm uses predictions of perishing order and desired envy bound to adaptively allocate resources.
result Algorithm achieves optimal envy-efficiency trade-off as derived from strong lower bounds.

Study explores fairness in financial deep learning through multi-scale trust quantification.

problem Ensuring fairness in financial deep learning models, especially under regulatory compliance.
method Conducts multi-scale trust quantification on a deep neural network for credit card default prediction.
result Demonstrates the feasibility and utility of multi-scale trust quantification for financial deep learning fairness.

Machine learning (ML) can automate decision-making by learning to predict decisions from historical data. However, these predictors may inherit discriminatory policies from past decisions and reproduce unfair decisions. In this paper, we propose two algorithms that adjust fitted ML predictors to make them fair. We focu…

2019-05-26abs ↗pdf ↗