Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2602.11482 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912899266510848 |
|---|---|
| author | Haishima, Kazuki Suzuki, Kyohei Slavakis, Konstantinos |
| author_facet | Haishima, Kazuki Suzuki, Kyohei Slavakis, Konstantinos |
| contents | This paper presents a novel method for recovering sparse vectors from linear models corrupted by Poisson noise. The contribution is twofold. First, an operator defined via the external division of two Bregman proximity operators is introduced to promote sparse solutions while mitigating the estimation bias induced by classical $\ell_1$-norm regularization. This operator is then embedded into the already established NoLips algorithm, replacing the standard Bregman proximity operator in a plug-and-play manner. Second, the geometric structure of the proposed external-division operator is elucidated through two complementary reformulations, which provide clear interpretations in terms of the primal and dual spaces of the Poisson inverse problem. Numerical tests show that the proposed method exhibits more stable convergence behavior than conventional Kullback-Leibler (KL)-based approaches and achieves significantly superior performance on synthetic data and an image restoration problem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_11482 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | External Division of Two Bregman Proximity Operators for Poisson Inverse Problems Haishima, Kazuki Suzuki, Kyohei Slavakis, Konstantinos Machine Learning This paper presents a novel method for recovering sparse vectors from linear models corrupted by Poisson noise. The contribution is twofold. First, an operator defined via the external division of two Bregman proximity operators is introduced to promote sparse solutions while mitigating the estimation bias induced by classical $\ell_1$-norm regularization. This operator is then embedded into the already established NoLips algorithm, replacing the standard Bregman proximity operator in a plug-and-play manner. Second, the geometric structure of the proposed external-division operator is elucidated through two complementary reformulations, which provide clear interpretations in terms of the primal and dual spaces of the Poisson inverse problem. Numerical tests show that the proposed method exhibits more stable convergence behavior than conventional Kullback-Leibler (KL)-based approaches and achieves significantly superior performance on synthetic data and an image restoration problem. |
| title | External Division of Two Bregman Proximity Operators for Poisson Inverse Problems |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2602.11482 |