In January, I had the opportunity to interact with many other robustness researchers from academia and industry at the Robust Artificial Intelligence Workshop. As part of the workshop, organized by Airbus AI Research and TNO (Netherlands applied research organization), I also prepared a presentation talking about two of my PhD projects: confidence-calibrated adversarial training (CCAT) and bit error robustness of neural networks to enable low-energy neural network accelerators. In this article, I want to share the presentation; all other talks from the workshop can be found here.
In October this year, I was invited to talk at IBM’s FOCA workshop about my latest research on bit error robustness of (quantized) DNN weights. Here, the goal is to develop DNN accelerators capable to operating at low-voltage. However, lowering voltage induces bit errors in the accelerators’ memory. While such bit errors can be avoided through hardware mechanisms, such approaches are usually costly in terms of energy and area. Thus, training DNNs robust to such bit errors would enable low-voltage operation, reducing energy consumption, without the need for hardware techniques. In this 5-minute talk, I give a short overview.
In our ICML’20 paper, confidence-calibrated adversarial training (CCAT) addresses two problems of “regular” adversarial training. First, robustness against adversarial examples unseen during training is improved and second, clean accuracy is increased. CCAT biases the model towards predicting low-confidence on adversarial examples such that adversarial examples can be rejected by confidence thresholding. This article shares my talk on CCAT as recorded for ICML’20.
Confidence-calibrated adversarial training (CCAT) addresses two problems when training on adversarial examples: the lack of robustness against adversarial examples unseen during training, and the reduced (clean) accuracy. In particular, CCAT biases the model towards predicting low-confidence on adversarial examples such that adversarial examples can be rejected by confidence thresholding. In this article, I want to share the slides of the corresponding ICML talk.
Recently, I had the opportunity to present my work on confidence-calibrated adversarial training at the Bosch Center for Artifical Intelligence and the University of Tübingen, specifically, the newly formed Tübingen AI Center. As part of the talk, I outlined the motivation and strengths of confidence-calibrated adversarial training compared to standard adversarial training: robustness against previously unseen attacks and improved accuracy. I also touched on the difficulties faced during robustness evaluation. This article provides the corresponding slides and gives a short overview of the talk.
In April, I visited Prof. Bernt Schiele’s Computer Vision and Multimodal Computing Department at the Max Planck Institute for Informatics in Saarbrücken. Aside from a presentation on my recent superpixel benchmark, I also met many interesting people and learned a lot about a career in research.
In the course of a seminar on “Selected Topics in Image Processing”, I worked on iPiano, an algorithm for non-convex and non-smooth optimization proposed by Ochs et al. . iPiano combines forward-backward splitting with an inertial force. This article presents the corresponding seminar paper including an implementation in C++ with applications to image denoising, image segmentation and compressed sensing.
In the course of my second seminar on “Current Topics in Computer Vision and Machine Learning”, offered by the Computer Vision Group at RWTH Aachen University, I wrote a report entitled “Neural Codes for Image Retrieval”. The work is motivated by recent research by Bebanko et al.  and the report as well as the corresponding slides can be found here.
At RWTH Aachen University, after writing a bachelor thesis, one has to give a final talk on the topic. My bachelor thesis “Superpixel Segmentation using Depth Information” examines the use of depth information to enhance superpixel segmentation by extending the superpixel algorithm called SEEDS . This article presents the slides of my final talk.