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

226453679905 · Jun 202019922001200920172026
48 results for algorithmic biases

Study shows statistical biases can mislead transformer models, impairing their generalization.

problem Statistical biases in transformers affect their ability to generalize.
method Evaluated transformer models on synthetic algorithmic tasks with varying statistical biases.
result Statistical biases lead to overestimation of transformer models' generalization capabilities.

The paper tackles sampling biases by ensuring minority groups are adequately represented in training data.

problem Sampling biases in training data lead to algorithmic biases in machine learning systems.
method The paper presents adaptive sampling methods to determine if it's possible to assemble a representative dataset from given data sources.
result The methods presented can determine with high confidence if a representative dataset can be assembled from given data sources.

The paper tackles bandit problems with biased offline data by using causal methods.

problem Improving bandit algorithms with biased offline data that includes confounding and selection biases.
method Formalizes the problem from a causal perspective, categorizes biases, and derives robust bounds for each arm.
result Causal bounds can guide the bandit agent to learn a nearly-optimal decision policy and consistently reduce asymptotic regret.

Many deep reinforcement learning algorithms contain inductive biases that sculpt the agent's objective and its interface to the environment. These inductive biases can take many forms, including domain knowledge and pretuned hyper-parameters. In general, there is a trade-off between generality and performance when algo…

2019-07-05abs ↗pdf ↗

New method learns collective variables using autoencoders for molecular simulations.

problem Learning low-dimensional slow degrees of freedom (collective variables) for molecular simulations.
method Iterative method involving CV learning with autoencoders and reweighting scheme.
result Achieves convergence of learned collective variables.

The paper argues that normalized mutual information is biased in clustering and community detection.

problem Bias in normalized mutual information for clustering and community detection.
method Introducing a modified version of mutual information to correct for information content and spurious dependence.
result The modified mutual information leads to different conclusions about which algorithms are best for community detection.

The study examines how social biases are reinforced in machine learning models used for credit scoring.

problem Reinforcement of societal biases in machine learning algorithms for credit scoring.
method Analysis of machine learning models predicting gender or ethnicity based on loan applications data.
result Machine learning models can reflect and reinforce social biases present in the data.

We evaluate the folk wisdom that algorithmic decision rules trained on data produced by biased human decision-makers necessarily reflect this bias. We consider a setting where training labels are only generated if a biased decision-maker takes a particular action, and so "biased" training data arise due to discriminato…

2019-09-18abs ↗pdf ↗

A very simple event frequency approximation algorithm that is sensitive to event timeliness is suggested. The algorithm iteratively updates categorical click-distribution, producing (path of) a random walk on a standard nn-dimensional simplex. Under certain conditions, this random walk is self-similar and corresponds …

2019-05-22abs ↗pdf ↗

The paper addresses biased preferences in candidate selection, proposing a fair and utility-maximizing algorithm.

problem Selecting candidates for institutions with biased preferences and limited capacities.
method An algorithm that considers group fairness and true utility, proving near-optimal results under distributional assumptions.
result The proposed algorithm achieves near-optimal group fairness and near-maximal true utility, even in biased settings.

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.

The paper analyzes time-dependent streaming data with biased gradient estimates and proposes improved stochastic optimization methods.

problem Stochastic optimization in a streaming setting with time-dependent and biased gradient estimates.
method Analysis of several first-order methods including SGD, mini-batch SGD, and time-varying mini-batch SGD, along with their Polyak-Ruppert averages.
result Time-varying mini-batch SGD methods can break long- and short-range dependence structures, and biased SGD methods can achieve comparable performance to their unbiased counterparts.

Many machine learning algorithms are trained and evaluated by splitting data from a single source into training and test sets. While such focus on in-distribution learning scenarios has led to interesting advancement, it has not been able to tell if models are relying on dataset biases as shortcuts for successful predi…

2019-10-07abs ↗pdf ↗

This work uncovers how model and data biases interact to cause unfairness in fraud detection.

problem Unfairness in fraud detection algorithms due to model and data biases.
method Taxonomy of data bias, hypotheses on fairness-accuracy trade-offs, real-world fraud use case study.
result Data bias affects fairness in expected value and variance, and simple pre-processing can balance group-wise error rates.

Algorithm improves recommendation subset selection in the presence of biases.

problem Maximizing submodular functions for recommendation in the presence of social biases.
method Algorithm for submodular maximization with fairness constraints.
result Algorithm provably outputs subsets with near-optimal utility and proportional representation.

Accurately predicting the outcome of sporting events has been a goal for many groups who seek to maximize profit. What makes this challenging is that the outcome of an event can be influenced by many factors that dynamically change across time. Oddsmakers attempt to estimate these factors by using both algorithmic and …

