Interpretable Matrix Completion: A Discrete Optimization Approach

References

• Beck A, Teboulle M (2009) A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1):183–202.Crossref, Google Scholar
• Bennett J, Lanning S (2007) The netflix prize. Proc. KDD Cup and Workshop 2007 (Citeseer), 35.Google Scholar
• Bertsimas D, Copenhaver MS (2018) Characterization of the equivalence of robustification and regularization in linear, median, and matrix regression. Eur. J. Oper. Res. 270:931–942.Crossref, Google Scholar
• Bertsimas D, van Parys B (2020) Sparse high-dimensional regression: Exact scalable algorithms and phase transitions. Ann. Statist. 48(1):300–323.Crossref, Google Scholar
• Boyd S, El Ghaoui L, Feron E, Balakrishnan V (1994) Linear Matrix Inequalities in System and Control Theory, vol 15 (SIAM, Philadelphia).Crossref, Google Scholar
• Byrd RH, Nocedal J, Waltz RA (2006) Knitro: An integrated package for nonlinear optimization. Large-Scale Nonlinear Optimization (Springer, Berlin), 35–59.Crossref, Google Scholar
• Candes EJ, Plan Y (2010) Matrix completion with noise. Proc. IEEE 98(6):925–936.Crossref, Google Scholar
• Candès EJ, Tao T (2010) The power of convex relaxation: Near-optimal matrix completion. IEEE Trans. Inform. Theory 56(5):2053–2080.Crossref, Google Scholar
• Chen Y, Bhojanapalli S, Sanghavi S, Ward R (2014a) Coherent matrix completion. Proc. Internat. Conf. on Machine Learn. (ICML, San Diego), 674–682.Google Scholar
• Chen Y, Jalali A, Sanghavi S, Xu H (2014b) Clustering partially observed graphs via convex optimization. J. Machine Learn. Res. 15(1):2213–2238.Google Scholar
• Chiang KY, Hsieh CJ, Dhillon IS (2015) Matrix completion with noisy side information. Adv. Neural Inform. Processing Systems 28:3447–3455.Google Scholar
• Chiang KY, Hsieh CJ, Natarajan N, Dhillon IS, Tewari A (2014) Prediction and clustering in signed networks: A local to global perspective. J. Machine Learn. Res. 15(1):1177–1213.Google Scholar
• Coey C, Lubin M, Vielma JP (2020) Outer approximation with conic certificates for mixed-integer convex problems. Math. Programming Comput. 12(2):249–293.Crossref, Google Scholar
• Dhillon P, Lu Y, Foster DP, Ungar L (2013) New subsampling algorithms for fast least squares regression. Adv. Neural Inform. Processing Systems 26:360–368.Google Scholar
• Duran MA, Grossmann IE (1986) An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Programming 36(3):307–339.Crossref, Google Scholar
• Farhat MR, Shapiro BJ, Kieser KJ, Sultana R, Jacobson KR, Victor TC, Warren RM, et al. (2013) Genomic analysis identifies targets of convergent positive selection in drug-resistant mycobacterium tuberculosis. Nature Genetics 45(10):1183.Crossref, Google Scholar
• Hastie T, Mazumder R, Lee JD, Zadeh R (2015) Matrix completion and low-rank svd via fast alternating least squares. J. Machine Learn. Res. 16(1):3367–3402.Google Scholar
• Jain P, Dhillon IS (2013) Provable inductive matrix completion. Preprint, submitted June 4, https://arxiv.org/abs/1306.0626.Google Scholar
• Jain P, Meka R, Dhillon IS (2010) Guaranteed rank minimization via singular value projection. Adv. Neural Inform. Processing Systems 23:937–945.Google Scholar
• Ji H, Liu C, Shen Z, Xu Y (2010) Robust video denoising using low rank matrix completion. Proc. Comput. Society Conf. on Comput. Vision and Pattern Recognition (IEEE, Piscataway, NJ).Google Scholar
• Keshavan RH, Oh S, Montanari A (2009) Matrix completion from a few entries. Proc. IEEE Internat. Sympos. on Inform. Theory (IEEE, Piscataway, NJ), 324–328.Google Scholar
• Koren Y, Bell R, Volinsky C (2009) Matrix factorization techniques for recommender systems. Computer 42(8):30–37.Crossref, Google Scholar
• Kronqvist J, Bernal DE, Lundell A, Grossmann IE (2019) A review and comparison of solvers for convex minlp. Optim. Engrg. 20(2):397–455.Crossref, Google Scholar
• Lu J, Liang G, Sun J, Bi J (2016) A sparse interactive model for matrix completion with side information. Adv. Neural Inform. Processing Systems 29:4071–4079.Google Scholar
• Mazumder R, Hastie T, Tibshirani R (2010) Spectral regularization algorithms for learning large incomplete matrices. J. Mach. Learn. Res. 11(Aug):2287–2322.Google Scholar
• Natarajan N, Dhillon IS (2014) Inductive matrix completion for predicting gene–disease associations. Bioinformatics 30(12):160–168.Crossref, Google Scholar
• Nazarov I, Shirokikh B, Burkina M, Fedonin G, Panov M (2018) Sparse group inductive matrix completion. Preprint, submitted April 27, https://arxiv.org/abs/1804.10653.Google Scholar
• Negahban S, Wainwright MJ (2012) Restricted strong convexity and weighted matrix completion: Optimal bounds with noise. J. Machine Learn. Res. 13(May):1665–1697.Google Scholar
• Recht B, Ré C (2013) Parallel stochastic gradient algorithms for large-scale matrix completion. Math. Programming Comput. 5(2):201–226.Crossref, Google Scholar
• Shah V, Rao N, Ding W (2017) Matrix factorization with side and higher order information. Statistics 1050:4.Google Scholar
• Si S, Chiang KY, Hsieh CJ, Rao N, Dhillon IS (2016) Goal-directed inductive matrix completion. Proc. 22nd ACM SIGKDD Internat. Conf. on Knowledge Discovery and Data Mining (ACM, New York), 1165–1174.Google Scholar
• Soni A, Chevalier T, Jain S (2017) Noisy inductive matrix completion under sparse factor models. 2017 IEEE Internat. Sympos. Inform. Theory (ISIT) (IEEE, Piscataway, NJ), 2990–2994.Google Scholar
• Tanner J, Wei K (2013) Normalized iterative hard thresholding for matrix completion. SIAM J. Sci. Comput. 35(5):S104–S125.Crossref, Google Scholar
• Woodbury MA (1949) The Stability of Out-Input Matrices (Chicago). https://mathscinet.ams.org/mathscinet-getitem?mr=38136.Google Scholar
• Xu M, Jin R, Zhou ZH (2013) Speedup matrix completion with side information: Application to multi-label learning. Burges CJ, Bottou L, Welling M, Ghahramani Z, Weinberger KQ, eds. Advances in Neural Information Processing Systems, vol. 26 (Curran Associates, Inc., New York), 2301–2309.Google Scholar