Paper addresses selection bias in online advertising auctions.
problem Selection bias affects auction truthfulness and advertiser profits.
method Theoretical analysis combined with multi-task learning.
result Selection bias can be significantly reduced using multi-task learning.
New scoring rule predicts causal relations from data with selection bias.
problem Discovering causal relations from independence constraints under selection bias and confounding.
method Local Y-Structure patterns and a scoring rule for Y-Structures.
result Y-Structure scoring rule successfully predicts causal relations in real-world data.
Estimates causal effects with selection bias and confounding using regression.
problem Estimating causal effects in presence of selection bias and confounding.
method Two-step regression estimator (TSR) that corrects for selection bias and accounts for confounding.
result TSR estimator reduces variance and is validated in simulations.
New method corrects selection bias in complex models.
problem Selection bias in statistical studies leading to systematic distortions.
method Amortized Bayesian inference with neural posterior estimation.
result Recover well-calibrated posterior distributions across diverse selection mechanisms.
New method corrects selection bias in post-selective inference for Group LASSO.
problem Inference after Group LASSO selection is unreliable.
method Develops a consistent, post-selective Bayesian method to adjust for selection bias.
result Corrects bias in recovering effects of selected variables.
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.
Algorithm bounds causal queries under selection bias.
problem Selection bias affects causal analysis.
method Proposes a new algorithm to address both identifiable and unidentifiable causal queries.
result The likelihood of available data is unimodal, enabling bounds on causal queries.
This paper tackles selection bias in recommender systems by considering the neighborhood effect.
problem Selection bias in recommender systems due to filtering and user selection.
method Formalizes neighborhood effect as interference problem, introduces treatment representation, and proposes ideal loss.
result Proposed methods achieve unbiased learning when both selection bias and neighborhood effect are present.
New method predicts model performance under selection bias in healthcare.
problem Selection bias limits model generalizability in healthcare.
method Proposes a novel upper bound method for estimating model performance.
result Validates and demonstrates the practical utility of the method.
Improves decision-making by correcting feature selection bias.
problem Cofounding bias in feature selection affects machine learning predictions.
method Proposes a meta-algorithm using a novel adjustment criterion based on causal sufficiency.
result Corrects cofounding bias to improve prediction performance.
SkMM selects data for finetuning by balancing bias and variance.
problem Balancing bias and variance in high-dimensional finetuning.
method Gradient sketching for bias reduction and moment matching for variance reduction.
result Gradient sketching selects samples efficiently and accurately.
Counterfactual reasoning is an important paradigm applicable in many fields, such as healthcare, economics, and education. In this work, we propose a novel method to address the issue of \textit{selection bias}. We learn two groups of latent random variables, where one group corresponds to variables that only cause sel…
We identify and analyze selection structure in sequential data.
problem Selection biases in sequential data can distort analysis and hide underlying generation processes.
method Nonparametric identifiability of selection structure without interventional experiments.
result Selection structure is identifiable in sequential data without parametric assumptions.
Discovering statistically significant patterns from databases is an important challenging problem. The main obstacle of this problem is in the difficulty of taking into account the selection bias, i.e., the bias arising from the fact that patterns are selected from extremely large number of candidates in databases. In …
Intersectional constraints improve selection outcomes by reducing inequality.
problem Persistent inequality and reduced utility in selection processes due to implicit bias.
method Introducing intersectional constraints to mitigate the adverse effects of implicit bias in selection processes.
result Intersectional constraints can recover almost all the utility achievable in the absence of implicit bias, offering a significant advantage over non-intersectional constraints.
A RL framework selects features to balance bias and accuracy dynamically.
problem Bias in automated feature selection when predictors are correlated.
method Multi-component reward function with policy gradient for dynamic regularization and bias mitigation.
result Model balances fairness and accuracy during training.
New algorithm identifies causal relationships from graphs, even with selection bias.
problem Identifying causal relationships from graphs with selection bias.
method Developed a measure-theoretic version of Pearl's causal calculus and a sound, complete identification algorithm.
result General measure-theoretic version of causal calculus allows for identification of causal relationships under selection bias.
New algorithm offers costless model selection in contextual bandits.
problem Minimizing cumulative regret in stochastic contextual bandits.
method Gradually increasing class complexity and adapting to the simplest class with dominant estimation variance.
result Costless model selection is feasible under certain conditions, providing improved regret guarantees.
sgboost reduces variable selection bias in boosting with balanced group selection.
problem Reduces variable selection bias in boosting algorithms.
method Simulation-based approach to balance selection frequencies of base-learners.
result Demonstrates efficacy through simulations and flexible group variable selection.
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.
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.
We study the phenomenon of bias amplification in classifiers, wherein a machine learning model learns to predict classes with a greater disparity than the underlying ground truth. We demonstrate that bias amplification can arise via an inductive bias in gradient descent methods that results in the overestimation of the…
New method debiases selection bias in PU classification with exposure data.
problem Binary classification from positive and unlabeled data with selection bias.
method Automatic Debiased PUE (ADPUE) learning method.
result ADPUE outperforms traditional PU learning methods on various datasets.
Causal processes in nature may contain cycles, and real datasets may violate causal sufficiency as well as contain selection bias. No constraint-based causal discovery algorithm can currently handle cycles, latent variables and selection bias (CLS) simultaneously. I therefore introduce an algorithm called Cyclic Causal…
TCFimt forecasts causal effects of multiple interventions from individual data.
problem Estimating causal effects of temporal multi-interventions from individual data.
method TCFimt uses adversarial tasks in seq2seq framework to alleviate bias and contrastive learning to decouple effects.
result TCFimt outperforms state-of-the-art methods in predicting future outcomes and choosing optimal treatments.
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.
Confounding bias, missing data, and selection bias are three common obstacles to valid causal inference in the data sciences. Covariate adjustment is the most pervasive technique for recovering casual effects from confounding bias. In this paper, we introduce a covariate adjustment formulation for controlling confoundi…
We consider large-scale studies in which it is of interest to test a very large number of hypotheses, and then to estimate the effect sizes corresponding to the rejected hypotheses. For instance, this setting arises in the analysis of gene expression or DNA sequencing data. However, naive estimates of the effect sizes …
Paper corrects bias in online learning algorithms with endogenous data.
problem Dynamic selection problems in online learning algorithms with endogenous data.
method Instrumental-variable-based algorithm to correct bias, proving central limit theorem.
result Obtains true parameter values and low regret levels.
We prove the main rules of causal calculus (also called do-calculus) for i/o structural causal models (ioSCMs), a generalization of a recently proposed general class of non-/linear structural causal models that allow for cycles, latent confounders and arbitrary probability distributions. We also generalize adjustment c…
The paper addresses selection bias in conformal prediction for focal units.
problem Selection bias in marginally valid conformal prediction intervals for focal units.
method A general framework for constructing selection-conditional coverage prediction sets.
result Efficient methods for various selection rules with exact finite-sample coverage.
Boundary effects inflate variance in Gaussian processes, leading to acquisition bias.
problem Boundary-induced acquisition bias in Gaussian processes.
method Traced root cause to geometric mechanism of kernel truncation at domain boundaries.
result Boundary effects create distortion that worsens with dimensionality, affecting acquisition behavior.
Tree ensembles such as Random Forests have achieved impressive empirical success across a wide variety of applications. To understand how these models make predictions, people routinely turn to feature importance measures calculated from tree ensembles. It has long been known that Mean Decrease Impurity (MDI), one of t…
New research shows the bandwagon effect doesn't cause bias but can make estimators inconsistent.
problem The bandwagon effect in recommender systems makes estimators inconsistent.
method Theoretical analysis investigating conditions for inconsistency and proposing mitigation approaches.
result The bandwagon effect can make estimators inconsistent, not just cause bias.
Develops SCMs for latent selection to simplify causal analysis.
problem Latent selection complicates causal analysis.
method Introduces a conditioning operation for SCMs to encode latent selection.
result Conditioning operation preserves simplicity, acyclicity, and linearity of SCMs.
STAS selects optimal spatio-temporal scales for bias correction in precipitation forecasts.
problem Limited prior data and fixed ST scale in existing BCoPs lead to biases in numerical weather predictions.
method End-to-end deep-learning BCoP model STAS with SFM/TFM to automatically adjust spatial and temporal scales.
result STAS outperforms 8 published BCoP methods on threat scores (TS).
Proposes a neural network model to improve predictions in biased datasets.
problem Reduces bias in predictions from datasets with selection bias.
method Integrates meta information about bias direction and quantity into a neural network model.
result Improves prediction accuracy in electoral polls with biased training data.
We explore the problem of learning under selective labels in the context of algorithm-assisted decision making. Selective labels is a pervasive selection bias problem that arises when historical decision making blinds us to the true outcome for certain instances. Examples of this are common in many applications, rangin…
Paper distinguishes causal structures under latent confounding and selection bias.
problem Distinguishing causal relationships when latent variables and selection bias are present.
method Formulated selected-marginalized directed graphs (smDGs) to distinguish causal structures.
result Two causal structures are indistinguishable if they have the same selected-marginalized directed graph.
New causal models perform poorly when evaluated on biased training sets.
problem Sample selection bias affects the evaluation of causal models' prediction performance.
method Re-evaluated prediction performance of causal models on a genetic perturbation data set, proposing a less-biased evaluation set.
result Causal models have similar or worse performance when evaluated on a less-biased set compared to standard association-based estimators.
Paper proposes adaptive parameter selection for KGD algorithms.
problem Improving parameter selection for kernel-based gradient descent.
method Integrates bias-variance analysis with splitting method, introduces empirical effective dimension.
result Adaptive parameter selection strategy achieves optimal generalization error bound.
Cross-validation under sample selection bias can, in principle, be done by importance-weighting the empirical risk. However, the importance-weighted risk estimator produces sub-optimal hyperparameter estimates in problem settings where large weights arise with high probability. We study its sampling variance as a funct…
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.
Study on investment strategy for agents with periodic preferences and discounting.
problem Investment decisions by agents with periodic S-shaped preferences and present bias.
method Infinite-horizon, continuous-time portfolio selection problem with quasi-hyperbolic discounting.
result Time-consistent planning strategy can be formulated as an equilibrium to a static mean field game.
A new method corrects bias in high-dimensional ridge regression.
problem Inherent bias in ridge regression limits statistical efficiency and scalability.
method Iterative bias correction strategy for p<n and Ridge-Screening method for p>n. result Valid inferences and asymptotic properties established for de-biased ridge estimators.
A new model shows fairness mechanisms can improve selection utility even without implicit bias.
problem Improving selection fairness without introducing a utility trade-off.
method A model with latent quality and group-dependent variance, comparing fairness mechanisms to group-oblivious selection.
result Demographic parity always increases selection utility, while γ-rules weakly increase it. The accuracy of deep neural networks is significantly affected by how well mini-batches are constructed during the training step. In this paper, we propose a novel adaptive batch selection algorithm called Recency Bias that exploits the uncertain samples predicted inconsistently in recent iterations. The historical lab…
Model predicts political ideology using context vectors to mitigate bias and scarcity.
problem Scarcity and selection bias in political ideology prediction.
method Proposes a statistical model decomposing embeddings into context and position vectors, training an end-to-end model for deployment.
result Model can predict ideological labels even with minimal biased data, outperforming state-of-the-art methods.