The following pages link to Benjamin Recht (Q378115):
Displaying 14 items.
- Simple bounds for recovering low-complexity models (Q378116) (← links)
- Null space conditions and thresholds for rank minimization (Q633114) (← links)
- On kernel methods for covariates that are rankings (Q1657968) (← links)
- The convex geometry of linear inverse problems (Q1928276) (← links)
- On the sample complexity of the linear quadratic regulator (Q2194770) (← links)
- Probability of unique integer solution to a system of linear equations (Q2275621) (← links)
- Parallel stochastic gradient algorithms for large-scale matrix completion (Q2392935) (← links)
- First-order methods almost always avoid strict saddle points (Q2425175) (← links)
- Exact matrix completion via convex optimization (Q2655288) (← links)
- (Q2788390) (← links)
- Near Minimax Line Spectral Estimation (Q2978834) (← links)
- Tensor completion and low-n-rank tensor recovery via convex optimization (Q3081493) (← links)
- Superresolution without separation (Q5229759) (← links)
- Isometric sketching of any set via the Restricted Isometry Property (Q5242860) (← links)
