Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sebastian Lunz

dblp:220/5694 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
2since 2021 · last 2024
0000-0003-2124-2052ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Trustworthy machine learning · 47% Generative modeling · 32% Learning theory · 11%
Computer graphics and multimedia
1 paper
Image and video processing · 100%

Topics — the 10 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.412019
On the Connection Between Adversarial Robustness and Saliency Map Interpretability · ICML 2019
Machine learning › Trustworthy machine learning
interpretability
0.412019
On the Connection Between Adversarial Robustness and Saliency Map Interpretability · ICML 2019
Machine learning › Trustworthy machine learning › interpretability › visual explanation
saliency map
0.412019
On the Connection Between Adversarial Robustness and Saliency Map Interpretability · ICML 2019
Machine learning › Trustworthy machine learning › robustness › adversarial robustness
adversarial training
0.312018
Adversarial Regularizers in Inverse Problems · NeurIPS 2018
Machine learning › Generative modeling
generative adversarial network
0.312018
Banach Wasserstein GAN · NeurIPS 2018
Machine learning › Generative modeling › inverse problem
inverse problem regularization
0.312018
Adversarial Regularizers in Inverse Problems · NeurIPS 2018
Machine learning › Learning theory
probability metric
0.312018
Banach Wasserstein GAN · NeurIPS 2018
Machine learning › Optimization for machine learning › optimal transport
wasserstein distance
0.312018
Banach Wasserstein GAN · NeurIPS 2018
Machine learning › Generative modeling › generative adversarial network
Wasserstein GAN
0.312018
Banach Wasserstein GAN · NeurIPS 2018
Image and video processing › image restoration
inverse problem
0.312018
Adversarial Regularizers in Inverse Problems · NeurIPS 2018

Methods — techniques the papers use, named apart from their topics

variational regularization · 0.7neural network · 0.7adversarial regularizer · 0.7lipschitz regularization · 0.4sobolev norm · 0.3gradient penalty · 0.3
YearPublicationVenuePosition
2024 Data-Driven Convex Regularizers for Inverse Problems
abstract
We propose to learn a data-adaptive convex regularizer, which is parameterized using an input-convex neural network (ICNN), for variational image reconstruction. The regularizer parameters are learned adversarially by telling apart clean images from the artifact-ridden ones in a training dataset. Convexity of the regularizer is theoretically and practically important since (i) one can establish well-posedness guarantees for the corresponding variational reconstruction problem and (ii) devise provably convergent optimization algorithms for reconstruction. In particular, the resulting method is shown to be convergent in the sense of regularization and can be solved provably using a gradient-based solver. To demonstrate the performance of our approach for solving inverse problems, we consider deblurring natural images and reconstruction in X-ray computed tomography (CT) and show that the proposed convex regularizer is on par with and sometimes superior to state-of-the-art classical and data-driven techniques for inverse problems, especially with severely ill-posed forward operators (such as in limited-angle tomography).
Subhadip Mukherjee, Sören Dittmer, Zakhar Shumaylov, Sebastian Lunz, Ozan Öktem, Carola-Bibiane Schönlieb
ICASSP4
2021 On Learned Operator Correction in Inverse Problems
abstract
We discuss the possibility of learning a data-driven explicit model correction for inverse problems and whether such a model correction can be used within a variational framework to obtain regularized reconstructions. This paper discusses the conceptual difficulty of learning such a forward model correction and proceeds to present a possible solution as a forward-adjoint correction that explicitly corrects in both data and solution spaces. We then derive conditions under which solutions to the variational problem with a learned correction converge to solutions obtained with the correct operator. The proposed approach is evaluated on an application to limited view photoacoustic tomography and compared to the established framework of the Bayesian approximation error method.
Sebastian Lunz, Andreas Hauptmann, Tanja Tarvainen, Carola-Bibiane Schönlieb, Simon R. Arridge
SIAM J. Imaging Sci.1
2019 On the Connection Between Adversarial Robustness and Saliency Map Interpretability
abstract
Recent studies on the adversarial vulnerability of neural networks have shown that models trained to be more robust to adversarial attacks exhibit more interpretable saliency maps than their non-robust counterparts. We aim to quantify this behaviour by considering the alignment between input image and saliency map. We hypothesize that as the distance to the decision boundary grows, so does the alignment. This connection is strictly true in the case of linear models. We confirm these theoretical findings with experiments based on models trained with a local Lipschitz regularization and identify where the nonlinear nature of neural networks weakens the relation.
Christian Etmann, Sebastian Lunz, Peter Maass, Carola-Bibiane Schönlieb
ICML2
2018 Banach Wasserstein GAN
abstract
Wasserstein Generative Adversarial Networks (WGANs) can be used to generate realistic samples from complicated image distributions. The Wasserstein metric used in WGANs is based on a notion of distance between individual images, which induces a notion of distance between probability distributions of images. So far the community has considered $\ell^2$ as the underlying distance. We generalize the theory of WGAN with gradient penalty to Banach spaces, allowing practitioners to select the features to emphasize in the generator. We further discuss the effect of some particular choices of underlying norms, focusing on Sobolev norms. Finally, we demonstrate a boost in performance for an appropriate choice of norm on CIFAR-10 and CelebA.
Jonas Adler, Sebastian Lunz
NeurIPS2
2018 Adversarial Regularizers in Inverse Problems
abstract
Inverse Problems in medical imaging and computer vision are traditionally solved using purely model-based methods. Among those variational regularization models are one of the most popular approaches. We propose a new framework for applying data-driven approaches to inverse problems, using a neural network as a regularization functional. The network learns to discriminate between the distribution of ground truth images and the distribution of unregularized reconstructions. Once trained, the network is applied to the inverse problem by solving the corresponding variational problem. Unlike other data-based approaches for inverse problems, the algorithm can be applied even if only unsupervised training data is available. Experiments demonstrate the potential of the framework for denoising on the BSDS dataset and for computer tomography reconstruction on the LIDC dataset.
Sebastian Lunz, Carola-Bibiane Schönlieb, Ozan Öktem
NeurIPS1