EDBT 2026 Demo / reviewers in the wild / expert
Marco Heyden
dblp:320/3738
· DBLP profile ↗
6ranked-venue papers in the field
4as first author
6since 2021 · last 2024
0000-0003-4981-709XORCID · corroborated
Domains — venue-derived; a paper can count in several
Data Mining & Knowledge Discovery · 5 (3 first)Database Systems & Data Management · 1 (1 first)
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | MicroPPO: Safe Power Flow Management in Decentralized Micro-Grids with Proximal Policy OptimizationabstractFuture sustainable energy systems require the integration of local renewable energy sources (RES) into decentralized micro-grids, each containing RES, energy storage systems, and local loads. A substantial challenge associated with micro-grids is the optimization of energy flows to minimize operating costs. This is particularly complex due to (a) the fluctuating power generation of RES, (b) the variability of local loads, and (c) the possibility of energy trade between a micro-grid and a larger ‘utility grid’ that it connects to. Existing methods struggle to manage these sources of uncertainty effectively. To address this, we propose MicroPPO, a reinforcement learning approach for real-time management of power flows in such small-scale energy systems. MicroPPO introduces a novel definition of the environment as a Markov Decision Process (MDP) with a continuous and multi-dimensional action space. This enables more precise control of power flows compared to discrete methods. Additionally, MicroPPO employs an innovative actor network architecture featuring multiple network branches to reflect the individual action dimensions. It further integrates a differentiable projection layer that enforces the feasibility of actions. We assess the performance of our approach against state-of-the-art methods using real-world data. Our results demonstrate MicroPPO's superior convergence towards near-optimal policies. Daniel Ebi, Edouard Fouché, Marco Heyden, Klemens Böhm |
DSAA | 3 |
| 2024 | Budgeted Multi-Armed Bandits with Asymmetric Confidence IntervalsabstractWe study the stochastic Budgeted Multi-Armed Bandit (MAB) problem, where a player chooses from K arms with unknown expected rewards and costs. The goal is to maximize the total reward under a budget constraint. A player thus seeks to choose the arm with the highest reward-cost ratio as often as possible. Current approaches for this problem have several issues, which we illustrate. To overcome them, we propose a new upper confidence bound (UCB) sampling policy, ømega-UCB, that uses asymmetric confidence intervals. These intervals scale with the distance between the sample mean and the bounds of a random variable, yielding a more accurate and tight estimation of the reward-cost ratio compared to our competitors. We show that our approach has sublinear instance-dependent regret in general and logarithmic regret for parameter ρ ≥ 1, and that it outperforms existing policies consistently in synthetic and real settings. Marco Heyden, Vadim Arzamasov, Edouard Fouché, Klemens Böhm |
KDD | 1 |
| 2024 | Leveraging Plasticity in Incremental Decision Trees
Marco Heyden, Heitor Murilo Gomes, Edouard Fouché, Bernhard Pfahringer, Klemens Böhm |
ECML/PKDD (5) | 1 |
| 2024 | Adaptive Bernstein change detector for high-dimensional data streamsabstractAbstract Change detection is of fundamental importance when analyzing data streams. Detecting changes both quickly and accurately enables monitoring and prediction systems to react, e.g., by issuing an alarm or by updating a learning algorithm. However, detecting changes is challenging when observations are high-dimensional. In high-dimensional data, change detectors should not only be able to identify when changes happen, but also in which subspace they occur. Ideally, one should also quantify how severe they are. Our approach, ABCD, has these properties. ABCD learns an encoder-decoder model and monitors its accuracy over a window of adaptive size. ABCD derives a change score based on Bernstein’s inequality to detect deviations in terms of accuracy, which indicate changes. Our experiments demonstrate that ABCD outperforms its best competitor by up to 20% in F1-score on average. It can also accurately estimate changes’ subspace, together with a severity measure that correlates with the ground truth. Marco Heyden, Edouard Fouché, Vadim Arzamasov, Tanja Fenn, Florian Kalinke, Klemens Böhm |
Data Min. Knowl. Discov. | 1 |
| 2022 | Evolution-Based Online Automated Machine Learning
Cedric Kulbach, Jacob Montiel, Maroua Bahri, Marco Heyden, Albert Bifet |
PAKDD (1) | 4 |
| 2022 | Tandem Outlier Detectors for Decentralized DataabstractToday, the collection of decentralized data is a common scenario: smartphones store users’ messages locally, smart meters collect energy consumption data, and modern power tools monitor operator behavior. We identify different types of outliers in such data: local, global, and partition outliers. They contain valuable information, for example, about mistakes in operation. However, existing outlier detection approaches cannot distinguish between those types. Thus, we propose a “tandem” technique to join “local” and “federated” outlier detectors. Our core idea is to combine outlier detection on a single device with latent information about devices’ data to discriminate between different outlier types. To the best of our knowledge, our method is the first to achieve this. We evaluate our approach on publicly available synthetic and real-world data that we collect in a study with 15 participants operating power tools. Marco Heyden, Jürgen Wilwer, Edouard Fouché, Steffen Thoma, Sven Matthiesen, Thomas Gwosch |
SSDBM | 1 |