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

Trend · papers per month

24487296 · May 202619922001200920172026
48 results for Causal Imputation

Casper uses causal graph neural networks to improve spatiotemporal time series imputation.

problem Imputing missing values in spatiotemporal time series with confounders and non-causal correlations.
method Casper introduces a novel Prompt Based Decoder (PBD) and Spatiotemporal Causal Attention (SCA) to block confounders and discover causal relationships.
result Casper outperforms baselines and effectively discovers causal relationships in spatiotemporal time series imputation.

PAIR-CI calibrates CI tests for causal discovery with incomplete data.

problem Miscalibration of CI tests when imputing incomplete data.
method Integrates multiple imputation directly into the inferential procedure via a paired permutation design.
result PAIR-CI reduces false positive rates to below 5% in simulations.

MissDAG addresses causal discovery with missing data using imputation and EM.

problem Causal discovery with missing data in incomplete observational studies.
method MissDAG uses EM framework to maximize likelihood of visible data, leveraging ANMs and Monte Carlo EM for approximations.
result MissDAG outperforms two-step imputation and causal discovery methods.

As systems are getting more autonomous with the development of artificial intelligence, it is important to discover the causal knowledge from observational sensory inputs. By encoding a series of cause-effect relations between events, causal networks can facilitate the prediction of effects from a given action and anal…

2020-01-15abs ↗pdf ↗

New model predicts drug effects across various cell types using causal imputation.

problem Predict drug effects across different cell types given limited data.
method Introduces a novel SCM-based model class with latent factor structure and uses Synthetic Interventions estimator.
result Method outperforms other matrix completion approaches in drug repurposing dataset.

Proposes a method to infer causal effects from incomplete data using latent confounders.

problem Missing data complicates causal inference, especially for non-linear models.
method Uses variational autoencoders to learn latent confounders and incorporate missing values.
result Demonstrates effectiveness of the method, especially for non-linear models.

Despite the major advances taken in causal modeling, causality is still an unfamiliar topic for many statisticians. In this paper, it is demonstrated from the beginning to the end how causal effects can be estimated from observational data assuming that the causal structure is known. To make the problem more challengin…

2014-03-05abs ↗pdf ↗

High-dimensional models can outperform simpler ones in causal inference.

problem Estimating average treatment effects with many covariates.
method High-dimensional linear regression and synthetic control with many control units.
result Adding more control units can improve imputation performance even when pre-treatment fit is perfect.

This paper tackles time series imputation by identifying and modeling different missing mechanisms.

problem Different types of missing mechanisms (MAR, MNAR) in time series data.
method Proposes a framework for time series imputation by analyzing data generation processes and modeling latent variables via variational inference and normalizing flow.
result Establishes identifiability results for latent variables under nonlinear independent component analysis, showing that latent variables are identifiable.

MISTR improves HTE estimation in survival data with heavy censoring and instrumental variables.

problem Estimating HTE in survival data with censoring and unobserved confounders.
method MISTR uses recursively imputed survival trees to handle censoring and instrumental variables.
result MISTR outperforms existing methods under heavy censoring and instrumental variable settings.

MissNODAG learns cyclic causal graphs from incomplete data.

problem Causal discovery in systems with feedback loops and missing data.
method Differentiable framework integrating additive noise model and expectation-maximization.
result MissNODAG uncovers cyclic structures and missingness mechanisms from partially observed data.

Estimator improves prediction with missing data in multi-environment settings.

problem Handling missing data in multi-environment settings for robust prediction.
method Derive an estimator from invariance objective under missing outcomes.
result The estimator achieves lower prediction error despite using a biased imputation model.

Scoping review of EO-ML methods for causal inference in poverty geography.

problem Lack of thorough documentation and best practices for EO-ML methods in causal analysis.
method Comprehensive scoping review cataloging five principal approaches.
result Detailed protocol for integrating EO data into causal analysis.

TMLE improves causal effect estimation in missing data scenarios with various positivity violations.

