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

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

collaborators

16 papers

math.ST2022

Discussion of "Vintage factor analysis with Varimax performs statistical inference"

Rungang Han, Anru R. Zhang

We wholeheartedly congratulate Drs. Rohe and Zeng for their insightful paper \cite{rohe2020vintage} on vintage factor analysis with Varimax rotation. This note discusses the condit…

cs.LG2022

Learning Polynomial Transformations

Sitan Chen, Jerry Li, Yuanzhi Li +1

We consider the problem of learning high dimensional polynomial transformations of Gaussians. Given samples of the form , where is hidden and $p:…

math.ST2020

Inference for Low-rank Tensors -- No Need to Debias

Dong Xia, Anru R. Zhang, Yuchen Zhou

In this paper, we consider the statistical inference for several low-rank tensor models. Specifically, in the Tucker low-rank tensor PCA or regression model, provided with any esti…

stat.ML202012 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

An Optimal Statistical and Computational Framework for Generalized Tensor Estimation

Rungang Han, Rebecca Willett, Anru R. Zhang

This paper describes a flexible framework for generalized low-rank tensor estimation problems that includes many important instances arising from applications in computational imag…

stat.ML2019

ISLET: Fast and Optimal Low-rank Tensor Regression via Importance Sketching

Anru Zhang, Yuetian Luo, Garvesh Raskutti +1

In this paper, we develop a novel procedure for low-rank tensor regression, namely \emph{\underline{I}mportance \underline{S}ketching \underline{L}ow-rank \underline{E}stimation fo…