Harald Steck
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Harald Steck has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Nathan Kallus
Cornell University Cornell University Cornell University
6 shared publications - Dawen Liang
Netflix, Inc., Los Gatos, CA, USA
5 shared publications - Julian McAuley
University of California San Diego, La Jolla, USA
3 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.
- Top Cited PapersOpen Access
- 13 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 887-890
Is Cosine-Similarity of Embeddings Really About Similarity?
Cosine-similarity is the cosine of the angle between two vectors, or equivalently the dot product between their normalizations. A popular application is to quantify semantic similarity between high-dimensional objects by applying cosine-similarity to a learned low-dimensional feature embedding. This can work better but sometimes also worse than the unnormalized dot-product between embedded vectors in practice. To gain insight into this empirical observation, we study embeddings derived from regularized linear models, where closed-form solutions facilitate analytical insights. We derive analytically how cosine-similarity can yield arbitrary and therefore meaningless 'similarities.' For some linear models the similarities are not even unique, while for others they are implicitly controlled by the regularization. We discuss implications beyond linear models: a combination of different regularizations are employed when learning deep models; these have implicit and unintended effects when taking cosine-similarities of the resulting embeddings, rendering results opaque and possibly arbitrary. Based on these insights, we caution against blindly using cosine-similarity and outline alternatives.
- 13 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 887-890
Top Cited PapersOpen AccessIs Cosine-Similarity of Embeddings Really About Similarity?
Cosine-similarity is the cosine of the angle between two vectors, or equivalently the dot product between their normalizations. A popular application is to quantify semantic similarity between high-dimensional objects by applying cosine-similarity to a learned low-dimensional feature embedding. This can work better but sometimes also worse than the unnormalized dot-product between embedded vectors in practice. To gain insight into this empirical observation, we study embeddings derived from regularized linear models, where closed-form solutions facilitate analytical insights. We derive analytically how cosine-similarity can yield arbitrary and therefore meaningless 'similarities.' For some linear models the similarities are not even unique, while for others they are implicitly controlled by the regularization. We discuss implications beyond linear models: a combination of different regularizations are employed when learning deep models; these have implicit and unintended effects when taking cosine-similarities of the resulting embeddings, rendering results opaque and possibly arbitrary. Based on these insights, we caution against blindly using cosine-similarity and outline alternatives.
- 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
- 1 August 2007
- Published by Elsevier in Journal of Thoracic Oncology
- Vol. 2 (8) , S407
D6-03: Proliferation and ‘invasiveness’ gene-expression signatures predict survival of surgically treated non-small-cell lung cancer
- 1 August 2007
- Published by Elsevier in Journal of Thoracic Oncology
- Vol. 2 (8) , S407
D6-03: Proliferation and ‘invasiveness’ gene-expression signatures predict survival of surgically treated non-small-cell lung cancer