@article {siahkoohi2022ravi,
	title = {Reliable amortized variational inference with physics-based latent distribution correction},
	journal = {Geophysics},
	volume = {88},
	number = {3},
	year = {2023},
	note = {(Geophysics)},
	month = {05},
	abstract = {Bayesian inference for high-dimensional inverse problems is challenged by the computational costs of the forward operator and the selection of an appropriate prior distribution. Amortized variational inference addresses these challenges where a neural network is trained to approximate the posterior distribution over existing pairs of model and data. When fed previously unseen data and normally distributed latent samples as input, the pretrained deep neural network{\textendash}-in our case a conditional normalizing flow{\textendash}-provides posterior samples with virtually no cost. However, the accuracy of this approach relies on the availability of high-fidelity training data, which seldom exists in geophysical inverse problems because of the highly heterogeneous structure of the Earth. In addition, accurate amortized variational inference requires the observed data to be drawn from the training data distribution. As such, we offer a solution that increases the resilience of amortized variational inference when faced with data distribution shifts, e.g., changes in the forward model or prior distribution. Our method involves a physics-based correction to the conditional normalizing flow latent distribution to provide a more accurate approximation to the posterior distribution for the observed data at hand. To accomplish this, instead of a standard Gaussian latent distribution, we parameterize the latent distribution by a Gaussian distribution with an unknown mean and diagonal covariance. These unknown quantities are then estimated by minimizing the Kullback-Leibler divergence between the corrected and true posterior distributions. While generic and applicable to other inverse problems, by means of a seismic imaging example, we show that our correction step improves the robustness of amortized variational inference with respect to changes in number of source experiments, noise variance, and shifts in the prior distribution. This approach provides a seismic image with limited artifacts and an assessment of its uncertainty with approximately the same cost as five reverse-time migrations.},
	keywords = {Inverse problems, Normalizing flows, seismic imaging, Uncertainty quantification, Variational Inference},
	doi = {10.1190/geo2022-0472.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2023/siahkoohi2022ravi/paper.html},
	software = {https://github.com/slimgroup/ReliableAVI.jl},
	author = {Ali Siahkoohi and Gabrio Rizzuti and Rafael Orozco and Felix J. Herrmann}
}
@article {lin2013GEOPrepsi,
	title = {Robust estimation of primaries by sparse inversion via one-norm minimization},
	journal = {Geophysics},
	volume = {78},
	number = {3},
	year = {2013},
	month = {05},
	pages = {R133-R150},
	abstract = {A recently proposed method called estimation of primaries by sparse inversion (EPSI) avoids the need for adaptive subtraction of approximate multiple predictions by directly inverting for the multiple-free subsurface impulse response as a collection of band-limited spikes. Although it can be shown that the correct primary impulse response is obtained through the sparsest possible solution, the original EPSI algorithm was not designed to take advantage of this result, and instead it relies on a multitude of inversion parameters, such as the level of sparsity per gradient update. We proposed and tested a new algorithm, named robust EPSI, in which we make obtaining the sparsest solution an explicit goal. Our approach remains a gradient-based approach like the original algorithm, but it is derived from a new biconvex optimization framework based on an extended basis-pursuit denoising formulation. Furthermore, because it is based on a general framework, robust EPSI can recover the impulse response in transform domains, such as sparsifying curvelet-based representations, without changing the underlying algorithm. We discovered that the sparsity-minimizing objective of our formulation enabled it to operate successfully on a variety of synthetic and field marine data sets without excessive tweaking of inversion parameters. We also found that recovering the solution in alternate sparsity domains can significantly improve the quality of the directly estimated primaries, especially for weaker late-arrival events. In addition, we found that robust EPSI produces a more artifact-free impulse response compared to the original algorithm.},
	keywords = {algorithm, biconvex, EPSI, multiples, Optimization, Pareto, sparsity, waveform inversion},
	doi = {10.1190/geo2012-0097.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2013/lin2013GEOPrepsi/lin2013GEOPrepsi.pdf},
	author = {Tim T.Y. Lin and Felix J. Herrmann}
}
@article {Mansour11TRssma,
	title = {Randomized marine acquisition with compressive sampling matrices},
	journal = {Geophysical Prospecting},
	volume = {60},
	number = {4},
	year = {2012},
	month = {07},
	pages = {648-662},
	abstract = {Seismic data acquisition in marine environments is a costly process that calls for the adoption of simultaneous-source or randomized acquisition - an emerging technology that is stimulating both geophysical research and commercial efforts. Simultaneous marine acquisition calls for the development of a new set of design principles and post-processing tools. In this paper, we discuss the properties of a specific class of randomized simultaneous acquisition matrices and demonstrate that sparsity-promoting recovery improves the quality of reconstructed seismic data volumes. We propose a practical randomized marine acquisition scheme where the sequential sources fire airguns at only randomly time-dithered instances. We demonstrate that the recovery using sparse approximation from random time-dithering with a single source approaches the recovery from simultaneous-source acquisition with multiple sources. Established findings from the field of compressive sensing indicate that the choice of the sparsifying transform that is incoherent with the compressive sampling matrix can significantly impact the reconstruction quality. Leveraging these findings, we then demonstrate that the compressive sampling matrix resulting from our proposed sampling scheme is incoherent with the curvelet transform. The combined measurement matrix exhibits better isometry properties than other transform bases such as a non-localized multidimensional Fourier transform. We illustrate our results with simulations of "ideal" simultaneous-source marine acquisition, which dithers both in time and space, compared with periodic and randomized time-dithering.},
	keywords = {curvelet transform, Fourier, Marine acquisition},
	doi = {10.1111/j.1365-2478.2012.01075.x},
	url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1365-2478.2012.01075.x/abstract},
	url2 = {https://slim.gatech.edu/Publications/Public/Journals/GeophysicalProspecting/2012/Mansour11TRssma/Mansour11TRssma.pdf},
	author = {Hassan Mansour and Haneet Wason and Tim T.Y. Lin and Felix J. Herrmann}
}
@article {mansour2012IEEETITrcs,
	title = {Recovering compressively sampled signals using partial support information},
	journal = {IEEE Transactions on Information Theory},
	volume = {58},
	number = {2},
	year = {2012},
	month = {02},
	pages = {1122-1134},
	publisher = {Department of Computer Science},
	address = {University of British Columbia, Vancouver},
	abstract = {We study recovery conditions of weighted $\ell_1$ minimization for signal reconstruction from compressed sensing measurements when partial support information is available. We show that if at least 50\% of the (partial) support information is accurate, then weighted $\ell_1$ minimization is stable and robust under weaker sufficient conditions than the analogous conditions for standard $\ell_1$ minimization. Moreover, weighted $\ell_1$ minimization provides better upper bounds on the reconstruction error in terms of the measurement noise and the compressibility of the signal to be recovered. We illustrate our results with extensive numerical experiments on synthetic data and real audio and video signals.},
	keywords = {Compressive Sensing},
	doi = {10.1109/TIT.2011.2167214},
	url = {https://slim.gatech.edu/Publications/Public/Journals/IEEETransInformationTheory/2012/mansour2012IEEETITrcs/mansour2012IEEETITrcs.pdf},
	author = {Michael P. Friedlander and Hassan Mansour and Rayan Saab and Ozgur Yilmaz}
}
@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}
}
@article {herrmann2010GEOPrsg,
	title = {Randomized sampling and sparsity: getting more information from fewer samples},
	journal = {Geophysics},
	volume = {75},
	number = {6},
	year = {2010},
	month = {12},
	pages = {WB173-WB187},
	publisher = {SEG},
	abstract = {Many seismic exploration techniques rely on the collection of massive data volumes that are subsequently mined for information during processing. Although this approach has been extremely successful in the past, current efforts toward higher-resolution images in increasingly complicated regions of the earth continue to reveal fundamental shortcomings in our workflows. Chiefly among these is the so-called {\textquotedblleft}curse of dimensionality{\textquotedblright} exemplified by Nyquist{\textquoteright}s sampling criterion, which disproportionately strains current acquisition and processing systems as the size and desired resolution of our survey areas continue to increase. We offer an alternative sampling method leveraging recent insights from compressive sensing toward seismic acquisition and processing for data that are traditionally considered to be undersampled. The main outcome of this approach is a new technology where acquisition and processing related costs are no longer determined by overly stringent sampling criteria, such as Nyquist. At the heart of our approach lies randomized incoherent sampling that breaks subsampling related interferences by turning them into harmless noise, which we subsequently remove by promoting transform-domain sparsity. Now, costs no longer grow significantly with resolution and dimensionality of the survey area, but instead depend only on transform-domain sparsity. Our contribution is twofold. First, we demonstrate by means of carefully designed numerical experiments that compressive sensing can successfully be adapted to seismic exploration. Second, we show that accurate recovery can be accomplished for compressively sampled data volumes sizes that exceed the size of conventional transform-domain data volumes by only a small factor. Because compressive sensing combines transformation and encoding by a single linear encoding step, this technology is directly applicable to acquisition and to dimensionality reduction during processing. In either case, sampling, storage, and processing costs scale with transform-domain sparsity. We illustrate this principle by means of number of case studies.},
	keywords = {Acquisition, Compressive Sensing, data acquisition, geophysical techniques, Nyquist criterion, Optimization, sampling methods, seismology, SLIM},
	doi = {10.1190/1.3506147},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2010/herrmann2010GEOPrsg/herrmann2010GEOPrsg.pdf},
	author = {Felix J. Herrmann}
}
