The following pages link to (Q4999009):
Displaying 6 items.
- Bounds on the quality of the PCA bounding boxes (Q1028234) (← links)
- Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244) (← links)
- Inference for low-rank tensors -- no need to debias (Q2131273) (← links)
- Computational barriers to estimation from low-degree polynomials (Q2149001) (← links)
- Statistical-computational trade-offs in tensor PCA and related problems via communication complexity (Q6151966) (← links)
- Statistical Query Lower Bounds for Tensor PCA (Q6346797) (← links)