The following pages link to Benjamin Recht (Q378115):
Displayed 39 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)
- Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints (Q3465237) (← links)
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization (Q3586174) (← links)
- Gradient Descent Learns Linear Dynamical Systems (Q4558171) (← links)
- (Q4558524) (← links)
- Atomic Norm Denoising With Applications to Line Spectral Estimation (Q4578849) (← links)
- Perturbed Iterate Analysis for Asynchronous Stochastic Optimization (Q4588862) (← links)
- Efficient discrete approximations of quantum gates (Q4832734) (← links)
- Optimization for Data Analysis (Q4997705) (← links)
- (Q5054631) (← links)
- Superresolution without separation (Q5229759) (← links)
- Tight query complexity lower bounds for PCA via finite sample deformed wigner law (Q5230378) (← links)
- Isometric sketching of any set via the Restricted Isometry Property (Q5242860) (← links)
- Distributed Control of Systems Over Discrete Groups (Q5273863) (← links)
- Decomposition Methods for Large Scale LP Decoding (Q5346195) (← links)
- Compressed Sensing Off the Grid (Q5346266) (← links)
- Sharp Time–Data Tradeoffs for Linear Inverse Problems (Q5375567) (← links)
- A Simpler Approach to Matrix Completion (Q5396731) (← links)
- The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems (Q5737722) (← links)
- (Q5866463) (← links)
- A General Analysis of the Convergence of ADMM (Q6258865) (← links)
- Low-rank Solutions of Linear Matrix Equations via Procrustes Flow (Q6263552) (← links)
- Near-Optimal Bounds for Binary Embeddings of Arbitrary Sets (Q6268384) (← links)
- Breaking Locality Accelerates Block Gauss-Seidel (Q6281919) (← links)
- On the Gap Between Strict-Saddles and True Convexity: An Omega(log d) Lower Bound for Eigenvector Approximation (Q6285543) (← links)
- Active Learning for Nonlinear System Identification with Guarantees (Q6343182) (← links)
- Approximately Exact Line Search (Q6353358) (← links)
- Online Control for Adaptive Tapering of Medications (Q6451976) (← links)