Dynamic Matrix Recovery

References

• Agarwal, A., Negahban, S., and Wainwright, M. J. (2012), “Noisy Matrix Decomposition via Convex Relaxation: Optimal Rates in High Dimensions,” The Annals of Statistics, 40, 1171–1197. DOI: 10.1214/12-AOS1000.
   Web of Science ®Google Scholar
• Beck, A., and Teboulle, M. (2009), “A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems,” SIAM Journal on Imaging Sciences, 2, 183–202. DOI: 10.1137/080716542.
   Web of Science ®Google Scholar
• Bi, X., Tang, X., Yuan, Y., Zhang, Y., and Qu, A. (2021), “Tensors in Statistics,” Annual Review of Statistics and its Application, 8, 345–368. DOI: 10.1146/annurev-statistics-042720-020816.
   Web of Science ®Google Scholar
• Candes, E. J., and Plan, Y. (2011), “Tight Oracle Inequalities for Low-Rank Matrix Recovery from a Minimal Number of Noisy Random Measurements,” IEEE Transactions on Information Theory, 57, 2342–2359. DOI: 10.1109/TIT.2011.2111771.
   Web of Science ®Google Scholar
• Candès, E. J., Li, X., Ma, Y., and Wright, J. (2011), “Robust Principal Component Analysis?” Journal of the ACM (JACM), 58, 1–37. DOI: 10.1145/1970392.1970395.
   Web of Science ®Google Scholar
• Candès, E. J., and Recht, B. (2009), “Exact Matrix Completion via Convex Optimization,” Foundations of Computational Mathematics, 9, 717–772. DOI: 10.1007/s10208-009-9045-5.
   Web of Science ®Google Scholar
• Csurgay, Á. I., Porod, W., and Lent, C. S. (2000), “Signal Processing with Near-Neighbor-Coupled Time-Varying Quantum-Dot Arrays,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, 47, 1212–1223. DOI: 10.1109/81.873875.
   Google Scholar
• Doukhan, P. (2012), Mixing: Properties and Examples (Vol. 85), New York: Springer.
   Google Scholar
• Fan, J., Wang, W., and Zhu, Z. (2021), “A Shrinkage Principle for Heavy-Tailed Data: High-Dimensional Robust Low-Rank Matrix Recovery,” Annals of Statistics, 49, 1239–1266.
   PubMed Web of Science ®Google Scholar
• Gandy, S., Recht, B., and Yamada, I. (2011), “Tensor Completion and Low-n-Rank Tensor Recovery via Convex Optimization,” Inverse Problems, 27, 025010. DOI: 10.1088/0266-5611/27/2/025010.
   Web of Science ®Google Scholar
• Gao, P., and Wang, M. (2018), “Dynamic Matrix Recovery from Partially Observed and Erroneous Measurements,” in 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), IEEE, pp. 4089–4093.
   Google Scholar
• Gross, D., Liu, Y.-K., Flammia, S. T., Becker, S., and Eisert, J. (2010), “Quantum State Tomography via Compressed Sensing,” Physical Review Letters, 105, 150401. DOI: 10.1103/PhysRevLett.105.150401.
   PubMed Web of Science ®Google Scholar
• Hang, H., and Steinwart, I. (2017), “A Bernstein-Type Inequality for Some Mixing Processes and Dynamical Systems with an Application to Learning,” The Annals of Statistics, 45, 708–743. DOI: 10.1214/16-AOS1465.
   Web of Science ®Google Scholar
• Hu, X., and Yao, F. (2022), “Dynamic Principal Component Analysis in High Dimensions,” Journal of the American Statistical Association. DOI: 10.1080/01621459.2022.2115917.
   Web of Science ®Google Scholar
• Ji, S., and Ye, J. (2009), “An Accelerated Gradient Method for Trace Norm Minimization,” in Proceedings of the 26th Annual International Conference on Machine Learning, pp. 457–464. DOI: 10.1145/1553374.1553434.
   Google Scholar
• Keshavan, R., Montanari, A., and Oh, S. (2009), “Matrix Completion from Noisy Entries,” Advances in Neural Information Processing Systems (Vol. 22).
   Google Scholar
• Klopp, O. (2011), “Rank Penalized Estimators for High-Dimensional Matrices,” Electronic Journal of Statistics, 5, 1161–1183. DOI: 10.1214/11-EJS637.
   Web of Science ®Google Scholar
• Koltchinskii, V., Lounici, K., and Tsybakov, A. B. (2011a), “Nuclear-Norm Penalization and Optimal Rates for Noisy Low-Rank Matrix Completion,” The Annals of Statistics, 39, 2302–2329. DOI: 10.1214/11-AOS894.
   Web of Science ®Google Scholar
• Koltchinskii, V., and Xia, D. (2015), “Optimal Estimation of Low Rank Density Matrices,” Journal of Machine Learning Research, 16, 1757–1792.
   Web of Science ®Google Scholar
• Koren, Y. (2009), “Collaborative Filtering with Temporal Dynamics,” in Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 447–456. DOI: 10.1145/1557019.1557072.
   Google Scholar
• Koren, Y., Bell, R., and Volinsky, C. (2009), “Matrix Factorization Techniques for Recommender Systems,” Computer, 42, 30–37. DOI: 10.1109/MC.2009.263.
   Web of Science ®Google Scholar
