EDBT 2026 Demo / reviewers in the wild / expert
Alice Wang 0001
dblp:45/2992-1 · also Alice Y. Wang 0001
· DBLP profile ↗
11ranked-venue papers in the field
1as first author
10since 2021 · last 2025
0000-0001-8827-3780ORCID · verified
Domains — venue-derived; a paper can count in several
Information Retrieval & Web Search · 11 (1 first)
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Contextualizing Spotify's Audiobook List Recommendations with Descriptive Shelves
Gustavo Penha, Alice Wang 0001, Martin Achenbach, Kristen Sheets, Sahitya Mantravadi, Remi Galvez, Nico Guetta-Jeanrenaud, Divya Narayanan, Ofeliya Kalaydzhyan, Hugues Bouchard |
ECIR (5) | 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 | 4 |
| 2025 | Unbiased Identification of Broadly Appealing Content Using a Pure Exploration Infinitely Armed Bandit StrategyabstractPodcasting is an increasingly popular medium for entertainment and discourse around the world, with tens of thousands of new podcasts released on a monthly basis. We consider the problem of identifying from these newly released podcasts those with the largest potential audiences so they can be considered for personalized recommendation to users. We first study and then discard a supervised approach due to the inadequacy of either content or consumption features for this task and instead propose a novel non-contextual bandit algorithm in the fixed-budget infinitely armed pure-exploration setting. We demonstrate that our algorithm is well suited to the best-arm identification task for a broad class of arm reservoir distributions, out-competing a large number of state-of-the-art algorithms. We then apply the algorithm to identifying podcasts with broad appeal in a simulated study and show that it efficiently sorts podcasts into groups by increasing appeal while avoiding the popularity bias inherent in supervised approaches. Finally, we study a setting in which users are more likely to stream more-streamed podcasts independent of their general appeal and find that our proposed algorithm is robust to this type of popularity bias. 1 Maryam Aziz, Jesse Anderton, Kevin Jamieson 0001, Alice Wang 0001, Hugues Bouchard, Javed A. Aslam |
Trans. Recomm. Syst. | 4 |
| 2023 | Graph Learning for Exploratory Query Suggestions in an Instant Search SystemabstractSearch systems in online content platforms are typically biased toward a minority of highly consumed items, reflecting the most common user behavior of navigating toward content that is already familiar and popular. Query suggestions are a powerful tool to support query formulation and to encourage exploratory search and content discovery. However, classic approaches for query suggestions typically rely either on semantic similarity, which lacks diversity and does not reflect user searching behavior, or on a collaborative similarity measure mined from search logs, which suffers from data sparsity and is biased by highly popular queries. In this work, we argue that the task of query suggestion can be modelled as a link prediction task on a heterogeneous graph including queries and documents, enabling Graph Learning methods to effectively generate query suggestions encompassing both semantic and collaborative information. We perform an offline evaluation on an internal Spotify dataset of search logs and on two public datasets, showing that node2vec leads to an accurate and diversified set of results, especially on the large scale real-world data. We then describe the implementation in an instant search scenario and discuss a set of additional challenges tied to the specific production environment. Finally, we report the results of a large scale A/B test involving millions of users and prove that node2vec query suggestions lead to an increase in online metrics such as coverage (+1.42% shown search results pages with suggestions) and engagement (+1.21% clicks), with a specifically notable boost in the number of clicks on exploratory search queries (+9.37%). Enrico Palumbo, Andreas Damianou, Alice Wang 0001, Alva Liu, Ghazal Fazelnia, Francesco Fabbri, Fabrizio Silvestri, Hugues Bouchard, Claudia Hauff, Mounia Lalmas-Roelleke, Ben Carterette, Praveen Chandar, David Nyhan |
CIKM | 3 |
| 2023 | Improving Content Retrievability in Search with Controllable Query GenerationabstractAn important goal of online platforms is to enable content discovery, i.e. allow users to find a catalog entity they were not familiar with. A pre-requisite to discover an entity, e.g. a book, with a search engine is that the entity is retrievable, i.e. there are queries for which the system will surface such entity in the top results. However, machine-learned search engines have a high retrievability bias, where the majority of the queries return the same entities. This happens partly due to the predominance of narrow intent queries, where users create queries using the title of an already known entity, e.g. in book search “harry potter”. The amount of broad queries where users want to discover new entities, e.g. in music search “chill lyrical electronica with an atmospheric feeling to it”, and have a higher tolerance to what they might find, is small in comparison. We focus here on two factors that have a negative impact on the retrievability of the entities (I) the training data used for dense retrieval models and (II) the distribution of narrow and broad intent queries issued in the system. We propose CtrlQGen, a method that generates queries for a chosen underlying intent—narrow or broad. We can use CtrlQGen to improve factor (I) by generating training data for dense retrieval models comprised of diverse synthetic queries. CtrlQGen can also be used to deal with factor (II) by suggesting queries with broader intents to users. Our results on datasets from the domains of music, podcasts, and books reveal that we can significantly decrease the retrievability bias of a dense retrieval model when using CtrlQGen. First, by using the generated queries as training data for dense models we make 9% of the entities retrievable—go from zero to non-zero retrievability. Second, by suggesting broader queries to users, we can make 12% of the entities retrievable in the best case. Gustavo Penha, Enrico Palumbo, Maryam Aziz, Alice Wang 0001, Hugues Bouchard |
WWW | 4 |
| 2022 | Time after Time: Longitudinal Trends in Nostalgic Listening
Clara Hanson, Jesse Anderton, Samuel F. Way, Ian Anderson 0003, Scott Wolf, Alice Wang 0001 |
ICWSM | 6 |
| 2022 | Identifying New Podcasts with High General Appeal Using a Pure Exploration Infinitely-Armed Bandit StrategyabstractPodcasting is an increasingly popular medium for entertainment and discourse around the world, with tens of thousands of new podcasts released on a monthly basis. We consider the problem of identifying from these newly-released podcasts those with the largest potential audiences so they can be considered for personalized recommendation to users. We first study and then discard a supervised approach due to the inadequacy of either content or consumption features for this task, and instead propose a novel non-contextual bandit algorithm in the fixed-budget infinitely-armed pure-exploration setting. We demonstrate that our algorithm is well-suited to the best-arm identification task for a broad class of arm reservoir distributions, out-competing a large number of state-of-the-art algorithms. We then apply the algorithm to identifying podcasts with broad appeal in a simulated study, and show that it efficiently sorts podcasts into groups by increasing appeal while avoiding the popularity bias inherent in supervised approaches. Maryam Aziz, Jesse Anderton, Kevin Jamieson 0001, Alice Wang 0001, Hugues Bouchard, Javed A. Aslam |
RecSys | 4 |
| 2022 | Sequential Recommendation via Stochastic Self-AttentionabstractSequential recommendation models the dynamics of a user’s previous behaviors in order to forecast the next item, and has drawn a lot of attention. Transformer-based approaches, which embed items as vectors and use dot-product self-attention to measure the relationship between items, demonstrate superior capabilities among existing sequential methods. However, users’ real-world sequential behaviors are uncertain rather than deterministic, posing a significant challenge to present techniques. We further suggest that dot-product-based approaches cannot fully capture collaborative transitivity, which can be derived in item-item transitions inside sequences and is beneficial for cold start items. We further argue that BPR loss has no constraint on positive and sampled negative items, which misleads the optimization. Ziwei Fan 0001, Zhiwei Liu 0001, Yu Wang 0158, Alice Wang 0001, Zahra Nazari, Lei Zheng 0001, Hao Peng 0001, Philip S. Yu |
WWW | 4 |
| 2021 | Leveraging Semantic Information to Facilitate the Discovery of Underserved PodcastsabstractPodcasts are a popular medium for rapid dissemination of information, entertainment, and casual conversations. Content aggregators are taking an increased interest in recommending podcasts to listeners to help them build larger audiences. With many podcasts released every day, many podcasts that would be of interest to listeners remain underserved by these recommendation systems. In this paper, we study variables related to podcast appeal to listeners selected at random in a large online study, in a production setting, involving more than five million recommendations. We present the results of two observational studies, which suggests that underserved podcast have the potential to grow their audiences. To mitigate the rich-get-richer effect, we propose leveraging semantic information, via means of knowledge graphs, to recommend underserved podcasts to listeners. Finally, we conduct empirical experiments that show our method is effective at recommending underserved podcasts, in comparison to baseline methods that rely on listening behavior. Maryam Aziz, Alice Wang 0001, Aasish Pappu, Hugues Bouchard, Yu Zhao 0002, Ben Carterette, Mounia Lalmas-Roelleke |
CIKM | 2 |
| 2021 | Representation of Music Creators on Wikipedia, Differences in Gender and Genre
Alice Wang 0001, Aasish Pappu, Henriette Cramer |
ICWSM | 1 |
| 2020 | Do podcasts and music compete with one another? Understanding users' audio streaming habitsabstractOver the past decade, podcasts have been one of the fastest growing online streaming media. Many online audio streaming platforms such as Pandora, Spotify, etc. that traditionally focused on music content have started to incorporate services related to podcasts. Although incorporating new media types such as podcasts has created tremendous opportunities for these streaming platforms to expand their content offering, it also introduces new challenges. Since the functional use of podcasts and music may largely overlap for many people, the two types of content may compete with one another for the finite amount of time that users may allocate for audio streaming. As a result, incorporating podcast listening may influence and change the way users have originally consumed music. Adopting quasi-experimental techniques, the current study assesses the causal influence of adding a new class of content on user listening behavior by using large scale observational data collected from a widely used audio streaming platform. Our results demonstrate that podcast and music consumption compete slightly but do not replace one another – users open another time window to listen to podcasts. In addition, users who have added podcasts to their music listening demonstrate significantly different consumption habits for podcasts vs. music in terms of the streaming time, duration and frequency. Taking all the differences as input features to a machine learning model, we demonstrate that a podcast listening session is predictable at the start of a new listening session. Our study provides a novel contribution for online audio streaming and consumption services to understand their potential consumers and to best support their current users with an improved recommendation system. Ang Li 0046, Alice Wang 0001, Zahra Nazari, Praveen Chandar, Ben Carterette |
WWW | 2 |