Demo Data from EDBT 2026 / reviewers in the wild / expert
Daniel de Marchi
dblp:270/4781
· DBLP profile ↗
2ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · unresolved
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 first-author
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 › value function estimation
bellman error |
0.7 | 1 | 2023 | Revisiting Bellman Errors for Offline Model Selection · ICML 2023 |
Machine learning › Reinforcement learning
offline reinforcement learning |
0.7 | 1 | 2023 | Revisiting Bellman Errors for Offline Model Selection · ICML 2023 |
Machine learning › Reinforcement learning
value function estimation |
0.7 | 1 | 2023 | Revisiting Bellman Errors for Offline Model Selection · ICML 2023 |
Methods — techniques the papers use, named apart from their topics
q-function · 0.7mean squared bellman error · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Revisiting Bellman Errors for Offline Model SelectionabstractOffline model selection (OMS), that is, choosing the best policy from a set of many policies given only logged data, is crucial for applying offline RL in real-world settings. One idea that has been extensively explored is to select policies based on the mean squared Bellman error (MSBE) of the associated Q-functions. However, previous work has struggled to obtain adequate OMS performance with Bellman errors, leading many researchers to abandon the idea. To this end, we elucidate why previous work has seen pessimistic results with Bellman errors and identify conditions under which OMS algorithms based on Bellman errors will perform well. Moreover, we develop a new estimator of the MSBE that is more accurate than prior methods. Our estimator obtains impressive OMS performance on diverse discrete control tasks, including Atari games. Joshua P. Zitovsky, Daniel de Marchi, Rishabh Agarwal, Michael R. Kosorok |
ICML | 2 |
| 2020 | Augmenting Molecular Images with Vector Representations as a Featurization Technique for Drug ClassificationabstractOne of the key steps in building deep learning systems for drug classification and generation is the choice of featurization for the molecules. Previous featurization methods have included molecular images, binary strings, graphs, and SMILES strings. This paper proposes the creation of molecular images "captioned" with binary vectors that encode information not contained in or easily understood from a molecular image alone. Specifically, we use Morgan fingerprints, which encode higher level structural information, and MACCS keys, which encode yes/no questions about a molecule's properties and structure. We tested our method on the HIV dataset published by the Pande lab, which consists of 41,127 molecules labeled by if they inhibit the HIV virus. Our final model achieved a state-of-the-art AUC-ROC on the HIV dataset, outperforming all other methods. Moreover, the model converged significantly faster than most other methods, requiring dramatically less computational power than unaugmented images. Daniel de Marchi, Amarjit Budhiraja |
ICASSP | 1 |