@techreport {louboutin2021NIPSmcte,
	title = {Low-memory stochastic backpropagation with multi-channel randomized trace estimation},
	number = {TR-CSE-2021-1},
	year = {2021},
	month = {06},
	abstract = {Thanks to the combination of state-of-the-art accelerators and highly optimized open software frameworks, there has been tremendous progress in the performance of deep neural networks. While these developments have been responsible for many breakthroughs, progress towards solving large-scale problems, such as video encoding and semantic segmentation in 3D, is hampered because access to on-premise memory is often limited. Instead of relying on (optimal) checkpointing or invertibility of the network layers{\textendash}-to recover the activations during backpropagation{\textendash}-we propose to approximate the gradient of convolutional layers in neural networks with a multi-channel randomized trace estimation technique. Compared to other methods, this approach is simple, amenable to analyses, and leads to a greatly reduced memory footprint. Even though the randomized trace estimation introduces stochasticity during training, we argue that this is of little consequence as long as the induced errors are of the same order as errors in the gradient due to the use of stochastic gradient descent. We discuss the performance of networks trained with stochastic backpropagation and how the error can be controlled while maximizing memory usage and minimizing computational overhead.},
	keywords = {Convolutions, HPC, Low Memory, machine learning, randomized linear algebra},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2021/louboutin2021NIPSmcte/louboutin2021NIPSmcte.pdf},
	software = {https://github.com/slimgroup/XConv},
	author = {Mathias Louboutin and Ali Siahkoohi and Rongrong Wang and Felix J. Herrmann}
}
@conference {chai2016SEGlbm,
	title = {A linearized Bregman method for compressive waveform inversion},
	booktitle = {SEG Technical Program Expanded Abstracts},
	year = {2016},
	note = {(SEG, Dallas)},
	month = {10},
	pages = {1449-1454},
	abstract = {We present an implementation of a recently developed and relatively simple linearized Bregman method to solve the large-scale $\ell_1$-norm sparsity-promoting Gauss-Newton (GN) full-waveform inversion (FWI) problem. Numerical experiments demonstrate that: the much simpler linearized Bregman method does a comparable and even superior job compared to a state-of-the-art $\ell_1$-norm solver SPGL1, which is previously used in the modified Gauss-Newton FWI; the linearized Bregman method is also more efficient (faster) than SPGL1; the FWI result with the linearized Bregman method solving $\ell_1$-norm sparsity-promoting problems to get the model updates is better than that obtained by solving $\ell_2$-norm least-squares problems to get the model updates.},
	keywords = {Bregman method, SEG, waveform inversion},
	doi = {10.1190/segam2016-13848105.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2016/chai2016SEGlbm/chai2016SEGlbm.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2016/chai2016SEGlbm/chai2016SEGlbm_pres.pdf},
	author = {Xintao Chai and Mengmeng Yang and Philipp A. Witte and Rongrong Wang and Zhilong Fang and Felix J. Herrmann}
}
@conference {esser2015EAGElcs,
	title = {A lifted $\ell_1/\ell_2$ constraint for sparse blind deconvolution},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2015},
	note = {(EAGE, Madrid)},
	month = {06},
	abstract = {We propose a modification to a sparsity constraint based on the ratio of $\ell_1$ and $\ell_2$ norms for solving blind seismic deconvolution problems in which the data consist of linear convolutions of different sparse reflectivities with the same source wavelet. We also extend the approach to the Estimation of Primaries by Sparse Inversion (EPSI) model, which includes surface related multiples. Minimizing the ratio of $\ell_1$ and $\ell_2$ norms has been previously shown to promote sparsity in a variety of applications including blind deconvolution. Most existing implementations are heuristic or require smoothing the $\ell_1/\ell_2$ penalty. Lifted versions of $\ell_1/\ell_2$ constraints have also been proposed but are challenging to implement. Inspired by the lifting approach, we propose to split the sparse signals into positive and negative components and apply an $\ell_1/\ell_2$ constraint to the difference, thereby obtaining a constraint that is easy to implement without smoothing the $\ell_1$ or $\ell_2$ norms. We show that a method of multipliers implementation of the resulting model can recover source wavelets that are not necessarily minimum phase and approximately reconstruct the sparse reflectivities. Numerical experiments demonstrate robustness to the initialization as well as to noise in the data.},
	keywords = {blind deconvolution, EAGE, EPSI},
	doi = {10.3997/2214-4609.201413420},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2015/esser2015EAGElcs/esser2015EAGElcs.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2015/esser2015EAGElcs/esser2015EAGElcs_poster.pdf},
	author = {Ernie Esser and Tim T.Y. Lin and Rongrong Wang and Felix J. Herrmann}
}
@presentation {esser2014SINBADlcs,
	title = {A lifted $\ell_1$/$\ell_2$ constraint for sparse blind deconvolution},
	year = {2014},
	publisher = {SINBAD},
	abstract = {We propose a modification to a sparsity constraint based on the ratio of l1 and l2 norms for solving blind seismic deconvolution problems in which the data consist of linear convolutions of different sparse reflectivities with the same source wavelet. No assumptions are made about the location of the support of either the wavelet or the sparse signals. Minimizing the ratio of l1 and l2 norms has been previously shown to promote sparsity in a variety of applications including blind deconvolution. Most existing implementations are heuristic or require smoothing the l1/l2 penalty. Lifted versions of l1/l2 constraints have also been proposed but are still challenging to implement. Inspired by the lifting approach, we propose to split the sparse signals into positive and negative components and apply an l1/l2 constraint to the difference, thereby obtaining a constraint that is easy to implement without smoothing the l1 or l2 norms. We show that a method of multipliers implementation of the resulting model can recover source wavelets that are not necessarily minimum phase and approximately reconstruct the sparse reflectivities. It appears to be robust to the initialization and to small amounts of noise in the data. We also discuss extensions to the Estimation of Primaries by Sparse Inversion (EPSI) convolution model.},
	keywords = {Presentation, SINBAD, SINBADFALL2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Fall/esser2014SINBADlcs/esser2014SINBADlcs.pdf},
	author = {Ernie Esser and Tim T.Y. Lin and Rongrong Wang and Felix J. Herrmann}
}
