Multi-source Learning via Completion of Block-wise Overlapping Noisy
Matrices

Multi-source Learning via Completion of Block-wise Overlapping Noisy Matrices

21 May 2021

Tianxi Cai

Papers citing "Multi-source Learning via Completion of Block-wise Overlapping Noisy Matrices"

12 / 12 papers shown

Title
KG-BERT: BERT for Knowledge Graph Completion Liang Yao Chengsheng Mao Yuan Luo SLR 33 582 0 07 Sep 2019
Clinical Concept Embeddings Learned from Massive Sources of Multimodal Medical Data Andrew L. Beam Benjamin Kompa A. Schmaltz Inbar Fried G. Weber N. Palmer Xu Shi Tianxi Cai I. Kohane 26 177 0 04 Apr 2018
Word Translation Without Parallel Data Alexis Conneau Guillaume Lample MarcÁurelio Ranzato Ludovic Denoyer Hervé Jégou 247 1,646 0 11 Oct 2017
No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis Rong Ge Chi Jin Yi Zheng 94 435 0 03 Apr 2017
Matrix Completion has No Spurious Local Minimum Rong Ge Jason D. Lee Tengyu Ma 41 597 0 24 May 2016
Structured Matrix Completion with Applications to Genomic Data Integration Tianxi Cai T. Tony Cai Anru R. Zhang 36 74 0 08 Apr 2015
Matrix Completion via Max-Norm Constrained Optimization T. Tony Cai Wenxin Zhou 55 112 0 02 Mar 2013
Efficient Estimation of Word Representations in Vector Space Tomas Mikolov Kai Chen G. Corrado J. Dean 3DV 456 31,406 0 16 Jan 2013
Noisy low-rank matrix completion with general sampling distribution Olga Klopp 67 205 0 01 Mar 2012
Nuclear norm penalization and optimal rates for noisy low rank matrix completion V. Koltchinskii Alexandre B. Tsybakov Karim Lounici 64 663 0 29 Nov 2010
Restricted strong convexity and weighted matrix completion: Optimal bounds with noise S. Negahban Martin J. Wainwright 89 521 0 10 Sep 2010
Matrix Completion from a Few Entries Raghunandan H. Keshavan Andrea Montanari Sewoong Oh 102 1,242 0 20 Jan 2009

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.