Fetching the paper…
Reading the bibliography…
We extend the theory of low-rank matrix recovery and completion to the case when Poisson observations for a linear combination or a subset of the entries of a matrix are available, which arises in various applications with count data.
Springer, 1991
M. Ledoux and M. Talagrand, Probability in Banach Spaces: isoperimetry and processes · 1991
Earlier work this paper cites.
B. Yu, “Assouad, Fano, and le cam,” in Festschrift for Lucien Le Cam
1997
Earlier work this paper cites.
E. G. Birgin, J. M. Martínez, and M. Raydan, “Nonmonotone spectral projected gradient methods on convex sets,” SIAM J. Optimization
2000
Earlier work this paper cites.
University of California, Berkeley, Berkeley, CA, 2001
J. Canny, Lecture notes for CS174: Combinatorics and Discrete Probability · 2001
Earlier work this paper cites.
Cambridge University Press, 2002
D. Pollard, A User’s guide to measure theoretic probability · 2002
Earlier work this paper cites.
Cambridge Univ Press, 2004
S. Boyd, Convex optimization · 2004
Earlier work this paper cites.
H. Shen and J. Z. Huang, “Analysis of call centre arrival data using singular value decomposition,” Applied Stochastic Models in Business and Industry
2005
Earlier work this paper cites.
E. J. Candès and T. Tao, “Near-optimal signal recovery from random projections: Universal encoding strategies?,” IEEE Trans. Info. Theory
2006
Earlier work this paper cites.
D. L. Donoho, “Compressed sensing,” IEEE Trans. Info. Theory
2006
Earlier work this paper cites.
J. Duchi, S. Shalev-Shwartz, Y. Singer, and T. Chandra, “Efficient projections onto the l 1-ball for learning in high dimensions,” in Proc. 25th Int. Conf. on Machine Learning (ICML)
2008
Earlier work this paper cites.
John Wiley & Sons, 2009
D. J. Brady, Optical imaging and spectroscopy · 2009
Earlier work this paper cites.
E. J. Candès and B. Recht, “Exact matrix completion via convex optimization,” Foundations of Computational Mathematics (FOCS)
2009
Earlier work this paper cites.
Z. Lin, A. Ganesh, J. Wright, L. Wu, M. Chen, and Y. Ma, “Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix,” Comp. Adv. Multi-Sensor Adaptive Processing (CAMSAP)
2009
Earlier work this paper cites.
R. Keshavan, A. Montanari, and S. Oh, “Matrix completion from noisy entries,” in Adv. Neural Information Processing Systems (NIPS)
2009
Earlier work this paper cites.
S. Ji and J. Ye, “An accelerated gradient method for trace norm minimization,” in Proc. 26th Ann. Int. Conf. on Machine Learning
2009
Earlier work this paper cites.
M. Kloft, U. Brefeld, P. Laskov, K.-R. Müller, A. Zien, and S. Sonnenburg, “Efficient and accurate lp-norm multiple kernel learning,” in Advances in neural information processing systems
2009
Earlier work this paper cites.
Z. Liu and L. Vandenberghe, “Interior-point method for nuclear norm approximation with application to system identification,” SIAM J. Matrix Analysis and Applications
2009
Earlier work this paper cites.
A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM J. Imaging Sciences
2009
Earlier work this paper cites.
R. H. Keshavan, A. Montanari, and S. Oh, “Matrix completion from a few entries,” IEEE Trans. Info. Theory
2010
Cited alongside, same era.
E. J. Candès and T. Tao, “The power of convex relaxation: Near-optimal matrix completion,” IEEE Trans. Info. Theory
2010
Cited alongside, same era.
W. Dai and O. Milenkovic, “Set: An algorithm for consistent matrix completion,” in IEEE Int. Conf. Acoustics, Speech and Signal Processing (ICASSP)
2010
Cited alongside, same era.
B. Recht, M. Fazel, and P. A. Parrilo, “Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization,” SIAM Review
2010
Cited alongside, same era.
J.-F. Cai, E. J. Candès, and Z. Shen, “A singular value thresholding algorithm for matrix completion,” SIAM J. Optimization
2010
Cited alongside, same era.
2012
Later among the works it cites.
J. A. Bazerque, G. Mateos, and G. B. Giannakis, “Inference of poisson count processes using low-rank tensor data,” in IEEE Int. Conf. Acoustics, Speech and Signal Processing (ICASSP)
2013
Later among the works it cites.
Q. Tran-Dinh, A. Kyrillidis, and V. Cevher, “A proximal newton framework for composite minimization: Graph learning without cholesky decomposition and matrix inversions,” Proc. 30th Int. Conf. Machine Learning (ICML)
2013
Later among the works it cites.
E. J. Candes and M. A. Davenport, “How well can we estimate a sparse vector?,” Applied and Computational Harmonic Analysis (ACHA)
2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. Mazumder, T. Hastie, and R. Tibshirani, “Spectral regularization algorithms for learning large incomplete matrices,” J. Machine Learning Research
2010
Cited alongside, same era.
E. J. Candes and Y. Plan, “Matrix completion with noise,” Proc. IEEE
2010
Cited alongside, same era.
M. Raginsky, R. M. Willett, Z. T. Harmany, and R. F. Marcia, “Compressed sensing performance bounds under poisson noise,” IEEE Trans. Signal Processing
2010
Cited alongside, same era.
A. Agarwal, S. Negahban, and M. J. Wainwright, “Fast global convergence rates of gradient methods for high-dimensional statistical recovery,” in Adv. Neural Information Processing Systems (NIPS)
2010
Cited alongside, same era.
University of California, Berkeley, Berkeley, CA, 2010
L. El Ghaoui, Lecture notes for EE227A: Algorithms for Large-Scale Convex Optimization · 2010
Cited alongside, same era.
B. Recht, “A simpler approach to matrix completion,” J. Machine Learning Research
2011
Cited alongside, same era.
S. Negahban, M. J. Wainwright, et al
2011
Cited alongside, same era.
P. Jain, P. Netrapalli, and S. Sanghavi, “Low-rank matrix completion using alternating minimization,” in Proc. 45th ACM Symp. on Theory of Computing (STOC)
2013
Later among the works it cites.
Y. Xie, J. Huang, and R. Willett, “Change-point detection for high-dimensional time series with missing data,” IEEE J. Sel. Top. Signal Processing (J-STSP)
2013
Later among the works it cites.
H. Fanaee-T and J. Gama, “Event labeling combining ensemble detectors and background knowledge,” Prog. Artificial Intelligence
2013
Later among the works it cites.
M. A. Davenport, Y. Plan, E. v. d. Berg, and M. Wootters, “1-bit matrix completion,” Information and Inference
2014
Later among the works it cites.
A. Soni, S. Jain, J. Haupt, and S. Gonella, “Error bounds for maximum likelihood matrix completion under sparse factor models,” in IEEE Global Conf. Sig. and Info. Proc. (GlobalSIP)
2014
Later among the works it cites.
2014
Later among the works it cites.
A. Soni and J. Haupt, “Estimation error guarantees for poisson denoising with sparse and structured dictionary models,” in IEEE Int. Symp. Info. Theory (ISIT)
2014
Later among the works it cites.
2014
Later among the works it cites.
Q. Tran-Dinh, A. Kyrillidis, and V. Cevher, “Composite self-concordant minimization,” J. Machine Learning Research
2014
Later among the works it cites.
M. J. Wainwright, “Structured regularizers for high-dimensional problems: Statistical and computational issues,” Annual Review of Statistics and Its Application
2014
Later among the works it cites.
M. J. Wainwright, “Structured regularizers for high-dimensional problems: Statistical and computational issues,” Annual Review of Statistics and its Applications
2014
Later among the works it cites.
Y. Cao and Y. Xie, “Low-rank matrix recovery in poisson noise,” in IEEE Global Conf. Sig. and Info. Proc. (GlobalSIP)
2014
Later among the works it cites.