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

Trend · papers per month

92185277369 · Jun 202019922001200920172026
48 results for debiasing techniques

Debiasing techniques can worsen gender bias in text classification, but a tweak improves both.

problem Debiasing techniques can inadvertently increase gender bias in text classification.
method Investigated traditional debiasing techniques and found they worsen bias. Suggested a minor adjustment.
result A minor adjustment to debiasing techniques can reduce gender bias while maintaining high classification accuracy.

This paper evaluates debiasing methods on word embeddings to reduce religious bias.

problem Social biases persist in word embeddings, potentially amplifying them in AI applications.
method Investigates and evaluates three multiclass debiasing techniques on three word embeddings.
result ConceptorDebiasing is the most effective method, reducing religious bias by 82-96%.

Study improves statistical inference for CATEs using Lasso and DML.

problem Estimating and inferring CATEs in high-dimensional settings.
method Doubly robust estimator, Lasso regularization, debiased Lasso, DML.
result TDL (triple/debiased Lasso) achieves n\sqrt{n}-consistency and confidence intervals.

A debiasing method improves nonparametric regression's statistical properties.

problem Lack of theoretical guarantees for modern nonparametric regression methods.
method Model-free debiasing method incorporating a correction term.
result Debiased estimator satisfies pointwise and uniform risk convergence, asymptotic normality.

A new debiasing method for high-dimensional regression with applications to PCR.

problem Debiasing in high-dimensional statistics with i.i.d. samples and sub-Gaussian covariates.
method Spectrum-Aware Debiasing using rescaled gradient descent with spectral information.
result Achieves debiasing in broader contexts with structured dependencies, heavy tails, and low-rank structures.

Deep neural networks tackle high-dimensional nonparametric interaction models.

problem Estimating structured regression functions in high-dimensional data.
method Analyze kthk^{th} order nonparametric interaction models in growing and high dimensions, introducing debiasing techniques.
result Debiased deep neural networks achieve optimal rates of convergence in both growing and high dimensions.

New technique reduces bias in CSO problems, improving sample complexity.

problem Reducing bias in conditional stochastic optimization problems.
method Introducing a stochastic extrapolation technique combined with variance reduction.
result Achieved significantly better sample complexity for nonconvex smooth objectives.

MAPPING debiases GNNs for fair node classification with limited leakage.

problem Graph Neural Networks inherit and exacerbate historical discrimination in high-stake domains.
method MAPPING uses distance covariance-based fairness constraints and adversarial debiasing.
result MAPPING achieves better trade-offs between fairness and utility, mitigating privacy risks.

New technique debiases distributed optimization, improving convergence rate.

problem Bias in local estimates limits effectiveness of distributed second order optimization.
method Surrogate sketching and scaled regularization to eliminate bias.
result The debiased local estimates lead to faster convergence in distributed optimization.

Debiased contrastive learning improves representation learning by correcting for same-label sampling.

problem Sampling negative examples from truly different labels improves performance in self-supervised representation learning.
method Developed a debiased contrastive objective that corrects for the sampling of same-label datapoints without true labels.
result The proposed debiased contrastive objective consistently outperforms state-of-the-art methods across vision, language, and reinforcement learning benchmarks.

ADML combines debiased learning with data-driven model selection for efficient inference.

problem Debiased machine learning estimators can be unstable and biased in nonparametric models.
method Data-driven model selection techniques combined with debiased machine learning.
result ADML estimators yield superefficient inference for pathwise differentiable parameters.

The paper studies a rebalanced dataset for imbalanced classification using Centered Random Forests.

problem Imbalanced classification where one class is underrepresented.
method Theoretical analysis of Centered Random Forests (CRF) with rebalanced datasets and debiasing techniques.
result Theoretical Central Limit Theorem (CLT) for the infinite CRF and debiased estimator IS-ICRF.

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.

Paper develops PGMM framework for debiased inference on nonparametric IV estimators.

problem Automatic debiased inference on nonparametric IV functionals.
method Penalized GMM (PGMM) framework for functionals of IV estimators.
result PGMM-based debiased estimator performs well, achieving near-nominal coverage.

New technique reduces bias in DNN models without sensitive attribute annotations.

problem Existing bias mitigation methods require instance-level annotations and do not guarantee removal of all sensitive information.
method Representation Neutralization for Fairness (RNF) debiases only the classification head of DNN models using neutralized representations.
result RNF effectively reduces discrimination of DNN models with minimal performance degradation.

A new method debiases multiple target parameters without IFs.

