arXiv (All)
open access
Sparse Signal Recovery Using Log-Sum Regularization and Adaptive Smoothing
We study sparse signal recovery from noisy linear observations using nonconvex log-sum regularization. The log-sum penalty reduces the shrinkage bias of $\ell_1$ regularization and more closely approximates the $\ell_0$ regularization, but its nonconvexity can make reconstruction algorithms unstable
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Instance Optimal Sparse Recovery from Nonlinear Observations: A Unified Framework#822520
- Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time#677445
- Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time#674248
- Robust filtering and smoothing via perturbation methods#1037635
- Randomized subspace correction methods for convex optimization#173322
Record · ID 926033
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive