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

203405608810 · Jun 202019922001200920172026
48 results for Neural Imputation

MissBGM uses AI and Bayesian modeling for better missing data imputation.

problem Missing data imputation in data science, especially with uncertainty quantification.
method AI-powered Bayesian generative modeling with explicit modeling of missingness mechanisms.
result MissBGM provides principled posterior uncertainty over imputations and superior performance.

SNI framework for mixed-type data imputation interprets and explains missing values.

problem Missing data in mixed-type databases skew analysis results.
method SNI couples statistical priors with neural attention to impute and explain missing values.
result SNI provides interpretable feature dependency diagnostics and soft regularization of attention.

Emputation learns imputation models guided by missingness assumptions.

problem Learning imputation models for missing data given observed data.
method Guided by specific missingness assumptions, Emputation trains a deep generative model to learn the extrapolation distribution of missing variables.
result The population minimizer of the emputation risk recovers the target extrapolation distribution under various identification assumptions.

This paper improves VAE-based imputation of FX implied volatilities, reducing errors and handling uncertainty.

problem Imputing missing implied volatilities for FX options.
method Modified VAE architecture and handling uncertainty.
result Significant performance improvements, nearly halving error in low missingness regimes.

GRAPE uses graph representation to handle missing data in feature imputation and label prediction.

problem Handling missing data in machine learning tasks.
method GRAPE uses a bipartite graph where observations and features are nodes, and observed feature values are edges. It formulates feature imputation as edge-level prediction and label prediction as node-level prediction, solving these with Graph Neural Networks.
result GRAPE achieves 20% lower mean absolute error for imputation and 10% lower for label prediction compared to state-of-the-art methods.

End-to-end model for time series classification with missing data.

problem Time series classification with missing data.
method End-to-end neural network that unifies imputation and representation learning.
result Proposed model outperforms state-of-the-art approaches for incomplete time series classification.

HyperImpute improves iterative imputation by automatically selecting models and hyperparameters.

problem Imputing missing values in datasets with variable model specifications.
method Generalized iterative imputation framework that adapts and configures models and hyperparameters automatically.
result Demonstrates superior imputation accuracy compared to benchmarks.

A method learns matrix factorization from diverse matrices and applies the knowledge to unseen matrices.

problem Matrix factorization without shared rows or columns.
method Neural network meta-learned to minimize expected imputation error using MAP estimation.
result The method can impute missing values from unseen matrices efficiently.

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.

Recently, data augmentation in the semi-supervised regime, where unlabeled data vastly outnumbers labeled data, has received a considerable attention. In this paper, we describe an efficient technique for this task, exploiting a recent framework we proposed for missing data imputation called graph imputation neural net…

2019-06-20abs ↗pdf ↗

New imputation strategies improve signature models for irregular time series.

problem Applying signature models to irregular time series requires continuous path construction.
method Characterized imputation as a problem, evaluated various strategies, proposed GP-PoM.
result Gaussian process adapters improve predictive performance and robustness.

NCPF model improves traffic data imputation with neural and tensor methods.

problem Pervasive missing data in traffic analysis due to sensor failures and gaps.
method Neural Canonical Polyadic Factorization (NCPF) integrating CP decomposition and deep learning.
result NCPF outperforms state-of-the-art baselines in urban traffic datasets.

Time series are widely used as signals in many classification/regression tasks. It is ubiquitous that time series contains many missing values. Given multiple correlated time series data, how to fill in missing values and to predict their class labels? Existing imputation methods often impose strong assumptions of the …

2018-05-27abs ↗pdf ↗

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.

Theoretical analysis of MCR for improving imputation quality in partially observed data.

problem Improving model generalization in partially observed settings.
method Theoretical analysis of Measure Consistency Regularization (MCR) for neural network distance.
result MCR's generalization advantage is not always guaranteed and can be monitored through a duality gap.

KReTTaH uses tensor trains and Hadamard overparameterization for fast, interpretable multi-way data imputation.

problem Multi-way data imputation for high-dimensional functional MRI and dynamic graph recovery.
method Reformulates imputation as RKHS regression with TT-constrained coefficients and Hadamard overparameterization. Optimizes TT coefficients and kernel matrices on Riemannian manifolds.
result Consistently outperforms state-of-the-art methods in modeling accuracy.

KReTTaH uses tensor trains and Hadamard overparameterization for fast, interpretable multi-way data imputation.

problem Multi-way data imputation in high-dimensional spaces.
method Reformulates imputation as RKHS regression with TT-constrained coefficients, optimized on manifold frameworks.
result Consistently outperforms state-of-the-art methods in accuracy.

We connect a broad class of generative models through their shared reliance on sequential decision making. Motivated by this view, we develop extensions to an existing model, and then explore the idea further in the context of data imputation -- perhaps the simplest setting in which to investigate the relation between …

2015-06-10abs ↗pdf ↗

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.

Improved traffic forecasting model handles missing data.

problem Short-term traffic forecasting with missing values.
method Proposed SBU-LSTM architecture with bidirectional and unidirectional LSTM.
result Superior performance in accuracy and robustness for network-wide traffic prediction.

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.