Skip to content
DraconiticResearch
Search Sources API
190,869 studies31 sourcesUpdated just now
PreprintCC BY-NC-ND 4.0arXiv

Learned Adaptive Multiresolution Diffusion Imaging

Abstract

Adaptive multiresolution methods reduce representation cost by concentrating fine-scale degrees of freedom where needed, but their tree updates are usually governed by fixed local criteria. We introduce Learned Adaptive Multiresolution Diffusion Imaging (Learned AMDI), which preserves the AMDI fixed-tree propagator and hierarchy constraints while replacing the post-propagation selector with a shared local policy trained by proximal policy optimization. Regression tests reproduce deterministic AMDI trajectories to machine precision when identical trees are used. In the Haar implementation studied here, the deterministic one-step selector accepts no refinements in 54 decisions. Across nine held-out cases, Learned AMDI executes 393 refinements and reduces the mean terminal reference discrepancy from $0.17496$ to $0.13657$, while occupancy rises from $0.13737$ to $0.26660$. Step-resolved diagnostics reveal occasional small adaptation-energy increases; fixed-tree energy stability therefore does not guarantee monotonicity of the learned outer iteration. At comparable occupancy, a validation-tuned observed-detail threshold reaches a discrepancy of $0.13792$ with slightly better RMSE and SSIM, placing both methods on essentially the same accuracy--occupancy tradeoff. A decision-1-only control reaches $0.13742$, indicating that most of the improvement on this static benchmark arises from the initial allocation. The shared actor transfers without retraining to 64×64 and 128×128 images, improving reference discrepancy, RMSE, and SSIM relative to deterministic AMDI, while the frozen threshold rule remains competitive. Learned AMDI thus provides a hierarchy-constrained, resolution-transferable mechanism for adaptive allocation and clarifies the contribution of sequential decisions.

Related

  1. ADAPTIVE MULTIRESOLUTION DIFFUSION OPERATORS: A VARIATIONAL THEORY ON EVOLVING MULTIRESOLUTION SPACES
    Christian Tantardini, Stig Rune Jensen, Roberto Di Remigio Eikås +1
    HALPreprintCC BY-NC-ND 4.0Full textNumerical analysis & scientific computingHALarXiv
  2. Multiresolution Sobolev Trained Fourier Neural Operator for Cross-Resolution Surrogate Modelling of Parametric Two-Phase Darcy Flows in Porous Media
    Zhao Zhang, Chengjin Guo, Zhenglong Chen +3
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  3. Convolution Quadrature with Adaptive History Compression for Variable-Order Fractional Reaction--Diffusion Equations
    Pu Yuan, Paul Zegeling
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  4. Frequency Structure of AMM Liquidity Pools: A Multiresolution Analysis of Regime Transitions
    Dennis N. Páez-Chala, Alfred Peris
    arXivPreprintCC BY 4.0Full textDynamical systemsarXiv
  5. Anatomical Connectivity from Tractography-free Diffusion Tensor Imaging and Its Application to EEG Brain Imagin
    Joonas Lahtinen
    arXivPreprintCC BY-SA 4.0Full textDynamical systemsNumerical analysis & scientific computingarXiv
BibTeX
@misc{tantardini2026learned,
  title = {{Learned Adaptive Multiresolution Diffusion Imaging}},
  author = {Christian Tantardini and Stig Rune Jensen and Roberto Di Remigio Eikås and Joakim Henrik Beck},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.07884},
  eprint = {2610.07884},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.07884},
  note = {CC BY-NC-ND 4.0},
}
RIS
TY  - UNPB
TI  - Learned Adaptive Multiresolution Diffusion Imaging
AU  - Christian Tantardini
AU  - Stig Rune Jensen
AU  - Roberto Di Remigio Eikås
AU  - Joakim Henrik Beck
PY  - 2026
DA  - 2026/10/06
PB  - arXiv
DO  - 10.48550/arxiv.2610.07884
UR  - https://arxiv.org/abs/2610.07884
AB  - Adaptive multiresolution methods reduce representation cost by concentrating fine-scale degrees of freedom where needed, but their tree updates are usually governed by fixed local criteria. We introduce Learned Adaptive Multiresolution Diffusion Imaging (Learned AMDI), which preserves the AMDI fixed-tree propagator and hierarchy constraints while replacing the post-propagation selector with a shared local policy trained by proximal policy optimization. Regression tests reproduce deterministic AMDI trajectories to machine precision when identical trees are used. In the Haar implementation studied here, the deterministic one-step selector accepts no refinements in 54 decisions. Across nine held-out cases, Learned AMDI executes 393 refinements and reduces the mean terminal reference discrepancy from $0.17496$ to $0.13657$, while occupancy rises from $0.13737$ to $0.26660$. Step-resolved diagnostics reveal occasional small adaptation-energy increases; fixed-tree energy stability therefore does not guarantee monotonicity of the learned outer iteration. At comparable occupancy, a validation-tuned observed-detail threshold reaches a discrepancy of $0.13792$ with slightly better RMSE and SSIM, placing both methods on essentially the same accuracy--occupancy tradeoff. A decision-1-only control reaches $0.13742$, indicating that most of the improvement on this static benchmark arises from the initial allocation. The shared actor transfers without retraining to 64×64 and 128×128 images, improving reference discrepancy, RMSE, and SSIM relative to deterministic AMDI, while the frozen threshold rule remains competitive. Learned AMDI thus provides a hierarchy-constrained, resolution-transferable mechanism for adaptive allocation and clarifies the contribution of sequential decisions.
ER  -