Mitigates gender bias amplification in model predictions.
problem Gender bias amplification in model predictions.
method Posterior regularization to mitigate bias.
result Almost removes gender bias amplification in model predictions.
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,695 papers · 148 categories
Trend · papers per month
48 results for “bias distribution”
ADB framework improves OOD generalization by increasing ID bias during training.
problem Machine learning models degrade on new data distributions.
method ADB framework introduces controlled statistical diversity during training.
result Higher in-distribution bias leads to better out-of-distribution generalization.
Extends Popularity Bias Memorization theorem to new conditions.
problem Estimating alignment with top-k singular hyperspace.
method Extending theorem to arbitrary degree distributions and proving upper and lower bounds.
result Upper and lower estimates for alignment with top-k singular hyperspace.
The study reveals a persistent bias in the distribution of holonomy on compact hyperbolic 3-manifolds.
problem The distribution of holonomy on compact hyperbolic 3-manifolds is not uniformly distributed.
method An asymptotic count of closed geodesics by their length and holonomy, and analysis of spectral parameters.
result A normalized, smoothed bias count of holonomy is distributed according to a probability distribution, controlled by the number of zero spectral parameters.
Controlling Overestimation Bias with Truncated Mixture of Continuous Distributional Quantile Criticscs.LG
Paper tackles overestimation bias in continuous control, improving performance by 25%.
problem Overestimation bias in off-policy learning.
method Truncated Quantile Critics (TQC) combines distributional representation, truncation, and ensembling of critics.
result TQC outperforms state-of-the-art methods by 25% on the Humanoid environment.
Paper proposes MMC to avoid high-density bias in clustering.
problem High-density bias in density-based clustering.
method Introduces mass distribution as a better foundation for clustering, proposing mass-maximization clustering (MMC).
result MMC avoids high-density bias and discovers clusters of arbitrary shapes, sizes, and densities.
Gradient descent learns ReLU functions with non-zero bias efficiently.
problem Learning ReLU functions with non-zero bias under Gaussian distributions.
method Gradient descent starting from random initialization.
result Gradient descent achieves near-optimal error with high probability.
BC-ACI corrects time series forecast bias, improving prediction intervals.
problem Persistent bias in time series forecasts leads to overly conservative prediction intervals.
method Augments ACI with an EWM estimate of forecast bias to correct nonconformity scores and re-center intervals.
result Reduces Winkler interval scores by 13-17% under distribution shifts, improving calibration.
Proposes a three-stage debiasing framework to improve out-of-distribution accuracy.
problem Inaccurate uncertainty estimations in bias-only models damage ensemble-based debiasing performance.
method Calibrates the bias-only model to improve its uncertainty estimations, creating a three-stage ensemble-based debiasing framework.
result The three-stage debiasing framework consistently outperforms traditional methods in out-of-distribution accuracy.
ABROCA assesses algorithmic bias, revealing skewed distributions that inflate results.
problem Detecting nuanced performance differences in classifier fairness.
method Study of ABROCA metric's statistical properties under various conditions.
result ABROCA distributions are skewed, inflating results by chance in imbalanced classes.
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.
Bayesian generative models can flag performance loss, bias, and out-of-distribution image contentcs.LG
SLUG method detects bias and out-of-distribution content in generative models.
problem Generative models can underrepresent certain groups and fail on out-of-distribution data.
method SLUG: A new uncertainty quantification method for VAEs combining Laplace approximations and stochastic trace estimators.
result SLUG's UQ score correlates with bias and out-of-distribution content.
Regional Inequality Simulations Based on Asset Exchange Models with Exchange Range and Local Support Biasphysics.soc-ph
New models reduce regional inequality by adjusting exchange range and asset distribution bias.
problem Reduction of regional inequality in economic systems.
method Proposed new asset exchange models with spatial exchange range and local support bias to adjust asset distribution and circulation rates.
result Achieved asset distribution from over-concentration to exponential and eventually normal, reducing Gini coefficient.
BR-SNIS reduces bias in self-normalized IS without increasing variance.
problem Bias in self-normalized IS.
method Iterated sampling-importance resampling (ISIR) to form a bias-reduced estimator.
result Significant reduction in bias without increasing variance.
Neural networks exhibit unimodal variance with model complexity, improving generalization.
problem The classical bias-variance trade-off does not apply to neural networks, leading to better generalization with larger models.
method Measured bias and variance of neural networks, confirmed empirically and theoretically.
result Neural networks show unimodal variance, leading to a double descent risk curve.
It has been noticed that some external CVIs exhibit a preferential bias towards a larger or smaller number of clusters which is monotonic (directly or inversely) in the number of clusters in candidate partitions. This type of bias is caused by the functional form of the CVI model. For example, the popular Rand index (R…
Bayesian inference corrects bias in supervised learning datasets.
problem Correcting bias in supervised machine learning datasets.
method Bayesian inference framework to adjust posterior distribution.
result Improved model fitting to original dataset.
The paper addresses score-mismatched diffusion models and zero-shot conditional samplers.
problem Theoretical guarantees for score-mismatched diffusion models in zero-shot conditional sampling.
method Theoretical analysis of score-mismatched diffusion models and zero-shot conditional samplers.
result Theoretical performance guarantees with explicit dimensional dependencies for score-mismatched diffusion samplers.
Unified framework suppresses model bias in semi-supervised learning with decoupled sampling control.
problem Class imbalance in semi-supervised learning, especially with distributional mismatches.
method Unified framework SC-SSL with decoupled sampling control, explicit expansion capability, and adaptive sampling probabilities.
result Consistent and state-of-the-art performance across various benchmark datasets and distribution settings.
Distributed learning is an effective way to analyze big data. In distributed regression, a typical approach is to divide the big data into multiple blocks, apply a base regression algorithm on each of them, and then simply average the output functions learnt from these blocks. Since the average process will decrease th…
Mitigates confirmation bias in SSL by adjusting pseudo labels dynamically.
problem Confirmation bias in semi-supervised learning leads to errors in pseudo labels.
method TaMatch framework adjusts scaling ratio to debias pseudo labels and dynamically adjusts target distribution.
result TaMatch significantly outperforms existing methods in SSL tasks.
This paper analyzes the bias of inexact MCMC methods in high dimensions.
problem Understanding the bias of inexact MCMC methods in high-dimensional spaces.
method Establishing bounds on Wasserstein distances between inexact MCMC methods and target distributions.
result The asymptotic bias of ULA and uHMC depends on key quantities related to the target distribution or the stationary probability measure of the scheme.
Improved sampling from complex distributions with reduced bias.
problem Reducing bias in high-dimensional sampling algorithms.
method Hierarchical entropy analysis to weaken assumptions and expand scope.
result Bias reduction in low-dimensional marginals scales with lower dimension, not full dimension.
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.
Adam avoids simplicity bias in neural networks, leading to better generalization.
problem Simplicity bias in neural networks trained with SGD.
method Comparison of Adam and GD on binary classification tasks with Gaussian data.
result Adam leads to richer and more diverse features, improving generalization.
A learned generative model often produces biased statistics relative to the underlying data distribution. A standard technique to correct this bias is importance sampling, where samples from the model are weighted by the likelihood ratio under model and true distributions. When the likelihood ratio is unknown, it can b…
Gradient clipping helps private SGD converge despite potential bias.
problem Gradient clipping in private SGD can bias convergence.
method Theoretical analysis and empirical evaluation of gradient clipping effects.
result Gradient clipping can prevent convergence to stationary points and introduces bias.
In many applications we seek to maximize an expectation with respect to a distribution over discrete variables. Estimating gradients of such objectives with respect to the distribution parameters is a challenging problem. We analyze existing solutions including finite-difference (FD) estimators and continuous relaxatio…
This paper tackles bias in federated learning without compromising data privacy.
problem Bias in federated learning models.
method Three pre-processing and in-processing methods to mitigate bias.
result Proposed methods are effective even with skewed data distributions or a small number of participating parties.
The bias potential model explains how generative models can generalize or memorize samples.
problem Understanding and achieving generalization in generative models like GANs.
method Introducing the bias potential model to analyze the behavior of generative models.
result Dimension-independent generalization accuracy can be achieved with early stopping in the bias potential model.
New method corrects bias in datasets using cumulative distribution functions.
problem Varying domains and biased datasets lead to differences between training and target distributions.
method Empirical cumulative distribution function estimates of the target distribution, rigorously generalized.
result Method is more robust, not reliant on parameter tuning, and performs similarly to state-of-the-art techniques.
Study Q-learning with constant stepsize, proving convergence and bias, and applying extrapolation.
problem Understanding and optimizing Q-learning with constant stepsize.
method Connecting Q-learning to a Markov chain, proving distributional convergence and bias, applying Richardson-Romberg extrapolation.
result Explicit expression for the linear coefficient of the asymptotic bias and improvement of RR extrapolation method.
Geometric framework analyzes bias in variational inference for posterior functionals.
problem Analyzing the bias of posterior functionals under variational approximations.
method Developed a geometric framework to evaluate the bias of posterior functionals using the variational tangent space.
result The leading-order bias of a posterior functional is determined by its component orthogonal to the variational tangent space.
Active learning introduces bias; this paper fixes it.
problem Bias in active learning due to non-representative training data.
method Formalized bias, identified situations where it's harmful/helpful, introduced corrective weights.
result Corrective weights can improve active learning, especially with overparameterized models.
New method controls bias in unadjusted Hamiltonian Monte Carlo and underdamped Langevin.
problem Bias in unadjusted Hamiltonian Monte Carlo and underdamped Langevin samplers.
method Delocalization of bias technique applied to these samplers.
result Control bias with integration steps for high-dimensional distributions.
Empirical Bayes Rebiasingstat.ME
We rebias estimates to improve interval calibration and prediction accuracy.
problem Constructing accurate intervals for noisy and biased estimates.
method Empirical Bayes rebiasing strategy that learns bias distribution from data.
result Substantial precision gains in prediction-powered inference.
A new algorithm removes unexpected correlations in biased data for better clustering.
problem Clustering with selection bias in data.
method Decorrelation regularized K-Means (DCKM) algorithm.
result DCKM achieves significant performance gains on real-world datasets.
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.
Modeling bias in evaluation processes using optimization.
problem Bias in evaluation processes based on socially-salient attributes.
method Optimization-based model with two parameters: resource-information trade-off and risk-averseness.
result Characterization of distributions and effect of parameters on observed distributions.
Proposes EDM algorithm to accelerate model training in distributed networks.
problem Hindered effectiveness of distributed stochastic optimization algorithms due to data heterogeneity and network sparsity.
method Introduces Exact-Diffusion with Momentum (EDM) algorithm, incorporating momentum techniques to mitigate bias and enhance convergence rate.
result EDM algorithm converges sub-linearly to the optimal solution, radius independent of data heterogeneity, for non-convex objective functions.
Private statistics estimation faces a bias, accuracy, and privacy trilemma.
problem Balancing privacy, accuracy, and bias in statistical estimation.
method Use differential privacy (DP) for private statistics, but clip samples to control sensitivity and add noise for privacy, introducing bias.
result No algorithm can simultaneously have low bias, low error, and low privacy loss for arbitrary distributions.
Paper analyzes \FedAvg's convergence and introduces a new algorithm to reduce bias.
problem Analyzing convergence and bias in Federated Averaging.
method Markov property, first-order bias expansion, Richardson-Romberg extrapolation.
result Bias in \FedAvg can be decomposed into noise and client heterogeneity components.
New method corrects bias in estimating entropic risk for better decision-making.
problem Underestimation of entropic risk when data are limited.
method Parametric bootstrap procedure to overestimate entropic risk.
result Corrected method provides better risk estimates, leading to improved decision-making.
This report examines the Pinned AUC metric introduced and highlights some of its limitations. Pinned AUC provides a threshold-agnostic measure of unintended bias in a classification model, inspired by the ROC-AUC metric. However, as we highlight in this report, there are ways that the metric can obscure different kinds…
The paper analyzes optimal implicit bias in linear regression for over-parameterized models.
problem Finding the best generalization performance in over-parameterized linear regression.
method Asymptotic analysis of generalization performance for convex functions/potentials.
result Optimal implicit bias that achieves the best generalization error under certain conditions.
Unified framework for mean testing under truncation bias.
problem High-dimensional mean testing under arbitrary truncation.
method Characterizes fundamental limits and develops a simple second-order test.
result Unified framework connects finite-moment, sub-Gaussian, and median-regular structural regimes.
New method corrects risk estimation bias, improving backtesting results.
problem Underestimation of risk by existing methods, especially in small samples.
method Proposes a new algorithm for bias correction using generalized Pareto distributions.
result The new algorithm leads to improved efficiency in estimating risk with heavy tails or heteroscedasticity.
This study analyzes bias in face generation models and proposes mitigation techniques.
problem Bias in face generation models that may misrepresent certain social groups.
method Three approaches: generators, attribute modifier, and post-processing bias mitigators.
result Generators suffer from bias across all social groups, while post-processing mitigators show different feature concentration.