problem Debiasing multiple target parameters in nonparametric models.
method Kernel Debiased Plug-in Estimation (KDPE) using TMLE and reproducing kernel Hilbert spaces.
result KDPE simultaneously debiases all pathwise differentiable target parameters.

The paper automates policy learning for nonlinear welfare criteria using machine learning and debiasing techniques.

problem Learning optimal policies from observational data with nonlinear welfare criteria.
method Modeling a nonlinear welfare criterion with a utility function, estimating propensity scores with machine learning, and using sieve approximations and cross-validation for model selection.
result The proposed policy learning method satisfies oracle inequalities, providing theoretical guarantees on performance.

A self-supervised debiasing method using rank regularization mitigates spurious correlations in neural networks.

problem Spurious correlations cause biases in deep neural networks, affecting generalization.
method Spectral analysis of latent representations, rank regularization, self-supervised pretraining, debiasing of downstream tasks.
result The proposed framework significantly improves generalization performance and outperforms supervised debiasing approaches.

This work debiases deep chest X-ray classifiers using intra- and post-processing methods.

problem Bias in deep neural networks for chest X-ray classification.
method Intra-processing techniques (fine-tuning and pruning) and post-processing methods.
result Successfully mitigates biases in fully connected and convolutional neural networks, offering stable performance.

Proposes online debiasing to correct bias in adaptive data collection for high-dimensional linear regression.

problem Bias in adaptive data collection for high-dimensional linear regression.
method Online debiasing procedure for LASSO and other estimators.
result Optimal debiasing of LASSO estimator in specific sparsity regime.

Develops a direct debiased machine learning framework using Bregman divergence.

problem Reduces bias in machine learning estimates of causal effects or structural models.
method Neyman targeted estimation and generalized Riesz regression using Bregman divergence.
result Improves estimation of parameters of interest in causal models.

Ridge regression is revisited with debiasing and thresholding, offering advantages over Lasso.

problem High-dimensional data challenges classical ridge regression's sparsity detection and bias issues.
method Debiasing and thresholding ridge regression, introducing a wild bootstrap for confidence regions and hypothesis testing, and a hybrid bootstrap for prediction intervals.
result Debiased and thresholded ridge regression can offer similar performance to thresholded Lasso and may be preferable in some settings.

StochasticRank optimizes ranking metrics efficiently and guarantees global convergence.

problem Optimizing discrete ranking metrics due to their ill-posed nature.
method Stochastic smoothing, gradient estimate, debiasing, and Stochastic Gradient Langevin Boosting.
result Global convergence and superior performance on ranking datasets.

Paper develops a distributed debiased estimator for sparse statistical inference.

problem High computational costs in debiased estimator construction for high-dimensional models.
method Develops a multi-round distributed debiased estimator using both labeled and unlabelled data.
result Unlabeled data improves statistical rate of each iteration in distributed setup.

COMMOD debiases models with minimal and interpretable changes.

problem Inconsistent and costly model updates in fair machine learning.
method Introduced COMMOD, a novel algorithm for algorithmic fairness that minimizes changes and makes them interpretable.
result COMMOD achieves comparable performance to state-of-the-art debiasing methods while making minimal and interpretable changes.

A theorem for debiasing machine learning with finite sample guarantees.

problem Calculating confidence intervals for machine learning functionals.
method Debiased machine learning based on bias correction and sample splitting.
result Nonasymptotic debiased machine learning theorem with finite sample guarantees.

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.

Automatic debiasing for causal and policy effects using Neural Nets and Random Forests.

problem Estimating causal and policy effects from high-dimensional or non-parametric regression functions.
method Automatic learning of Riesz representation using Neural Nets and Random Forests.
result Automatic debiasing method performs well compared to state-of-the-art algorithms.

Unified theory and debiasing framework for random oblique projections in high dimensions.

problem Systematic statistical bias in random oblique projections induced by sampling.
method Unified non-asymptotic theory and debiasing framework.
result Sharp bias--variance characterizations and improved approximation accuracy.

New method for debiased inference without assuming exact solutions in inverse problems.

problem Dealing with inverse problems where exact solutions may not exist.
method Nonparametric instrumental variable analysis without structural equations.
result Valid inference on functionals of inverse problems without assuming exact solutions.

Easyllp simplifies LLP, achieving low task loss at individual instance level.

problem Weakly supervised classification with label proportions.
method Flexible debiasing approach based on aggregate labels, operating on arbitrary loss functions.
result Accurately estimates expected loss at individual level, with provable guarantees.