problem Estimating causal effects in studies with missing data and positivity violations.
method Targeted Maximum Likelihood Estimation (TMLE) with various missing data methods.
result Complete cases with TMLE incorporating an outcome-missingness model exhibit lower bias and greater robustness against positivity violations.

A new imputation method MissARF uses adversarial random forests for fast and accurate missing value imputation.

problem Handling missing values in biostatistical analyses.
method Adversarial Random Forests (ARF) for density estimation and data synthesis.
result MissARF performs comparably to state-of-the-art methods in imputation quality and runtime.

Many real datasets contain values missing not at random (MNAR). In this scenario, investigators often perform list-wise deletion, or delete samples with any missing values, before applying causal discovery algorithms. List-wise deletion is a sound and general strategy when paired with algorithms such as FCI and RFCI, b…

2017-05-25abs ↗pdf ↗

Proposes CoDEAL for estimating heterogeneous treatment effects in panel data models.

problem Estimating heterogeneous treatment effects in causal panel data models with covariate effects.
method Covariate-Adjusted Deep Causal Learning (CoDEAL) integrating neural networks and autoencoders.
result Establishes theoretical guarantees and demonstrates compelling performance in simulations and real data.

CSDI improves time series imputation by 40-65% over existing methods.

problem Imputing missing values in time series data.
method Conditional Score-based Diffusion models conditioned on observed data.
result CSDI improves by 40-65% over existing probabilistic imputation methods on popular metrics.

MTSCI uses diffusion models to impute multivariate time series data with consistency.

problem Imputation of missing values in multivariate time series data.
method MTSCI employs a contrastive complementary mask and mixup mechanism to ensure intra-consistency and inter-consistency.
result MTSCI achieves state-of-the-art performance on multivariate time series imputation tasks.

Study examines parallel computing strategies for faster imputation of missing data.

problem Time-consuming iterative imputation methods for large datasets.
method Variable-wise and model-wise distributed parallel computing strategies in missForest.
result Variable-wise distributed strategy introduces additional biases in imputation results.

Study compares imputation methods' effects on IML confidence intervals.

problem Missing data impacts IML interpretation and confidence intervals.
method Compared single vs multiple imputation methods on IML confidence intervals.
result Multiple imputation provides closer coverage to nominal than single imputation.

The paper compares theoretical and empirical performance of imputation methods for missing data.

problem Missing data in real-world datasets.
method Contrast of theoretical and empirical imputation methods for prediction.
result Mean-imputation is asymptotically optimal for prediction, while mode-imputation is sub-optimal.

New criteria improve imputation model selection using MOO.

problem Selecting the best imputation model using prediction accuracy metrics.
method Introduced three modified MOO criteria based on rank transformation, energy distance, and likelihood principle.
result Demonstrated how MOO is related to missing-at-random assumption and derived statistical and computational learning theories.

Improved time series classification with imputed data using label-guided forest-based methods.

problem Missing data in time series data.
method Label-guided imputation using forest-based proximity measures.
result Imputation leads to higher classification accuracies, even with imputed values differing from true values.

Missing data imputation can help improve the performance of prediction models in situations where missing data hide useful information. This paper compares methods for imputing missing categorical data for supervised classification tasks. We experiment on two machine learning benchmark datasets with missing categorical…

2016-10-28abs ↗pdf ↗

Kernel ridge regression imputation with consistent variance estimation for handling missing data.

problem Handling missing data in statistical analysis.
method Kernel ridge regression imputation combined with entropy method for variance estimation.
result Root-n consistency of the imputation estimator in a Sobolev space setting.

Paper introduces metrics to evaluate missing data imputation without ground truth.

problem Handling missing data in time series without ground truth.
method Introduces Wasserstein distance (WD) and Jensen-Shannon divergence (JSD) as metrics to evaluate imputation quality.
result WD and JSD are effective metrics for assessing missing data imputation quality.

This work proposes a non-iterative strategy for missing value imputations which is guided by similarity between observations, but instead of explicitly determining distances or nearest neighbors, it assigns observations to overlapping buckets through recursive semi-random hyperplane cuts, in which weighted averages are…

2019-11-15abs ↗pdf ↗