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

Trend · papers per month

17345168 · Jun 202019922001200920172026
48 results for fairness audits

Study examines auditing fairness in evolving models, identifying strategic updates that preserve audit properties.

problem Auditing fairness in machine learning models that adapt to changing environments.
method Characterizes strategic updates that preserve audit properties, proposes a generic PAC auditing framework.
result Establishes distribution-free auditing bounds for statistical parity using the SP dimension.

Peer-induced fairness framework audits algorithmic fairness in AI applications.

problem Current auditing methods lack robustness and fail to distinguish between algorithmic discrimination and subject limitations.
method Combines counterfactual fairness and peer comparison strategy for a reliable auditing tool.
result Demonstrates significant unfairness in micro-firms compared to non-micro firms, highlighting the framework's potential.

Fairness audits fail under missing protected labels, especially at zero access.

problem Understanding the reliability of fairness audits with incomplete protected-label data.
method Introduced a seed-calibrated stress test to separate missingness effects from seed-to-seed movement.
result Missing protected labels do not significantly alter fairness mitigation methods, but they can lead to harmful intersectional outcomes.

Auditing fairness of decision-makers is now in high demand. To respond to this social demand, several fairness auditing tools have been developed. The focus of this study is to raise an awareness of the risk of malicious decision-makers who fake fairness by abusing the auditing tools and thereby deceiving the social co…

2019-01-24abs ↗pdf ↗

Proposes auditing for envy-freeness in recommender systems to assess individual preferences.

problem Auditing fairness in recommender systems for individual preferences.
method Formulates a pure exploration problem in multi-armed bandits, proposing a sample-efficient algorithm with theoretical guarantees.
result Algorithm ensures fairness without deteriorating user experience on real-world datasets.

The paper addresses fairness in online learning by extending auditing schemes and presenting efficient algorithms.

problem Ensuring fairness in online learning while maximizing predictive accuracy.
method Extending auditing schemes to handle multiple auditors and presenting oracle-efficient algorithms.
result Presented algorithms achieve upper bounds on regret and fairness violations, improving on existing bounds.

Develops Active Fourier Auditor to estimate ML model properties without reconstructing them.

problem Verifying and auditing properties of Machine Learning models in real-world applications.
method A new framework that quantifies ML model properties using Fourier coefficients, without reconstructing the model.
result Active Fourier Auditor (AFA) is more accurate and sample-efficient than baselines for estimating robustness, individual fairness, and group fairness.

Study reveals AI skin cancer classifiers underperform for darker skin phototypes, advocating for fairness auditing.

problem AI bias in dermatology, particularly for darker skin phototypes.
method Predictive Representativity (PR) framework, evaluating classifiers on HAM10000 and BOSQUE Test sets.
result Substantial performance disparities by skin phototype, highlighting AI bias.

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.

EL framework certifies and flags bias in ML models without distributional assumptions.

problem Systematic performance disparities across sensitive subpopulations in ML models.
method Empirical likelihood-based approach for non-parametric fairness auditing.
result EL framework outperforms bootstrap methods in certification and subpopulation discovery.

Investigates fairness in pipeline models where individuals may drop out.

problem Fairness in pipeline models where individuals may drop out and subsequent stages depend on remaining individuals.
method Rigorous framework for evaluating fairness guarantees, showing that naïve auditing is insufficient and dependence must exist between stages.
result Fairness in pipelines can be arbitrary, even with just two stages, and requires dependence between stages.

New methods target conditional demographic parity using optimal transport distances.

problem Auditing and enforcing conditional demographic parity (CDP) in models with complex conditioning variables.
method Developed novel measures of conditional demographic disparity (CDD) based on optimal transport distances and regularization-based approaches.
result Validated methods airbit{} and airlp{} effectively target CDP in real-world datasets with continuous model outputs.

Neural networks help auditors efficiently assess financial statements by learning underlying data patterns.

