scientific article; zbMATH DE number 7370600
From MaRDI portal
Publication:4999009
Publication date: 9 July 2021
Full work available at URL: https://arxiv.org/abs/2008.04101
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitycomputational-statistical gapsmatrix/tensor estimationstatistical query (SQ) modeltensor PCA
Related Items (4)
Tensor clustering with planted structures: statistical optimality and computational limits ⋮ Inference for low-rank tensors -- no need to debias ⋮ Computational barriers to estimation from low-degree polynomials ⋮ Statistical-computational trade-offs in tensor PCA and related problems via communication complexity
Cites Work
- Unnamed Item
- On the distribution of the largest eigenvalue in principal components analysis
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis
- Tensor decompositions for learning latent variable models
- Efficient noise-tolerant learning from statistical queries
- Tensor SVD: Statistical and Computational Limits
- Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization
- On the Complexity of Random Satisfiability Problems with Planted Solutions
- Statistical Algorithms and a Lower Bound for Detecting Planted Cliques
- Analysis of Boolean Functions
- The Landscape of the Spiked Tensor Model
- Efficient Algorithms and Lower Bounds for Robust Linear Regression
- Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors
- An Introduction to Matrix Concentration Inequalities
- Conditional Expectation and Unbiased Sequential Estimation
This page was built for publication:
