EDBT 2026 Demo / reviewers in the wild / expert
Johannes Günther 0002
dblp:43/5151-2
· DBLP profile ↗
3ranked-venue papers
0as first author
1since 2021 · last 2024
0000-0003-4926-312XORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 since 2021Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1
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 |
Reinforcement learning · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
value function estimation |
0.4 | 1 | 2020 | Gamma-Nets: Generalizing Value Estimation over Timescale · AAAI 2020 |
Machine learning › Reinforcement learning › value function estimation
general value functions |
0.1 | 1 | 2020 | Gamma-Nets: Generalizing Value Estimation over Timescale · AAAI 2020 |
Methods — techniques the papers use, named apart from their topics
linear function approximation · 0.4deep reinforcement learning · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Explainability of deep reinforcement learning algorithms in robotic domains by using Layer-wise Relevance Propagation
Mehran Taghian, Shotaro Miwa, Yoshihiro Mitsuka, Johannes Günther 0002, Shadan Golestan, Osmar R. Zaïane |
Eng. Appl. Artif. Intell. | 4 |
| 2020 | Gamma-Nets: Generalizing Value Estimation over TimescaleabstractTemporal abstraction is a key requirement for agents making decisions over long time horizons—a fundamental challenge in reinforcement learning. There are many reasons why value estimates at multiple timescales might be useful; recent work has shown that value estimates at different time scales can be the basis for creating more advanced discounting functions and for driving representation learning. Further, predictions at many different timescales serve to broaden an agent's model of its environment. One predictive approach of interest within an online learning setting is general value function (GVFs), which represent models of an agent's world as a collection of predictive questions each defined by a policy, a signal to be predicted, and a prediction timescale. In this paper we present Γ-nets, a method for generalizing value function estimation over timescale, allowing a given GVF to be trained and queried for arbitrary timescales so as to greatly increase the predictive ability and scalability of a GVF-based model. The key to our approach is to use timescale as one of the value estimator's inputs. As a result, the prediction target for any timescale is available at every timestep and we are free to train on any number of timescales. We first provide two demonstrations by 1) predicting a square wave and 2) predicting sensorimotor signals on a robot arm using a linear function approximator. Next, we empirically evaluate Γ-nets in the deep reinforcement learning setting using policy evaluation on a set of Atari video games. Our results show that Γ-nets can be effective for predicting arbitrary timescales, with only a small cost in accuracy as compared to learning estimators for fixed timescales. Γ-nets provide a method for accurately and compactly making predictions at many timescales without requiring a priori knowledge of the task, making it a valuable contribution to ongoing work on model-based planning, representation learning, and lifelong learning algorithms. Craig Sherstan, Shibhansh Dohare, James MacGlashan, Johannes Günther 0002, Patrick M. Pilarski |
AAAI | 4 |
| 2019 | Detecting the Onset of Machine Failure Using Anomaly Detection Methods
Mohammad Riazi, Osmar R. Zaïane, Tomoharu Takeuchi, Anthony Maltais, Johannes Günther 0002, Micheal Lipsett |
DaWaK | 5 |