Demo Data from VLDB 2026 / reviewers in the wild / expert
Christiano Coletto Christakou
dblp:243/3112
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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 |
Learning paradigms · 44% Reinforcement learning · 44% Robot manipulation · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning paradigms
curriculum learning |
0.4 | 1 | 2019 | Curriculum Learning for Cumulative Return Maximization · IJCAI 2019 |
Machine learning › Reinforcement learning
exploration |
0.4 | 1 | 2019 | Curriculum Learning for Cumulative Return Maximization · IJCAI 2019 |
Robotics › Robot manipulation › robot programming
task sequencing |
0.1 | 1 | 2019 | Curriculum Learning for Cumulative Return Maximization · IJCAI 2019 |
Methods — techniques the papers use, named apart from their topics
meta-heuristic optimization · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Curriculum Learning for Cumulative Return MaximizationabstractCurriculum learning has been successfully used in reinforcement learning to accelerate the learning process, through knowledge transfer between tasks of increasing complexity. Critical tasks, in which suboptimal exploratory actions must be minimized, can benefit from curriculum learning, and its ability to shape exploration through transfer. We propose a task sequencing algorithm maximizing the cumulative return, that is, the return obtained by the agent across all the learning episodes. By maximizing the cumulative return, the agent not only aims at achieving high rewards as fast as possible, but also at doing so while limiting suboptimal actions. We experimentally compare our task sequencing algorithm to several popular metaheuristic algorithms for combinatorial optimization, and show that it achieves significantly better performance on the problem of cumulative return maximization. Furthermore, we validate our algorithm on a critical task, optimizing a home controller for a micro energy grid. Francesco Foglino, Christiano Coletto Christakou, Ricardo Luna 0001, Matteo Leonetti |
IJCAI | 2 |