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

4.1%8.2%12.2%16.3% · May 202619922001200920172026
48 results for miss rate

Sparse regression such as the Lasso has achieved great success in handling high-dimensional data. However, one of the biggest practical problems is that high-dimensional data often contain large amounts of missing values. Convex Conditioned Lasso (CoCoLasso) has been proposed for dealing with high-dimensional data with…

2018-11-01abs ↗pdf ↗

Merlin improves robustness of MTSF models to missing data.

problem Suboptimal forecasting performance due to unfixed missing rates in MTSF models.
method Offline knowledge distillation and multi-view contrastive learning.
result Merlin enhances robustness of MTSF models while preserving accuracy.

Rating prediction is an important application, and a popular research topic in collaborative filtering. However, both the validity of learning algorithms, and the validity of standard testing procedures rest on the assumption that missing ratings are missing at random (MAR). In this paper we present the results of a us…

2012-06-20abs ↗pdf ↗

DeepIFSAC uses attention mechanisms and contrastive learning to impute missing values in tabular data.

problem Missing values in tabular data, especially when high and not random.
method Row and column attention in a contrastive learning framework with CutMix data augmentation.
result Proposed method outperforms state-of-the-art methods for missing rates between 10% and 90% and various missing value types.

ELMV uses ensemble learning to handle missing values in EHR data.

problem Significant missing values in EHR data cause bias and unreliable conclusions.
method ELMV constructs multiple subsets with lower missing rates and uses a support set for ensemble learning.
result ELMV outperforms conventional methods in critical feature identification and outcome prediction.

Recommending items to users is a challenging task due to the large amount of missing information. In many cases, the data solely consist of ratings or tags voluntarily contributed by each user on a very limited subset of the available items, so that most of the data of potential interest is actually missing. Current ap…

2015-09-30abs ↗pdf ↗

Given nn samples from a population of individuals belonging to different types with unknown proportions, how do we estimate the probability of discovering a new type at the (n+1)(n+1)-th draw? This is a classical problem in statistics, commonly referred to as the missing mass estimation problem. Recent results by Ohannes…

2018-06-25abs ↗pdf ↗

BlockEcho method improves imputation of block-wise missing data.

problem Block-wise missing data reduces interpolation capability and predictive power.
method Integrates Matrix Factorization (MF) within Generative Adversarial Networks (GAN) to retain long-distance inter-element relationships.
result Superior performance on public datasets across three domains, especially at higher missing rates.

The paper analyzes kk-means clustering for missing data, proving statistical guarantees under MCAR.

problem Statistical guarantees for kk-means clustering with missing data, especially under Missing Completely at Random (MCAR).
method Established n\sqrt{n}-excess risk bound and consistency of cluster centers under general missing mechanisms; derived n\sqrt{n}-convergence rate and asymptotic normality for MCAR.
result Achieving n\sqrt{n}-rate and converging to true cluster centers requires distinct true cluster centers in every dimension under MCAR.

Study compares traditional and machine learning methods for handling missing data in longitudinal studies.

problem Handling missing Not at Random (MNAR) and nonnormal data in longitudinal research.
method Monte Carlo simulations to assess six missing data techniques.
result FIML is most effective for MNAR data, while TSRE excels for MAR data.

Matrix completion is a modern missing data problem where both the missing structure and the underlying parameter are high dimensional. Although missing structure is a key component to any missing data problems, existing matrix completion methods often assume a simple uniform missing mechanism. In this work, we study ma…

2018-12-19abs ↗pdf ↗

New method for efficient matrix completion with nonignorable missing data.

problem Nonignorable missing data in matrix completion.
method Nuclear norm regularized U-statistic loss function and accelerated proximal gradient algorithm.
result Near minimax optimal statistical convergence rate for nonignorable missing data.

We propose a simple imputation method for high-dimensional linear regression with missing data.

problem Handling missing covariates in high-dimensional linear regression.
method Impute missing entries with conditional mean of observed covariates and use standard LASSO or square-root LASSO.
result The imputation scheme retains minimax estimation rate and is pivotal for the square-root LASSO.

A new criterion HBIC improves model selection for factor analysis with missing data.

problem Model selection for factor analysis with incomplete data.
method Proposes a novel criterion HBIC that uses actual observed information in the penalty term.
result HBIC is more accurate than BIC when missing data rates are high.

GT estimator shows convergence for Markov samples, improving i.i.d. results.

problem Estimating missing mass in Markov samples.
method Analyzed convergence of Good-Turing estimator for Markov samples, considering spectral properties of transition matrices.
result The convergence of the GT estimator for Markov samples depends on the spectral properties of the transition matrices, leading to a new minimax rate of 1/(nβ5)1/(nβ^5) for rank-2 Markov chains.

New method resolves bias in recommender learning without needing missing data.

problem Bias in offline recommender learning from explicit ratings.
method Proposes a novel algorithm to minimize generalization error bound via adversarial learning, independent of propensity estimation.
result Demonstrates superior performance in rating prediction and ranking metrics without missing completely at random data.

Missing values widely exist in many real-world datasets, which hinders the performing of advanced data analytics. Properly filling these missing values is crucial but challenging, especially when the missing rate is high. Many approaches have been proposed for missing value imputation (MVI), but they are mostly heurist…

2018-08-05abs ↗pdf ↗

