Abstract reviews mathematical fairness in machine learning.
problem Ensuring fairness in machine learning models.
method Independence-based approach to fairness definitions and methodologies.
result Optimal fair classifiers and predictors under equality of odds are derived.
The paper proposes a happiness-based fairness framework using linear programming.
problem Fairness in decision-making outcomes.
method Linear programming to compute optimal, fair post-processing strategies.
result Unified and extended fairness definitions with practical strengths across diverse scenarios.
New concept of within-group fairness improves AI fairness without sacrificing accuracy.
problem Fairness issues in AI models treating individuals in the same sensitive group unfairly.
method Introducing within-group fairness, proposing mathematical definitions, and developing learning algorithms.
result Improves within-group fairness without sacrificing accuracy and between-group fairness.
Was it fair that Harry was hired but not Barry? Was it fair that Pam was fired instead of Sam? How can one ensure fairness when an intelligent algorithm takes these decisions instead of a human? How can one ensure that the decisions were taken based on merit and not on protected attributes like race or sex? These are t…
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.
Paper optimizes PCA for fairness using MMD and Stiefel manifold optimization.
problem Fair principal component analysis (PCA) to minimize MMD between protected classes.
method Formulates fair PCA as non-convex optimization over Stiefel manifold, solves using REPMS with theoretical guarantees.
result Our approach outperforms prior work in fairness, explained variance, and runtime.
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.
What does it mean for an algorithm to be fair? Different papers use different notions of algorithmic fairness, and although these appear internally consistent, they also seem mutually incompatible. We present a mathematical setting in which the distinctions in previous papers can be made formal. In addition to characte…
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…
In recent years, machine learning techniques have been increasingly applied in sensitive decision making processes, raising fairness concerns. Past research has shown that machine learning may reproduce and even exacerbate human bias due to biased training data or flawed model assumptions, and thus may lead to discrimi…
Paper develops a fair pricing algorithm for dynamic settings with uncertain demand.
problem Fair pricing in dynamic, uncertain demand scenarios.
method Contextual bandit algorithm with dynamic pricing and demand learning.
result Achieves optimal regret bound with fairness constraints.
This paper tackles hidden technical debts in fair ML systems for Fintech.
problem Building fair machine learning systems in financial services.
method Examining key stages of ML system development and deployment.
result Technical debts exist in deploying fair ML systems in Fintech.
We formalize in the proof assistant Isabelle essential basic notions and results in financial mathematics. We provide generic formal definitions of concepts such as markets, portfolios, derivative products, arbitrages or fair prices, and we show that, under the usual no-arbitrage condition, the existence of a replicati…
Ensuring that classifiers are non-discriminatory or fair with respect to a sensitive feature (e.g., race or gender) is a topical problem. Progress in this task requires fixing a definition of fairness, and there have been several proposals in this regard over the past few years. Several of these, however, assume either…
Equal experience fairness in recommender systems reduces bias.
problem Bias in data leads to unfair item recommendations.
method Introduces equal experience fairness notion and optimization framework.
result Mitigates unfairness in recommendations with minimal accuracy loss.
New method for k-modes algorithm improves clustering performance.
problem Improving initial solution selection for k-modes algorithm.
method Uses Hospital-Resident Assignment Problem to find initial cluster centroids.
result Outperforms other initialisations in most cases, especially for low-density data.
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.
The paper explores various forms of calibration scores and their implications for fairness.
problem The evaluation of probabilistic predictions through calibration.
method The authors organize three grouping choices and one agglomeration of group errors, providing a framework for comparing and creating new calibration scores.
result The study demonstrates that appropriate choices of grouping can provide notions of (sub-)group or individual fairness.
Develops a fair classifier for deep learning models.
problem Ensuring fairness in classification models across different sub-populations.
method Applies Rawlsian principles to minimize error rate on the worst-off sub-population.
result Introduces a practical method to adapt any black-box deep learning model to be fair.
The SABR model is shortly presented and the volatility swap explained. The fair value for a volatility swap is then computed using the usual theory in financial mathematics. An analytical solution using confluent hypergeometric functions is found. The solution is then verified using Rama Cont's functional calculus.
The paper analyzes fairness of compensation-based risk-sharing schemes for fund payouts.
problem Fair allocation of payouts in an endowment contingency fund.
method Analyzes two types of administrators and general non-negative loss distributions.
result General conditions for actuarial fairness are provided.
Gamblers lose in long bets despite casino claims, study shows.
problem Gamblers losing in seemingly fair gambling scenarios.
method Theoretical and experimental analysis of two-armed Futurity slot machines.
result Casinos have a win rate greater than 50% in long bets, making them unfair.
With the recent trend of applying machine learning in every aspect of human life, it is important to incorporate fairness into the core of the predictive algorithms. We address the problem of predicting the quality of public speeches while being fair with respect to sensitive attributes of the speakers, e.g. gender and…
Differential privacy improves AI security, fairness, and learning.
problem Privacy violations, security issues, and model fairness in AI.
method Application of differential privacy in various AI areas.
result Differential privacy enhances AI performance in multiple areas.
A non-trivial predictor satisfies demographic parity and equalizes group risks in regression.
problem Achieving fairness in regression models while maintaining equal risks across groups.
method Provided an explicit example of a non-constant predictor satisfying Demographic Parity and Equal Group-Wise Risks.
result First explicit construction of a non-constant predictor satisfying both fairness notions.
Datasets often contain biases which unfairly disadvantage certain groups, and classifiers trained on such datasets can inherit these biases. In this paper, we provide a mathematical formulation of how this bias can arise. We do so by assuming the existence of underlying, unknown, and unbiased labels which are overwritt…
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…
BIND removes background noise from binary matrices, improving detection accuracy and fairness.
problem Real data often violates the i.i.d assumption for binary matrix entries, leading to inaccurate detection.
method BIND optimizes detection by estimating row- and column-wise mixture distributions and eliminating background noise.
result BIND effectively removes background noise and increases detection accuracy and fairness.
This paper deals with applications of coherent risk measures to pricing in incomplete markets. Namely, we study the No Good Deals pricing technique based on coherent risk. Two forms of this technique are presented: one defines a good deal as a trade with negative risk; the other one defines a good deal as a trade with …
In this paper we explore an identity in distribution of hitting times of a finite variation process (Yor's process) and a diffusion process (geometric Brownian motion with affine drift), which arise from various applications in financial mathematics. As a result, we provide analytical solutions to the fair charge of va…
The paper explores fairness, welfare, and equity in personalized pricing across various applications.
problem Interplay of fairness, welfare, and equity in personalized pricing based on customer features.
method Comprehensive literature review and observational metrics without underlying valuation distribution assumptions.
result Personalized pricing can expand access, improve welfare, and increase revenue or budget utilization.
The paper examines bias in ML models using the Adult dataset.
problem Understanding and mitigating bias in machine learning models.
method Mathematical framework for fair learning, Disparate Impact index, and evaluation of bias reduction methods.
result Some common bias reduction methods are ineffective.
AP-Calculus offers a new framework for causal inference in Bayesian networks.
problem Causal inference in Bayesian networks with complex architectures.
method Introduces Attribution Projection Calculus (AP-Calculus) to determine causal relationships.
result Proves that for each label, exactly one intermediate node acts as a deconfounder.
We mathematically compare four competing definitions of group-level nondiscrimination: demographic parity, equalized odds, predictive parity, and calibration. Using the theoretical framework of Friedler et al., we study the properties of each definition under various worldviews, which are assumptions about how, if at a…
Mixed-integer optimization improves fairness and transparency in machine learning models.
problem Ensuring fairness and transparency in machine learning models deployed in sensitive areas.
method Embedding responsible ML considerations directly into the learning process using mixed-integer optimization.
result MIO enables the learning of inherently transparent models that can incorporate fairness or other constraints.
In general it is not clear which kind of information is supposed to be used for calculating the fair value of a contingent claim. Even if the information is specified, it is not guaranteed that the fair value is uniquely determined by the given information. A further problem is that asset prices are typically expressed…
New framework values football players based on in-game interactions.
problem Valuing football players based on in-game performance.
method Combining financial models and network theory using a passing matrix.
result Dynamic and individualized player valuation framework.
This paper provides a PAC-Bayesian bound for CVaR in machine learning.
problem Learning algorithms minimizing CVaR of empirical loss.
method Generalization bound of PAC-Bayesian type, reducing CVaR estimation to expectation estimation.
result The bound is small when empirical CVaR is small, providing concentration inequalities for CVaR.
This paper works out fair values of stock loan model with automatic termination clause, cap and margin. This stock loan is treated as a generalized perpetual American option with possibly negative interest rate and some constraints. Since it helps a bank to control the risk, the banks charge less service fees compared …
The paper explores how to learn models that respect constraints in probabilistic learning.
problem Learning models that respect declared constraints in probabilistic learning.
method Mathematical inquiry on tractable probabilistic models like sum-product networks.
result Determines conditions under which constraints can be integrated with model learning.
Two simple methods learn fair metrics from data to improve fairness in ML tasks.
problem Lack of widely accepted fair metrics for many ML tasks hinders individual fairness adoption.
method Presented two simple ways to learn fair metrics from various data types.
result Fair training with learned metrics improves fairness on three ML tasks.
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.
We introduce and treat rigorously a new multi-agent model of the continuous double auction or in other words the order book (OB). It is designed to explain collective behaviour of the market when new information affecting the market arrives. The novel feature of the model is two additional slow changing parameters, the…
Fair Mixup improves fairness in classifiers by interpolating between groups.
problem Ensuring fairness in classifiers during training and evaluation.
method Fair Mixup uses interpolation of samples between groups to enforce fairness constraints.
result Fair Mixup ensures better generalization of fairness in various benchmarks.
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.
DFL framework improves action and outcome fairness in policy learning.
problem Fairness in policy learning, especially action and outcome fairness.
method Integrates action and outcome fairness into a multi-objective optimization problem using a lexicographic weighted Tchebyshev method.
result DFL framework improves both action and outcome fairness with minimal value reduction.
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.
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.