Fetching the paper…
Reading the bibliography…
We consider the setup of nonparametric {\em blind regression} for estimating the entries of a large $m \times n$ matrix, when provided with a small, random fraction of noisy measurements.
D. Aldous, “Representations for partially eschangeable arrays of random variables,” J. Multivariate Anal. , vol. 11, pp. 581 – 598, 1981
1981
Earlier work this paper cites.
D. Hoover, “Row-column exchangeability and a generalized model for probability,” in Exchangeability in Probability and Statistics (Rome, 1981) , 1981, pp. 281 – 291
1981
Earlier work this paper cites.
Y. Mack and B. W. Silverman, “Weak and strong uniform consistency of kernel regression estimates,” Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete , vol. 61, no. 3, pp. 405–415, 1982
1982
Earlier work this paper cites.
D. Goldberg, D. Nichols, B. M. Oki, and D. Terry, “Using collaborative filtering to weave an information tapestry,” Commun. ACM , 1992
1992
Earlier work this paper cites.
M. P. Wand and M. C. Jones, Kernel smoothing . Crc Press, 1994
1994
Earlier work this paper cites.
P. Indyk, “Algorithmic applications of low-distortion geometric embeddings,” in focs , vol. 1, 2001, pp. 10–33
2001
Earlier work this paper cites.
M. Fazel, H. Hindi, and S. P. Boyd, “Log-det heuristic for matrix rank minimization with applications to hankel and euclidean distance matrices,” in Proceedings of ACC , vol. 3. IEEE, 2003, pp. 2156–2162
2003
Earlier work this paper cites.
G. Linden, B. Smith, and J. York, “Amazon.com recommendations: Item-to-item collaborative filtering,” IEEE Internet Computing , vol. 7, no. 1, pp. 76–80, 2003
2003
Earlier work this paper cites.
N. Srebro, N. Alon, and T. S. Jaakkola, “Generalization error bounds for collaborative prediction with low-rank matrices,” in Advances In Neural Information Processing Systems , 2004, pp. 1321–1328
2004
Earlier work this paper cites.
——, “Nearest neighbors in high-dimensional spaces,” 2004
2004
Earlier work this paper cites.
J. Wang, A. P. de Vries, and M. J. T. Reinders, “Unifying user-based and item-based collaborative filtering approaches by similarity fusion,” in Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval , ser. SIGIR ’06. New York, NY, USA: ACM, 2006, pp. 501–508. [Online]. Available: http://doi.acm.org/10.1145/1148170.1148257
2006
Earlier work this paper cites.
R. M. Bell and Y. Koren, “Scalable collaborative filtering with jointly derived neighborhood interpolation weights,” in Proceedings of the 2007 Seventh IEEE International Conference on Data Mining , ser. ICDM ’07. Washington, DC, USA: IEEE Computer Society, 2007, pp. 43–52. [Online]. Available: http://dx.doi.org/10.1109/ICDM.2007.90
2007
Earlier work this paper cites.
D. Cai, X. He, X. Wu, and J. Han, “Non-negative matrix factorization on manifold,” in Data Mining, 2008. ICDM’08. Eighth IEEE International Conference on . IEEE, 2008, pp. 63–72
2008
Earlier work this paper cites.
Y. Koren, “Factorization meets the neighborhood: A multifaceted collaborative filtering model,” in Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , ser. KDD ’08. New York, NY, USA: ACM, 2008, pp. 426–434. [Online]. Available: http://doi.acm.org/10.1145/1401890.1401944
2008
Earlier work this paper cites.
T. G. Kolda and J. Sun, “Scalable tensor decompositions for multi-aspect data mining,” in 2008 Eighth IEEE International conference on data mining , 2008, pp. 363 – 372
2008
Earlier work this paper cites.
V. De Silva and L. H. Lim, “Tensor rank and the ill-posedness of the best low-rank approximation problem,” SIAM Journal on Matrix Analysis and Applications , vol. 30, no. 3, pp. 1084 – 1127, 2008
2008
Earlier work this paper cites.
E. J. Candès and B. Recht, “Exact matrix completion via convex optimization,” Foundations of Computational mathematics , vol. 9, no. 6, pp. 717–772, 2009
2009
Earlier work this paper cites.
R. Keshavan, A. Montanari, and S. Oh, “Matrix completion from a few entries,” IEEE Trans. Inf. Theory , vol. 56, no. 6, 2009
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,” CAMSAP , vol. 61, 2009
2009
Earlier work this paper cites.
B.-H. Shen, S. Ji, and J. Ye, “Mining discrete patterns via binary matrix factorization,” in Proceedings of the 15th ACM SIGKDD international conference . ACM, 2009, pp. 757–766
2009
Earlier work this paper cites.
T. G. Kolda and B. W. Bader, “Tensor decompositions and applications,” SIAM review , vol. 51, no. 3, pp. 455–500, 2009
2009
Earlier work this paper cites.
J. Sun, S. Papadimitriou, C. Y. Lin, N. Cao, S. Liu, and W. Qian, “Multivis: Content-based social network exploration through multi-way visual analysis,” in Proc. SIAM Intl. Conf. on Data Mining , 2009, pp. 1064 – 1075
2009
Earlier work this paper cites.
Z. Liu and L. Vandenberghe, “Interior-point method for nuclear norm approximation with application to system identification,” SIAM Journal on Matrix Analysis and Applications , vol. 31, no. 3, pp. 1235–1256, 2010
2010
Earlier work this paper cites.
R. Mazumder, T. Hastie, and R. Tibshirani, “Spectral regularization algorithms for learning large incomplete matrices,” The Journal of Machine Learning Research , vol. 11, pp. 2287–2322, 2010
2010
Earlier work this paper cites.
2010
Earlier work this paper cites.
R. Mazumder, T. Hastie, and R. Tibshirani, “Spectral regularization algorithms for learning large incomplete matrices,” The Journal of Machine Learning Research , vol. 11, pp. 2287–2322, 2010
2010
Earlier work this paper cites.
A. Rohde, A. B. Tsybakov et al. , “Estimation of high-dimensional low-rank matrices,” The Annals of Statistics , vol. 39, no. 2, pp. 887–930, 2011
2011
Cited alongside, same era.
Y. Koren and R. Bell, “Advances in collaborative filtering,” in Recommender Systems Handbook . Springer US, 2011, pp. 145–186
2011
Cited alongside, same era.
S. Gandy, B. Recht, and I. Yamada, “Tensor completion and low-n-rank tensor recovery via convex optimization,” Inverse Problems , vol. 27, no. 2, p. 025010, 2011
2011
Cited alongside, same era.
R. Tomioka, T. Suzuki, K. Hayashi, and H. Kashima, “Statistical performance of convex tensor decomposition,” in Advances in Neural Information Processing Systems , 2011, pp. 972–980
2011
Cited alongside, same era.
S. Balakrishnan, M. Kolar, A. Rinaldo, A. Singh, and L. Wasserman, “Statistical and computational tradeoffs in biclustering,” in NIPS 2011 workshop on computational trade-offs in statistical learning , vol. 4, 2011
S. Chatterjee, “Matrix estimation by universal singular value thresholding,” The Annals of Statistics , vol. 43, no. 1, pp. 177–214, 2015
2015
Later among the works it cites.
X. Ning, C. Desrosiers, and G. Karypis, Recommender Systems Handbook . Springer US, 2015, ch. A Comprehensive Survey of Neighborhood-Based Recommendation Methods, pp. 37–76
2015
Later among the works it cites.
2015
Later among the works it cites.
P. Orbanz and D. M. Roy, “Bayesian models of graphs, arrays and other exchangeable random structures,” IEEE transactions on pattern analysis and machine intelligence , vol. 37, no. 2, pp. 437 – 461, 2015
2015
Later among the works it cites.
Z. Ma, Y. Wu et al. , “Computational barriers in minimax submatrix detection,” The Annals of Statistics , vol. 43, no. 3, pp. 1089–1116, 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
S. Gandy, B. Recht, and I. Yamada, “Tensor completion and low-n-rank tensor recovery via convex optimization,” Inverse Problems , vol. 27, no. 2, p. 025010, 2011
2011
Cited alongside, same era.
M. Signoretto, R. Van de Plas, B. De Moor, and J. A. Suykens, “Tensor versus matrix completion: a comparison with application to spectral data,” IEEE Signal Processing Letters , vol. 18, no. 7, pp. 403 – 406, 2011
2011
Cited alongside, same era.
R. Tomioka, T. Suzuki, K. Hayashi, and H. Kashima, “Statistical performance of convex tensor decomposition,” in Advances in Neural Information Processing Systems , 2011, pp. 972–980
2011
Cited alongside, same era.
S. Negahban and M. J. Wainwright, “Restricted strong convexity and weighted matrix completion: Optimal bounds with noise,” The Journal of Machine Learning Research , vol. 13, no. 1, pp. 1665–1697, 2012
2012
Cited alongside, same era.
S. Arora, R. Ge, and A. Moitra, “Learning topic models–going beyond svd,” in Foundations of Computer Science (FOCS), 2012 IEEE 53rd Annual Symposium on . IEEE, 2012, pp. 1–10
2012
Cited alongside, same era.
S. Arora, R. Ge, R. Kannan, and A. Moitra, “Computing a nonnegative matrix factorization–provably,” in Proceedings of the 44th annual ACM symposium on Theory of computing . ACM, 2012, pp. 145–162
2012
Cited alongside, same era.
T. Austin, “Exchangeable random arrays.” Technical Report, Notes for IAS workshop. , 2012
2012
Cited alongside, same era.
2015
Later among the works it cites.
C. Gao, Y. Lu, and H. H. Zhou, “Rate-optimal graphon estimation,” The Annals of Statistics , vol. 43, no. 6, pp. 2624–2652, 2015
2015
Later among the works it cites.
O. Klopp, A. B. Tsybakov, and N. Verzelen, “Oracle inequalities for network models and sparse graphon estimation,” Annals of Statistics , 2015
2015
Later among the works it cites.
Q. Zhao, L. Zhang, and A. Cichocki, “Bayesian cp factorization of incomplete tensors with automatic rank determination,” IEEE Trans. Pattern Analysis and Machine Intelligence , vol. 37, no. 9, pp. 1751–1763, 2015
2015
Later among the works it cites.
J. Lee, S. Kim, G. Lebanon, Y. Singer, and S. Bengio, “Llorma: Local low-rank matrix approximation,” Journal of Machine Learning Research , vol. 17, no. 15, pp. 1–24, 2016. [Online]. Available: http://jmlr.org/papers/v17/14-301.html
2016
Later among the works it cites.
G. Bresler, D. Shah, and L. F. Voloch, “Collaborative filtering with low regret,” in ACM Sigmetrics , 2016
2016
Later among the works it cites.
B. Barak and A. Moitra, “Noisy tensor completion via the sum-of-squares hierarchy,” in Conference on Learning Theory , 2016
2016
Later among the works it cites.
E. Abbe, A. S. Bandeira, and G. Hall, “Exact recovery in the stochastic block model,” IEEE Transactions on Information Theory , vol. 62, no. 1, pp. 471–487, 2016
2016
Later among the works it cites.
C. E. Lee, Y. Li, D. Shah, and D. Song, “Blind regression: nonparametric regression for latent variable models via collaborative filtering,” in Proceedings of the 30th International Conference on Neural Information Processing Systems . Curran Associates Inc., 2016, pp. 2163–2173
2016
Later among the works it cites.
2016
Later among the works it cites.
J. Xu, “Rates of convergence of spectral methods for graphon estimation,” in ICML , 2017
2017
Closest in time.
Y. Zhang, E. Levina, and J. Zhu, “Estimating network edge probabilities by neighbourhood smoothing,” Biometrika , vol. 104, no. 4, pp. 771–783, 2017
2017
Closest in time.
A. Potechin and D. Steurer, “Exact tensor completion with sum-of-squares,” in Conference on Learning Theory , 2017, pp. 1619–1673
2017
Closest in time.
2017
Closest in time.
D. Xia and M. Yuan, “On polynomial time methods for exact low-rank tensor completion,” Foundations of Computational Mathematics , pp. 1–49, 2017
2017
Closest in time.
N. B. Shah, S. Balakrishnan, A. Guntuboyina, and M. J. Wainwright, “Stochastically transitive models for pairwise comparisons: Statistical and computational issues,” IEEE Transactions on Information Theory , vol. 63, no. 2, pp. 934–959, 2017
2017
Closest in time.
C. Borgs, J. Chayes, C. E. Lee, and D. Shah, “Thy friend is my friend: Iterative collaborative filtering for sparse matrix estimation,” in Advances in Neural Information Processing Systems , 2017, pp. 4715–4726
2017
Closest in time.
G. Chen and D. Shah, Explaining the success of nearest neighbor method in prediction . Foundations and Trends in Machine Learning, 2018
2018
Closest in time.
A. Montanari and N. Sun, “Spectral algorithms for tensor completion,” Communications on Pure and Applied Mathematics , vol. 71, no. 11, pp. 2381–2425, 2018
2018
Closest in time.
N. B. Shah, S. Balakrishnan, and M. J. Wainwright, “Low permutation-rank matrices: Structural properties and noisy completion,” in 2018 IEEE International Symposium on Information Theory (ISIT) . IEEE, 2018, pp. 366–370
2018
Closest in time.
S. Chatterjee and S. Mukherjee, “Estimation in tournaments and graphs under monotonicity constraints,” IEEE Transactions on Information Theory , 2019
2019
Closest in time.
N. Flammarion, C. Mao, P. Rigollet et al. , “Optimal rates of statistical seriation,” Bernoulli , vol. 25, no. 1, pp. 623–653, 2019
2019
Closest in time.