AI & ML
Regularisation and Parameter Choice Rules for Composite Linear Inverse Problems
arXiv cs.NA0 views
arXiv:2610.13483v1 Announce Type: new Abstract: In this paper we propose a novel regularisation strategy for structured linear inverse problems of the form $Ax=F \circ G x = z$. Instead of using the operator $A$ or a complex scheme involving both $F$ and $G$ simultaneously, combining already existing and simpler regularisations for $F$ and $G$ allows the use of established and optimised programs for high-speed computations. As classical parameter choice rules fail in the scenario when no source conditions are known because intermediate error bounds may be unavailable, we provide both a-priori and a-posteriori rules with a convergence speed analysis given source conditions. We test the proposed method on the pre-clinical medical imaging technique of magnetic particle imaging with different choices of regularisation and on a convolution problem for an analysis of the convergence speed.
Source:https://arxiv.org/abs/2610.13483PreviousGlobal Optimization of Beam Profiles for Suppressing the Bump-On-Tail InstabilityNextOn a maximum principle in discretization with spherical harmonics
Related posts

What Arconatese 3-4 Pontedera tells us about Serie D - Girone D
0dev.to Watercooler
Your AI agent got an HTTP error. Should it retry?
0dev.to Discuss
Is AI dangerous, or just misunderstood?
0dev.to Discuss
Why we price a developer tool per fix instead of per seat
0dev.to Productivity
My LLM-Powered Sidekick for Painless PR Descriptions
0dev.to Productivity
Reward-Adaptive Backtracking GFlowNet: A Technique Worth Understanding
0dev.to Productivity