paper-with-me

Papers

DIPA: Distilled Preconditioned Algorithms for Solving Imaging Inverse Problems

2026-05-14 · Romario Gualdrón-Hurtado, Roman Jacome, Leon Suarez, Henry Arguello arxiv

Solving imaging inverse problems has usually been addressed by designing proper prior models of the underlying signal. However, minimizing the data fidelity term poses significant challenges due to the ill-conditioned sensing matrix caused by physical constraints in the acquisition system. Thus, preconditioning techniques have been adopted in classical optimization theory to address ill-conditioned data-fidelity minimization by transforming the algorithm gradient step to achieve faster convergence and better numerical stability. We extend the preconditioning concept beyond convergence acceleration and use it to improve reconstruction quality. We introduce DIPA: Distilled Preconditioned Algorithms, where a preconditioning operator (PO) is optimized using teacher-guided distillation criteria. Unlike standard model-compression KD, the teacher and student differ by the sensing operators available during reconstruction: the teacher uses a simulated, better-conditioned, and more informative sensing matrix, whereas the student uses the physically feasible sensing matrix. We design different distillation loss functions to transfer different properties of the teacher algorithm to the preconditioned student. The PO can be linear (L-DIPA), allowing interpretability, or non-linear (N-DIPA), parametrized by a neural network, offering better scalability. We validate the proposed PO design across several imaging modalities, including magnetic resonance imaging, compressed sensing, and super-resolution imaging.

📄 PDF Abstract BibTeX arXiv:2605.15456

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Preconditioned inexact fixed point iteration method for solving tensor absolute value equation

2024-11-08 · 2024/8/17 2024 11 · Xin-Mei Lv , Shu-Xin Miao

Preconditioning techniques are the most used methods to accelerate the tensor splitting iteration method for solving multi-linear systems. In this paper, we consider the numerical method for solving tensor absolute val…

A Neural-Operator Preconditioned Newton Method for Accelerated Nonlinear Solvers

2025-11-11 · Youngkyu Lee, Shanqing Liu, Jerome Darbon, George Em Karniadakis arxiv

We propose a novel neural preconditioned Newton (NP-Newton) method for solving parametric nonlinear systems of equations. To overcome the stagnation or instability of Newton iterations caused by unbalanced nonlinearities…

Computational Efficiency

A General Regret Bound of Preconditioned Gradient Method for DNN Training

2023-01-01 · CVPR 2023 1 · Hongwei Yong, Ying Sun, Lei Zhang

While adaptive learning rate methods, such as Adam, have achieved remarkable improvement in optimizing Deep Neural Networks (DNNs), they consider only the diagonal elements of the full preconditioned matrix. Though t…

image-classificationImage Classificationobject-detectionObject Detection

A Comparative Framework for Preconditioned Lasso Algorithms

2013-12-01 · NeurIPS 2013 12 · Fabian L. Wauthier, Nebojsa Jojic, Michael. I. Jordan

The Lasso is a cornerstone of modern multivariate data analysis, yet its performance suffers in the common situation in which covariates are correlated. This limitation has led to a growing number of \emph{Preconditioned…

DiPaCo: Distributed Path Composition

2024-03-15 · Arthur Douillard, Qixuan Feng, Andrei A. Rusu, Adhiguna Kuncoro 외

Progress in machine learning (ML) has been fueled by scaling neural network models. This scaling has been enabled by ever more heroic feats of engineering, necessary for accommodating ML approaches that require high band…

Language ModellingModel Compression