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

Trend · papers per month

97193290386 · Jun 202019922001200920182026
48 results for Fair Value Accounting

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.

This paper presents a coherent approach to FVA and CVA pricing of derivatives, based on recent accounting developments.

problem Derivative pricing and risk adjustment issues, especially FVA and CVA.
method A new pricing model based on fair value accounting and ISDA standards, focusing on the liability side of derivatives.
result A coherent method for determining FVA and CVA, resolving several debate issues and allowing reuse of existing infrastructure.

New algorithms ensure fairness in sequential decisions, accounting for feedback effects.

problem Ignoring feedback effects can lead to unfair outcomes in sequential decision-making.
method Model feedback effects as MDPs and propose fair properties and algorithms.
result Demonstrated the necessity of considering dynamical effects for fairness.

A Python tool assesses fairness, accountability, and transparency in AI decisions.

problem Lack of regulation and certification for AI-driven decisions.
method Developed an open-source Python toolbox to analyze fairness, accountability, and transparency aspects of machine learning.
result Automatically reports fairness, accountability, and transparency aspects of AI decisions to stakeholders.

The paper addresses monotonicity in machine learning models for fairness and accountability.

problem Ensuring fairness and accountability in transparent machine learning models.
method Study of three types of monotonicity (individual, weak pairwise, strong pairwise) and propose monotonic groves of neural additive models.
result Monotonic groves of neural additive models maintain transparency, accountability, and fairness.

This paper examines how taxation and stochastic interest rates affect GMWB Variable Annuities.

problem Improving the financial cost and withdrawal dynamics of GMWB Variable Annuities.
method Developed a numerical framework to compute fair value of GMWB contracts, accounting for taxation and stochastic interest rates.
result Accounting for both taxation and stochastic interest rate significantly impacts GMWB withdrawal strategy and cost.

Introduces lookahead counterfactual fairness to account for downstream effects of ML predictions.

problem Downstream effects of ML predictions on individuals not considered by counterfactual fairness.
method Introduces lookahead counterfactual fairness (LCF), a new fairness notion that considers future status. Proposes an algorithm based on theoretical conditions.
result Proposes an algorithm to achieve lookahead counterfactual fairness and validates it on synthetic and real data.

The paper tackles multi-level fairness in algorithmic systems, addressing bias at both individual and structural levels.

problem Algorithmic systems can unfairly impact marginalized groups, especially when considering only individual-level bias.
method Formalizes multi-level fairness using causal inference tools, addressing effects of sensitive attributes at multiple levels.
result Illustrates the importance of accounting for macro-level sensitive attributes in fairness assessments.

Proposes a method to create fair ITRs that balance value and fairness.

problem Fairness issues in ITRs that can lead to unfair advantages or disadvantages.
method Optimal transport theory to transform optimal ITRs into fair ITRs.
result Established a theoretical upper bound on value loss for improved trade-off ITRs.

Extends individual fairness to online decision-making, ensuring fair treatment over time.

problem Ensuring fair treatment of individuals in online decision-making.
method Introduces fairness-across-time (FT) and fairness-in-hindsight (FH) definitions, and designs a new algorithm (CaFE) to achieve sub-linear regret guarantees.
result FH can be embedded as a primary safeguard against unfair discrimination without hindering long-term decision-making.

New algorithms handle missing data to improve fairness in machine learning.

problem Missing values in data can lead to unfair outcomes in machine learning models.
method Developed scalable and adaptive algorithms to handle missing values while preserving predictive information.
result Our adaptive algorithms consistently achieve higher fairness and accuracy than standard impute-then-classify methods.

Proposes a method to enforce fairness in machine learning models without sensitive data.

problem Bias in machine learning models from historical data.
method Infers sensitive attributes from auxiliary features and integrates fairness constraints into model training.
result Mitigates bias while preserving predictive accuracy.

This work surveys algorithmic recourse, aiming to clarify definitions and solutions.

problem Providing explanations and recommendations to individuals affected by automated decisions.
method Literature review and unified definitions, formulations, and solutions.
result Unified definitions and solutions for algorithmic recourse.

This work proposes a new pre-processing method for supervised learning to improve fairness without sacrificing utility.

problem Improving fairness in supervised learning without compromising model performance.
method Task-tailored pre-processing approach that balances fairness and utility.
result The proposed method preserves consistent trade-offs among multiple downstream models and improves fairness in computer vision tasks.

Proposes a new fairness definition based on equity for machine learning classification.

