Why do we regularise in every iteration for imaging inverse problems?
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912100383719424 |
|---|---|
| author | Papoutsellis, Evangelos Kereta, Zeljko Papafitsoros, Kostas |
| author_facet | Papoutsellis, Evangelos Kereta, Zeljko Papafitsoros, Kostas |
| contents | Regularisation is commonly used in iterative methods for solving imaging inverse problems. Many algorithms involve the evaluation of the proximal operator of the regularisation term in every iteration, leading to a significant computational overhead since such evaluation can be costly. In this context, the ProxSkip algorithm, recently proposed for federated learning purposes, emerges as an solution. It randomly skips regularisation steps, reducing the computational time of an iterative algorithm without affecting its convergence. Here we explore for the first time the efficacy of ProxSkip to a variety of imaging inverse problems and we also propose a novel PDHGSkip version. Extensive numerical results highlight the potential of these methods to accelerate computations while maintaining high-quality reconstructions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_00688 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Why do we regularise in every iteration for imaging inverse problems? Papoutsellis, Evangelos Kereta, Zeljko Papafitsoros, Kostas Numerical Analysis Computer Vision and Pattern Recognition Optimization and Control Regularisation is commonly used in iterative methods for solving imaging inverse problems. Many algorithms involve the evaluation of the proximal operator of the regularisation term in every iteration, leading to a significant computational overhead since such evaluation can be costly. In this context, the ProxSkip algorithm, recently proposed for federated learning purposes, emerges as an solution. It randomly skips regularisation steps, reducing the computational time of an iterative algorithm without affecting its convergence. Here we explore for the first time the efficacy of ProxSkip to a variety of imaging inverse problems and we also propose a novel PDHGSkip version. Extensive numerical results highlight the potential of these methods to accelerate computations while maintaining high-quality reconstructions. |
| title | Why do we regularise in every iteration for imaging inverse problems? |
| topic | Numerical Analysis Computer Vision and Pattern Recognition Optimization and Control |
| url | https://arxiv.org/abs/2411.00688 |