Demo Data from EDBT 2026 / reviewers in the wild / expert
Flavio Mazzolini
dblp:259/1642
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › dynamic programming › value iteration
fitted q-iteration |
0.4 | 1 | 2020 | Control Frequency Adaptation via Action Persistence in Batch Reinforcement Learning · ICML 2020 |
Machine learning › Reinforcement learning
offline reinforcement learning |
0.4 | 1 | 2020 | Control Frequency Adaptation via Action Persistence in Batch Reinforcement Learning · ICML 2020 |
Machine learning › Reinforcement learning
value function estimation |
0.1 | 1 | 2020 | Control Frequency Adaptation via Action Persistence in Batch Reinforcement Learning · ICML 2020 |
Methods — techniques the papers use, named apart from their topics
persistence selection heuristic · 0.4fitted q-iteration · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Control Frequency Adaptation via Action Persistence in Batch Reinforcement LearningabstractThe choice of the control frequency of a system has a relevant impact on the ability of reinforcement learning algorithms to learn a highly performing policy. In this paper, we introduce the notion of action persistence that consists in the repetition of an action for a fixed number of decision steps, having the effect of modifying the control frequency. We start analyzing how action persistence affects the performance of the optimal policy, and then we present a novel algorithm, Persistent Fitted Q-Iteration (PFQI), that extends FQI, with the goal of learning the optimal value function at a given persistence. After having provided a theoretical study of PFQI and a heuristic approach to identify the optimal persistence, we present an experimental campaign on benchmark domains to show the advantages of action persistence and proving the effectiveness of our persistence selection method. Alberto Maria Metelli, Flavio Mazzolini, Lorenzo Bisi, Luca Sabbioni, Marcello Restelli |
ICML | 2 |