Pages that link to "Item:Q5170958"

The following pages link to Computational and statistical tradeoffs via convex relaxation (Q5170958):

Displaying 20 items.

• Sharp MSE bounds for proximal denoising (Q330102) (← links)
• On statistics, computation and scalability (Q373533) (← links)
• Optimal detection of sparse principal components in high dimension (Q385763) (← links)
• A new perspective on least squares under convex constraint (Q482891) (← links)
• Statistics for big data: a perspective (Q1642374) (← links)
• When small data beats big data (Q1642414) (← links)
• Sharp oracle inequalities for least squares estimators in shape restricted regression (Q1750286) (← links)
• The overlap gap property in principal submatrix recovery (Q2067659) (← links)
• Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244) (← links)
• Crawling subsampling for multivariate spatial autoregression model in large-scale networks (Q2233551) (← links)
• Optimal testing for planted satisfiability problems (Q2259537) (← links)
• Computational barriers in minimax submatrix detection (Q2352736) (← links)
• High-dimensional change-point estimation: combining filtering with convex optimization (Q2397167) (← links)
• Proximal Markov chain Monte Carlo algorithms (Q2628880) (← links)
• \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed? (Q2659754) (← links)
• Kronecker-structured covariance models for multiway data (Q2678238) (← links)
• (Q4993325) (← links)
• Making sense of big data (Q5170976) (← links)
• Manifold separation-based DOA estimation for nonlinear arrays via compressed super-resolution of positive sources (Q6045804) (← links)
• BOLT-SSI: A Statistical Approach to Screening Interaction Effects for Ultra-High Dimensional Data (Q6069479) (← links)