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.

Michael Eichelbeck

dblp:320/3724 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2026
0000-0002-1522-8767ORCID · verified

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

Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
3 papers
Reinforcement learning · 74% Trustworthy machine learning · 18% Motion planning and robot control · 5%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › policy optimization
policy gradient
1.822026
Improving Stochastic Action-Constrained Reinforcement Learning via Truncated Distributions · AAAI 2026
Excluding the Irrelevant: Focusing Reinforcement Learning through Continuous Action Masking · NeurIPS 2024
Machine learning › Reinforcement learning › constrained reinforcement learning
action-constrained reinforcement learning
1.012026
Improving Stochastic Action-Constrained Reinforcement Learning via Truncated Distributions · AAAI 2026
Machine learning › Reinforcement learning
constrained reinforcement learning
1.012026
Improving Stochastic Action-Constrained Reinforcement Learning via Truncated Distributions · AAAI 2026
Machine learning › Reinforcement learning › policy optimization › policy gradient
stochastic policy gradient
1.012026
Improving Stochastic Action-Constrained Reinforcement Learning via Truncated Distributions · AAAI 2026
Machine learning › Trustworthy machine learning › uncertainty estimation
conformal prediction
0.912025
Zono-Conformal Prediction: Zonotope-Based Uncertainty Quantification for Regression and Classification Tasks · J. Mach. Learn. Res. 2025
Machine learning › Trustworthy machine learning
uncertainty estimation
0.912025
Zono-Conformal Prediction: Zonotope-Based Uncertainty Quantification for Regression and Classification Tasks · J. Mach. Learn. Res. 2025
Machine learning › Reinforcement learning › safe reinforcement learning
action masking
0.812024
Excluding the Irrelevant: Focusing Reinforcement Learning through Continuous Action Masking · NeurIPS 2024
Machine learning › Reinforcement learning
action space design
0.812024
Excluding the Irrelevant: Focusing Reinforcement Learning through Continuous Action Masking · NeurIPS 2024
Machine learning › Reinforcement learning › policy optimization
proximal policy optimization
0.812024
Excluding the Irrelevant: Focusing Reinforcement Learning through Continuous Action Masking · NeurIPS 2024
Machine learning › Deep learning architectures and training
feedforward neural network
0.312025
Zono-Conformal Prediction: Zonotope-Based Uncertainty Quantification for Regression and Classification Tasks · J. Mach. Learn. Res. 2025
Robotics › Motion planning and robot control
robot control
0.212024
Excluding the Irrelevant: Focusing Reinforcement Learning through Continuous Action Masking · NeurIPS 2024
Robotics › Motion planning and robot control › robot control
safe control
0.212024
Excluding the Irrelevant: Focusing Reinforcement Learning through Continuous Action Masking · NeurIPS 2024

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

truncated normal distribution · 1.0numerical approximation · 1.0reachset-conformant identification · 0.9linear programming · 0.9interval predictor models · 0.9policy gradient · 0.8action masking · 0.8
YearPublicationVenuePosition
2026 Improving Stochastic Action-Constrained Reinforcement Learning via Truncated Distributions
abstract
In reinforcement learning (RL), it is often advantageous to consider additional constraints on the action space to ensure safety or action relevance. Existing work on such action-constrained RL faces challenges regarding effective policy updates, computational efficiency, and predictable runtime. Recent work proposes to use truncated normal distributions for stochastic policy gradient methods. However, the computation of key characteristics, such as the entropy, log-probability, and their gradients, becomes intractable under complex constraints. Hence, prior work approximates these using the non-truncated distributions, which severely degrades performance. We argue that accurate estimation of these characteristics is crucial in the action-constrained RL setting, and propose efficient numerical approximations for them. We also provide an efficient sampling strategy for truncated policy distributions and validate our approach on three benchmark environments, which demonstrate significant performance improvements when using accurate estimations.
Roland Stolz, Michael Eichelbeck, Matthias Althoff
AAAI2
2025 Zono-Conformal Prediction: Zonotope-Based Uncertainty Quantification for Regression and Classification Tasks
abstract
Conformal prediction is a popular uncertainty quantification method that augments a base predictor to return sets of predictions with statistically valid coverage guarantees. However, current methods are often computationally expensive and data-intensive, as they require constructing an uncertainty model before calibration. Moreover, existing approaches typically represent the prediction sets with intervals, which limits their ability to capture dependencies in multi-dimensional outputs. We address these limitations by introducing zono-conformal prediction, a novel approach inspired by interval predictor models and reachset-conformant identification that constructs prediction zonotopes with assured coverage. By placing zonotopic uncertainty sets directly into the model of the base predictor, zono-conformal predictors can be identified via a single, data-efficient linear program. While we can apply zono-conformal prediction to arbitrary nonlinear base predictors, we focus on feed-forward neural networks in this work. Aside from regression tasks, we also construct optimal zono-conformal predictors in classification settings where the output of an uncertain predictor is a set of possible classes. We provide probabilistic coverage guarantees and present methods for detecting outliers in the identification data. In extensive numerical experiments, we show that zono-conformal predictors are less conservative than interval predictor models and standard conformal prediction methods, while achieving a similar coverage over the test data.
Laura Lützow, Michael Eichelbeck, Mykel J. Kochenderfer, Matthias Althoff
J. Mach. Learn. Res.2
2024 Excluding the Irrelevant: Focusing Reinforcement Learning through Continuous Action Masking
abstract
Continuous action spaces in reinforcement learning (RL) are commonly defined as multidimensional intervals. While intervals usually reflect the action boundaries for tasks well, they can be challenging for learning because the typically large global action space leads to frequent exploration of irrelevant actions. Yet, little task knowledge can be sufficient to identify significantly smaller state-specific sets of relevant actions. Focusing learning on these relevant actions can significantly improve training efficiency and effectiveness. In this paper, we propose to focus learning on the set of relevant actions and introduce three continuous action masking methods for exactly mapping the action space to the state-dependent set of relevant actions. Thus, our methods ensure that only relevant actions are executed, enhancing the predictability of the RL agent and enabling its use in safety-critical applications. We further derive the implications of the proposed methods on the policy gradient. Using proximal policy optimization ( PPO), we evaluate our methods on four control tasks, where the relevant action set is computed based on the system dynamics and a relevant state set. Our experiments show that the three action masking methods achieve higher final rewards and converge faster than the baseline without action masking.
Roland Stolz, Hanna Krasowski, Jakob Thumm, Michael Eichelbeck, Philipp Gassert, Matthias Althoff
NeurIPS4
2022 Contingency-constrained economic dispatch with safe reinforcement learning
abstract
Future power systems will rely heavily on micro grids with a high share of decentralised renewable energy sources and energy storage systems. The high complexity and uncertainty in this context might make conventional power dispatch strategies infeasible. Reinforcement-learning-based (RL) controllers can address this challenge, however, cannot themselves provide safety guarantees, preventing their deployment in practice. To overcome this limitation, we propose a formally validated RL controller for economic dispatch. We extend conventional constraints by a time-dependent constraint encoding the islanding contingency. The contingency constraint is computed using set-based backwards reachability analysis, and actions of the RL agent are verified through a safety layer. Unsafe actions are projected into the safe action space while leveraging constrained zonotope set representations for computational efficiency. The developed approach is demonstrated on a residential use case considering real-world measurements.
Michael Eichelbeck, Hannah Markgraf, Matthias Althoff
ICMLA1