Paper proposes a new model for imputing missing spatiotemporal traffic data.

problem Missing data and sparsity in spatiotemporal traffic data.
method Low-rank tensor completion (LRTC) framework with truncated nuclear norm (TNN).
result The proposed model outperforms state-of-the-art imputation models in various scenarios.

Paper proposes a new tensor imputation method for spatiotemporal traffic data with missing patterns.

problem Imputation of corrupted or incomplete traffic data.
method Truncated tensor Schatten p-norm (TSpN) for spatiotemporal traffic data imputation.
result The proposed method outperforms other state-of-the-art tensor-based imputation models in various missing cases.

Paper tackles linear models with missing values, achieving minimax optimal results.

problem Missing values in real-world data complicate linear model learning.
method Proposes a rigorous setting and a new algorithm leveraging missing data distribution.
result Derives minimax optimal adaptive risk bounds for predictions with missing values.

Study proposes GRU-D networks for missing value handling in road surface friction prediction.

problem Missing values in road surface friction data affect prediction accuracy.
method Gated Recurrent Unit (GRU) network with decay mechanism.
result GRU-D networks outperform baseline models in road surface friction prediction.

Missing responses is a missing data format in which outcomes are not always observed. In this work we develop kernel machines that can handle missing responses. First, we propose a kernel machine family that uses mainly the complete cases. For the quadratic loss, we then propose a family of doubly-robust kernel machine…

2018-06-07abs ↗pdf ↗

Multimodal learning has shown promising performance in content-based recommendation due to the auxiliary user and item information of multiple modalities such as text and images. However, the problem of incomplete and missing modality is rarely explored and most existing methods fail in learning a recommendation model …

2018-08-21abs ↗pdf ↗

Sensor data has been playing an important role in machine learning tasks, complementary to the human-annotated data that is usually rather costly. However, due to systematic or accidental mis-operations, sensor data comes very often with a variety of missing values, resulting in considerable difficulties in the follow-…

2017-11-20abs ↗pdf ↗

Study examines how imputation accuracy affects prediction accuracy in regression problems with missing covariates.

problem Missing covariates in regression or classification problems.
method Simulation and empirical analysis using UCI datasets and statistical inference.
result Imputation accuracy impacts prediction accuracy, especially with Machine Learning methods.

New framework predicts time series with missing values without imputation.

problem Predicting time series with missing values, especially when there's no ground truth for missing data.
method CRIB framework, combining attention mechanism and consistency regularization.
result CRIB framework predicts accurately even under high missing rates.

The paper controls false discovery rate in link prediction using conformal inference.

problem Identifying true edges in a graph while controlling false discoveries.
method Proposes a novel method based on conformal inference to control false discovery rate (FDR) in link prediction.
result Empirically demonstrates FDR control for both simulated and real data.

This paper tackles missing data in Burundian bond market yield curves.

problem Missing data challenges accurate yield curve construction in Burundian sovereign bond market.
method Exploration of data limitations, proposing and testing various imputation methods (LR, Previous value, miss-Forest, Next value).
result Linear Regression method performs best across variables, approximating normal distribution for error values.

In many machine learning applications, we are faced with incomplete datasets. In the literature, missing data imputation techniques have been mostly concerned with filling missing values. However, the existence of missing values is synonymous with uncertainties not only over the distribution of missing values but also …

2019-05-22abs ↗pdf ↗

OnlineSCI extends ACI for adaptive selective inference with improved coverage and IER control.

problem Adaptive selective inference in online settings with improved coverage and IER control.
method Adaptive selective inference with extended ACI algorithm.
result OnlineSCI controls average missed coverage and instantaneous error rate at selected times, up to a non-asymptotic remainder term.

Matrix completion works well for smooth non-linear structures, even without low-rank assumptions.

problem Matrix completion for smooth non-linear structures.
method Nuclear-norm penalization for matrices lying in a low-dimensional non-linear manifold.
result Nuclear-norm penalization is minimax rate optimal for recovering smooth non-linear matrices with missing data.

Predict missing movie ratings or graph embeddings with low rank matrices.

problem Predicting missing entries in a ratings matrix or graph embeddings with known linear relations.
method Low rank matrix completion approach applied to graph embeddings.
result Effective methods for predicting missing entries in matrices and graph embeddings.

CoIFNet unifies imputation and forecasting for robust multivariate time series prediction with missing values.

problem Pervasive missing values degrade multivariate time series forecasting accuracy.
method CoIFNet integrates imputation and forecasting through Cross-Timestep Fusion and Cross-Variate Fusion modules.
result CoIFNet achieves 24.40% improvement over state-of-the-art methods at 0.6 point (block) missing rate.

FSD-CAP improves graph feature imputation under high missing rates.

problem Challenges in imputing missing node features in graphs, especially under high missing rates.
method Two-stage framework: subgraph expansion, fractional diffusion, class-aware propagation.
result Significantly improved imputation quality compared to existing methods, achieving high accuracy on benchmark datasets.

Paper presents a method for imputing and forecasting structural response from incomplete sensor data.

problem Missing sensor data in structural health monitoring (SHM).
method Incremental Bayesian tensor learning for spatiotemporal missing data reconstruction and forecasting.
result The proposed method achieves accurate and robust imputation and prediction even with high rates of missing data.

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.