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. 1802.06967
  4. Cited By
Recovery of simultaneous low rank and two-way sparse coefficient
  matrices, a nonconvex approach

Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach

20 February 2018
Ming Yu
Varun Gupta
Mladen Kolar
ArXivPDFHTML

Papers citing "Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach"

26 / 26 papers shown
Title
Factor Group-Sparse Regularization for Efficient Low-Rank Matrix
  Recovery
Factor Group-Sparse Regularization for Efficient Low-Rank Matrix Recovery
Jicong Fan
Lijun Ding
Yudong Chen
Madeleine Udell
56
70
0
13 Nov 2019
ISLET: Fast and Optimal Low-rank Tensor Regression via Importance
  Sketching
ISLET: Fast and Optimal Low-rank Tensor Regression via Importance Sketching
Anru R. Zhang
Yuetian Luo
Garvesh Raskutti
M. Yuan
165
44
0
09 Nov 2019
Low-rank matrix recovery with composite optimization: good conditioning
  and rapid convergence
Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
Vasileios Charisopoulos
Yudong Chen
Damek Davis
Mateo Díaz
Lijun Ding
Dmitriy Drusvyatskiy
72
85
0
22 Apr 2019
Matrix Completion has No Spurious Local Minimum
Matrix Completion has No Spurious Local Minimum
Rong Ge
Jason D. Lee
Tengyu Ma
108
599
0
24 May 2016
Dropping Convexity for Faster Semi-definite Optimization
Dropping Convexity for Faster Semi-definite Optimization
Srinadh Bhojanapalli
Anastasios Kyrillidis
Sujay Sanghavi
70
173
0
14 Sep 2015
Fast matrix completion without the condition number
Fast matrix completion without the condition number
Moritz Hardt
Mary Wootters
102
107
0
15 Jul 2014
Incoherence-Optimal Matrix Completion
Incoherence-Optimal Matrix Completion
Yudong Chen
104
205
0
01 Oct 2013
Completing Any Low-rank Matrix, Provably
Completing Any Low-rank Matrix, Provably
Yudong Chen
Srinadh Bhojanapalli
Sujay Sanghavi
Rachel A. Ward
105
116
0
12 Jun 2013
Sparse PCA: Optimal rates and adaptive estimation
Sparse PCA: Optimal rates and adaptive estimation
Tommaso Cai
Zongming Ma
Yihong Wu
149
327
0
06 Nov 2012
Truncated Power Method for Sparse Eigenvalue Problems
Truncated Power Method for Sparse Eigenvalue Problems
Xiao-Tong Yuan
Tong Zhang
127
329
0
12 Dec 2011
Sparse principal component analysis and iterative thresholding
Sparse principal component analysis and iterative thresholding
Zongming Ma
145
333
0
12 Dec 2011
Low-rank Matrix Recovery from Errors and Erasures
Low-rank Matrix Recovery from Errors and Erasures
Yudong Chen
A. Jalali
Sujay Sanghavi
Constantine Caramanis
109
166
0
03 Apr 2011
Natural Language Processing (almost) from Scratch
Natural Language Processing (almost) from Scratch
R. Collobert
Jason Weston
Léon Bottou
Michael Karlen
Koray Kavukcuoglu
Pavel P. Kuksa
191
7,726
0
02 Mar 2011
Noisy matrix decomposition via convex relaxation: Optimal rates in high
  dimensions
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
Alekh Agarwal
S. Negahban
Martin J. Wainwright
225
433
0
23 Feb 2011
Nuclear norm penalization and optimal rates for noisy low rank matrix
  completion
Nuclear norm penalization and optimal rates for noisy low rank matrix completion
V. Koltchinskii
Alexandre B. Tsybakov
Karim Lounici
226
663
0
29 Nov 2010
A Unified Framework for High-Dimensional Analysis of M-Estimators with
  Decomposable Regularizers
A Unified Framework for High-Dimensional Analysis of M-Estimators with Decomposable Regularizers
S. Negahban
Pradeep Ravikumar
Martin J. Wainwright
Bin Yu
474
1,379
0
13 Oct 2010
Restricted strong convexity and weighted matrix completion: Optimal
  bounds with noise
Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
S. Negahban
Martin J. Wainwright
199
522
0
10 Sep 2010
Union Support Recovery in Multi-task Learning
Union Support Recovery in Multi-task Learning
Mladen Kolar
John D. Lafferty
Larry A. Wasserman
186
60
0
31 Aug 2010
Oracle Inequalities and Optimal Inference under Group Sparsity
Oracle Inequalities and Optimal Inference under Group Sparsity
Karim Lounici
Massimiliano Pontil
Alexandre B. Tsybakov
Sara van de Geer
287
382
0
11 Jul 2010
Singular vectors under random perturbation
Singular vectors under random perturbation
V. Vu
193
76
0
12 Apr 2010
Guaranteed Rank Minimization via Singular Value Projection
Guaranteed Rank Minimization via Singular Value Projection
Raghu Meka
Prateek Jain
Inderjit S. Dhillon
183
553
0
30 Sep 2009
Matrix Completion from Noisy Entries
Matrix Completion from Noisy Entries
Raghunandan H. Keshavan
Andrea Montanari
Sewoong Oh
265
719
0
11 Jun 2009
Feature Hashing for Large Scale Multitask Learning
Feature Hashing for Large Scale Multitask Learning
Kilian Q. Weinberger
A. Dasgupta
Josh Attenberg
John Langford
Alex Smola
119
1,023
0
12 Feb 2009
Matrix Completion from a Few Entries
Matrix Completion from a Few Entries
Raghunandan H. Keshavan
Andrea Montanari
Sewoong Oh
426
1,246
0
20 Jan 2009
High-dimensional analysis of semidefinite relaxations for sparse
  principal components
High-dimensional analysis of semidefinite relaxations for sparse principal components
Arash A. Amini
Martin J. Wainwright
156
314
0
27 Mar 2008
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear
  Norm Minimization
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Benjamin Recht
Maryam Fazel
P. Parrilo
416
3,768
0
28 Jun 2007
1