Matrix Completion from $O(n)$ Samples in Linear Time

v1v2v3v4 (latest)

Matrix Completion from $O(n)$ Samples in Linear Time

Annual Conference Computational Learning Theory (COLT), 2017

8 February 2017

ArXiv (abs)PDF HTML

Papers citing "Matrix Completion from $O(n)$ Samples in Linear Time"

9 / 9 papers shown

Title
Differential Privacy for Euclidean Jordan Algebra with Applications to Private Symmetric Cone Programming Zhao Song Jianfei Xue Lichen Zhang 46 0 0 21 Sep 2025
Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear TimeInternational Conference on Learning Representations (ICLR), 2023 Yuzhou Gu Zhao Song Junze Yin Licheng Zhang 198 32 0 21 Feb 2023
Detection thresholds in very sparse matrix completion C. Bordenave Simon Coste R. Nadakuditi 192 27 0 12 May 2020
Recommendation on a Budget: Column Space Recovery from Partially Observed Entries with Random or Active SamplingInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2020 Carolyn Kim Mohsen Bayati 119 0 0 26 Feb 2020
Can Agents Learn by Analogy? An Inferable Model for PAC Reinforcement Learning Yanchao Sun Furong Huang 139 4 0 21 Dec 2019
Sparse random tensors: Concentration, regularization and applications Zhixin Zhou Yizhe Zhu 339 15 0 20 Nov 2019
Deterministic tensor completion with hypergraph expandersSIAM Journal on Mathematics of Data Science (SIMODS), 2019 K. Harris Yizhe Zhu 268 11 0 23 Oct 2019
Fast and Sample Efficient Inductive Matrix Completion via Multi-Phase Procrustes Flow Xiao Zhang S. Du Quanquan Gu 110 24 0 03 Mar 2018
Matrix Completion and Related Problems via Strong Duality Maria-Florina Balcan Yingyu Liang David P. Woodruff Hongyang R. Zhang 258 8 0 27 Apr 2017