Pages that link to "Item:Q5375567"
From MaRDI portal
The following pages link to Sharp Time–Data Tradeoffs for Linear Inverse Problems (Q5375567):
Displayed 14 items.
- Sharp oracle inequalities for least squares estimators in shape restricted regression (Q1750286) (← links)
- Precise statistical analysis of classification accuracies for adversarial training (Q2091832) (← links)
- Generalizing CoSaMP to signals from a union of low dimensional linear subspaces (Q2175016) (← links)
- A simple homotopy proximal mapping algorithm for compressive sensing (Q2425244) (← 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)
- Fast and Reliable Parameter Estimation from Nonlinear Observations (Q4588858) (← links)
- An Equivalence between Critical Points for Rank Constraints Versus Low-Rank Factorizations (Q5131960) (← links)
- On the Convergence Rate of Projected Gradient Descent for a Back-Projection Based Objective (Q5860373) (← links)
- Sharp global convergence guarantees for iterative nonconvex optimization with random data (Q6046308) (← links)
- A unified analysis of convex and non-convex \(\ell_p\)-ball projection problems (Q6097485) (← links)
- A unified approach to uniform signal recovery from nonlinear observations (Q6101267) (← links)
- Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems (Q6134435) (← links)
- Noisy linear inverse problems under convex constraints: exact risk asymptotics in high dimensions (Q6183752) (← links)