Sebastian Ziesche

dblp:123/4530 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
4since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 since 2021Computer networks · 1Databases, data management, data science and information retrieval · 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
Probabilistic and Bayesian machine learning · 100%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
exact inference
0.812024
Exact Inference for Continuous-Time Gaussian Process Dynamics · AAAI 2024
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process
0.812024
Exact Inference for Continuous-Time Gaussian Process Dynamics · AAAI 2024
Coding theory
error-correcting codes
0.212013
Efficient Majority-Logic Decoding of Short-Length Reed-Muller Codes at Information Positions · IEEE Trans. Commun. 2013
Coding theory › error-correcting codes › decoding
majority-logic decoding
0.212013
Efficient Majority-Logic Decoding of Short-Length Reed-Muller Codes at Information Positions · IEEE Trans. Commun. 2013
Coding theory › error-correcting codes
reed-muller codes
0.212013
Efficient Majority-Logic Decoding of Short-Length Reed-Muller Codes at Information Positions · IEEE Trans. Commun. 2013
Coding theory › error-correcting codes › decoding › decoding problems
decoding complexity
0.012013
Efficient Majority-Logic Decoding of Short-Length Reed-Muller Codes at Information Positions · IEEE Trans. Commun. 2013

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

taylor integrator · 0.8numerical integrator · 0.8multistep integrator · 0.8systematic encoding · 0.2majority-logic decoding · 0.2
YearPublicationVenuePosition
2024 Exact Inference for Continuous-Time Gaussian Process Dynamics
abstract
Many physical systems can be described as a continuous-time dynamical system. In practice, the true system is often unknown and has to be learned from measurement data. Since data is typically collected in discrete time, e.g. by sensors, most methods in Gaussian process (GP) dynamics model learning are trained on one-step ahead predictions. While this scheme is mathematically tempting, it can become problematic in several scenarios, e.g. if measurements are provided at irregularly-sampled time steps or physical system properties have to be conserved. Thus, we aim for a GP model of the true continuous-time dynamics. We tackle this task by leveraging higher-order numerical integrators. These integrators provide the necessary tools to discretize dynamical systems with arbitrary accuracy. However, most higher-order integrators require dynamics evaluations at intermediate time steps, making exact GP inference intractable. In previous work, this problem is often addressed by approximate inference techniques. However, exact GP inference is preferable in many scenarios, e.g. due to its mathematical guarantees. In order to enable direct inference, we propose to leverage multistep and Taylor integrators. We demonstrate how exact inference schemes can be derived for these types of integrators. Further, we derive tailored sampling schemes that allow one to draw consistent dynamics functions from the posterior. The learned model can thus be integrated with arbitrary integrators, just like a standard dynamical system. We show empirically and theoretically that our approach yields an accurate representation of the continuous-time system.
Katharina Ensinger, Nicholas Tagliapietra, Sebastian Ziesche, Sebastian Trimpe
AAAI3
2024 Learning Hybrid Dynamics Models with Simulator-Informed Latent States
abstract
Dynamics model learning deals with the task of inferring unknown dynamics from measurement data and predicting the future behavior of the system. A typical approach to address this problem is to train recurrent models. However, predictions with these models are often not physically meaningful. Further, they suffer from deteriorated behavior over time due to accumulating errors. Often, simulators building on first principles are available being physically meaningful by design. However, modeling simplifications typically cause inaccuracies in these models. Consequently, hybrid modeling is an emerging trend that aims to combine the best of both worlds. In this paper, we propose a new approach to hybrid modeling, where we inform the latent states of a learned model via a black-box simulator. This allows to control the predictions via the simulator preventing them from accumulating errors. This is especially challenging since, in contrast to previous approaches, access to the simulator's latent states is not available. We tackle the task by leveraging observers, a well-known concept from control theory, inferring unknown latent states from observations and dynamics over time. In our learning-based setting, we jointly learn the dynamics and an observer that infers the latent states via the simulator. Thus, the simulator constantly corrects the latent states, compensating for modeling mismatch caused by learning. To maintain flexibility, we train an RNN-based residuum for the latent states that cannot be informed by the simulator.
Katharina Ensinger, Sebastian Ziesche, Sebastian Trimpe
AAAI2
2023 Combining Slow and Fast: Complementary Filtering for Dynamics Learning
abstract
Modeling an unknown dynamical system is crucial in order to predict the future behavior of the system. A standard approach is training recurrent models on measurement data. While these models typically provide exact short-term predictions, accumulating errors yield deteriorated long-term behavior. In contrast, models with reliable long-term predictions can often be obtained, either by training a robust but less detailed model, or by leveraging physics-based simulations. In both cases, inaccuracies in the models yield a lack of short-time details. Thus, different models with contrastive properties on different time horizons are available. This observation immediately raises the question: Can we obtain predictions that combine the best of both worlds? Inspired by sensor fusion tasks, we interpret the problem in the frequency domain and leverage classical methods from signal processing, in particular complementary filters. This filtering technique combines two signals by applying a high-pass filter to one signal, and low-pass filtering the other. Essentially, the high-pass filter extracts high-frequencies, whereas the low-pass filter extracts low frequencies. Applying this concept to dynamics model learning enables the construction of models that yield accurate long- and short-term predictions. Here, we propose two methods, one being purely learning-based and the other one being a hybrid model that requires an additional physics-based simulator.
Katharina Ensinger, Sebastian Ziesche, Barbara Rakitsch, Michael Tiemann 0001, Sebastian Trimpe
AAAI2
2022 Structure-Preserving Gaussian Process Dynamics
Katharina Ensinger, Friedrich Solowjow, Sebastian Ziesche, Michael Tiemann 0001, Sebastian Trimpe
ECML/PKDD (5)3
2013 Efficient Majority-Logic Decoding of Short-Length Reed-Muller Codes at Information Positions
abstract
Short-length Reed-Muller codes under majority-logic decoding are of particular importance for efficient hardware implementations in real-time and embedded systems. This paper significantly improves Chen's two-step majority-logic decoding method for binary Reed-Muller codes RM(r,m), r ≤ m/2, if - systematic encoding assumed - only errors at information positions are to be corrected. Some general results on the minimal number of majority gates are presented that are particularly good for short codes. Specifically, with its importance in applications as a 3-error-correcting, self-dual code, the smallest non-trivial example, RM(2,5) of dimension 16 and length 32, is investigated in detail. Further, the decoding complexity of our procedure is compared with that of Chen's decoding algorithm for various Reed-Muller codes up to length 210.
Peter Hauck, Michael Huber 0002, Juliane Bertram, Dennis Brauchle, Sebastian Ziesche
IEEE Trans. Commun.5