problem Efficiently auditing large volumes of financial statements and journal entries.
method Vector Quantised-Variational Autoencoder (VQ-VAE) neural networks.
result VQ-VAE neural networks can learn a quantized representation of accounting data, uncovering latent factors and providing a representative audit sample.

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.

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.

Algorithmic fairness is a field of study that addresses the systematic disadvantage of marginalized groups in machine learning systems.

problem Modern machine learning systems increasingly determine access to economic and social opportunities, leading to structural inequalities and prejudices.
method Statistical and structural approaches to algorithmic fairness.
result The field of algorithmic fairness emerged to address the systematic disadvantage of marginalized groups in machine learning systems.

Many existing fairness criteria for machine learning involve equalizing some metric across protected groups such as race or gender. However, practitioners trying to audit or enforce such group-based criteria can easily face the problem of noisy or biased protected group information. First, we study the consequences of …

2020-02-21abs ↗pdf ↗

We extend the fair machine learning literature by considering the problem of proportional centroid clustering in a metric context. For clustering nn points with kk centers, we define fairness as proportionality to mean that any n/kn/k points are entitled to form their own cluster if there is another center that is clo…

2019-05-09abs ↗pdf ↗

Survey of technologies for trustworthy machine learning systems.

problem Building machine learning systems that are fair, explainable, auditable, and secure.
method Survey of technologies across data and model stages of machine learning.
result Four categories of system properties (fairness, explainability, auditability, safety & security) are essential for trustworthy systems.

A new method uses LLMs to discover causal pathways that affect fairness in machine learning.

problem Discovering fairness-relevant causal pathways in the presence of noise and confounding.
method Hybrid LLM-guided causal discovery framework combining active learning and dynamic scoring.
result LLM-guided methods, including the proposed active, dynamically scored variant, outperform baselines in recovering fairness-relevant structure under noisy conditions.

Decomposes bias in linear models under demographic parity constraints.

problem Understanding and quantifying bias in linear models under fairness constraints.
method Post-processing framework to decompose bias into direct and indirect components.
result Analytical characterization of how demographic parity reshapes model coefficients.

Signed compression progress on a sealed audit is goodhart-resistant.

problem Intrinsic motivation for agents to improve their world models by compressing experience.
method Rewarding agents for the signed decrease of a fixed sealed-audit loss.
result Cumulative reward telescopes exactly to endpoint audit improvement, preventing infinite reward push while true audit performance stagnates.

This study improves audit sampling by using sequential procedures with statistical guarantees.

problem Improving audit efficiency and reliability with statistical methods.
method Formulated as a sequential testing problem, defining null and alternative hypotheses, stopping and decision rules, and exact boundary conditions.
result Exact design yields ex ante control of decision error probabilities, and simulation-based implementation approximates this design.

RESHAPE explains financial statement anomalies by aggregating explanations from AENNs.

problem Detecting and explaining accounting anomalies in financial audits is challenging.
method Proposes RESHAPE to explain model output on an aggregated attribute-level.
result RESHAPE provides more comprehensible explanations compared to existing methods.

AI-driven framework improves enterprise financial audits and risk identification.

problem Manual auditing is inefficient and limited by data complexity and evolving fraud tactics.
method Machine learning algorithms (SVM, RF, KNN) applied to a dataset of audit project counts, violations, and fraud instances.
result Random Forest achieves best performance with F1-score of 0.9012, identifying fraud and compliance anomalies.

Improved canary crafting for one-run privacy auditing reduces leakage estimates.

problem Detecting canaries in one-run privacy auditing to estimate leakage effectively.
method Optimizes canaries for detectability and diversity, using a greedy initialization and bilevel optimization.
result Achieves stronger leakage estimates at lower computational cost.

Audited Conformal Prediction improves conditional coverage in pretrained models under distribution shift.

problem Uncertainty quantification for pretrained models under unknown distribution shift
method Leverages a small labeled dataset to train an audit model for marginal coverage, integrates outputs into conformal prediction framework
result Significantly higher conditional coverage than existing approaches