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

Trend · papers per month

125249374498 · Jun 202019922001200920172026
48 results for information bias

A bias classifier is introduced to resist adversarial attacks.

problem Resisting adversarial attacks on deep neural networks (DNNs).
method Introducing the bias part of a DNN with Relu as the activation function as a classifier, and adding a random first-degree part to make it information-theoretically safe.
result The bias classifier is more robust than DNNs of similar size against adversarial attacks.

Study suggests using information flow measures to target interventions in neural networks.

problem Identifying neural network edges that can be pruned to reduce bias.
method Used MM-information flow framework to measure and compare information flows about true labels and protected attributes, and evaluated pruning effects on bias reduction.
result Pruning edges with larger information flows about protected attributes reduces bias at the output.

Building on the view of machine learning as search, we demonstrate the necessity of bias in learning, quantifying the role of bias (measured relative to a collection of possible datasets, or more generally, information resources) in increasing the probability of success. For a given degree of bias towards a fixed targe…

2019-07-13abs ↗pdf ↗

New estimator reduces bias and variance issues in mutual information estimation.

problem Difficulty in using variational MI estimators due to bias/variance tradeoffs and self-consistency issues.
method Developed a new estimator based on a unified perspective of variational approaches, focusing on variance reduction.
result Empirical results show improved bias-variance trade-offs compared to existing estimators.

We study the informational efficiency of a market with a single traded asset. The price initially differs from the fundamental value, about which the agents have noisy private information (which is, on average, correct). A fraction of traders revise their price expectations in each period. The price at which the asset …

2010-09-26abs ↗pdf ↗

Proposes methods to correct bias and missing data in regression models.

problem Nonignorable selection bias and missing response in regression models.
method Imputation-based and importance weighted regression methods, including repeated regression and doubly robust combination.
result Repeated regression can effectively correct bias and outperforms weighted regression in extrapolation.

Framework reduces simplicity bias in NNs, improving OOD generalization and robustness.

problem Simplicity bias in deep learning models leads to biased predictions and poor OOD generalization.
method Proposes a framework that regularizes conditional mutual information to encourage use of diverse features.
result Demonstrates effectiveness in various settings, enhancing OOD generalization and robustness.

New method learns diverse solutions in reinforcement learning without gradient bias.

problem Lack of diverse solutions in reinforcement learning tasks.
method Maximizes state-action-based mutual information directly, using variational lower bound.
result Successfully learns an infinite set of diverse solutions.

(Bolukbasi et al., 2016) demonstrated that pretrained word embeddings can inherit gender bias from the data they were trained on. We investigate how this bias affects downstream classification tasks, using the case study of occupation classification (De-Arteaga et al.,2019). We show that traditional techniques for debi…

2019-08-07abs ↗pdf ↗

Paper tackles treatment leakage in text-based causal inference, proposing methods to mitigate bias.

problem Treatment leakage in text-as-confounder applications introduces bias in causal estimates.
method Formal definitions, four text distillation methods (passage removal, classification, salient feature removal, nullspace projection).
result Moderate distillation optimally balances bias reduction against confounder retention.

New method neutralizes gender bias in word embeddings without losing semantic information.

problem Gender biases in word embeddings trained on human-generated corpora.
method Latent Disentanglement and Counterfactual Generation with siamese auto-encoder and gradient reversal layer.
result Our method outperforms existing debiasing methods in preserving semantic information and neutralizing gender biases.

GWIB improves counterfactual regression by balancing latent distributions and reducing selection bias.

problem Selection bias between control and treatment groups negatively impacts counterfactual regression performance.
method GWIB uses Gromov-Wasserstein information bottleneck to maximize mutual information between covariates and outcomes while penalizing kernelized mutual information between latent representations and covariates.
result GWIB consistently outperforms state-of-the-art CFR methods in ITE estimation tasks.

New framework explains neural network bias in solving differential equations.

problem Understanding and controlling the bias in PINNs for differential equations.
method Deriving an integro-differential equation from PINNs and GPR equivalence.
result PINN predictions are influenced by a kernel term reflecting architecture choices.

The paper addresses bias in survival analysis due to informative censoring.

problem Bias in treatment effect estimates due to informative censoring in survival analysis.
method Assumption-lean framework using partial identification to derive bounds on CATE.
result Proposes a meta-learner, SurvB-learner, to estimate bounds on CATE.

FR-Train improves fair and robust AI training by detecting and reducing poisoned data.

problem Training AI models that are fair and robust in the presence of data bias and poisoning.
method Mutual information-based adversarial training with an additional discriminator.
result FR-Train maintains fairness and accuracy even in the presence of poisoned data.

This work addresses fairness in ML models by training and evaluating attribute classifiers under uncertain and incomplete data.

