Research map / Learning theory and algorithms / Matrix and tensor methods
Sparse and Smooth Signal Estimation: Convexification of L0-Formulations
Alper Atamturk, Andres Gomez, Shaoning Han
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 strong Decomp convexification instead of plain L1 relaxation | L0 signal estimation relaxation · Accelerometer data | optimality gap (%): 66.7 -> 0.4 | Improved |
| use Decomp instead of L1 relaxation (cost in time) | convex relaxation · Accelerometer data | solve time (s): 1 -> 54 | Hurt |
| use Decomp instead of Gurobi branch-and-bound | L0 estimation · k=2000, lambda=0.1 | optimality gap (%): 2.7 -> 0.3 | Improved |
| use Decomp instead of Gurobi branch-and-bound | L0 estimation · k=2000, lambda=0.2 | optimality gap (%): 7.4 -> 0.6 | Improved |
| use Decomp instead of Gurobi branch-and-bound | L0 estimation · k=4000, lambda=0.1 | optimality gap (%): 3.4 -> 0.0 | Improved |
| use Decomp instead of Gurobi branch-and-bound | L0 estimation · k=4000, lambda=0.2 | optimality gap (%): 2.8 -> 0.1 | Improved |
| use Decomp instead of L1 relaxation | L1 relaxation · k=2000, lambda=0.1 | optimality gap (%): 91.2 -> 0.3 | Improved |
Closest papers by meaning
- Estimating Sparse Signals With Smooth Support via Convex Programming and Block Sparsity (CVPR 2016 · similarity 0.87)
- Rank-one Convexification for Sparse Regression (JMLR 2025 · similarity 0.87)
- Structured Sparsity Optimization with Non-Convex Surrogates of $\ell _{2,0}$-Norm: A Unified Algorithmic Framework (TPAMI 2022 · similarity 0.87)
- The Price of Sparsity: Sufficient Conditions for Sparse Recovery using Sparse and Sparsified Measurements (NeurIPS 2025 · similarity 0.86)
- Sketching for Convex and Nonconvex Regularized Least Squares with Sharp Guarantees (ICLR 2025 · similarity 0.86)
- Methods for Convex $(L_0,L_1)$-Smooth Optimization: Clipping, Acceleration, and Adaptivity (ICLR 2025 · similarity 0.84)
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.
