English
Related papers

Related papers: Robust Low-Rank Matrix Estimation

200 papers

Recent developments on deep learning established some theoretical properties of deep neural networks estimators. However, most of the existing works on this topic are restricted to bounded loss functions or (sub)-Gaussian or bounded input.…

Machine Learning · Statistics 2024-05-09 William Kengne , Modou Wade

We consider a general statistical learning problem where an unknown fraction of the training data is corrupted. We develop a robust learning method that only requires specifying an upper bound on the corrupted data fraction. The method…

Machine Learning · Statistics 2020-02-10 Muhammad Osama , Dave Zachariah , Peter Stoica

We study the high-dimensional asymptotics of empirical risk minimization (ERM) in over-parametrized two-layer neural networks with quadratic activations trained on synthetic data. We derive sharp asymptotics for both training and test…

Machine Learning · Statistics 2026-02-03 Vittorio Erba , Emanuele Troiani , Lenka Zdeborová , Florent Krzakala

Penalized spline estimation with discrete difference penalties (P-splines) is a popular estimation method for semiparametric models, but the classical least-squares estimator is highly sensitive to deviations from its ideal model…

Methodology · Statistics 2022-03-24 Ioannis Kalogridis , Stefan Van Aelst

Many modern datasets are collected automatically and are thus easily contaminated by outliers. This led to a regain of interest in robust estimation, including new notions of robustness such as robustness to adversarial contamination of the…

Statistics Theory · Mathematics 2023-05-05 Pierre Alquier , Mathieu Gerber

This paper studies low-rank matrix completion in the presence of heavy-tailed and possibly asymmetric noise, where we aim to estimate an underlying low-rank matrix given a set of highly incomplete noisy entries. Though the matrix completion…

Statistics Theory · Mathematics 2022-06-10 Bingyan Wang , Jianqing Fan

Asymmetry along with heteroscedasticity or contamination often occurs with the growth of data dimensionality. In ultra-high dimensional data analysis, such irregular settings are usually overlooked for both theoretical and computational…

Statistics Theory · Mathematics 2022-07-20 Bin Luo , Xiaoli Gao

The task of estimating a matrix given a sample of observed entries is known as the \emph{matrix completion problem}. Most works on matrix completion have focused on recovering an unknown real-valued low-rank matrix from a random sample of…

Statistics Theory · Mathematics 2014-08-27 Olga Klopp , Jean Lafond , Eric Moulines , Joseph Salmon

Low-rank matrix completion is an important problem with extensive real-world applications. When observations are uniformly sampled from the underlying matrix entries, existing methods all require the matrix to be incoherent. This paper…

Machine Learning · Computer Science 2015-02-11 Shusen Wang , Tong Zhang , Zhihua Zhang

Penalized estimation principle is fundamental to high-dimensional problems. In the literature, it has been extensively and successfully applied to various models with only structural parameters. As a contrast, in this paper, we apply this…

Statistics Theory · Mathematics 2017-08-03 Jianqing Fan , Runlong Tang , Xiaofeng Shi

This paper deals with the trace regression model where $n$ entries or linear combinations of entries of an unknown $m_1\times m_2$ matrix $A_0$ corrupted by noise are observed. We propose a new nuclear norm penalized estimator of $A_0$ and…

Statistics Theory · Mathematics 2016-03-24 Vladimir Koltchinskii , Alexandre B. Tsybakov , Karim Lounici

M-estmators including the Welsch and Cauchy have been widely adopted for robustness against outliers, but they also down-weigh the uncontaminated data. To address this issue, we devise a framework to generate a class of nonconvex functions…

Machine Learning · Statistics 2023-10-10 Zhi-Yong Wang , Hing Cheung So

We study least-squares trace regression when the parameter is the sum of a $r$-low-rank matrix and a $s$-sparse matrix and a fraction $\epsilon$ of the labels is corrupted. For subgaussian distributions and feature-dependent noise, we…

Statistics Theory · Mathematics 2024-01-08 Philip Thompson

Fully robust versions of the elastic net estimator are introduced for linear and logistic regression. The algorithms to compute the estimators are based on the idea of repeatedly applying the non-robust classical estimators to data subsets…

Methodology · Statistics 2017-03-16 Fatma Sevinc Kurnaz , Irene Hoffmann , Peter Filzmoser

In this paper we prove the asymptotic efficiency of the model selection procedure proposed by the authors in the first part. To this end we introduce the robust risk as the least upper bound of the quadratical risk over a broad class of…

Statistics Theory · Mathematics 2009-09-18 Victor Konev , Serguei Pergamenchtchikov

Let $A:[0,1]\rightarrow\mathbb{H}_m$ (the space of Hermitian matrices) be a matrix valued function which is low rank with entries in H\"{o}lder class $\Sigma(\beta,L)$. The goal of this paper is to study statistical estimation of $A$ based…

Machine Learning · Statistics 2019-11-05 Fan Zhou

We consider the problem of recovering a lowrank matrix M from a small number of random linear measurements. A popular and useful example of this problem is matrix completion, in which the measurements reveal the values of a subset of the…

Information Theory · Computer Science 2009-10-05 Emmanuel J. Candes , Yaniv Plan

Relative error estimation has been recently used in regression analysis. A crucial issue of the existing relative error estimation procedures is that they are sensitive to outliers. To address this issue, we employ the $\gamma$-likelihood…

Methodology · Statistics 2018-10-17 Kei Hirose , Hiroki Masuda

This paper studies robust regression in the settings of Huber's $\epsilon$-contamination models. We consider estimators that are maximizers of multivariate regression depth functions. These estimators are shown to achieve minimax rates in…

Statistics Theory · Mathematics 2017-02-16 Chao Gao

We study the completion of approximately low rank matrices with entries missing not at random (MNAR). In the context of typical large-dimensional statistical settings, we establish a framework for the performance analysis of the nuclear…

Information Theory · Computer Science 2024-01-02 Agostino Capponi , Mihailo Stojnic