Proposes a method to recover sparse tensors with covariate info.
problem Sparse tensor with high missing entries and many zeros.
method Covariate-assisted Sparse Tensor Completion (COSTCO) using latent components.
result 23% accuracy improvement over baseline in advertisement dataset.
A new model for dynamic covariance recovery in neuroimaging data.
problem Estimating time-varying covariances in high-dimensional neuroimaging data.
method Nonconvex factorization into sparse spatial and smooth temporal components, combined with spectral initialization and gradient descent.
result The proposed method achieves linear convergence and superior performance compared to existing approaches.
Paper quantizes heavy-tailed data for near optimal estimation rates.
problem Estimating parameters from heavy-tailed data with quantization.
method Truncate and dither data, then uniformly quantize; achieves near minimax rates.
result Near optimal estimation rates achievable with quantized data.
Exact recovery method for community detection in Gaussian mixtures with dependent noise.
problem Community detection in Gaussian mixtures with dependent and heterogeneous noise.
method Maximum likelihood estimator (MLE) for constrained quadratic optimization problem, using Σ-whitened separation and local inequalities. result Sharp exact-recovery threshold and no-gap mechanism in the unknown-size setting.
A new model integrates covariates with grade of membership analysis for better latent structure recovery.
problem Improving latent structure recovery in multivariate categorical data analysis.
method Covariate-assisted grade of membership model exploiting shared low-rank simplex geometry.
result Auxiliary covariates can provably improve latent structure recovery, leading to faster convergence rates.
New spectral clustering method handles discrete covariates for better community detection.
problem Community detection in networks with discrete covariates.
method Spectral algorithm that separates latent network structure from observed covariates.
result Achieves perfect clustering with high probability in large, sparse networks.
We propose a Bayesian model that predicts recovery curves based on information available before the disruptive event. A recovery curve of interest is the quantified sexual function of prostate cancer patients after prostatectomy surgery. We illustrate the utility of our model as a pre-treatment medical decision aid, pr…
Robust Lasso-Zero handles missing covariates and sparse corruptions.
problem Sparse corruptions and missing covariates in sparse linear models.
method Extension of Lasso-Zero to handle sparse corruptions, with theoretical guarantees on sign recovery.
result Robust Lasso-Zero can handle missing values without specifying a parametric model.
Paper estimates GMMs with unknown covariances using sparse regularization.
problem Estimating GMMs with unknown diagonal covariances from samples.
method Employed Beurling-LASSO (BLASSO) for sparse estimation of component means, covariances, and weights.
result Established non-asymptotic recovery guarantees with nearly parametric convergence rates.
Estimation of low-rank matrices is of significant interest in a range of contemporary applications. In this paper, we introduce a rank-one projection model for low-rank matrix recovery and propose a constrained nuclear norm minimization method for stable recovery of low-rank matrices in the noisy case. The procedure is…
Two spectral algorithms for community detection in graphs with covariates are compared.
problem Detecting community structure in graphs with covariates.
method Two model-based spectral algorithms are presented and compared.
result The second algorithm often better estimates block assignments by accounting for vertex covariates.
The paper infers multiple graphs from stationary signals on them.
problem Inferring multiple graphs from signals observed on their nodes.
method Convex optimization method leveraging matrix polynomial commutation.
result High-probability bounds on recovery error provided.
It is known that for a certain class of single index models (SIMs) Y=f(Xp×1⊺β0,ε), support recovery is impossible when X∼N(0,Ip×p) and a model complexity adjusted sample size is below a critical threshold. Recen…
RBM learns in high dimensions via AMP and GD, reaching optimal weak recovery.
problem Learning from high-dimensional data with RBM.
method AMP and GD analysis for RBM training in high dimensions.
result RBM reaches optimal weak recovery threshold in spiked covariance model.
High precision analytical approximation is proposed for variance-covariance based risk allocation in a portfolio of risky assets. A general case of a single-period multi-factor Merton-type model with stochastic recovery is considered. The accuracy of the approximation as well as its speed are compared to and shown to b…
Probabilistic principal component analysis (PPCA) seeks a low dimensional representation of a data set in the presence of independent spherical Gaussian noise. The maximum likelihood solution for the model is an eigenvalue problem on the sample covariance matrix. In this paper we consider the situation where the data v…
In the past decade, sparse and low-rank recovery have drawn much attention in many areas such as signal/image processing, statistics, bioinformatics and machine learning. To achieve sparsity and/or low-rankness inducing, the ℓ1 norm and nuclear norm are of the most popular regularization penalties due to their co…
We study the basic problem of robust subspace recovery. That is, we assume a data set that some of its points are sampled around a fixed subspace and the rest of them are spread in the whole ambient space, and we aim to recover the fixed underlying subspace. We first estimate "robust inverse sample covariance" by solvi…
Flat minima lead to better generalization in low-rank matrix recovery models.
problem Understanding why flat minima generalize well in overparameterized models.
method Analysis of overparameterized matrix and bilinear sensing, robust PCA, covariance matrix estimation, and neural networks with quadratic activation functions.
result Flat minima, measured by the trace of the Hessian, exactly recover the ground truth in low-rank matrix recovery models under standard statistical assumptions.
Efficient algorithms for sparse parameter recovery in mixture models.
problem Support recovery of high-dimensional sparse latent vectors in mixture models.
method Efficient algorithms with logarithmic sample complexity dependence on dimensionality.
result First guarantees on support recovery for various mixture models.
Paper proposes a fast algorithm to recover causal DAGs with latent variables.
problem Discovering causal relationships in the presence of latent variables.
method Cholesky factorization of covariance matrix with optimization for latent variables.
result The algorithm significantly outperforms previous methods in synthetic and real-world datasets.
Meta-learning improves support recovery in high-dimensional PCA.
problem Support recovery in high-dimensional Principal Component Analysis.
method Meta-learning approach to reduce sample complexity and support recovery.
result Support recovery can be achieved with significantly fewer samples than traditional methods.
Paper tackles distributed quantile regression with improved efficiency and support recovery.
problem Challenges in distributed estimation and support recovery for high-dimensional linear quantile regression.
method Transformed quantile regression into least-squares optimization, applied double-smoothing approach, developed efficient algorithm.
result Achieved near-oracle convergence rate and high support recovery accuracy.
Transfer learning improves loan recovery rate forecasting under data scarcity.
problem Data scarcity in loan portfolios limits RR modeling accuracy.
method Introduces FT-MDN-Transformer, a mixture-density tabular Transformer architecture for TL.
result FT-MDN-Transformer outperforms baseline models in RR forecasting, especially under covariate and conditional shifts.
Proposes a fusion method for many treatment groups in ITRs.
problem Challenges in handling many treatment groups with data sparsity and covariate imbalance.
method Calibration-weighted treatment fusion procedure that balances covariates and fuses similar treatments.
result Ensures robust treatment group recovery and policy value compared to existing methods.
This paper considers regression tasks involving high-dimensional multivariate processes whose structure is dependent on some {known} graph topology. We put forth a new definition of time-vertex wide-sense stationarity, or joint stationarity for short, that goes beyond product graphs. Joint stationarity helps by reducin…
We characterize the performance of sequential information guided sensing, Info-Greedy Sensing, when there is a mismatch between the true signal model and the assumed model, which may be a sample estimate. In particular, we consider a setup where the signal is low-rank Gaussian and the measurements are taken in the dire…
Polynomial-time algorithm for estimating covariance in corrupted Gaussian data.
problem Estimating covariance in data with up to 1-α fraction of adversarial corruptions.
method Uses low-degree sum-of-squares certificates for anti-concentration and hypercontractivity.
result Outputs a list of candidate parameters with high probability containing a nearly correct covariance.
We consider high dimensional sparse regression, and develop strategies able to deal with arbitrary -- possibly, severe or coordinated -- errors in the covariance matrix X. These may come from corrupted data, persistent experimental errors, or malicious respondents in surveys/recommender systems, etc. Such non-stochas…
We consider the problem of approximating the set of eigenvalues of the covariance matrix of a multivariate distribution (equivalently, the problem of approximating the "population spectrum"), given access to samples drawn from the distribution. The eigenvalues of the covariance of a distribution contain basic informati…
Paper proposes efficient methods for clustering and signal recovery in high-dimensional data with block structures.
problem High-dimensional clustering and signal recovery under block signal structures.
method CFA-PCA and MA-PCA methods for sparse and dense block signals.
result Proposed methods achieve computational minimax optimality for clustering and signal recovery.
T-Rex uses EM to fit robust factor models in noisy data.
problem Robustly fitting factor models in high-dimensional data with heavy tails and outliers.
method Expectation-Maximization (EM) algorithm based on Tyler's M-estimator for elliptical distributions.
result Demonstrates robustness in direction-of-arrival estimation and subspace recovery.
Probabilistic principal component analysis (PPCA) seeks a low dimensional representation of a data set in the presence of independent spherical Gaussian noise, Sigma = (sigma^2)*I. The maximum likelihood solution for the model is an eigenvalue problem on the sample covariance matrix. In this paper we consider the situa…
Enhances inference of spreading processes using neural-network priors.
problem Estimating initial states of graph processes from partial observations.
method Bayesian framework with single-layer perceptron neural network for initial states; hybrid BP-AMP algorithm.
result Model exhibits first-order phase transitions, creating a statistical-to-computational gap.
Study on Gaussian-width complexity on statistical manifolds and its applications in learning and recovery.
problem Understanding the geometry of statistical manifolds and its implications for learning and recovery.
method Analysis of Fisher width and inverse-Fisher width, proving their complementary roles and establishing a relation between them.
result Established a sharp relation between Fisher width and inverse-Fisher width, showing they cannot reduce relative to Euclidean scale.
Study reveals limits of PLS in multi-modal learning with correlated signals.
problem Understanding PLS performance in multi-modal learning with correlated signals.
method Random matrix theory analysis of spiked cross-covariance models.
result Identifies SNR and correlation regimes where PLS fails to recover any signal.
C-kNN-LSH identifies similar patient histories for causal inference in longitudinal data.
problem Estimating causal effects from longitudinal trajectories with high-dimensional confounding.
method C-kNN-LSH uses locality-sensitive hashing to find clinical twins and estimate treatment effects.
result C-kNN-LSH outperforms existing methods in capturing recovery heterogeneity and estimating policy values.
Improved subspace recovery algorithm with dimension-independent error and polynomial time.
problem Efficiently recover a covariance matrix from a mix of inliers and adversarial outliers.
method List-decodable subspace recovery algorithm with faster fixed-polynomial time and less restrictive distributional assumptions.
result Achieved dimension-independent error guarantee of O(1/α) with poly(1/α d^O(1)) time complexity.
Inference and Estimation in Missing Information (MI) scenarios are important topics in Statistical Learning Theory and Machine Learning (ML). In ML literature, attempts have been made to enhance prediction through precise feature selection methods. In sparse linear models, LASSO is well-known in extracting the desired …
Study reveals how attention helps in signal recovery from sequence models using random matrix theory.
problem Signal recovery from sequence models with attention mechanisms.
method Analysis of sample covariance matrices constructed from pooled sequence representations with attention weights.
result Optimal attention weights maximize signal-to-noise ratio and improve signal recovery.
New method selects variables in groups with few nonzeros, improving support recovery.
problem Structured variable selection with sparse patterns across groups.
method Composite norm and proximal algorithm for exclusive group sparsity.
result Asymptotic consistency in signed support recovery under conventional assumptions.
Active-set algorithm improves Cox regression for shape-restricted covariates.
problem Improving Cox regression for shape-restricted covariates.
method Shape-restricted inference using active-set optimization for spline basis expansion.
result Active-set algorithm produces accurate linear covariate effect estimates.
Bayesian framework for analyzing heterogeneous covariance data with a novel MoE-Wishart model.
problem Analyzing complex multivariate systems with varying covariance structures.
method Comprehensive Bayesian framework using mixture-of-experts Wishart model with predictor-dependent mixture weights.
result Accurate subpopulation recovery and estimation in heterogeneous covariance scenarios.
Proposes an offline active learning method for graphs.
problem Active learning on graphs where labeling is expensive.
method Two-stage biased sampling strategy considering informativeness and representativeness.
result Establishes a theoretical relationship between generalization error and number of nodes selected.
PopArt efficiently solves sparse linear bandits with tighter recovery guarantees.
problem Sparse linear bandits where rewards depend on a few covariates.
method PopArt: a simple, computationally efficient sparse linear estimation method.
result Improved regret bounds compared to state-of-the-art algorithms.
We consider the class of convex minimization problems, composed of a self-concordant function, such as the logdet metric, a convex data fidelity term h(⋅) and, a regularizing -- possibly non-smooth -- function g(⋅). This type of problems have recently attracted a great deal of interest, mainly due to th…
Model-based clustering defines population level clusters relative to a model that embeds notions of similarity. Algorithms tailored to such models yield estimated clusters with a clear statistical interpretation. We take this view here and introduce the class of G-block covariance models as a background model for varia…
AMP algorithm for matrix tensor product model provides recovery conditions.
problem Generalization of standard spiked matrix models with multiple pairwise observations.
method Approximate message passing with optimal weighing and combining of estimates.
result Asymptotically exact performance description and necessary/sufficient recovery conditions.