@conference {orozco2022SPIEadjoint,
	title = {Adjoint operators enable fast and amortized machine learning based Bayesian uncertainty quantification},
	booktitle = {SPIE Medical Imaging Conference},
	year = {2023},
	note = {(SPIE, San Diego)},
	month = {02},
	abstract = {Machine learning algorithms such as Normalizing Flows, VAEs, and GANs are powerful tools in Bayesian uncertainty quantification (UQ) of inverse problems. Unfortunately, when using these algorithms medical imaging practitioners are faced with the challenging task of manually defining neural networks that can handle complicated inputs such as acoustic data. This task needs to be replicated for different receiver types or configurations since these change the dimensionality of the input. We propose to first transform the data using the adjoint operator {\textemdash}ex: time reversal in photoacoustic imaging (PAI) or back-projection in computer tomography (CT) imaging {\textemdash} then continue posterior inference using the adjoint data as an input now that it has been standardized to the size of the unknown model. This adjoint preprocessing technique has been used in previous works but with minimal discussion on if it is biased. In this work, we prove that conditioning on adjoint data is unbiased for a certain class of inverse problems. We then demonstrate with two medical imaging examples (PAI and CT) that adjoints enable two things: Firstly, adjoints partially undo the physics of the forward operator resulting in faster convergence of an ML based Bayesian UQ technique. Secondly, the algorithm is now robust to changes in the observed data caused by differing transducer subsampling in PAI and number of angles in CT. Our adjoint-based Bayesian inference method results in point estimates that are faster to compute than traditional baselines and show higher SSIM metrics, while also providing validated UQ.},
	keywords = {Amortized Inference, Bayesian inference, deep learning, Inverse problems, machine learning, medical imaging, Normalizing flows, SPIE, Uncertainty quantification},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SPIE/2023/orozco2022SPIEadjoint/SPIE_2022_adjoint.html},
	author = {Rafael Orozco and Ali Siahkoohi and Gabrio Rizzuti and Tristan van Leeuwen and Felix J. Herrmann}
}
@article {vanleeuwen2015IPpmp,
	title = {A penalty method for PDE-constrained optimization in inverse problems},
	journal = {Inverse Problems},
	volume = {32},
	number = {1},
	year = {2015},
	note = {(Inverse Problems)},
	month = {12},
	pages = {015007},
	abstract = {Many inverse and parameter estimation problems can be written as PDE-constrained optimization problems. The goal is to infer the parameters, typically coefficients of the PDE, from partial measurements of the solutions of the PDE for several right-hand sides. Such PDE-constrained problems can be solved by finding a stationary point of the Lagrangian, which entails simultaneously updating the parameters and the (adjoint) state variables. For large-scale problems, such an all-at-once approach is not feasible as it requires storing all the state variables. In this case one usually resorts to a reduced approach where the constraints are explicitly eliminated (at each iteration) by solving the PDEs. These two approaches, and variations thereof, are the main workhorses for solving PDE-constrained optimization problems arising from inverse problems. In this paper, we present an alternative method that aims to combine the advantages of both approaches. Our method is based on a quadratic penalty formulation of the constrained optimization problem. By eliminating the state variable, we develop an efficient algorithm that has roughly the same computational complexity as the conventional reduced approach while exploiting a larger search space. Numerical results show that this method indeed reduces some of the nonlinearity of the problem and is less sensitive to the initial iterate.},
	keywords = {Inverse problems, Optimization, PDE, penalty method},
	url = {https://slim.gatech.edu/Publications/Public/Journals/InverseProblems/2015/vanleeuwen2015IPpmp/vanleeuwen2015IPpmp.pdf},
	url2 = {http://stacks.iop.org/0266-5611/32/i=1/a=015007},
	author = {Tristan van Leeuwen and Felix J. Herrmann}
}
@article {Aravkin11TRridr,
	title = {Robust inversion, dimensionality reduction, and randomized sampling},
	journal = {Mathematical Programming},
	volume = {134},
	number = {1},
	year = {2012},
	month = {08},
	pages = {101-125},
	abstract = {We consider a class of inverse problems in which the forward model is the solution operator to linear ODEs or PDEs. This class admits several dimensionality-reduction techniques based on data averaging or sampling, which are especially useful for large-scale problems. We survey these approaches and their connection to stochastic optimization. The data-averaging approach is only viable, however, for a least-squares misfit, which is sensitive to outliers in the data and artifacts unexplained by the forward model. This motivates us to propose a robust formulation based on the Student{\textquoteright}s t-distribution of the error. We demonstrate how the corresponding penalty function, together with the sampling approach, can obtain good results for a large-scale seismic inverse problem with 50 \% corrupted data.},
	keywords = {FWI, Inverse problems, Optimization, Robust estimation, Seismic inversion, Stochastic optimization},
	doi = {10.1007/s10107-012-0571-6},
	url = {http://www.springerlink.com/content/35rwr101h5736340/},
	url2 = {https://slim.gatech.edu/Publications/Public/Journals/MathematicalProgramming/aravkin2012MPrid/aravkin2012MPrid.pdf},
	author = {Aleksandr Y. Aravkin and Michael P. Friedlander and Felix J. Herrmann and Tristan van Leeuwen}
}
