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.
The paper analyzes k k k -means clustering for missing data, proving statistical guarantees under MCAR.
problem Statistical guarantees for k k k -means clustering with missing data, especially under Missing Completely at Random (MCAR). method Established n \sqrt{n} n -excess risk bound and consistency of cluster centers under general missing mechanisms; derived n \sqrt{n} n -convergence rate and asymptotic normality for MCAR. result Achieving n \sqrt{n} n -rate and converging to true cluster centers requires distinct true cluster centers in every dimension under MCAR. 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…
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.
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.
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.
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…
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.
Proposes a robust EM algorithm for analyzing incomplete panel count data.
problem Missing reports in panel count data.
method Functional EM algorithm for non-parametric counting process mean function estimation.
result Robust to misspecification of Poisson process assumption and missing completely at random.
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 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 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…
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.
Optimal transport distances help impute missing data.
problem Missing data in real-world datasets.
method Use optimal transport distances as a loss function to impute missing data values.
result OT-based methods match or outperform state-of-the-art imputation methods.
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.
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.
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.
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.
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.
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.
Generates samples conditioned on labels using optimal transport.
problem Estimating conditional distributions for specific labels.
method Wasserstein geodesic generator based on optimal transport theory.
result Learned conditional distributions and optimal transport maps.
The paper classifies Finsler surfaces satisfying the T-condition or σT-condition.
problem Characterizing Finsler surfaces based on specific tensor conditions.
method Analyzing Finsler surfaces in dimensions n≥3, proving conditions equivalence, and solving PDEs.
result All Finsler surfaces satisfying the T-condition or σT-condition are classified.
The paper develops a new approach to conditional risk measures using modular convex analysis.
problem Developing a new method for conditional risk measures.
method Random modular approach to conditional certainty equivalents and niveloids in the conditional L ∞ L^{\infty} L ∞ -space. result Retrieves a conditional variational formula for optimized certainty equivalents and applies it to the conditional entropic risk measure.
Paper constructs solutions to Bogomolny equations with specific boundary and asymptotic conditions.
problem Constructing solutions to Bogomolny equations with given boundary and asymptotic conditions.
method Using generalized Nahm pole boundary condition and real symmetry breaking condition.
result Solutions analogous to instanton solutions, satisfying different asymptotic conditions.
We extend probabilistic programming to handle conditioning on marginal distributions.
problem Conditioning probabilistic programs on marginal distributions of observable variables.
method We define and implement stochastic conditioning, allowing inference in probabilistic programs conditioned on marginal distributions.
result We demonstrate the effectiveness of stochastic conditioning in various real-life scenarios.
New tests for conditional copulas based on decision trees.
problem Testing constancy of conditional dependence structure given conditioning events.
method Data-driven decision trees to maximize differences in conditional Kendall's tau.
result Asymptotic distributions of test statistics under the null hypothesis.
Paper finds necessary condition for logarithmic Minkowski problem in higher dimensions.
problem Logarithmic Minkowski problem in higher dimensions.
method Established a necessary condition through generalization and refinement of previous work.
result Generalizes and refines necessary condition for logarithmic Minkowski problem.
This paper introduces a neural operator for probabilistic conditioning.
problem Probabilistic conditioning of random variables X X X given Y Y Y . method Develops a single operator that maps any joint density to its conditional, approximated by neural operators.
result Neural operators can approximate the conditioning operator to arbitrary accuracy.
CSI method learns conditional distributions by estimating flow equations.
problem Learning conditional distributions in generative models.
method Estimates probability flow equations to transport reference to target distribution.
result Derives explicit expressions for conditional drift and score functions.
New conditional risk measures called conditional generalized quantiles defined and characterized.
problem Developing new risk measures for dynamic risk assessment.
method Propose and characterize conditional generalized quantiles using expected utility model and equivalent conditions.
result Characterized conditional generalized quantiles as well-defined and equivalent to a conditional first order condition.
A new method for learning conditional distributions using ODEs and neural networks.
problem Learning conditional distributions efficiently and accurately.
method Conditional Föllmer Flow, discretized with Euler's method, using nonparametric velocity estimation.
result Effective approximation of target conditional distributions, with convergence results for Wasserstein-2 distance.
Sharp statistical theory for conditional diffusion models.
problem Lack of theoretical foundation for conditional diffusion models.
method Sharp statistical theory with approximation of conditional score function.
result Sample complexity bound that adapts to data distribution smoothness.
An analysis is made of reality conditions within the context of noncommutative geometry. We show that if a covariant derivative satisfies a given left Leibniz rule then a right Leibniz rule is equivalent to the reality condition. We show also that the matrix which determines the reality condition must satisfy the Yang-…
New conditions prevent gaps in optimal control problems.
problem Preventing gaps in optimal control problems with state constraints.
method Developed new sufficient conditions not relying on convexity.
result Derived bounds for the size of the relaxation gap.
We identify conditional parity as a general notion of non-discrimination in machine learning. In fact, several recently proposed notions of non-discrimination, including a few counterfactual notions, are instances of conditional parity. We show that conditional parity is amenable to statistical analysis by studying ran…