Martin Mundt
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Martin Mundt has a total of 117 co-authors. Here are the top co-authors by number of shared publications:
Visvanathan Ramesh
Goethe University, Frankfurt, Germany
5 shared publications- Visvanathan Ramesh
Goethe University, Computer Science, Frankfurt, Germany and The Hessian Center for Artificial Intelligence (hessian.AI), Frankfurt am Main, Germany
4 shared publications - Alvydas Lisauskas
Institute of Applied Electrodynamics and Telecommunications, Vilnius University, Vilnius, LITHUANIA
3 shared publications - Hartmut G. Roskos
Physikalisches Institut, Johann Wolfgang Goethe-Universität, Frankfurt am Main, Germany
3 shared publications - Iuliia Pliushch
Department of Computer Science, Goethe University, Theodor-W.-Adorno-Platz 1, 60323 Frankfurt, Germany
3 shared publications - Viktor Krozer
Department of Physics, Goethe University Frankfurt, 60438 Frankfurt, Germany
3 shared publications
Latest Publications
- Open Access
- 25 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 6254-6279
Making a Name for Myself : On Academic Naming Policies and their Impact
- 25 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 6254-6279
Open AccessMaking a Name for Myself : On Academic Naming Policies and their Impact
- Open Access
Designing a Hybrid Neural System to Learn Real-world Crack Segmentation from Fractal-based Simulation
Identification of cracks is essential to assess the structural integrity of concrete infrastructure. However, robust crack segmentation remains a challenging task for computer vision systems due to the diverse appearance of concrete surfaces, variable lighting and weather conditions, and the overlapping of different defects. In particular recent data-driven methods struggle with the limited availability of data, the fine-grained and time-consuming nature of crack annotation, and face subsequent difficulty in generalizing to out-of-distribution samples. In this work, we move past these challenges in a two-fold way. We introduce a high-fidelity crack graphics simulator based on fractals and a corresponding fully-annotated crack dataset. We then complement the latter with a system that learns generalizable representations from simulation, by leveraging both a pointwise mutual information estimate along with adaptive instance normalization as inductive biases. Finally, we empirically highlight how different design choices are symbiotic in bridging the simulation to real gap, and ultimately demonstrate that our introduced system can effectively handle real-world crack segmentation.
Open AccessDesigning a Hybrid Neural System to Learn Real-world Crack Segmentation from Fractal-based Simulation
Identification of cracks is essential to assess the structural integrity of concrete infrastructure. However, robust crack segmentation remains a challenging task for computer vision systems due to the diverse appearance of concrete surfaces, variable lighting and weather conditions, and the overlapping of different defects. In particular recent data-driven methods struggle with the limited availability of data, the fine-grained and time-consuming nature of crack annotation, and face subsequent difficulty in generalizing to out-of-distribution samples. In this work, we move past these challenges in a two-fold way. We introduce a high-fidelity crack graphics simulator based on fractals and a corresponding fully-annotated crack dataset. We then complement the latter with a system that learns generalizable representations from simulation, by leveraging both a pointwise mutual information estimate along with adaptive instance normalization as inductive biases. Finally, we empirically highlight how different design choices are symbiotic in bridging the simulation to real gap, and ultimately demonstrate that our introduced system can effectively handle real-world crack segmentation.
- Open Access
- 12 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1882-1895
Queer In AI: A Case Study in Community-Led Participatory AI
- 12 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1882-1895
Open AccessQueer In AI: A Case Study in Community-Led Participatory AI
- Top Cited PapersOpen Access
- 20 January 2023
- Published by Elsevier in Neural Networks
- Vol. 160, 306-336
A wholistic view of continual learning with deep neural networks: Forgotten lessons and the bridge to active and open world learning
- 20 January 2023
- Published by Elsevier in Neural Networks
- Vol. 160, 306-336
Top Cited PapersOpen AccessA wholistic view of continual learning with deep neural networks: Forgotten lessons and the bridge to active and open world learning
- 12 November 2022
- Published by Springer Nature
- p. 397-413
When Deep Classifiers Agree: Analyzing Correlations Between Learning Order and Image Statistics
- 12 November 2022
- Published by Springer Nature
- p. 397-413
When Deep Classifiers Agree: Analyzing Correlations Between Learning Order and Image Statistics
- 21 July 2022
- Published by Elsevier in Neural Networks
- Vol. 154, 397-412
Return of the normal distribution: Flexible deep continual learning with variational auto-encoders
- 21 July 2022
- Published by Elsevier in Neural Networks
- Vol. 154, 397-412
Return of the normal distribution: Flexible deep continual learning with variational auto-encoders
- Open Access
- 31 March 2022
- Published by MDPI AG in Journal of Imaging
- Vol. 8 (4) , 93
Unified Probabilistic Deep Continual Learning through Generative Replay and Open Set Recognition
Modern deep neural networks are well known to be brittle in the face of unknown data instances and recognition of the latter remains a challenge. Although it is inevitable for continual-learning systems to encounter such unseen concepts, the corresponding literature appears to nonetheless focus primarily on alleviating catastrophic interference with learned representations. In this work, we introduce a probabilistic approach that connects these perspectives based on variational inference in a single deep autoencoder model. Specifically, we propose to bound the approximate posterior by fitting regions of high density on the basis of correctly classified data points. These bounds are shown to serve a dual purpose: unseen unknown out-of-distribution data can be distinguished from already trained known tasks towards robust application. Simultaneously, to retain already acquired knowledge, a generative replay process can be narrowed to strictly in-distribution samples, in order to significantly alleviate catastrophic interference.
- 31 March 2022
- Published by MDPI AG in Journal of Imaging
- Vol. 8 (4) , 93
Open AccessUnified Probabilistic Deep Continual Learning through Generative Replay and Open Set Recognition
Modern deep neural networks are well known to be brittle in the face of unknown data instances and recognition of the latter remains a challenge. Although it is inevitable for continual-learning systems to encounter such unseen concepts, the corresponding literature appears to nonetheless focus primarily on alleviating catastrophic interference with learned representations. In this work, we introduce a probabilistic approach that connects these perspectives based on variational inference in a single deep autoencoder model. Specifically, we propose to bound the approximate posterior by fitting regions of high density on the basis of correctly classified data points. These bounds are shown to serve a dual purpose: unseen unknown out-of-distribution data can be distinguished from already trained known tasks towards robust application. Simultaneously, to retain already acquired knowledge, a generative replay process can be narrowed to strictly in-distribution samples, in order to significantly alleviate catastrophic interference.
- 1 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3518-3527
Neural Architecture Search of Deep Priors: Towards Continual Learning without Catastrophic Interference
In this paper we analyze the classification performance of neural network structures without parametric inference. Making use of neural architecture search, we empirically demonstrate that it is possible to find random weight architectures, a deep prior, that enables a linear classification to perform on par with fully trained deep counterparts. Through ablation experiments, we exclude the possibility of winning a weight initialization lottery and confirm that suitable deep priors do not require additional inference. In an extension to continual learning, we investigate the possibility of catastrophic interference free incremental learning. Under the assumption of classes originating from the same data distribution, a deep prior found on only a subset of classes is shown to allow discrimination of further classes through training of a simple linear classifier.
- 1 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3518-3527
Neural Architecture Search of Deep Priors: Towards Continual Learning without Catastrophic Interference
In this paper we analyze the classification performance of neural network structures without parametric inference. Making use of neural architecture search, we empirically demonstrate that it is possible to find random weight architectures, a deep prior, that enables a linear classification to perform on par with fully trained deep counterparts. Through ablation experiments, we exclude the possibility of winning a weight initialization lottery and confirm that suitable deep priors do not require additional inference. In an extension to continual learning, we investigate the possibility of catastrophic interference free incremental learning. Under the assumption of classes originating from the same data distribution, a deep prior found on only a subset of classes is shown to allow discrimination of further classes through training of a simple linear classifier.
- 1 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3595-3605
Avalanche: an End-to-End Library for Continual Learning
Learning continually from non-stationary data streams is a long-standing goal and a challenging problem in machine learning. Recently, we have witnessed a renewed and fast-growing interest in continual learning, especially within the deep learning community. However, algorithmic solutions are often difficult to re-implement, evaluate and port across different settings, where even results on standard benchmarks are hard to reproduce. In this work, we propose Avalanche, an open-source end-to-end library for continual learning research based on PyTorch. Avalanche is designed to provide a shared and collaborative codebase for fast prototyping, training, and reproducible evaluation of continual learning algorithms.
- 1 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3595-3605
Avalanche: an End-to-End Library for Continual Learning
Learning continually from non-stationary data streams is a long-standing goal and a challenging problem in machine learning. Recently, we have witnessed a renewed and fast-growing interest in continual learning, especially within the deep learning community. However, algorithmic solutions are often difficult to re-implement, evaluate and port across different settings, where even results on standard benchmarks are hard to reproduce. In this work, we propose Avalanche, an open-source end-to-end library for continual learning research based on PyTorch. Avalanche is designed to provide a shared and collaborative codebase for fast prototyping, training, and reproducible evaluation of continual learning algorithms.
- 1 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 753-757
Open Set Recognition Through Deep Neural Network Uncertainty: Does Out-of-Distribution Detection Require Generative Classifiers?
We present an analysis of predictive uncertainty based out-of-distribution detection for different approaches to estimate various models' epistemic uncertainty and contrast it with extreme value theory based open set recognition. While the former alone does not seem to be enough to overcome this challenge, we demonstrate that uncertainty goes hand in hand with the latter method. This seems to be particularly reflected in a generative model approach, where we show that posterior based open set recognition outperforms discriminative models and predictive uncertainty based outlier rejection, raising the question of whether classifiers need to be generative in order to know what they have not seen.
- 1 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 753-757
Open Set Recognition Through Deep Neural Network Uncertainty: Does Out-of-Distribution Detection Require Generative Classifiers?
We present an analysis of predictive uncertainty based out-of-distribution detection for different approaches to estimate various models' epistemic uncertainty and contrast it with extreme value theory based open set recognition. While the former alone does not seem to be enough to overcome this challenge, we demonstrate that uncertainty goes hand in hand with the latter method. This seems to be particularly reflected in a generative model approach, where we show that posterior based open set recognition outperforms discriminative models and predictive uncertainty based outlier rejection, raising the question of whether classifiers need to be generative in order to know what they have not seen.