English
Related papers

Related papers: Robust Partial Least Squares Using Low Rank and Sp…

200 papers

We study the problem of estimating a low-rank positive semidefinite (PSD) matrix from a set of rank-one measurements using sensing vectors composed of i.i.d. standard Gaussian entries, which are possibly corrupted by arbitrary outliers.…

Information Theory · Computer Science 2016-12-21 Yuanxin Li , Yue Sun , Yuejie Chi

The panel data regression models have gained increasing attention in different areas of research including but not limited to econometrics, environmental sciences, epidemiology, behavioral and social sciences. However, the presence of…

Methodology · Statistics 2020-11-24 Beste Hamiye Beyaztas , Soutir Bandyopadhyay

Partial least squares (PLS) regression combines dimensionality reduction and prediction using a latent variable model. Since partial least squares regression (PLS-R) does not require matrix inversion or diagonalization, it can be applied to…

Methodology · Statistics 2014-08-05 Tzu-Yu Liu , Laura Trinchera , Arthur Tenenhaus , Dennis Wei , Alfred O. Hero

This paper deals with the rotation synchronization problem, which arises in global registration of 3D point-sets and in structure from motion. The problem is formulated in an unprecedented way as a "low-rank and sparse" matrix decomposition…

Computer Vision and Pattern Recognition · Computer Science 2019-02-05 Federica Arrigoni , Andrea Fusiello , Beatrice Rossi , Pasqualina Fragneto

This paper proposes a sparse regression strategy for discovery of ordinary differential equations from incomplete and noisy data. Inference is performed over both equation parameters and state variables using a statistically motivated…

Dynamical Systems · Mathematics 2026-02-18 Teddy Meissner , Karl Glasner

We consider classification and regression tasks where we have missing data and assume that the (clean) data resides in a low rank subspace. Finding a hidden subspace is known to be computationally hard. Nevertheless, using a non-proper…

Machine Learning · Computer Science 2015-01-15 Elad Hazan , Roi Livni , Yishay Mansour

Sparse linear regression, which entails finding a sparse solution to an underdetermined system of linear equations, can formally be expressed as an $l_0$-constrained least-squares problem. The Orthogonal Least-Squares (OLS) algorithm…

Machine Learning · Statistics 2016-08-01 Abolfazl Hashemi , Haris Vikalo

We show that when a high-dimensional data matrix is the sum of a low-rank matrix and a random error matrix with independent entries, the low-rank component can be consistently estimated by solving a convex minimization problem. We develop a…

Econometrics · Economics 2019-11-14 Jushan Bai , Junlong Feng

We propose a minimum distance estimation method for robust regression in sparse high-dimensional settings. The traditional likelihood-based estimators lack resilience against outliers, a critical issue when dealing with high-dimensional…

Methodology · Statistics 2013-07-12 Aurélie C. Lozano , Nicolai Meinshausen

In this letter, we study the deterministic sampling patterns for the completion of low rank matrix, when corrupted with a sparse noise, also known as robust matrix completion. We extend the recent results on the deterministic sampling…

Information Theory · Computer Science 2018-03-14 Morteza Ashraphijuo , Vaneet Aggarwal , Xiaodong Wang

Principal Components Analysis (PCA) is one of the most widely used dimension reduction techniques. Robust PCA (RPCA) refers to the problem of PCA when the data may be corrupted by outliers. Recent work by Cand{\`e}s, Wright, Li, and Ma…

Information Theory · Computer Science 2018-08-14 Namrata Vaswani , Praneeth Narayanamurthy

This paper studies the problem of estimating a large coefficient matrix in a multiple response linear regression model when the coefficient matrix could be both of low rank and sparse in the sense that most nonzero entries concentrate on a…

Methodology · Statistics 2016-03-18 Zhuang Ma , Zongming Ma , Tingni Sun

In the recent work of Candes et al, the problem of recovering low rank matrix corrupted by i.i.d. sparse outliers is studied and a very elegant solution, principal component pursuit, is proposed. It is motivated as a tool for video…

Computer Vision and Pattern Recognition · Computer Science 2015-03-17 Chenlu Qiu , Namrata Vaswani

Modern data sets, such as those in healthcare and e-commerce, are often derived from many individuals or systems but have insufficient data from each source alone to separately estimate individual, often high-dimensional, model parameters.…

Machine Learning · Computer Science 2024-11-14 Maryann Rui , Thibaut Horel , Munther Dahleh

We propose an algorithmic framework, that employs active subspace techniques, for scalable global optimization of functions with low effective dimension (also referred to as low-rank functions). This proposal replaces the original…

Optimization and Control · Mathematics 2024-02-01 Coralia Cartis , Xinzhu Liang , Estelle Massart , Adilet Otemissov

This work examines the multi-view compressive phase retrieval problem in a distributed sensor network, where each sensor device, limited by storage and sensing capabilities, can access only intensity measurements from an unknown part of the…

Information Theory · Computer Science 2025-06-02 Ming-Hsun Yang

We investigate practical algorithms to find or disprove the existence of small subsets of a dataset which, when removed, reverse the sign of a coefficient in an ordinary least squares regression involving that dataset. We empirically study…

Methodology · Statistics 2023-08-01 Daniel Freund , Samuel B. Hopkins

We address the detection of material defects, which are inside a layered material structure using compressive sensing based multiple-input and multiple-output (MIMO) wireless radar. Here, the strong clutter due to the reflection of the…

Signal Processing · Electrical Eng. & Systems 2022-04-18 Udaya S. K. P. Miriya Thanthrige , Peter Jung , Aydin Sezgin

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

A novel framework is introduced to formalize identifiability in well-specified but ill-posed linear regression models. The framework is distribution-free and accommodates highly correlated features that may or may not relate to the…

Statistics Theory · Mathematics 2026-03-05 Gianluca Finocchio , Tatyana Krivobokova