Dawen Liang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Dawen Liang has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Nathan Kallus
Cornell University Cornell University Cornell University
6 shared publications - Harald Steck
Netflix Inc., Los Gatos, CA, USA
5 shared publications - Julian McAuley
University of California San Diego, La Jolla, USA
4 shared publications - Zhankui He
University of California, San Diego, San Diego, USA
3 shared publications - Zhouhang Xie
University of California, San Diego, La Jolla, California, USA
3 shared publications - Rahul Jha
Netflix Inc., Los Gatos, California, USA
2 shared publications
Latest Publications
- Open Access
- 22 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 3323-3334
Collaborative Retrieval for Large Language Model-based Conversational Recommender Systems
- 22 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 3323-3334
Open AccessCollaborative Retrieval for Large Language Model-based Conversational Recommender Systems
- Open Access
- 22 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 3885-3895
Does Weighting Improve Matrix Factorization for Recommender Systems?
- 22 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 3885-3895
Open AccessDoes Weighting Improve Matrix Factorization for Recommender Systems?
- Open Access
- 10 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 866-875
Reindex-Then-Adapt: Improving Large Language Models for Conversational Recommendation
Large Language Models (LLMs) are revolutionizing conversational recommender systems (CRS) by effectively indexing item content, understanding complex conversational contexts, and generating relevant item titles. However, the autoregressive nature of LLMs, which outputs item titles as a long sequence of subtokens, hinders the ability to efficiently obtain and control recommendations across the entire item set. This challenge in calculating probabilities over all items limits LLMs' potential, such as (1) limiting control over recommendation popularities and (2) preventing the synergy of marrying LLMs and traditional recommender systems (RecSys). To address this challenge, we propose the Reindex-Then-Adapt (RTA) framework. It consists of two steps: (1) Reindex: a lightweight network learns to condense multi-token item titles into single tokens within the LLM and distills LLM-generated recommendations as ranked lists. This bypasses the autoregressive nature of LLMs while trying to preserve their CRS abilities; (2) Adapt: LLMs after reindexing enable efficient adjustment of probability distributions over single-token titles, further enhanced through RecSys integration. RTA bridges the strengths of LLMs and RecSys, enabling understanding of complex queries as LLMs do, while efficiently controlling recommended item distributions as in traditional RecSys. We show the effectiveness of our RTA over base LLMs across three CRS datasets with negligible additional parameters.
- 10 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 866-875
Open AccessReindex-Then-Adapt: Improving Large Language Models for Conversational Recommendation
Large Language Models (LLMs) are revolutionizing conversational recommender systems (CRS) by effectively indexing item content, understanding complex conversational contexts, and generating relevant item titles. However, the autoregressive nature of LLMs, which outputs item titles as a long sequence of subtokens, hinders the ability to efficiently obtain and control recommendations across the entire item set. This challenge in calculating probabilities over all items limits LLMs' potential, such as (1) limiting control over recommendation popularities and (2) preventing the synergy of marrying LLMs and traditional recommender systems (RecSys). To address this challenge, we propose the Reindex-Then-Adapt (RTA) framework. It consists of two steps: (1) Reindex: a lightweight network learns to condense multi-token item titles into single tokens within the LLM and distills LLM-generated recommendations as ranked lists. This bypasses the autoregressive nature of LLMs while trying to preserve their CRS abilities; (2) Adapt: LLMs after reindexing enable efficient adjustment of probability distributions over single-token titles, further enhanced through RecSys integration. RTA bridges the strengths of LLMs and RecSys, enabling understanding of complex queries as LLMs do, while efficiently controlling recommended item distributions as in traditional RecSys. We show the effectiveness of our RTA over base LLMs across three CRS datasets with negligible additional parameters.
- Open Access
- 8 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 1045-1050
Neighborhood-Based Collaborative Filtering for Conversational Recommendation
Conversational recommender systems (CRS) should understand users’ expressed interests, which are frequently semantically rich and knowledge-intensive. Prior works attempt to address this challenge by using external knowledge bases or parametric knowledge in large language models (LLMs). In this paper, we study a complementary solution, exploiting item knowledge in the training data. We hypothesize that many inference-time user requests can be answered by reusing popular crowd-written answers associated with similar training queries. Following this intuition, we define a class of neighborhood-based CRS that makes recommendations by identifying items commonly associated with similar training dialogue contexts. Experiments on Inspired, Redial, and Reddit-Movie benchmarks show our method outperforms state-of-the-art LLMs with 2 billion parameters, and offers on-par performance to 7 billion parameter models while using over 170 times less GPU memory. We also show neighborhood and model-based predictions can be combined to achieve further performance improvements1.
- 8 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 1045-1050
Open AccessNeighborhood-Based Collaborative Filtering for Conversational Recommendation
Conversational recommender systems (CRS) should understand users’ expressed interests, which are frequently semantically rich and knowledge-intensive. Prior works attempt to address this challenge by using external knowledge bases or parametric knowledge in large language models (LLMs). In this paper, we study a complementary solution, exploiting item knowledge in the training data. We hypothesize that many inference-time user requests can be answered by reusing popular crowd-written answers associated with similar training queries. Following this intuition, we define a class of neighborhood-based CRS that makes recommendations by identifying items commonly associated with similar training dialogue contexts. Experiments on Inspired, Redial, and Reddit-Movie benchmarks show our method outperforms state-of-the-art LLMs with 2 billion parameters, and offers on-par performance to 7 billion parameter models while using over 170 times less GPU memory. We also show neighborhood and model-based predictions can be combined to achieve further performance improvements1.
- Open Access
- 13 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 3576-3585
Off-Policy Evaluation for Large Action Spaces via Policy Convolution
Developing accurate off-policy estimators is crucial for both evaluating and optimizing for new policies. The main challenge in off-policy estimation is the distribution shift between the logging policy that generates data and the target policy that we aim to evaluate. Typically, techniques for correcting distribution shift involve some form of importance sampling. This approach results in unbiased value estimation but often comes with the trade-off of high variance. Furthermore, importance sampling relies on the common support assumption, which becomes impractical when the action space is large. To address these challenges, we introduce the Policy Convolution (PC) family of estimators for the contextual bandit setting. These methods leverage latent structure within actions---made available through action embeddings---to strategically convolve the logging and target policies. This convolution introduces a unique bias-variance trade-off, that can be controlled via the amount of convolution. Our experiments on synthetic and benchmark datasets demonstrate remarkable mean squared error (MSE) improvements when using PC, especially when either the action space or policy mismatch becomes large, with gains of up to 5-6 orders of magnitude over existing estimators.
- 13 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 3576-3585
Open AccessOff-Policy Evaluation for Large Action Spaces via Policy Convolution
Developing accurate off-policy estimators is crucial for both evaluating and optimizing for new policies. The main challenge in off-policy estimation is the distribution shift between the logging policy that generates data and the target policy that we aim to evaluate. Typically, techniques for correcting distribution shift involve some form of importance sampling. This approach results in unbiased value estimation but often comes with the trade-off of high variance. Furthermore, importance sampling relies on the common support assumption, which becomes impractical when the action space is large. To address these challenges, we introduce the Policy Convolution (PC) family of estimators for the contextual bandit setting. These methods leverage latent structure within actions---made available through action embeddings---to strategically convolve the logging and target policies. This convolution introduces a unique bias-variance trade-off, that can be controlled via the amount of convolution. Our experiments on synthetic and benchmark datasets demonstrate remarkable mean squared error (MSE) improvements when using PC, especially when either the action space or policy mismatch becomes large, with gains of up to 5-6 orders of magnitude over existing estimators.
- Top Cited PapersOpen Access
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 720-730
Large Language Models as Zero-Shot Conversational Recommenders
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 720-730
Top Cited PapersOpen AccessLarge Language Models as Zero-Shot Conversational Recommenders