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

Johannes S. Otterbach

dblp:222/3130 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021Computer networks · 1 · 1 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
1 paper
Trustworthy machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › interpretability › explainable AI
additive models
0.712023
Curve Your Enthusiasm: Concurvity Regularization in Differentiable Generalized Additive Models · NeurIPS 2023
Machine learning › Trustworthy machine learning › interpretability › explainable AI › self-interpretable models
generalized additive model
0.712023
Curve Your Enthusiasm: Concurvity Regularization in Differentiable Generalized Additive Models · NeurIPS 2023
Machine learning › Trustworthy machine learning
interpretability
0.712023
Curve Your Enthusiasm: Concurvity Regularization in Differentiable Generalized Additive Models · NeurIPS 2023
Machine learning › Trustworthy machine learning › interpretability
feature importance
0.212023
Curve Your Enthusiasm: Concurvity Regularization in Differentiable Generalized Additive Models · NeurIPS 2023

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

regularization · 0.7differentiable additive models · 0.7
YearPublicationVenuePosition
2024 Progressive updates of convolutional neural networks for enhanced reliability in small satellite applications
abstract
Small satellites enable many important applications for both economic and scientific purposes. Many of these applications are inherently data-centric and rely on large amounts of high-resolution satellite imagery to be delivered in a timely manner. However, communicating this data to Earth is challenging due to intermittent connectivity, high packet losses, low data rates, and similar issues. Therefore, efficient onboard prioritization and data processing are essential for future satellite missions. Machine learning methods, such as deep neural networks, are very suitable for such prioritization, as they are already used extensively for satellite imagery processing and they can be deployed onboard of satellites. However, updating them to support new classification requirements when the satellite is already in orbit is difficult, as often multiple passes are required to complete model transmission due to the communication challenges. To cope with this issue, we propose a progressive transmission mechanism for model updates, which leverages vector quantization and arithmetic coding. Our mechanism allows to achieve high accuracies even with partially updated models. Evaluation results show that our mechanism significantly outperforms other less optimized transmission schemes.
Olga Kondrateva, Stefan Dietzel, Maximilian Schambach, Johannes S. Otterbach, Björn Scheuermann 0001
Comput. Commun.4
2023 Curve Your Enthusiasm: Concurvity Regularization in Differentiable Generalized Additive Models
abstract
Generalized Additive Models (GAMs) have recently experienced a resurgence in popularity due to their interpretability, which arises from expressing the target value as a sum of non-linear transformations of the features. Despite the current enthusiasm for GAMs, their susceptibility to concurvity — i.e., (possibly non-linear) dependencies between the features — has hitherto been largely overlooked. Here, we demonstrate how concurvity can severly impair the interpretability of GAMs and propose a remedy: a conceptually simple, yet effective regularizer which penalizes pairwise correlations of the non-linearly transformed feature variables. This procedure is applicable to any differentiable additive model, such as Neural Additive Models or NeuralProphet, and enhances interpretability by eliminating ambiguities due to self-canceling feature contributions. We validate the effectiveness of our regularizer in experiments on synthetic as well as real-world datasets for time-series and tabular data. Our experiments show that concurvity in GAMs can be reduced without significantly compromising prediction quality, improving interpretability and reducing variance in the feature importances.
Julien Siems, Konstantin Ditschuneit, Winfried Ripken, Alma Lindborg, Maximilian Schambach, Johannes S. Otterbach, Martin Genzel
NeurIPS6