arXiv Machine Learning
Jul 17
Learning Who to Treat When Treatment is Missing
arXiv:2607. 14346v1 Announce Type: new Abstract: Policy learning methods are increasingly used to inform treatment allocation under budget constraints.
Synthetic Nearest Neighbors: Extending Synthetic Controls for Matrix Completion with Missing Not at Random Data
Related stories
arXiv Machine Learning
Oct 7
Assumption-lean logistic regression with missing covariates
arXiv:2610.07292v1 Announce Type: cross Abstract: Missing covariates are frequently encountered in supervised learning problems, and classical methods for estimation using such data use carefully cho...
arXiv Machine Learning
Aug 18
Doubly robust nearest neighbors in factor models
arXiv:2211. 14297v4 Announce Type: replace-cross Abstract: We introduce and analyze an improved variant of nearest neighbors (NN) for estimation with missing data in latent factor models.
arXiv Machine Learning
Oct 15
Generalizing Identifiability Results in Causal Discovery from Complete Data to Missing Data Settings
arXiv:2610.19211v1 Announce Type: cross Abstract: While causal discovery methods have matured for complete data, such algorithms for handling missing values remain limited. We establish general suffi...
Hugging Face Trending Papers
Oct 13
Generalizing Identifiability Results in Causal Discovery from Complete Data to Missing Data Settings
While causal discovery methods have matured for complete data, such algorithms for handling missing values remain limited. We establish general sufficient conditions under which causal graphs remain i...
arXiv Machine Learning
Aug 26
Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion
arXiv:2411.12965v3 Announce Type: replace-cross Abstract: Nearest neighbor (NN) algorithms have been extensively used for missing data problems in recommender systems and sequential decision-making s...
arXiv Machine Learning
Sep 30
Learning Causal Normalizing Flows from Incomplete Data via Observed-Data Likelihood
arXiv:2609.37664v1 Announce Type: new Abstract: Causal Normalizing Flows (CNFs) enable causal inference from observational data given the causal structure, but they assume fully observed training dat...
arXiv Machine Learning
1d ago
Improving the Optimization Landscape of Matrix Completion with $\epsilon$-close Surrogates
The paper proposes a new approach to matrix completion by adding small (ε-level) perturbations to the nullspace of the observation mask, creating noisy surrogates that remain close to the true matrix. These surrogates satisfy a restricted isometry property, enabling the use of tensor methods with theoretical guarantees. The authors provide quantitative recovery guarantees under independent observation assumptions, without requiring explicit sampling rate or incoherence conditions.
arXiv Machine Learning
Jul 17
Causal Inference for Sequential Settings under Interference and Latent Confounding
arXiv:2607. 14940v1 Announce Type: new Abstract: We study causal inference under outcome interference for sequential, observational settings.
arXiv Machine Learning
Sep 25
Nuclear Norm-Regularized Bayesian Matrix Completion
The paper introduces a Bayesian approach to matrix completion that uses a nuclear norm-based prior and addresses the challenge of unknown noise variance by placing a prior on it. It presents the first sampler for this model, providing a non‑asymptotic polynomial‑time guarantee in terms of matrix dimensions and desired accuracy. The method discretizes the noise precision and employs thermodynamic integration to construct a categorical posterior, offering a feasibility result for Bayesian sampling in non‑log‑concave settings.
arXiv Machine Learning
Sep 22
ITSY: Causal Discovery From Irregular Time-Series Data
arXiv:2609.23516v1 Announce Type: new Abstract: Structural causal models for time series recover contemporaneous and lagged effects, but most methods require complete observation windows and become m...
arXiv Machine Learning
Jun 10
Sample-efficient inductive matrix completion with noise and inexact side-information
arXiv:2605. 17189v2 Announce Type: replace-cross Abstract: Inductive matrix completion (IMC) is a variant of low-rank matrix completion that incorporates row and column side-information.