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

83166249332 · Jun 202019922001200920172026
48 results for bias testing

Study improves statistical power for detecting algorithmic bias in educational data.

problem Challenges in measuring algorithmic bias using ABROCA due to skewed distribution.
method Investigates ABROCA's distributional properties and proposes nonparametric randomization tests.
result ABROCA-based bias assessments are underpowered in typical EDM sample sizes.

Adversarial training leads to large generalization gap, decomposed into bias and variance.

problem Understanding the large generalization gap in adversarially trained models.
method Bias-Variance decomposition of test risk as a function of adversarial perturbation radius.
result Bias increases monotonically with adversarial perturbation radius and is dominant in test risk.

Study evaluates bias mitigation methods in deep learning, finds they often exploit hidden biases.

problem Deep learning systems learn biases, affecting performance on minority groups.
method Improved evaluation protocol, new dataset, robustness across different tuning distributions.
result Bias mitigation methods often exploit hidden biases, are not robust to multiple forms of bias, and are sensitive to tuning set choice.

Proposes tests to control confounding bias in predictive models.

problem Lack of non-parametric tests for confounding bias in predictive modeling.
method Partial and full confounder tests for probing null hypotheses of unconfounded and fully confounded models.
result Reveals previously unreported or hard-to-correct confounders in machine learning models.

The bias-variance tradeoff tells us that as model complexity increases, bias falls and variances increases, leading to a U-shaped test error curve. However, recent empirical results with over-parameterized neural networks are marked by a striking absence of the classic U-shaped test error curve: test error keeps decrea…

2018-10-19abs ↗pdf ↗

New framework minimizes interference and selection bias in network A/B testing.

problem Interference and selection bias in network A/B testing.
method Proposes a principled framework that jointly minimizes interference and selection bias using edge spillover probability and cluster matching.
result Significantly lower error in causal effect estimation compared to existing solutions.

Active testing reduces label costs for efficient model evaluation.

problem Real-world applications require expensive test labels, disconnecting from existing model evaluation methods.
method Derives acquisition strategies to select test points efficiently, addressing label bias and variance.
result Active testing improves model evaluation efficiency without sacrificing accuracy.

Study shows different trajectory prediction models generalize better under OoD conditions.

problem Comparing trajectory prediction models' robustness across different datasets.
method Training models on Argoverse 2 and testing on Waymo Open Motion, and vice versa, with various augmentation strategies.
result Smallest model with highest inductive bias performs best in OoD generalization.

In classification problems, sampling bias between training data and testing data is critical to the ranking performance of classification scores. Such bias can be both unintentionally introduced by data collection and intentionally introduced by the algorithm, such as under-sampling or weighting techniques applied to i…

2017-10-31abs ↗pdf ↗

Deep neural networks can generalize by reducing high-frequency noise over time, not always following a monotonic learning bias.

problem Understanding the learning dynamics and generalization of over-parameterized DNNs.
method Experimental analysis of deep double descent, focusing on the spectral bias of DNNs.
result The high-frequency components of DNNs diminish over training, leading to a second descent in test error.

Propensity score matching improves fairness in machine learning models.

problem Bias in training data affects fairness metrics in machine learning models.
method Propensity score matching to evaluate and mitigate bias in test data.
result FairMatch significantly reduces bias in test data without sacrificing predictive performance.

Synthetic control method improves policy evaluation in high-dimensional settings.

problem Evaluating the impact of new policies in large-scale applications.
method Two-phase approach: nearest neighbor matching followed by supervised learning.
result The method successfully improves estimate accuracy in large-scale experiments.

Performance of investment managers are evaluated in comparison with benchmarks, such as financial indices. Due to the operational constraint that most professional databases do not track the change of constitution of benchmark portfolios, standard tests of performance suffer from the "look-ahead benchmark bias," when t…

2008-10-10abs ↗pdf ↗

With recent advances in high throughput technology, researchers often find themselves running a large number of hypothesis tests (thousands+) and esti- mating a large number of effect-sizes. Generally there is particular interest in those effects estimated to be most extreme. Unfortunately naive estimates of these effe…

2013-11-15abs ↗pdf ↗

