Demo Data from EDBT 2026 / reviewers in the wild / expert
Michal Kepa
dblp:365/8123
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 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
1 paper |
Planning, search and constraint satisfaction · 54% Reinforcement learning · 46% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › deep reinforcement learning
alphazero |
0.8 | 1 | 2024 | Fast and Knowledge-Free Deep Learning for General Game Playing (Student Abstract) · AAAI 2024 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
game playing |
0.8 | 1 | 2024 | Fast and Knowledge-Free Deep Learning for General Game Playing (Student Abstract) · AAAI 2024 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › game playing
general game playing |
0.8 | 1 | 2024 | Fast and Knowledge-Free Deep Learning for General Game Playing (Student Abstract) · AAAI 2024 |
Machine learning › Reinforcement learning › value function approximation
value network |
0.8 | 1 | 2024 | Fast and Knowledge-Free Deep Learning for General Game Playing (Student Abstract) · AAAI 2024 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › game tree search
monte carlo tree search |
0.2 | 1 | 2024 | Fast and Knowledge-Free Deep Learning for General Game Playing (Student Abstract) · AAAI 2024 |
Methods — techniques the papers use, named apart from their topics
value network · 0.8monte carlo tree search · 0.8attention layers · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Fast and Knowledge-Free Deep Learning for General Game Playing (Student Abstract)abstractWe develop a method of adapting the AlphaZero model to General Game Playing (GGP) that focuses on faster model generation and requires less knowledge to be extracted from the game rules. The dataset generation uses MCTS playing instead of self-play; only the value network is used, and attention layers replace the convolutional ones. This allows us to abandon any assumptions about the action space and board topology. We implement the method within the Regular Boardgames GGP system and show that we can build models outperforming the UCT baseline for most games efficiently. Michal Maras, Michal Kepa, Jakub Kowalski, Marek Szykula |
AAAI | 2 |