problem Challenges in fairness metrics due to uncertain and incomplete data.
method Developed a theoretical and empirical analysis to understand and improve bias estimation in the data-scarce regime.
result The test accuracy of the attribute classifier is not always correlated with its effectiveness in bias estimation.

The paper explores the trade-off between bias and variance in high-dimensional models.

problem Understanding the unavoidable trade-off between bias and variance in high-dimensional statistical models.
method Proposes a general strategy to obtain lower bounds on the variance of estimators with a specified bias, and applies it to various statistical models.
result Shows the extent to which the bias-variance trade-off is unavoidable and quantifies the performance loss for methods that do not balance it.

Recommendation systems have been integrated into the majority of large online systems to filter and rank information according to user profiles. It thus influences the way users interact with the system and, as a consequence, bias the evaluation of the performance of a recommendation algorithm computed using historical…

2015-06-12abs ↗pdf ↗

The paper addresses sampling bias in risk-based active learning.

problem Sampling bias in active learning leads to poor decision-making performance.
method The paper uses a semi-supervised Gaussian mixture model with an EM algorithm to counteract sampling bias.
result The EM algorithm effectively incorporates pseudo-labels for unlabelled data, reducing sampling bias.

Anonymization reduces economic signal extraction from financial texts.

problem Reducing meaningful economic signals from financial texts due to anonymization.
method Analyzed the impact of anonymization on textual understanding and economic signal extraction.
result Information loss due to anonymization is severe and pervasive, outweighing its benefits in certain financial applications.

New algorithm achieves optimal regret in average reward MDPs without prior bias information.

problem Achieving optimal regret in average reward MDPs with computational efficiency and without prior bias information.
method Projective Mitigated Extended Value Iteration (PMEVI) to compute bias-constrained optimal policies efficiently.
result First tractable algorithm with minimax optimal regret of O~(sp(h)SAT)\widetilde{\mathrm{O}}(\sqrt{\mathrm{sp}(h^*) S A T}).

New method mitigates bias without sensitive data using causal graph and variational autoencoder.

problem Lack of fairness strategies when sensitive attributes are not collected.
method SRCVAE framework based on causal graph for inferring a proxy sensitive attribute.
result Significant improvements in fairness metrics over existing methods.

A new method for learning network representations that avoids information bias and sparsity.

problem Information bias and sparsity in network representation learning.
method A spreading-activation schema for learning node embeddings in network structures.
result Significant improvement in various real-world network analysis tasks.

RS-PINN uses randomized smoothing to speed up high-dimensional PDE simulations without sacrificing accuracy.

problem High computational cost and bias in PINNs for high-dimensional PDEs.
method Introduces Gaussian noise for stochastic smoothing of PINNs, enabling Monte Carlo derivative approximation.
result Proposes bias correction techniques and a hybrid method to optimize the bias-variance trade-off.

Estimating and optimizing Mutual Information (MI) is core to many problems in machine learning; however, bounding MI in high dimensions is challenging. To establish tractable and scalable objectives, recent work has turned to variational bounds parameterized by neural networks, but the relationships and tradeoffs betwe…

2019-05-16abs ↗pdf ↗

Bayesian adaptive designs can be biased by active learning, especially with misspecified models.

problem Active learning bias in Bayesian adaptive experimental designs.
method Analysis of linear and preference learning models, empirical testing.
result Model misspecification and noise influence active learning bias in Bayesian designs.

OMIC improves matrix completion with orthonormal side information and nuclear-norm regularization.

problem Matrix completion with improved interpretability and adaptability.
method OMIC combines orthonormal side information and nuclear-norm regularization, optimized by a converging algorithm.
result OMIC outperforms state-of-the-art methods in synthetic and real-world datasets.

This work introduces a bias-variance decomposition for proper scores, improving uncertainty estimation in predictive models.

problem Reliable uncertainty estimation for predictions in safety-critical applications, especially under domain drift.
method Developed a general bias-variance decomposition for proper scores, introducing the Bregman Information as the variance term.
result The decomposition provides novel formulations for different predictive tasks, including classification and model ensembles.

Machine learning can improve 2SLS first stage predictions, but nonlinear methods often introduce bias.

problem Improving the first stage of 2SLS using machine learning.
method Decomposed bias into three components, investigated through simulation.
result Nonlinear machine learning methods can introduce substantial bias in second-stage estimates.

PAC-MCTS addresses biased search in LLM-guided planning by dynamically pruning.

problem Systematic biases in LLMs lead to inefficient and unsafe search in deep planning tasks.
method Formulates node expansion as BAI under bounded bias, derives sample complexity bounds, and proposes PAC-MCTS for dynamic confidence bounds.
result PAC-MCTS improves robustness and efficiency by up to 78% fewer API evaluations and 3x higher sample efficiency.