Comment on ``Hypothesis testing by convex optimization
From MaRDI portal
Publication:491382
DOI10.1214/15-EJS998zbMath1327.62295MaRDI QIDQ491382
Publication date: 25 August 2015
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.ejs/1438951884
Nonparametric hypothesis testing (62G10) Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Minimax procedures in statistical decision theory (62C20) Convex programming (90C25) Numerical optimization and variational techniques (65K10) Markov processes: hypothesis testing (62M02)
Cites Work
- Latent variable graphical model selection via convex optimization
- Optimal detection of sparse principal components in high dimension
- Exponential screening and optimal rates of sparse estimation
- On combinatorial testing problems
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
- Expressing combinatorial optimization problems by linear programs
- Expected complexity of graph partitioning problems
- Computational barriers in minimax submatrix detection
- Simultaneous analysis of Lasso and Dantzig selector
- Detection of a sparse submatrix of a high-dimensional noisy matrix
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Exact matrix completion via convex optimization
- Large Cliques Elude the Metropolis Process
- Neyman-Pearson classification, convexity and stochastic constraints
- Convexity, Classification, and Risk Bounds
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
