Demo Data from EDBT 2026 / reviewers in the wild / expert
Marco Pratticò
dblp:381/4655
· 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 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 · 61% Kernel, tree and ensemble methods · 30% Optimization for machine learning · 9% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Kernel, tree and ensemble methods › kernel embedding
conditional mean embedding |
0.8 | 1 | 2024 | Operator World Models for Reinforcement Learning · NeurIPS 2024 |
Machine learning › Reinforcement learning › policy optimization
policy mirror descent |
0.8 | 1 | 2024 | Operator World Models for Reinforcement Learning · NeurIPS 2024 |
Machine learning › Reinforcement learning › model-based reinforcement learning › model learning
world model learning |
0.8 | 1 | 2024 | Operator World Models for Reinforcement Learning · NeurIPS 2024 |
Machine learning › Optimization for machine learning
convergence analysis |
0.2 | 1 | 2024 | Operator World Models for Reinforcement Learning · NeurIPS 2024 |
Methods — techniques the papers use, named apart from their topics
policy mirror descent · 0.8operator theory · 0.8conditional mean embedding · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Operator World Models for Reinforcement LearningabstractPolicy Mirror Descent (PMD) is a powerful and theoretically sound methodology for sequential decision-making. However, it is not directly applicable to Reinforcement Learning (RL) due to the inaccessibility of explicit action-value functions. We address this challenge by introducing a novel approach based on learning a world model of the environment using conditional mean embeddings. Leveraging tools from operator theory we derive a closed-form expression of the action-value function in terms of the world model via simple matrix operations. Combining these estimators with PMD leads to POWR, a new RL algorithm for which we prove convergence rates to the global optimum. Preliminary experiments in finite and infinite state settings support the effectiveness of our method. Pietro Novelli, Marco Pratticò, Massimiliano Pontil, Carlo Ciliberto |
NeurIPS | 2 |