• Li, X. P., Huang, L., So, H. C., and Zhao, B. (2019), “A Survey on Matrix Completion: Perspective of Signal Processing,” arXiv:1901.10885.
   Google Scholar
• Liu, J., Musialski, P., Wonka, P., and Ye, J. (2012), “Tensor Completion for Estimating Missing Values in Visual Data,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 35, 208–220. DOI: 10.1109/TPAMI.2012.39.
   Web of Science ®Google Scholar
• Lois, B., and Vaswani, N. (2015), “Online Matrix Completion and Online Robust PCA,” in 2015 IEEE International Symposium on Information Theory (ISIT), IEEE, pp. 1826–1830.
   Google Scholar
• Merlevède, F., Peligrad, M., and Rio, E. (2009), “Bernstein Inequality and Moderate Deviations Under Strong Mixing Conditions,” in High Dimensional Probability V: The Luminy Volume, pp. 273–292, Beachwood, OH: Institute of Mathematical Statistics.
   Google Scholar
• Merlevède, F., Peligrad, M., and Rio, E. (2011), “A Bernstein Type Inequality and Moderate Deviations for Weakly Dependent Sequences,” Probability Theory and Related Fields, 151, 435–474. DOI: 10.1007/s00440-010-0304-9.
   Web of Science ®Google Scholar
• Negahban, S., and Wainwright, M. J. (2011), “Estimation of (Near) Low-Rank Matrices with Noise and High-Dimensional Scaling,” The Annals of Statistics, 39, 1069–1097. DOI: 10.1214/10-AOS850.
   Web of Science ®Google Scholar
• Nesterov, Y. E. (1983), “A Method of Solving a Convex Programming Problem with Convergence Rate o(1k2),” Doklady Akademii Nauk, 269, 543–547.
   Web of Science ®Google Scholar
• Netflix. (2006), “Netflix Prize Data,” available at http://netflixprize.com/index.html.
   Google Scholar
• Pont-Tuset, J., Perazzi, F., Caelles, S., Arbeláez, P., Sorkine-Hornung, A., and Van Gool, L. (2017), “The 2017 Davis Challenge on Video Object Segmentation,” arXiv:1704.00675.
   Google Scholar
• Qiu, K., Mao, X., Shen, X., Wang, X., Li, T., and Gu, Y. (2017), “Time-Varying Graph Signal Reconstruction,” IEEE Journal of Selected Topics in Signal Processing, 11, 870–883. DOI: 10.1109/JSTSP.2017.2726969.
   Web of Science ®Google Scholar
• Recht, B., Fazel, M., and Parrilo, P. A. (2010), “Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization,” SIAM Review, 52, 471–501. DOI: 10.1137/070697835.
   Web of Science ®Google Scholar
• Toh, K.-C., and Yun, S. (2010), “An Accelerated Proximal Gradient Algorithm for Nuclear Norm Regularized Linear Least Squares Problems,” Pacific Journal of Optimization, 6, 15.
   Web of Science ®Google Scholar
• Vershynin, R. (2018), High-Dimensional Probability: An Introduction with Applications in Data Science (Vol. 47), Cambridge: Cambridge University Press.
   Google Scholar
• Wang, X., Donaldson, R., Nell, C., Gorniak, P., Ester, M., and Bu, J. (2016), “Recommending Groups to Users Using User-Group Engagement and Time-Dependent Matrix Factorization,” in Proceedings of the AAAI Conference on Artificial Intelligence. DOI: 10.1609/aaai.v30i1.10160.
   Google Scholar
• Xia, D., and Yuan, M. (2021), “Statistical Inferences of Linear Forms for Noisy Matrix Completion,” Journal of the Royal Statistical Society, Series B, 83, 58–77. DOI: 10.1111/rssb.12400.
   Google Scholar
• Xu, L., and Davenport, M. (2016), “Dynamic Matrix Recovery from Incomplete Observations Under an Exact Low-Rank Constraint,” in Advances in Neural Information Processing Systems (Vol. 29).
   Google Scholar
• Xu, X., Dong, F., Li, Y., He, S., and Li, X. (2020), “Contextual-Bandit based Personalized Recommendation with Time-Varying User Interests,” in Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 34), pp. 6518–6525. DOI: 10.1609/aaai.v34i04.6125.
   Google Scholar
• Zhang, A. R., Luo, Y., Raskutti, G., and Yuan, M. (2020), “Islet: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching,” SIAM Journal on Mathematics of Data Science, 2, 444–479. DOI: 10.1137/19M126476X.
   Google Scholar
• Zhang, Y., Bi, X., Tang, N., and Qu, A. (2021), “Dynamic Tensor Recommender Systems,” The Journal of Machine Learning Research, 22, 3032–3066.
   Web of Science ®Google Scholar
• Zhao, T., Wang, Z., and Liu, H. (2015), “A Nonconvex Optimization Framework for Low Rank Matrix Estimation,” in Advances in Neural Information Processing Systems (Vol. 28).
   PubMedGoogle Scholar
• Zheng, Q., and Lafferty, J. (2016), “Convergence Analysis for Rectangular Matrix Completion Using Burer-Monteiro Factorization and Gradient Descent,” arXiv:1605.07051.
   Google Scholar
• Zhou, H., Li, L., and Zhu, H. (2013), “Tensor Regression with Applications in Neuroimaging Data Analysis,” Journal of the American Statistical Association, 108, 540–552. DOI: 10.1080/01621459.2013.776499.
   PubMed Web of Science ®Google Scholar