Pages that link to "Item:Q2799918"
From MaRDI portal
The following pages link to Convex Recovery of a Structured Signal from Independent Random Linear Measurements (Q2799918):
Displayed 32 items.
- Low rank matrix recovery from rank one measurements (Q347516) (← links)
- Low-rank matrix recovery via rank one tight frame measurements (Q666654) (← links)
- Preserving injectivity under subgaussian mappings and its application to compressed sensing (Q778017) (← links)
- A note on computing the smallest conic singular value (Q1636761) (← links)
- Simplicial faces of the set of correlation matrices (Q1991097) (← links)
- Sparse space-time models: concentration inequalities and Lasso (Q2028941) (← links)
- Phase retrieval with PhaseLift algorithm (Q2033498) (← links)
- The distribution of the Lasso: uniform control over sparse balls and adaptive parameter tuning (Q2054498) (← links)
- Proof methods for robust low-rank matrix recovery (Q2106469) (← links)
- Bias versus non-convexity in compressed sensing (Q2155168) (← links)
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution (Q2189396) (← links)
- Complex phase retrieval from subgaussian measurements (Q2226993) (← links)
- Sharp oracle inequalities for low-complexity priors (Q2304249) (← links)
- Solving equations of random convex functions via anchored regression (Q2317380) (← links)
- Compressed sensing for finite-valued signals (Q2401311) (← links)
- \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed? (Q2659754) (← links)
- Generic error bounds for the generalized Lasso with sub-exponential data (Q2675193) (← links)
- Estimation in High Dimensions: A Geometric Perspective (Q2799917) (← links)
- Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements (Q4603729) (← links)
- Stable low-rank matrix recovery via null space properties (Q4606522) (← links)
- Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization (Q5006447) (← links)
- Robust Width: A Characterization of Uniformly Stable and Robust Compressed Sensing (Q5020144) (← links)
- Fast Convex Pruning of Deep Neural Networks (Q5027023) (← links)
- Norm and Trace Estimation with Random Rank-one Vectors (Q5150838) (← links)
- Simultaneous Phase Retrieval and Blind Deconvolution via Convex Programming (Q5214251) (← links)
- Linear convergence of Frank-Wolfe for rank-one matrix recovery without strong convexity (Q6038639) (← links)
- Robust sensing of low-rank matrices with non-orthogonal sparse decomposition (Q6051152) (← links)
- A unified approach to uniform signal recovery from nonlinear observations (Q6101267) (← links)
- Sampling rates for \(\ell^1\)-synthesis (Q6142336) (← links)
- Noisy linear inverse problems under convex constraints: exact risk asymptotics in high dimensions (Q6183752) (← links)
- The Lasso with general Gaussian designs with applications to hypothesis testing (Q6183778) (← links)
- Performance bounds of the intensity-based estimators for noisy phase retrieval (Q6185682) (← links)