We study offline recommender learning from explicit rating feedback in the presence of selection bias. A current promising solution for the bias is the inverse propensity score (IPS) estimation. However, the performance of existing propensity-based methods can suffer significantly from the propensity estimation bias. I…
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,657 papers · 148 categories
Trend · papers per month
33 results for “MCAR”
Imputation-Powered Inferencestat.ME
Imputation-Powered Inference improves subpopulation efficiency in missing data settings.
problem Complex missing data patterns challenge standard inference methods.
method Imputation-Powered Inference (IPI) combines blackbox imputation with bias correction.
result IPI provides valid and efficient M-estimation under MCAR blockwise missingness.
The paper analyzes -means clustering for missing data, proving statistical guarantees under MCAR.
problem Statistical guarantees for -means clustering with missing data, especially under Missing Completely at Random (MCAR).
method Established -excess risk bound and consistency of cluster centers under general missing mechanisms; derived -convergence rate and asymptotic normality for MCAR.
result Achieving -rate and converging to true cluster centers requires distinct true cluster centers in every dimension under MCAR.
Trinary decision tree improves handling of missing data in machine learning.
problem Improving accuracy in decision tree algorithms when dealing with missing data.
method Introduces Trinary decision tree, which does not assume missing values contain information about the response.
result Trinary decision tree outperforms other algorithms in Missing Completely at Random settings, especially when data is only missing out-of-sample.
A very simple interpretation of matrix completion problem is introduced based on statistical models. Combined with the well-known results from missing data analysis, such interpretation indicates that matrix completion is still a valid and principled estimation procedure even without the missing completely at random (M…
Paper introduces methods to handle missing data in probabilistic regression trees.
problem Handling missing data in probabilistic regression trees.
method Three approaches: uniform probability, partial observation, and dimension-reduced smoothing.
result Preserves interpretability while extending applicability to incomplete datasets.
Panel count data describes aggregated counts of recurrent events observed at discrete time points. To understand dynamics of health behaviors, the field of quantitative behavioral research has evolved to increasingly rely upon panel count data collected via multiple self reports, for example, about frequencies of smoki…
GANs improve missing data imputation for ranking tasks.
problem Missing data in ranking datasets violates standard assumptions.
method Conditional Imputation GAN for Extended Missing At Random and Extended Always Missing At Random mechanisms.
result Optimal GAN imputation for EMAR and EAMAR mechanisms.
Random imputation is surprisingly effective for linear predictors in missing data scenarios.
problem The effectiveness of naive imputation in missing data scenarios for linear predictors.
method A unique random features model framework to study predictive performances.
result Naive imputation is negligible in bias for linear predictors under MCAR assumption.
New taxonomy for structured missingness in large-scale databases.
problem Handling missing values in structured data.
method Introducing a new taxonomy for Structured Missingness (SM) and embedding it within existing mechanisms.
result Demonstrated the impact of Structured Missingness on inference and prediction.
Causal Matrix Completionecon.EM
New method corrects bias in missing data for matrix completion.
problem Missing data bias in matrix completion.
method Causal model and synthetic nearest neighbors (SNN) method.
result Synthetic nearest neighbors (SNN) method provides consistent and normal estimates.
Missing data is a crucial issue when applying machine learning algorithms to real-world datasets. Starting from the simple assumption that two batches extracted randomly from the same dataset should share the same distribution, we leverage optimal transport distances to quantify that criterion and turn it into a loss f…
New random forest algorithm improves regression with missing data.
problem Regression with missing data values.
method New random forest algorithm compared to existing techniques.
result Improved performance in quadratic errors and bias compared to existing methods.
New method for optimal transport with missing data, debiased and efficient.
problem Solving optimal transport between two distributions with missing values.
method Debiasing Wasserstein distance for empirical Gaussian distributions, entropic regularized optimal transport using ISVT.
result Efficient and consistent estimation of entropic regularized optimal transport.
A new imputation method estimates missing values by matching observed marginals from masked data.
problem Missing values in data undermine statistical and machine learning analysis.
method Estimates a distribution from masked observations using positive semi-definite kernel density estimation.
result The method yields both single and multiple imputations from the same fitted density, with statistical consistency and fast adaptive excess risk.
Generative imputation network improves missing value estimation.
problem Missing data in statistical analysis.
method Integrates generative networks with chained equations for robust multiple imputation.
result GCMI outperforms other imputation techniques in simulations and real data.
Develops a VAE model for datasets with missing data.
problem Applying VAEs to datasets with missing data.
method A novel latent variable model of a corruption process generating missing data, with a tractable ELBO.
result Improved marginal log-likelihood and better missing data imputation compared to existing approaches.
Missing data is a common problem in real-world settings and particularly relevant in healthcare applications where researchers use Electronic Health Records (EHR) and results of observational studies to apply analytics methods. This issue becomes even more prominent for longitudinal data sets, where multiple instances …
Imputation for prediction often offers limited benefits, especially with powerful models.
problem The challenge of missing data in predictive models.
method Comparative analysis of imputation methods across various predictive models and datasets.
result Advanced imputation methods often offer limited benefits for powerful predictive models.
A new tensor completion method handles missing data with missing not at random entries.
problem Handling missing data in tensors where the probability of observation depends on other entries.
method Estimate propensities using convex relaxation, then use higher-order SVD with inverse propensities weights.
result Finite-sample error bounds on the completed tensor are provided.
Latent diffusion improves robustness in missing data imputation.
problem Missing data imputation under MCAR corruption.
method Two-stage framework: VAE for latent feature learning, diffusion model in latent space.
result Latent diffusion maintains high quality and stability up to 50% missingness.
PbP strategy improves logistic model prediction with missing values.
problem Predicting with missing inputs in logistic models.
method Pattern-by-Pattern (PbP) strategy for logistic models with missing values.
result PbP accurately approximates Bayes probabilities under GPMM across various missing data scenarios.
Study addresses covariate mismatch in federated learning, improving model accuracy.
problem Learning from clients with different feature sets in federated learning.
method Developed two approaches for linear prediction under covariate mismatch: plug-in estimator and impute-then-regress strategy.
result Proposed methods provide asymptotic and finite-sample learning rates, improving model accuracy.
Missing data are ubiquitous in many domains including healthcare. When these data entries are not missing completely at random, the (conditional) independence relations in the observed data may be different from those in the complete data generated by the underlying causal process. Consequently, simply applying existin…
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.
Study on estimating Gaussian mean with missing data in high dimensions.
problem Estimating Gaussian mean in high dimensions with missing data due to realizable contamination.
method Statistical Query model, Low-Degree Polynomials, PTF tests, and algorithms.
result Established information-computation gap and developed efficient algorithms.
A Unified Framework for Inference with General Missingness Patterns and Machine Learning Imputationstat.ME
Unified ML imputation framework for missing data.
problem Invalid inference with incomplete data and ML imputations.
method Stratified by missingness patterns, weights and aggregates complete case information.
result Valid statistical inference for general missingness patterns.
MIRRAMS framework tackles robust tabular learning under unseen missingness shifts.
problem Challenges in achieving robust predictive performance due to shifts in missingness distribution between training and test inputs.
method Introduces MI robustness conditions and MIRRAMS framework to enforce these conditions without specific missingness assumptions.
result Consistently outperforms existing state-of-the-art baselines and maintains stable performance under diverse missingness conditions.
TabSODA: Tabular Diffusion based Imputation with Skip Pattern Detection and Ordinal Awarenessstat.ML
TabSODA improves imputation of surveys with skips and ordinal data.
problem Handling structural skips and ordinal responses in survey data.
method TabSODA uses an Elucidated Diffusion Model with skip pattern detection and ordinal awareness.
result TabSODA reduces ordinal missing-at-random (MACE) by up to 23.7% and improves categorical accuracy by up to 9%.
Fed-MIWAE improves federated learning by imputing missing data.
problem Handling missing data in federated learning models.
method Federated version of MIWAE, a deep latent variable model for missing data imputation.
result Fed-MIWAE achieves imputation accuracy comparable to centralized methods in federated scenarios.
The cumulative distribution network (CDN) is a recently developed class of probabilistic graphical models (PGMs) permitting a copula factorization, in which the CDF, rather than the density, is factored. Despite there being much recent interest within the machine learning community about copula representations, there h…
A deep generative model improves imputation of MNAR data by treating missing and complete data equally.
problem Missing Not At Random (MNAR) data in analysis.
method A generative model-specific joint probability decomposition method (conjunction model) and a deep generative imputation model (GNR).
result GNR surpasses state-of-the-art MNAR baselines with significant margins in RMSE and better mask reconstruction.
SSLfmm package improves semi-supervised learning by incorporating informative missingness in finite mixture models.
problem Improving semi-supervised learning with informative missingness in datasets.
method Estimates Bayes' classifier under a finite mixture model with MCAR and MAR missingness mechanisms.
result The classifier trained on partially labelled data can achieve lower misclassification rates than supervised methods.