2017-10-18abs ↗pdf ↗

Study data biases to predict algorithmic discrimination, developing a Data Bias Profile.

problem Data biases contribute to algorithmic discrimination, but their impact is understudied.
method Analyzed three common data biases across various datasets and models, developing a Data Bias Profile.
result Combination of proxies and label bias can lead to more significant discrimination than underrepresentation alone.

Learning algorithms need bias to generalize and perform better than random guessing. We examine the flexibility (expressivity) of biased algorithms. An expressive algorithm can adapt to changing training data, altering its outcome based on changes in its input. We measure expressivity by using an information-theoretic …

2019-11-09abs ↗pdf ↗

Survey on biases in image analysis for industrial safety.

problem Bias in machine learning algorithms affects industrial safety-critical applications.
method Survey and analysis of recent advances in bias detection and mitigation.
result Need for new methods to detect and mitigate biases in image analysis for safety-critical applications.

Solves biased pseudo-labels in imbalanced SSL by refining them.

problem Imbalanced class distributions in semi-supervised learning lead to biased pseudo-labels.
method Formulates a convex optimization problem to refine pseudo-labels and develops an efficient algorithm, DARP.
result Demonstrates the effectiveness of DARP in various imbalanced semi-supervised scenarios.

Algorithm improves binary classification of biased grouped data.

problem Improving binary classification for biased, grouped data.
method Assumes partition-projected class-conditional invariance across groups and derives a semi-supervised algorithm to learn a group-aware classifier.
result Demonstrates improved area under the ROC curve compared to baselines.

Study shows how online personalization can lead to unfair models due to biased user responses.

problem Fairness issues in online personalization systems due to biased user responses.
method Formulated a regularization-based approach to mitigate biases in machine learning models.
result Demonstrated that online personalization can cause models to learn unfair behavior from biased user responses.

The paper tackles fair sequential decision making with biased linear bandit feedback.

problem Fair sequential decision making with biased linear bandit feedback.
method Phased elimination algorithm to correct unfair evaluations, establishing upper bounds on regret.
result The worst-case regret is smaller than O(κ1/3log(T)1/3T2/3)\mathcal{O}(κ_*^{1/3}\log(T)^{1/3}T^{2/3}).

Algorithm reduces audit costs by identifying best service configurations from biased textual evidence.

problem Designing service systems from textual evidence requires accurate selection despite biased automated scoring.
method Developed PP-LUCB algorithm combining LLM scores and selective audits to minimize costs.
result Correctly identified the best model in 40/40 trials with 90% cost reduction.

While implicit feedback (e.g., clicks, dwell times, etc.) is an abundant and attractive source of data for learning to rank, it can produce unfair ranking policies for both exogenous and endogenous reasons. Exogenous reasons typically manifest themselves as biases in the training data, which then get reflected in the l…

2019-11-19abs ↗pdf ↗

We consider practical data characteristics underlying federated learning, where unbalanced and non-i.i.d. data from clients have a block-cyclic structure: each cycle contains several blocks, and each client's training data follow block-specific and non-i.i.d. distributions. Such a data structure would introduce client …

2020-02-18abs ↗pdf ↗

The possible impact of algorithmic recommendation on the autonomy and free choice of Internet users is being increasingly discussed, especially in terms of the rendering of information and the structuring of interactions. This paper aims at reviewing and framing this issue along a double dichotomy. The first one addres…

2019-07-19abs ↗pdf ↗

With the deluge of digitized information in the Big Data era, massive datasets are becoming increasingly available for learning predictive models. However, in many practical situations, the poor control of the data acquisition processes may naturally jeopardize the outputs of machine learning algorithms, and selection …

2019-06-28abs ↗pdf ↗

A new strategy for identifying the best arm in Gaussian bandits with improved exploration.

problem Best-arm identification for Gaussian bandits with bounded means and unit variance.
method Exploration-Biased Sampling, a non-asymptotic approach with improved exploration behavior.
result Improved exploration behavior makes the strategy more stable and interpretable.

NeuralRBMLE tackles explore-exploit trade-offs in contextual bandits with neural networks.

problem Stochastic contextual bandit problem with general bounded reward functions.
method Reward-biased maximum likelihood estimation with neural networks to enforce exploration.
result Both NeuralRBMLE variants achieve O~(T)\widetilde{\mathcal{O}}(\sqrt{T}) regret.

The paper shows how the generalization curve can have multiple peaks, influenced by data and learning algorithm biases.

problem Understanding the generalization behavior of linear regression models under varying parameterizations.
method Analyzes generalization loss in linear regression models with varying parameterizations, both under- and over-parameterized.
result The generalization curve can have an arbitrary number of peaks, and their locations can be controlled.