@techreport {siahkoohi2020TRfuqf,
	title = {Faster Uncertainty Quantification for Inverse Problems with Conditional Normalizing Flows},
	number = {TR-CSE-2020-2},
	year = {2020},
	month = {07},
	institution = {Georgia Institute of Technology},
	abstract = {In inverse problems, we often have access to data consisting of paired samples $(x,y)\sim p_X,Y(x,y)$ where $y$ are partial observations of a physical system, and $x$ represents the unknowns of the problem. Under these circumstances, we can employ supervised training to learn a solution $x$ and its uncertainty from the observations $y$. We refer to this problem as the "supervised" case. However, the data $y\sim p_Y(y)$ collected at one point could be distributed differently than observations $y{\textquoteright}\sim p_Y{\textquoteright}(y{\textquoteright})$, relevant for a current set of problems. In the context of Bayesian inference, we propose a two-step scheme, which makes use of normalizing flows and joint data to train a conditional generator $q_θ(x|y)$ to approximate the target posterior density $p_X|Y(x|y)$. Additionally, this preliminary phase provides a density function $q_θ(x|y)$, which can be recast as a prior for the "unsupervised" problem, e.g. when only the observations $y{\textquoteright}\sim p_Y{\textquoteright}(y{\textquoteright})$, a likelihood model $y{\textquoteright}|x$, and a prior on $x{\textquoteright}$ are known. We then train another invertible generator with output density $q{\textquoteright}_φ(x|y{\textquoteright})$ specifically for $y{\textquoteright}$, allowing us to sample from the posterior $p_X|Y{\textquoteright}(x|y{\textquoteright})$. We present some synthetic results that demonstrate considerable training speedup when reusing the pretrained network $q_θ(x|y{\textquoteright})$ as a warm start or preconditioning for approximating $p_X|Y{\textquoteright}(x|y{\textquoteright})$, instead of learning from scratch. This training modality can be interpreted as an instance of transfer learning. This result is particularly relevant for large-scale inverse problems that employ expensive numerical simulations.},
	keywords = {deep learning, invertible networks, Uncertainty quantification},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2020/siahkoohi2020TRfuqf/siahkoohi2020TRfuqf.html},
	author = {Ali Siahkoohi and Gabrio Rizzuti and Philipp A. Witte and Felix J. Herrmann}
}
@techreport {louboutin2020SEGtwri,
	title = {Time-domain Wavefield Reconstruction Inversion in a TTI medium},
	number = {TR-CSE-2020-1},
	year = {2020},
	month = {4},
	institution = {Georgia Institute of Technology},
	abstract = {We introduce a generalization of time-domain wavefield reconstruction inversion to anisotropic acoustic modeling. Wavefield reconstruction inversion has been extensively researched in recent years for its ability to mitigate cycle skipping. The original method was formulated in the frequency domain with acoustic isotropic physics. However, frequency-domain modeling requires sophisticated iterative solvers that are difficult to scale to industrial-size problems and more realistic physical assumptions, such as tilted transverse isotropy, object of this study. The work presented here is based on a recently proposed dual formulation of wavefield reconstruction inversion, which allows time-domain propagator that are suitable to both large scales and more accurate physics.},
	keywords = {anisotropy, FWI, TTI, WRI},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2020/louboutin2020SEGtwri/louboutin2020SEGtwri.html},
	url2 = {https://arxiv.org/pdf/2004.07355.pdf},
	author = {Mathias Louboutin and Gabrio Rizzuti and Felix J. Herrmann}
}
@techreport {kumar2013ICMLlr,
	title = {An SVD-free Pareto curve approach to rank minimization},
	number = {TR-EOAS-2013-2},
	year = {2013},
	month = {02},
	institution = {UBC},
	abstract = {Recent SVD-free matrix factorization formulations have enabled rank optimization for extremely large-scale systems (millions of rows and columns). In this paper, we consider rank-regularized formulations that only require a target data-fitting error level, and propose an algorithm for the corresponding problem. We illustrate the advantages of the new approach using the Netflix problem, and use it to obtain high quality results for seismic trace interpolation, a key application in exploration geophysics. We show that factor rank can be easily adjusted as the inversion proceeds, and propose a weighted extension that allows known subspace information to improve the results of matrix completion formulations. Using these methods, we obtain high-quality reconstructions for large scale seismic interpolation problems with real data.},
	keywords = {interpolation, low rank},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2013/kumar2013ICMLlr/kumar2013ICMLlr.pdf},
	author = {Aleksandr Y. Aravkin and Rajiv Kumar and Hassan Mansour and Ben Recht and Felix J. Herrmann}
}
