ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1202.4044
  4. Cited By
Robust computation of linear models by convex relaxation

Robust computation of linear models by convex relaxation

18 February 2012
Gilad Lerman
Michael B. McCoy
J. Tropp
Teng Zhang
ArXivPDFHTML

Papers citing "Robust computation of linear models by convex relaxation"

27 / 27 papers shown
Title
T-Rex: Fitting a Robust Factor Model via Expectation-Maximization
T-Rex: Fitting a Robust Factor Model via Expectation-Maximization
Daniel Cederberg
22
0
0
17 May 2025
Connective Reconstruction-based Novelty Detection
Connective Reconstruction-based Novelty Detection
Seyyed Morteza Hashemi
Parvaneh Aliniya
Parvin Razzaghi
OODD
22
0
0
25 Oct 2022
Closed-Form, Provable, and Robust PCA via Leverage Statistics and
  Innovation Search
Closed-Form, Provable, and Robust PCA via Leverage Statistics and Innovation Search
M. Rahmani
Ping Li
24
4
0
23 Jun 2021
Modal Principal Component Analysis
Modal Principal Component Analysis
Keishi Sando
H. Hino
29
16
0
07 Aug 2020
G2D: Generate to Detect Anomaly
G2D: Generate to Detect Anomaly
M. PourReza
Bahram Mohammadi
Mostafa Khaki
Samir Bouindour
H. Snoussi
Mohammad Sabokrou
16
60
0
20 Jun 2020
Manifold Proximal Point Algorithms for Dual Principal Component Pursuit
  and Orthogonal Dictionary Learning
Manifold Proximal Point Algorithms for Dual Principal Component Pursuit and Orthogonal Dictionary Learning
Shixiang Chen
Zengde Deng
Shiqian Ma
Anthony Man-Cho So
30
28
0
05 May 2020
Old is Gold: Redefining the Adversarially Learned One-Class Classifier
  Training Paradigm
Old is Gold: Redefining the Adversarially Learned One-Class Classifier Training Paradigm
M. Zaheer
Jin-ha Lee
Marcella Astrid
Seung-Ik Lee
AAML
27
221
0
16 Apr 2020
Fair Principal Component Analysis and Filter Design
Fair Principal Component Analysis and Filter Design
Gad Zalcberg
A. Wiesel
20
13
0
16 Feb 2020
Consensus-Based Optimization on the Sphere: Convergence to Global
  Minimizers and Machine Learning
Consensus-Based Optimization on the Sphere: Convergence to Global Minimizers and Machine Learning
M. Fornasier
Hui Huang
L. Pareschi
Philippe Sünnen
29
68
0
31 Jan 2020
Outlier Detection and Data Clustering via Innovation Search
Outlier Detection and Data Clustering via Innovation Search
M. Rahmani
P. Li
34
3
0
30 Dec 2019
Robust Group Synchronization via Cycle-Edge Message Passing
Robust Group Synchronization via Cycle-Edge Message Passing
Gilad Lerman
Yunpeng Shi
25
30
0
24 Dec 2019
An Overview of Robust Subspace Recovery
An Overview of Robust Subspace Recovery
Gilad Lerman
Tyler Maunu
28
130
0
02 Mar 2018
Adversarially Learned One-Class Classifier for Novelty Detection
Adversarially Learned One-Class Classifier for Novelty Detection
Mohammad Sabokrou
Mohammad Khalooei
M. Fathy
Ehsan Adeli
AAML
18
685
0
25 Feb 2018
Robust Subspace Learning: Robust PCA, Robust Subspace Tracking, and
  Robust Subspace Recovery
Robust Subspace Learning: Robust PCA, Robust Subspace Tracking, and Robust Subspace Recovery
Namrata Vaswani
T. Bouwmans
S. Javed
Praneeth Narayanamurthy
OOD
35
273
0
26 Nov 2017
A Well-Tempered Landscape for Non-convex Robust Subspace Recovery
A Well-Tempered Landscape for Non-convex Robust Subspace Recovery
Tyler Maunu
Teng Zhang
Gilad Lerman
24
63
0
13 Jun 2017
Hyperplane Clustering Via Dual Principal Component Pursuit
Hyperplane Clustering Via Dual Principal Component Pursuit
M. Tsakiris
René Vidal
27
31
0
06 Jun 2017
Subspace Learning in The Presence of Sparse Structured Outliers and
  Noise
Subspace Learning in The Presence of Sparse Structured Outliers and Noise
Shervin Minaee
Yao Wang
32
6
0
14 Mar 2017
Coherence Pursuit: Fast, Simple, and Robust Principal Component Analysis
Coherence Pursuit: Fast, Simple, and Robust Principal Component Analysis
M. Rahmani
George Atia
35
134
0
15 Sep 2016
Innovation Pursuit: A New Approach to Subspace Clustering
Innovation Pursuit: A New Approach to Subspace Clustering
M. Rahmani
George Atia
45
52
0
02 Dec 2015
Dual Principal Component Pursuit
Dual Principal Component Pursuit
M. Tsakiris
René Vidal
26
96
0
15 Oct 2015
A Riemannian low-rank method for optimization over semidefinite matrices
  with block-diagonal constraints
A Riemannian low-rank method for optimization over semidefinite matrices with block-diagonal constraints
Nicolas Boumal
27
67
0
01 Jun 2015
Randomized Robust Subspace Recovery for High Dimensional Data Matrices
Randomized Robust Subspace Recovery for High Dimensional Data Matrices
M. Rahmani
George Atia
30
57
0
21 May 2015
Adaptive Stochastic Gradient Descent on the Grassmannian for Robust
  Low-Rank Subspace Recovery and Clustering
Adaptive Stochastic Gradient Descent on the Grassmannian for Robust Low-Rank Subspace Recovery and Clustering
Jun He
Yue Zhang
35
8
0
12 Dec 2014
Relations among Some Low Rank Subspace Recovery Models
Relations among Some Low Rank Subspace Recovery Models
Hongyang R. Zhang
Zhouchen Lin
Chao Zhang
Junbin Gao
35
29
0
06 Dec 2014
Fast, Robust and Non-convex Subspace Recovery
Fast, Robust and Non-convex Subspace Recovery
Gilad Lerman
Tyler Maunu
41
77
0
24 Jun 2014
Robust Subspace Clustering via Thresholding
Robust Subspace Clustering via Thresholding
Reinhard Heckel
Helmut Bölcskei
55
155
0
18 Jul 2013
Robust subspace recovery by Tyler's M-estimator
Robust subspace recovery by Tyler's M-estimator
Teng Zhang
59
28
0
07 Jun 2012
1