Fast and robust tensor decomposition with applications to dictionary learning

27 June 2017

Papers citing "Fast and robust tensor decomposition with applications to dictionary learning"

13 / 13 papers shown

Title
Tensor Methods in High Dimensional Data Analysis: Opportunities and Challenges Arnab Auddy Dong Xia Ming Yuan AI4CE 50 2 0 28 May 2024
Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials Alexander S. Wein 27 9 0 10 Nov 2022
Lower Bounds for the Convergence of Tensor Power Iteration on Random Overcomplete Models Yuchen Wu Kangjie Zhou 29 6 0 07 Nov 2022
Concentration of polynomial random matrices via Efron-Stein inequalities Goutham Rajendran Madhur Tulsiani 14 7 0 06 Sep 2022
A Robust Spectral Algorithm for Overcomplete Tensor Decomposition Samuel B. Hopkins T. Schramm Jonathan Shi 25 23 0 05 Mar 2022
Fast algorithm for overcomplete order-3 tensor decomposition Jingqiu Ding Tommaso dÓrsi Chih-Hung Liu Stefan Tiegel David Steurer 21 9 0 14 Feb 2022
Clustering Mixtures with Almost Optimal Separation in Polynomial Time Jingkai Li Allen Liu 23 23 0 01 Dec 2021
Efficient Sparse Coding using Hierarchical Riemannian Pursuit Ye Xue Vincent K. N. Lau Songfu Cai 33 3 0 21 Apr 2021
SoS Degree Reduction with Applications to Clustering and Robust Moment Estimation David Steurer Stefan Tiegel 29 10 0 05 Jan 2021
Analysis of the Optimization Landscapes for Overcomplete Representation Learning Qing Qu Yuexiang Zhai Xiao Li Yuqian Zhang Zhihui Zhu 20 9 0 05 Dec 2019
Subgradient Descent Learns Orthogonal Dictionaries Yu Bai Qijia Jiang Ju Sun 20 51 0 25 Oct 2018
Mean Estimation with Sub-Gaussian Rates in Polynomial Time Samuel B. Hopkins 18 79 0 19 Sep 2018
Relative Error Tensor Low Rank Approximation Zhao Song David P. Woodruff Peilin Zhong 27 122 0 26 Apr 2017