Drew Mitchell | Searcharxiv

arXiv2022

Mutual-Information Based Optimal Experimental Design for Hyperpolarized $^{13}$C-Pyruvate MRI

A key parameter of interest recovered from hyperpolarized (HP) MRI measurements is the apparent pyruvate-to-lactate exchange rate, $k_{PL}$, for measuring tumor metabolism. This manuscript presents an information-theory-based optimal experimental design (OED) approach that minimizes the uncertainty in the rate parameter, $k_{PL}$, recovered from HP-MRI measurements. Mutual information (MI) is employed to measure the information content of the HP measurements with respect to the first-order exchange kinetics of the pyruvate conversion to lactate. Flip angles of the pulse sequence acquisition are optimized with respect to the mutual information. Further, a spatially varying model (high-fidelity) based on the Block-Torrey equations is proposed and utilized as a control. A time-varying flip angle scheme leads to a higher parameter optimization that can further improve the quantitative value of mutual information over a constant flip angle scheme. However, the constant flip angle scheme leads to the best accuracy and precision when considering inference from noise-corrupted data. For the particular MRI data examined here, pyruvate and lactate flip angles of 35 and 28 degrees, respectively, were the best choice in terms of accuracy and precision of the parameter recovery. Moreover, the recovery of rate parameter $k_{PL}$ from the data generated from the high-fidelity model highlights the influence of diffusion and strength of vascular source on the recovered rate parameter. Since the existing pharmacokinetic models for HP-MRI do not account for spatial variation, the optimized design parameters may not be fully optimal in a more general 3D setting.

cs.IT↗

arXiv2018

Nesterov Acceleration of Alternating Least Squares for Canonical Tensor Decomposition: Momentum Step Size Selection and Restart Mechanisms

We present Nesterov-type acceleration techniques for Alternating Least Squares (ALS) methods applied to canonical tensor decomposition. While Nesterov acceleration turns gradient descent into an optimal first-order method for convex problems by adding a momentum term with a specific weight sequence, a direct application of this method and weight sequence to ALS results in erratic convergence behaviour. This is so because the tensor decomposition problem is non-convex and ALS is accelerated instead of gradient descent. Instead, we consider various restart mechanisms and suitable choices of momentum weights that enable effective acceleration. Our extensive empirical results show that the Nesterov-accelerated ALS methods with restart can be dramatically more efficient than the stand-alone ALS or Nesterov accelerated gradient methods, when problems are ill-conditioned or accurate solutions are desired. The resulting methods perform competitively with or superior to existing acceleration methods for ALS, including ALS acceleration by NCG, NGMRES, or LBFGS, and additionally enjoy the benefit of being much easier to implement. We also compare with Nesterov-type updates where the momentum weight is determined by a line search, which are equivalent or closely related to existing line search methods for ALS. On a large and ill-conditioned 71$\times$1000$\times$900 tensor consisting of readings from chemical sensors to track hazardous gases, the restarted Nesterov-ALS method shows desirable robustness properties and outperforms any of the existing methods by a large factor. There is clear potential for extending our Nesterov-type acceleration approach to accelerating other optimization algorithms than ALS applied to other non-convex problems, such as Tucker tensor decomposition. Our Matlab code is available at https://github.com/hansdesterck/nonlinear-preconditioning-for-optimization.

math.OC↗