Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1711.04965
Cited By
Near-optimal sample complexity for convex tensor completion
14 November 2017
Navid Ghadermarzy
Y. Plan
Özgür Yilmaz
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Near-optimal sample complexity for convex tensor completion"
6 / 6 papers shown
Title
When big data actually are low-rank, or entrywise approximation of certain function-generated matrices
Stanislav Budzinskiy
70
2
0
03 Jul 2024
Tensor Methods in High Dimensional Data Analysis: Opportunities and Challenges
Arnab Auddy
Dong Xia
Ming Yuan
AI4CE
50
2
0
28 May 2024
Low-Tubal-Rank Tensor Recovery via Factorized Gradient Descent
Zhiyu Liu
Zhi Han
Yandong Tang
Xi-Le Zhao
Yao Wang
50
1
0
22 Jan 2024
Tensor Completion for Causal Inference with Multivariate Longitudinal Data: A Reevaluation of COVID-19 Mandates
Jonathan Auerbach
M. Slawski
Shixue Zhang
21
0
0
09 Mar 2022
Deterministic tensor completion with hypergraph expanders
K. Harris
Yizhe Zhu
36
11
0
23 Oct 2019
Tensor Completion Algorithms in Big Data Analytics
Qingquan Song
Hancheng Ge
James Caverlee
Xia Hu
26
228
0
28 Nov 2017
1