Research map / Learning theory and algorithms / Matrix and tensor methods
Structured Matrix Recovery via the Generalized Dantzig Selector
Sheng Chen, Arindam Banerjee
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use spectral k-support norm instead of trace norm as the structure regularizer in generalized Dantzig selector | Generalized Dantzig selector for rank-r matrices · theoretical analysis (rank-r Theta*, n > O(r(d+p-r))) | error bound order on Frobenius error | No clear effect |
| Restrict the error cone with a subspace spectral OWL seminorm built from a subgradient of the symmetric gauge at sigma*, which contains the true error cone | Restricted compatibility constant bound for unitarily invariant norms · theoretical analysis | upper bound on restricted compatibility constant Psi_R | Improved |
Closest papers by meaning
- Probabilistic Low-Rank Matrix Completion from Quantized Measurements (JMLR 2016 · similarity 0.88)
- Generalization Bounds for Inductive Matrix Completion in Low-Noise Settings (AAAI 2023 · similarity 0.87)
- Fast exact recovery of noisy matrix from few entries: the infinity norm approach (NeurIPS 2025 · similarity 0.86)
- Matrix Norm Estimation from a Few Entries (NeurIPS 2017 · similarity 0.86)
- Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery (ICML 2025 · similarity 0.86)
- RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees (NeurIPS 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