Deep networks generalize well even when they fit training data perfectly, thanks to overparametrization.

problem Understanding generalization in overparametrized deep networks.
method Random features regression, asymptotic analysis, ensemble averaging.
result Bias remains constant beyond the interpolation threshold, while variance components decay with overparametrization.

This paper examines the use of a residual bootstrap for bias correction in machine learning regression methods. Accounting for bias is an important obstacle in recent efforts to develop statistical inference for machine learning methods. We demonstrate empirically that the proposed bootstrap bias correction can lead to…

2015-06-01abs ↗pdf ↗

We detect lookahead bias in LLM forecasts using a novel statistical method.

problem Detecting lookahead bias in LLM-generated economic forecasts.
method Developed a statistical procedure using date-only recall queries and estimated Lookahead Propensity (LAP).
result LLM forecasts are contaminated with lookahead bias, as indicated by a positive interaction between LAP and the forecast in accuracy regressions.

New insights into bias and variance in over-parameterized models.

problem Understanding bias and variance in over-parameterized models.
method Analytic expressions derived from statistical physics for two minimal models.
result Over-parameterized models can overfit even in noiseless conditions.

Corrects bias in LLM-as-a-judge evaluations using adaptive calibration.

problem Bias in LLM evaluations due to imperfect sensitivity and specificity.
method Plug-in framework with confidence intervals accounting for test and calibration dataset uncertainties.
result LML-based evaluation yields more reliable estimates than human-only evaluation.

The paper detects and identifies bias in data using a counterfactual approach.

problem Detecting and identifying bias in data, especially in medical image classification.
method A global explanation framework using the counterfactual approach to identify bias causing artifacts.
result Black frames significantly influence Convolutional Neural Network's prediction, changing benign to malignant.

Most of previous machine learning algorithms are proposed based on the i.i.d. hypothesis. However, this ideal assumption is often violated in real applications, where selection bias may arise between training and testing process. Moreover, in many scenarios, the testing data is not even available during the training pr…

2017-08-22abs ↗pdf ↗

Recent developments in Neural Relation Extraction (NRE) have made significant strides towards Automated Knowledge Base Construction (AKBC). While much attention has been dedicated towards improvements in accuracy, there have been no attempts in the literature to our knowledge to evaluate social biases in NRE systems. W…

2019-11-09abs ↗pdf ↗

The paper introduces Relative Bias to quantify LLM bias systematically.

problem Quantifying bias in LLMs is challenging due to ambiguity and rapid model emergence.
method Relative Bias framework using Embedding Transformation and LLM-as-a-Judge methodologies.
result The two scoring methods show strong alignment, providing a systematic approach.

DCEM algorithm reduces bias in machine learning models trained on selective labels.

problem Bias in machine learning models trained on selective labels.
method Disparate Censorship Expectation-Maximization (DCEM) algorithm.
result DCEM improves bias mitigation without sacrificing discriminative performance.

Data that is gathered adaptively --- via bandit algorithms, for example --- exhibits bias. This is true both when gathering simple numeric valued data --- the empirical means kept track of by stochastic bandit algorithms are biased downwards --- and when gathering more complicated data --- running hypothesis tests on c…

2018-06-06abs ↗pdf ↗

Standard methods in supervised learning separate training and prediction: the model is fit independently of any test points it may encounter. However, can knowledge of the next test point x\mathbf{x}_{\star} be exploited to improve prediction accuracy? We address this question in the context of linear prediction, show…

2019-08-06abs ↗pdf ↗

Algorithm recovers causal graphs in presence of latent confounders and selection bias.

problem Recovering causal graphs in the presence of latent confounders and selection bias.
method Iterative causal discovery (ICD) algorithm that relies on causal Markov and faithfulness assumptions.
result Sound and complete algorithm that recovers the equivalence class of the underlying causal graph.

Can we make Bayesian posterior MCMC sampling more efficient when faced with very large datasets? We argue that computing the likelihood for N datapoints in the Metropolis-Hastings (MH) test to reach a single binary decision is computationally inefficient. We introduce an approximate MH rule based on a sequential hypoth…

2013-04-19abs ↗pdf ↗