A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/2001.08496v2.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
SPOQ ℓ_p-Over-ℓ_q Regularization for Sparse Signal Recovery applied to Mass Spectrometry
[article]
<span title="2020-09-22">2020</span>
<i >
arXiv
</i>
<span class="release-stage" >pre-print</span>
Preserved Fulltext
Other Versions
<span title="2020-01-23">2020</span>
<span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2001.08496v1">arXiv:2001.08496v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dd3wfhsrojb7xovwqko3nnyfsq">fatcat:dd3wfhsrojb7xovwqko3nnyfsq</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2001.08496v1">arXiv:2001.08496v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dd3wfhsrojb7xovwqko3nnyfsq">fatcat:dd3wfhsrojb7xovwqko3nnyfsq</a> </span>
Underdetermined or ill-posed inverse problems require additional information for d sound solutions with tractable optimization algorithms. Sparsity yields consequent heuristics to that matter, with numerous applications in signal restoration, image recovery, or machine learning. Since the ℓ_0 count measure is barely tractable, many statistical or learning approaches have invested in computable proxies, such as the ℓ_1 norm. However, the latter does not exhibit the desirable property of scale
<span class="external-identifiers">
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2001.08496v2">arXiv:2001.08496v2</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tqkyhud34rgpvhvcixschcw6au">fatcat:tqkyhud34rgpvhvcixschcw6au</a>
</span>
more »
... ariance for sparse data. Extending the SOOT Euclidean/Taxicab ℓ_1-over-ℓ_2 norm-ratio initially introduced for blind deconvolution, we propose SPOQ, a family of smoothed (approximately) scale-invariant penalty functions. It consists of a Lipschitz-differentiable surrogate for ℓ_p-over-ℓ_q quasi-norm/norm ratios with p∈ ]0,2[ and q≥ 2. This surrogate is embedded into a novel majorize-minimize trust-region approach, generalizing the variable metric forward-backward algorithm. For naturally sparse mass-spectrometry signals, we show that SPOQ significantly outperforms ℓ_0, ℓ_1, Cauchy, Welsch, SCAD and Celo penalties on several performance measures. Guidelines on SPOQ hyperparameters tuning are also provided, suggesting simple data-driven choices.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200926182644/https://arxiv.org/pdf/2001.08496v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
</button>
</a>
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2001.08496v2" title="arxiv.org access">
<button class="ui compact blue labeled icon button serp-button">
<i class="file alternate outline icon"></i>
arxiv.org
</button>
</a>