EDBT 2026 Demo / reviewers in the wild / expert
Edoardo D'Amico
dblp:275/0110
· DBLP profile ↗
8ranked-venue papers in the field
3as first author
8since 2021 · last 2026
0000-0002-8262-7207ORCID · verified
Domains — venue-derived; a paper can count in several
Information Retrieval & Web Search · 6 (1 first)Data Mining & Knowledge Discovery · 1 (1 first)Knowledge Engineering, Semantic Web & Information Systems · 1 (1 first)
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Don't Get Bored: Enhancing Scalability and Diversity in Session-Based Slate RecommendationabstractReinforcement learning (RL) has demonstrated great potential to improve slate-based recommender systems by optimizing long-term user engagement. However, addressing the combinatorial action space in slate recommendations remains challenging. Recent work decomposes slate Q -values into item-wise Q -values, improving the tractability of value-based methods to learn the model. But in scenarios with a large item pool and a resource-intensive value function like deep neural networks, the action selection process still incurs substantial computational costs. Slow training might be tolerable, but high costs during action selection could hinder real-time deployment. To address this issue, this article introduces an actor method that reduces Q -function evaluations to a subset of items, significantly cutting inference time for practical deployment. The research suggests acquiring representations at both item and slate levels, strategically identifying a specific item subset for slate composition. The proposed methodologies are assessed over different simulated user engagement behaviors: users certain about preferences (“decisive” behavior) and those more exploratory or bored users, losing interest with repetitive content exposure (“explorative” behavior). Empirical evaluation shows that the proposed approach achieves comparable user engagement with a value-based policy across behaviors. Meanwhile, it notably enhances serving time while recommending diverse topic slates, thus demonstrating its potential effectiveness and efficiency in real-world applications. Aayush Singha Roy, Edoardo D'Amico, Elias Z. Tragos, Aonghus Lawlor, Neil J. Hurley |
Trans. Recomm. Syst. | 2 |
| 2025 | Evaluating Podcast Recommendations with Profile-Aware LLM-as-a-JudgeabstractEvaluating personalized recommendations remains a central challenge, especially in long-form audio domains like podcasts, where traditional offline metrics suffer from exposure bias and online methods such as A/B testing are costly and operationally constrained. In this paper, we propose a novel framework that leverages Large Language Models (LLMs) as offline judges to assess the quality of podcast recommendations in a scalable and interpretable manner. Our two-stage profile-aware approach first constructs natural-language user profiles distilled from 90 days of listening history. These profiles summarize both topical interests and behavioral patterns, serving as compact, interpretable representations of user preferences. Rather than prompting the LLM with raw data, we use these profiles to provide high-level, semantically rich context-enabling the LLM to reason more effectively about alignment between a user's interests and recommended episodes. This reduces input complexity and improves interpretability. The LLM is then prompted to deliver fine-grained pointwise and pairwise judgments based on the profile-episode match. In a controlled study with 47 participants, our profile-aware judge matched human judgments with high fidelity and outperformed or matched a variant using raw listening histories. The framework enables efficient, profile-aware evaluation for iterative testing and model selection in recommender systems. Francesco Fabbri, Gustavo Penha, Edoardo D'Amico, Alice Wang 0001, Marco De Nadai, Jackie Doremus, Paul Gigioli, Andreas Damianou, Oskar Stål, Mounia Lalmas-Roelleke |
RecSys | 3 |
| 2025 | Semantic IDs for Joint Generative Search and Recommendation
Gustavo Penha, Edoardo D'Amico, Marco De Nadai, Enrico Palumbo, Alexandre Tamborrino, Ali Vardasbi, Max Lefarov, Shawn Lin, Timothy Christopher Heath, Francesco Fabbri, Hugues Bouchard |
RecSys | 2 |
| 2024 | Rs4rs: Semantically Find Recent Publications from Top Recommendation System-Related VenuesabstractRs4rs is a web application designed to perform semantic search on recent papers from top conferences and journals related to Recommender Systems. Current scholarly search engine tools like Google Scholar, Semantic Scholar, and ResearchGate often yield broad results that fail to target the most relevant high-quality publications. Moreover, manually visiting individual conference and journal websites is a time-consuming process that primarily supports only syntactic searches. Rs4rs addresses these issues by providing a user-friendly platform where researchers can input their topic of interest and receive a list of recent, relevant papers from top Recommender Systems venues. Utilizing semantic search techniques, Rs4rs ensures that the search results are not only precise and relevant but also comprehensive, capturing papers regardless of variations in wording. This tool significantly enhances research efficiency and accuracy, thereby benefitting the research community and public by facilitating access to high-quality, pertinent academic resources in the field of Recommender Systems. Rs4rs is available at https://rs4rs.com. Tri Kurniawan Wijaya, Edoardo D'Amico, Gábor Fodor 0002, Manuel V. Loureiro |
RecSys | 2 |
| 2023 | Item Graph Convolution Collaborative Filtering for Inductive Recommendations
Edoardo D'Amico, Khalil Muhammad, Elias Z. Tragos, Barry Smyth, Neil J. Hurley, Aonghus Lawlor |
ECIR (1) | 1 |
| 2023 | Pure Spectral Graph Embeddings: Reinterpreting Graph Convolution for Top-N Recommendation
Edoardo D'Amico, Aonghus Lawlor, Neil J. Hurley |
PAKDD (3) | 1 |
| 2023 | Scalable Deep Q-Learning for Session-Based Slate RecommendationabstractReinforcement learning (RL) has demonstrated great potential to improve slate-based recommender systems by optimizing recommendations for long-term user engagement. To handle the combinatorial action space in slate recommendation, recent works decompose the Q-value of a slate into item-wise Q-values, using an item-wise value-based policy. However, the common case where the value function is a parameterized function taking state and action as input results in a linearly increasing number of evaluations required to select an action, proportional to the number of candidate items. While slow training may be acceptable, this becomes intractable when considering the costly evaluation of the parameterized function, such as with deep neural networks, during model serving time. To address this issue, we propose an actor-based policy that reduces the evaluation of the Q-function to a subset of items, significantly reducing inference time and enabling practical deployment in real-world industrial settings. In our empirical evaluation, we demonstrate that our proposed approach achieves equivalent user session engagement to a value-based policy, while significantly reducing the slate serving time by at least 4 times. Aayush Singha Roy, Edoardo D'Amico, Elias Z. Tragos, Aonghus Lawlor, Neil J. Hurley |
RecSys | 2 |
| 2022 | Analyzing and improving stability of matrix factorization for recommender systems
Edoardo D'Amico, Giovanni Gabbolini, Cesare Bernardis, Paolo Cremonesi |
J. Intell. Inf. Syst. | 1 |