ResearchTrend.AI
Poisson Matrix Recovery and Completion
v1v2 (latest)

Poisson Matrix Recovery and Completion

Yang Cao
Yao Xie
ArXiv (abs)PDFHTML

Papers citing "Poisson Matrix Recovery and Completion"

17 / 17 papers shown
Title
Low Rank Matrix Completion with Exponential Family Noise
Low Rank Matrix Completion with Exponential Family Noise
Jean Lafond
76
45
0
24 Feb 2015
Noisy Matrix Completion under Sparse Factor Models
Noisy Matrix Completion under Sparse Factor Models
Akshay Soni
Swayambhoo Jain
Jarvis Haupt
S. Gonella
76
36
0
02 Nov 2014
Fast Algorithm for Low-rank matrix recovery in Poisson noise
Fast Algorithm for Low-rank matrix recovery in Poisson noise
Yang Cao
Yao Xie
59
11
0
02 Jul 2014
Minimax Optimal Rates for Poisson Inverse Problems with Physical Constraints
Minimax Optimal Rates for Poisson Inverse Problems with Physical Constraints
Xin Jiang
Garvesh Raskutti
Rebecca Willett
65
38
0
25 Mar 2014
Composite Self-Concordant Minimization
Composite Self-Concordant Minimization
Quoc Tran-Dinh
Anastasios Kyrillidis
Volkan Cevher
103
95
0
13 Aug 2013
A proximal Newton framework for composite minimization: Graph learning without Cholesky decompositions and matrix inversions
A proximal Newton framework for composite minimization: Graph learning without Cholesky decompositions and matrix inversions
Quoc Tran-Dinh
Anastasios Kyrillidis
Volkan Cevher
62
29
0
08 Jan 2013
Low-rank Matrix Completion using Alternating Minimization
Low-rank Matrix Completion using Alternating Minimization
Prateek Jain
Praneeth Netrapalli
Sujay Sanghavi
222
1,066
0
03 Dec 2012
1-Bit Matrix Completion
1-Bit Matrix Completion
Mark A. Davenport
Y. Plan
E. Berg
Mary Wootters
212
353
0
17 Sep 2012
Changepoint detection for high-dimensional time series with missing data
Changepoint detection for high-dimensional time series with missing data
Yao Xie
Jiaji Huang
Rebecca Willett
AI4TS
53
121
0
24 Aug 2012
Robust computation of linear models by convex relaxation
Robust computation of linear models by convex relaxation
Gilad Lerman
Michael B. McCoy
J. Tropp
Teng Zhang
147
161
0
18 Feb 2012
How well can we estimate a sparse vector?
How well can we estimate a sparse vector?
Emmanuel J. Candès
Mark A. Davenport
103
116
0
27 Apr 2011
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
Estimation of high-dimensional low-rank matrices
Estimation of high-dimensional low-rank matrices
Angelika Rohde
Alexandre B. Tsybakov
261
382
0
29 Dec 2009
Estimation of (near) low-rank matrices with noise and high-dimensional scaling
Estimation of (near) low-rank matrices with noise and high-dimensional scaling
S. Negahban
Martin J. Wainwright
232
570
0
27 Dec 2009
Matrix Completion from Noisy Entries
Matrix Completion from Noisy Entries
Raghunandan H. Keshavan
Andrea Montanari
Sewoong Oh
265
719
0
11 Jun 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
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