Demo Data from EDBT 2026 / reviewers in the wild / expert
Guy Azran
dblp:275/3395
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2024
0000-0002-2840-2584ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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 |
Reinforcement learning · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
deep reinforcement learning |
0.8 | 1 | 2024 | Contextual Pre-planning on Reward Machine Abstractions for Enhanced Transfer in Deep Reinforcement Learning · AAAI 2024 |
Machine learning › Reinforcement learning
hierarchical reinforcement learning |
0.8 | 1 | 2024 | Contextual Pre-planning on Reward Machine Abstractions for Enhanced Transfer in Deep Reinforcement Learning · AAAI 2024 |
Machine learning › Reinforcement learning › reward design
reward machine |
0.8 | 1 | 2024 | Contextual Pre-planning on Reward Machine Abstractions for Enhanced Transfer in Deep Reinforcement Learning · AAAI 2024 |
Methods — techniques the papers use, named apart from their topics
symbolic representation · 0.8reward machines · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Contextual Pre-planning on Reward Machine Abstractions for Enhanced Transfer in Deep Reinforcement LearningabstractRecent studies show that deep reinforcement learning (DRL) agents tend to overfit to the task on which they were trained and fail to adapt to minor environment changes. To expedite learning when transferring to unseen tasks, we propose a novel approach to representing the current task using reward machines (RMs), state machine abstractions that induce subtasks based on the current task’s rewards and dynamics. Our method provides agents with symbolic representations of optimal transitions from their current abstract state and rewards them for achieving these transitions. These representations are shared across tasks, allowing agents to exploit knowledge of previously encountered symbols and transitions, thus enhancing transfer. Empirical results show that our representations improve sample efficiency and few-shot transfer in a variety of domains. Guy Azran, Mohamad H. Danesh, Stefano V. Albrecht, Sarah Keren |
AAAI | 1 |