Felix Fiedler
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Felix Fiedler has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Sergio Lucia
Technische Universität Dortmund
4 shared publications - Benjamin Karg
Laboratory of Process Automation Systems Technische Universität Dortmund Dortmund Germany
1 shared publication - Christoph Döpmann
TU Berlin
1 shared publication - Dean Brandner
Technische Universität Dortmund, Laboratory of Process Automation Systems, Emil-Figge-Straße 70, Dortmund 44227, Germany
1 shared publication - Felix Brabender1 shared publication
- Florian Tschorsch
Technische Universität Dresden
1 shared publication
Latest Publications
- Open Access
- 2 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 123149-123160
Improved Uncertainty Quantification for Neural Networks With Bayesian Last Layer
Uncertainty quantification is an important task in machine learning - a task in which standard neural networks (NNs) have traditionally not excelled. This can be a limitation for safety-critical applications, where uncertainty-aware methods like Gaussian processes or Bayesian linear regression are often preferred. Bayesian neural networks are an approach to address this limitation. They assume probability distributions for all parameters and yield distributed predictions. However, training and inference are typically intractable and approximations must be employed. A promising approximation is NNs with Bayesian last layer (BLL). They assume distributed weights only in the linear output layer and yield a normally distributed prediction. To approximate the intractable Bayesian neural network, point estimates of the distributed weights in all but the last layer should be obtained by maximizing the marginal likelihood. This has previously been challenging, as the marginal likelihood is expensive to evaluate in this setting. We present a reformulation of the log-marginal likelihood of a NN with BLL which allows for efficient training using backpropagation. Furthermore, we address the challenge of uncertainty quantification for extrapolation points. We provide a metric to quantify the degree of extrapolation and derive a method to improve the uncertainty quantification for these points. Our methods are derived for the multivariate case and demonstrated in a simulation study. In comparison to Bayesian linear regression with fixed features, and a Bayesian neural network trained with variational inference, our proposed method achieves the highest log-predictive density on test data.
- 2 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 123149-123160
Open AccessImproved Uncertainty Quantification for Neural Networks With Bayesian Last Layer
Uncertainty quantification is an important task in machine learning - a task in which standard neural networks (NNs) have traditionally not excelled. This can be a limitation for safety-critical applications, where uncertainty-aware methods like Gaussian processes or Bayesian linear regression are often preferred. Bayesian neural networks are an approach to address this limitation. They assume probability distributions for all parameters and yield distributed predictions. However, training and inference are typically intractable and approximations must be employed. A promising approximation is NNs with Bayesian last layer (BLL). They assume distributed weights only in the linear output layer and yield a normally distributed prediction. To approximate the intractable Bayesian neural network, point estimates of the distributed weights in all but the last layer should be obtained by maximizing the marginal likelihood. This has previously been challenging, as the marginal likelihood is expensive to evaluate in this setting. We present a reformulation of the log-marginal likelihood of a NN with BLL which allows for efficient training using backpropagation. Furthermore, we address the challenge of uncertainty quantification for extrapolation points. We provide a metric to quantify the degree of extrapolation and derive a method to improve the uncertainty quantification for these points. Our methods are derived for the multivariate case and demonstrated in a simulation study. In comparison to Bayesian linear regression with fixed features, and a Bayesian neural network trained with variational inference, our proposed method achieves the highest log-predictive density on test data.
- Open Access
- 20 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 117018-117029
Probabilistic Multi-Step Identification With Implicit State Estimation for Stochastic MPC
Stochastic Model Predictive Control (SMPC) is a promising solution for controlling multivariable systems in the presence of uncertainty. However, a core challenge lies in obtaining a probabilistic system model. Recently, multi-step system identification has been proposed as a solution. Multi-step models simultaneously predict a finite sequence of future states, which traditionally involves recursive evaluation of a state-space model. Particularly in the stochastic context, the recursive evaluation of identified state-space models has several drawbacks, making multi-step models an appealing choice. As a main novelty of this work, we propose a probabilistic multi-step identification method for a linear system with noisy state measurements and unknown process and measurement noise covariances. We show that, in expectation, evaluating the identified multi-step model is equivalent to estimating the initial state distribution and subsequently propagating this distribution using the known system dynamics. Therefore, using only recorded data of an unknown linear system, our proposed method yields a probabilistic multi-step model, including the state estimation task, that can be directly used for SMPC. As an additional novelty, our proposed SMPC formulation considers parametric uncertainties of the identified multi-step model. We demonstrate our method in two simulation studies, showcasing its effectiveness even for a nonlinear system with output feedback.
- 20 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 117018-117029
Open AccessProbabilistic Multi-Step Identification With Implicit State Estimation for Stochastic MPC
Stochastic Model Predictive Control (SMPC) is a promising solution for controlling multivariable systems in the presence of uncertainty. However, a core challenge lies in obtaining a probabilistic system model. Recently, multi-step system identification has been proposed as a solution. Multi-step models simultaneously predict a finite sequence of future states, which traditionally involves recursive evaluation of a state-space model. Particularly in the stochastic context, the recursive evaluation of identified state-space models has several drawbacks, making multi-step models an appealing choice. As a main novelty of this work, we propose a probabilistic multi-step identification method for a linear system with noisy state measurements and unknown process and measurement noise covariances. We show that, in expectation, evaluating the identified multi-step model is equivalent to estimating the initial state distribution and subsequently propagating this distribution using the known system dynamics. Therefore, using only recorded data of an unknown linear system, our proposed method yields a probabilistic multi-step model, including the state estimation task, that can be directly used for SMPC. As an additional novelty, our proposed SMPC formulation considers parametric uncertainties of the identified multi-step model. We demonstrate our method in two simulation studies, showcasing its effectiveness even for a nonlinear system with output feedback.
- Top Cited PapersOpen Access
- 7 September 2023
- Published by Elsevier in Control Engineering Practice
- Vol. 140
do-mpc: Towards FAIR nonlinear and robust model predictive control
- 7 September 2023
- Published by Elsevier in Control Engineering Practice
- Vol. 140
Top Cited PapersOpen Accessdo-mpc: Towards FAIR nonlinear and robust model predictive control
- Open Access
- 14 November 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Internet Technology
- Vol. 22 (4) , 1-30
Optimization-Based Predictive Congestion Control for the Tor Network: Opportunities and Challenges
Based on the principle of onion routing, the Tor network achieves anonymity for its users by relaying user data over a series of intermediate relays. This approach makes congestion control in the network a challenging task. As of this writing, this results in higher latencies due to considerable backlog as well as unfair data rate allocation. In this article, we present a concept study of PredicTor, a novel approach to congestion control that tackles clogged overlay networks. Unlike traditional approaches, it is built upon the idea of distributed model predictive control, a recent advancement from the area of control theory. PredicTor is tailored to minimizing latency in the network and achieving max-min fairness. We contribute a thorough evaluation of its behavior in both toy scenarios to assess the optimizer and complex networks to assess its potential. For this, we conduct large-scale simulation studies and compare PredicTor to existing congestion control mechanisms in Tor. We show that PredicTor is highly effective in reducing latency and realizing fair rate allocations. In addition, we strive to bring the ideas of modern control theory to the networking community, enabling the development of improved, future congestion control. Thus, we demonstrate benefits and issues alike with this novel research direction.
- 14 November 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Internet Technology
- Vol. 22 (4) , 1-30
Open AccessOptimization-Based Predictive Congestion Control for the Tor Network: Opportunities and Challenges
Based on the principle of onion routing, the Tor network achieves anonymity for its users by relaying user data over a series of intermediate relays. This approach makes congestion control in the network a challenging task. As of this writing, this results in higher latencies due to considerable backlog as well as unfair data rate allocation. In this article, we present a concept study of PredicTor, a novel approach to congestion control that tackles clogged overlay networks. Unlike traditional approaches, it is built upon the idea of distributed model predictive control, a recent advancement from the area of control theory. PredicTor is tailored to minimizing latency in the network and achieving max-min fairness. We contribute a thorough evaluation of its behavior in both toy scenarios to assess the optimizer and complex networks to assess its potential. For this, we conduct large-scale simulation studies and compare PredicTor to existing congestion control mechanisms in Tor. We show that PredicTor is highly effective in reducing latency and realizing fair rate allocations. In addition, we strive to bring the ideas of modern control theory to the networking community, enabling the development of improved, future congestion control. Thus, we demonstrate benefits and issues alike with this novel research direction.