activity
20162026
most citedOpen Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection

12 citations · 58 across the 15 of their papers we have counts for

collaborators
Showing 2020Show all

6 papers · 1 filter

stat.ME2020★ 9 cited

Exact Clustering in Tensor Block Model: Statistical Optimality and Computational Limit

Rungang Han, Yuetian Luo, Miaoyan Wang +1

High-order clustering aims to identify heterogeneous substructures in multiway datasets that arise commonly in neuroimaging, genomics, social network studies, etc. The non-convex a…

math.OC2020★ 7 cited

Recursive Importance Sketching for Rank Constrained Least Squares: Algorithms and High-order Convergence

Yuetian Luo, Wen Huang, Xudong Li +1

In this paper, we propose {\it \underline{R}ecursive} {\it \underline{I}mportance} {\it \underline{S}ketching} algorithm for {\it \underline{R}ank} constrained least squares {\it \…

stat.ML2020★ 12 cited

Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection

Yuetian Luo, Anru R. Zhang

We note the significance of hypergraphic planted clique (HPC) detection in the investigation of computational hardness for a range of tensor problems. We ask if more evidence for t…

math.ST2020★ 9 cited

A Sharp Blockwise Tensor Perturbation Bound for Orthogonal Iteration

Yuetian Luo, Garvesh Raskutti, Ming Yuan +1

In this paper, we develop novel perturbation bounds for the high-order orthogonal iteration (HOOI) [DLDMV00b]. Under mild regularity conditions, we establish blockwise tensor pertu…

math.NA2020★ 5 cited

A Schatten- Low-rank Matrix Perturbation Analysis via Perturbation Projection Error Bound

Yuetian Luo, Rungang Han, Anru R. Zhang

This paper studies the Schatten- error of low-rank matrix estimation by singular value decomposition under perturbation. We specifically establish a perturbation bound on the lo…

math.ST2020★ 3 cited

Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits

Yuetian Luo, Anru R. Zhang

This paper studies the statistical and computational limits of high-order clustering with planted structures. We focus on two clustering models, constant high-order clustering (CHC…