Cramér-Rao bound-informed training of neural networks for quantitative MRI

• Published in: arXiv.org 2021-10
• Main Authors: Zhang, Xiaoxia, Duchemin, Quentin, Liu, Kangning, Flassbeck, Sebastian, Gultekin, Cem, Fernandez-Granda, Carlos, Assländer, Jakob
• Format: Article
• Language: English
• Subjects: Convexity; Fingerprinting; Lower bounds; Magnetic resonance imaging; Neural networks; Parameter estimation; Training
• ISSN: 2331-8422
• DOI: 10.48550/arxiv.2109.10535

Neural networks are increasingly used to estimate parameters in quantitative MRI, in particular in magnetic resonance fingerprinting. Their advantages over the gold standard non-linear least square fitting are their superior speed and their immunity to the non-convexity of many fitting problems. We find, however, that in heterogeneous parameter spaces, i.e. in spaces in which the variance of the estimated parameters varies considerably, good performance is hard to achieve and requires arduous tweaking of the loss function, hyper parameters, and the distribution of the training data in parameter space. Here, we address these issues with a theoretically well-founded loss function: the Cramér-Rao bound (CRB) provides a theoretical lower bound for the variance of an unbiased estimator and we propose to normalize the squared error with respective CRB. With this normalization, we balance the contributions of hard-to-estimate and not-so-hard-to-estimate parameters and areas in parameter space, and avoid a dominance of the former in the overall training loss. Further, the CRB-based loss function equals one for a maximally-efficient unbiased estimator, which we consider the ideal estimator. Hence, the proposed CRB-based loss function provides an absolute evaluation metric. We compare a network trained with the CRB-based loss with a network trained with the commonly used means squared error loss and demonstrate the advantages of the former in numerical, phantom, and in vivo experiments.