Ali Vardasbi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Ali Vardasbi has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Hugues Bouchard
Spotify, Barcelona, Spain
4 shared publications - Enrico Palumbo
Spotify, Turin, Italy
3 shared publications - Gustavo Penha
Tech Research, Spotify, Amsterdam, Netherlands
3 shared publications - Maarten de Rijke
University of Amsterdam, Amsterdam, Netherlands
3 shared publications - Claudia Hauff
Spotify, Delft, Netherlands
2 shared publications - Harrie Oosterhuis
University of Amsterdam, Amsterdam, Netherlands
2 shared publications
Latest Publications
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 4938-4943
As It Was: Aligning LLM Search Evaluation with Historical User Preferences
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 4938-4943
Open AccessAs It Was: Aligning LLM Search Evaluation with Historical User Preferences
- 2 January 2026
- Published by Springer Nature
- p. 3-15
Adaptive Repetition for Mitigating Position Bias in LLM-Based Ranking
- 2 January 2026
- Published by Springer Nature
- p. 3-15
Adaptive Repetition for Mitigating Position Bias in LLM-Based Ranking
- Open Access
- 22 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 1117-1121
You Say Search, I Say Recs: A Scalable Agentic Approach to Query Understanding and Exploratory Search at Spotify
- 22 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 1117-1121
Open AccessYou Say Search, I Say Recs: A Scalable Agentic Approach to Query Understanding and Exploratory Search at Spotify
- Open Access
- 8 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 340-349
Bridging Search and Recommendation in Generative Retrieval: Does One Task Help the Other?
Generative retrieval for search and recommendation is a promising paradigm for retrieving items, offering an alternative to traditional methods that depend on external indexes and nearest-neighbor searches. Instead, generative models directly associate inputs with item IDs. Given the breakthroughs of Large Language Models (LLMs), these generative systems can play a crucial role in centralizing a variety of Information Retrieval (IR) tasks in a single model that performs tasks such as query understanding, retrieval, recommendation, explanation, re-ranking, and response generation. Despite the growing interest in such a unified generative approach for IR systems, the advantages of using a single, multi-task model over multiple specialized models are not well established in the literature. This paper investigates whether and when such a unified approach can outperform task-specific models in the IR tasks of search and recommendation, broadly co-existing in multiple industrial online platforms, such as Spotify, YouTube, and Netflix. Previous work shows that (1) the latent representations of items learned by generative recommenders are biased towards popularity, and (2) content-based and collaborative-filtering-based information can improve an item’s representations. Motivated by this, our study is guided by two hypotheses: [H1] the joint training regularizes the estimation of each item’s popularity, and [H2] the joint training regularizes the item’s latent representations, where search captures content-based aspects of an item and recommendation captures collaborative-filtering aspects. Our extensive experiments with both simulated and real-world data support both [H1] and [H2] as key contributors to the effectiveness improvements observed in the unified search and recommendation generative models over the single-task approaches.
- 8 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 340-349
Open AccessBridging Search and Recommendation in Generative Retrieval: Does One Task Help the Other?
Generative retrieval for search and recommendation is a promising paradigm for retrieving items, offering an alternative to traditional methods that depend on external indexes and nearest-neighbor searches. Instead, generative models directly associate inputs with item IDs. Given the breakthroughs of Large Language Models (LLMs), these generative systems can play a crucial role in centralizing a variety of Information Retrieval (IR) tasks in a single model that performs tasks such as query understanding, retrieval, recommendation, explanation, re-ranking, and response generation. Despite the growing interest in such a unified generative approach for IR systems, the advantages of using a single, multi-task model over multiple specialized models are not well established in the literature. This paper investigates whether and when such a unified approach can outperform task-specific models in the IR tasks of search and recommendation, broadly co-existing in multiple industrial online platforms, such as Spotify, YouTube, and Netflix. Previous work shows that (1) the latent representations of items learned by generative recommenders are biased towards popularity, and (2) content-based and collaborative-filtering-based information can improve an item’s representations. Motivated by this, our study is guided by two hypotheses: [H1] the joint training regularizes the estimation of each item’s popularity, and [H2] the joint training regularizes the item’s latent representations, where search captures content-based aspects of an item and recommendation captures collaborative-filtering aspects. Our extensive experiments with both simulated and real-world data support both [H1] and [H2] as key contributors to the effectiveness improvements observed in the unified search and recommendation generative models over the single-task approaches.
- Open Access
- 10 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1514-1524
The Impact of Group Membership Bias on the Quality and Fairness of Exposure in Ranking
When learning to rank from user interactions, search and recommender systems must address biases in user behavior to provide a high-quality ranking. One type of bias that has recently been studied in the ranking literature is when sensitive attributes, such as gender, have an impact on a user's judgment about an item's utility. For example, in a search for an expertise area, some users may be biased towards clicking on male candidates over female candidates. We call this type of bias group membership bias. Increasingly, we seek rankings that are fair to individuals and sensitive groups. Merit-based fairness measures rely on the estimated utility of the items. With group membership bias, the utility of the sensitive groups is underestimated, hence, without correcting for this bias, a supposedly fair ranking is not truly fair. In this paper, first, we analyze the impact of group membership bias on ranking quality as well as merit-based fairness metrics and show that group membership bias can hurt both ranking and fairness. Then, we provide a correction method for group bias that is based on the assumption that the utility score of items in different groups comes from the same distribution. This assumption has two potential issues of sparsity and equality-instead-of-equity; we use an amortized approach to address these. We show that our correction method can consistently compensate for the negative impact of group membership bias on ranking quality and fairness metrics.
- 10 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1514-1524
Open AccessThe Impact of Group Membership Bias on the Quality and Fairness of Exposure in Ranking
When learning to rank from user interactions, search and recommender systems must address biases in user behavior to provide a high-quality ranking. One type of bias that has recently been studied in the ranking literature is when sensitive attributes, such as gender, have an impact on a user's judgment about an item's utility. For example, in a search for an expertise area, some users may be biased towards clicking on male candidates over female candidates. We call this type of bias group membership bias. Increasingly, we seek rankings that are fair to individuals and sensitive groups. Merit-based fairness measures rely on the estimated utility of the items. With group membership bias, the utility of the sensitive groups is underestimated, hence, without correcting for this bias, a supposedly fair ranking is not truly fair. In this paper, first, we analyze the impact of group membership bias on ranking quality as well as merit-based fairness metrics and show that group membership bias can hurt both ranking and fairness. Then, we provide a correction method for group bias that is based on the assumption that the utility score of items in different groups comes from the same distribution. This assumption has two potential issues of sparsity and equality-instead-of-equity; we use an amortized approach to address these. We show that our correction method can consistently compensate for the negative impact of group membership bias on ranking quality and fairness metrics.
- Open Access
- 4 March 2024
- Published by Association for Computing Machinery (ACM)
- p. 1118-1121
Unbiased Learning to Rank: On Recent Advances and Practical Applications
Since its inception, the field of unbiased learning to rank (ULTR) has remained very active and has seen several impactful advancements in recent years. This tutorial provides both an introduction to the core concepts of the field and an overview of recent advancements in its foundations, along with several applications of its methods. The tutorial is divided into four parts: Firstly, we give an overview of the different forms of bias that can be addressed with ULTR methods. Secondly, we present a comprehensive discussion of the latest estimation techniques in the ULTR field. Thirdly, we survey published results of ULTR in real-world applications. Fourthly, we discuss the connection between ULTR and fairness in ranking. We end by briefly reflecting on the future of ULTR research and its applications. This tutorial is intended to benefit both researchers and industry practitioners interested in developing new ULTR solutions or utilizing them in real-world applications.
- 4 March 2024
- Published by Association for Computing Machinery (ACM)
- p. 1118-1121
Open AccessUnbiased Learning to Rank: On Recent Advances and Practical Applications
Since its inception, the field of unbiased learning to rank (ULTR) has remained very active and has seen several impactful advancements in recent years. This tutorial provides both an introduction to the core concepts of the field and an overview of recent advancements in its foundations, along with several applications of its methods. The tutorial is divided into four parts: Firstly, we give an overview of the different forms of bias that can be addressed with ULTR methods. Secondly, we present a comprehensive discussion of the latest estimation techniques in the ULTR field. Thirdly, we survey published results of ULTR in real-world applications. Fourthly, we discuss the connection between ULTR and fairness in ranking. We end by briefly reflecting on the future of ULTR research and its applications. This tutorial is intended to benefit both researchers and industry practitioners interested in developing new ULTR solutions or utilizing them in real-world applications.
- Open Access
- 18 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 2532-2541
Repetition and Exploration in Sequential Recommendation
- 18 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 2532-2541
Open AccessRepetition and Exploration in Sequential Recommendation
- Open Access
- 18 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 18-27
On the Impact of Outlier Bias on User Clicks
- 18 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 18-27
Open AccessOn the Impact of Outlier Bias on User Clicks
- Open Access
- 18 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 3440-3443
Recent Advances in the Foundations and Applications of Unbiased Learning to Rank
- 18 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 3440-3443
Open AccessRecent Advances in the Foundations and Applications of Unbiased Learning to Rank