problem Machine learning systems can perpetuate societal biases.
method Formalizes a new fairness definition based on equity, operationalizes it for classification, and evaluates its effectiveness.
result Demonstrates the effectiveness of the new fairness definition for equitable classification.

New fairness criteria for algorithmic recourse actions that consider causal relationships.

problem Fairness of recourse actions in algorithmic classification.
method Proposes two new fairness criteria at group and individual levels, explicitly accounting for causal relationships.
result Fairness of recourse is complementary to fairness of prediction, and can be enforced by altering the classifier.

FairTrade uses variational inference to create fair predictions in causal models.

problem Creating fair predictions in machine learning models with causal reasoning.
method FairTrade uses variational inference to account for unobserved confounders and integrates fairness constraints on causal paths.
result Demonstrates the effectiveness of FairTrade in creating fair predictions in both simulated and real-world datasets.

The paper addresses fairness in dynamic pricing for strategic buyers.

problem Price disparities among specific groups can lead to unfair perceptions and legal violations.
method Proposes a dynamic pricing policy that achieves fairness and discourages strategic behavior.
result Achieves an upper bound of O(T+H(T))O(\sqrt{T}+H(T)) regret over TT time horizons, reducing regret by 35.06% compared to a benchmark policy.

A new decision tree method tackles fairness in datasets with missing values.

problem Fairness concerns in machine learning models trained on data with missing values.
method An integrated approach based on decision trees that incorporates missing values directly and optimizes a fairness-regularized objective function.
result Our method outperforms existing fairness intervention methods applied to imputed datasets.

The paper tackles fair set-valued classification under demographic parity constraints.

problem Set-valued classification can amplify discriminatory bias, especially in multiclass settings.
method Proposes two strategies: an oracle-based method and a proxy method, both aiming to satisfy demographic parity and expected size constraints.
result Established distribution-free convergence rates and excess-risk bounds for both methods.

New framework for fairness in machine learning models using SHAP values and adversarial learning.

problem Fairness of model predictions, especially for unprivileged groups.
method Develops a new fairness definition and a framework using SHAP values and adversarial learning to mitigate bias.
result Models produced are fairer and performant, demonstrating the approach on various datasets.

The paper explores fairness in multi-component recommender systems.

problem How to ensure fairness in recommender systems composed of multiple models.
method Study of fairness ranking metrics, theoretical analysis, and empirical evaluation.
result Fairness in recommendation systems can be achieved by improving individual components.

FedFaiREE addresses fairness in decentralized learning with small samples.

problem Ensuring fairness in decentralized federated learning with limited data.
method FedFaiREE is a post-processing algorithm for distribution-free fair learning in decentralized settings with small samples.
result FedFaiREE provides theoretical guarantees for both fairness and accuracy in decentralized environments.

Algorithm samples fair rankings to ensure individual fairness while maintaining group fairness.

problem Fair ranking tasks with group fairness constraints and uncertainty in item utilities.
method Efficient algorithm that samples rankings from an individually-fair distribution ensuring group fairness.
result Expected utility of output ranking is at least α times optimal fair solution, where α depends on utilities and constraints.

New model considers unfairness complaints to ensure multiple fairness criteria.

problem Ensuring fairness in systems that may conflict with each other.
method Data-driven model guided by unfairness complaints, supports multiple fairness criteria, and considers their incompatibilities. Stochastic and adversarial settings analyzed with efficient algorithms.
result Efficient algorithms for both stochastic and adversarial settings with competitive guarantees.

Secure methods learn fair models without revealing sensitive attributes.

problem Training fair machine learning models without exposing sensitive data.
method Secure multi-party computation to encrypt sensitive attributes.
result Outcome-based fair models can be learned, checked, or verified without revealing sensitive attributes.

Study on missing data mechanisms and simple imputation methods in fairness of machine learning algorithms.

problem Impact of missing data mechanisms and simple imputation methods on fairness of machine learning algorithms.
method Three popular datasets for classification fairness were used. Missing values were generated using three missing data mechanisms. Various missing data handling techniques (listwise deletion, mean imputation, mode imputation, multiple imputation) were applied to the datasets. Fairness was assessed using classification algorithms (random forests).
result Missing data mechanism does not significantly impact fairness; listwise deletion gives highest fairness on average.

Linear optimizers can handle group fairness objectives efficiently.

problem Balancing performance or loss with fairness across groups.
method Polynomial-time reduction using linear optimizers for arbitrary objectives.
result Optimizing arbitrary group fairness objectives is as computationally tractable as optimizing average performance.

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.

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.