<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>X (A. Pisani);</journal-title>
      </journal-title-group>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Leveraging Semantic Embeddings of User Reviews with Of-the-Shelf LLMs for Recom mender Systems</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Nicola Cecere</string-name>
          <email>nicola.cecere@mail.polimi.it</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andrea Pisani</string-name>
          <email>andrea.pisani@polito.it</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Maurizio Ferrari Dacrema</string-name>
          <email>maurizio.ferrari@polimi.it</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Paolo Cremonesi</string-name>
          <email>paolo.cremonesi@polimi.it</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Politecnico di Milano</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Italy</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Politecnico di Torino</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Italy</string-name>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Large Language Models, User Reviews, Recommendation, Text embedding</string-name>
        </contrib>
      </contrib-group>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0001</lpage>
      <abstract>
        <p>Enhancing Recommender Systems (RS) with plain-text reviews has been a challenging efort despite significant eforts in the past. Recently, Large Language Models (LLMs) have demonstrated exceptional capabilities in understanding natural language semantics, leading to promising applications across various fields. Nonetheless, applying these models to recommendation tasks introduces several challenges, including high computational demands and the potential for generating inaccurate or fabricated content (”hallucinations”). Consequently, instead of directly employing LLMs as generative models for recommendations, our research explores whether embeddings derived from plain-text reviews can enrich traditional recommendation algorithms and analyze the recommendation impact of diferent LLM embeddings with high efectiveness in NLP tasks. We conduct our experimental analysis using two Amazon Review Datasets, and three pre-trained LLM embedding models.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>CEUR
ceur-ws.org</p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <p>
        Recommender systems (RS) are essential tools in navigating the extensive digital catalogs
available today, where users frequently contribute reviews of their chosen items. Historically,
these textual reviews have been underutilized in RS, despite their potential to enhance system
accuracy and user satisfaction [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Recent advancements in Natural Language Understanding,
driven by the development of Large Language Models (LLMs), ofer new opportunities to
leverage these textual reviews efectively. In this study, we investigate the integration of
semantic-rich embeddings generated from LLMs into traditional content-based (CBF) and
collaborative filtering (CF) RS. Our research is driven by two primary objectives: firstly, to show
how traditional RS work when augmented with review embeddings as side information, and
secondly, to conduct a comparative analysis of various LLMs regarding their efectiveness.
      </p>
    </sec>
    <sec id="sec-3">
      <title>2. Background</title>
      <p>
        Numerous methods have been developed to extract information from reviews, however, most
of these techniques are over a decade old and have fallen out of common use. This decline is
largely because review-based RS rarely achieve the recommendation accuracy of CF models
[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. LLM technology has significantly influenced various fields, including RS. These models
are increasingly utilized to provide text-based recommendations, in the form of generative
RS. Employing methods such as pre-training, fine-tuning, and prompt engineering [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], LLMs
improve conversational RS where recommendations are generated through natural language
interactions. Additionally, LLM embeddings serve as auxiliary data to enhance traditional CF
models, using approaches that are similar to this study but applied over diferent textual data,
such as product descriptions.
      </p>
      <p>
        Our interest is in models that incorporate embeddings as side information, enhancing
contextual relevance. UniSRec [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] and Text-based CF (TCF) [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] explore the use of LLM embeddings
in RS. UniSRec integrates these embeddings from various sub-categories of the Amazon
Review Dataset for both pre-training and Parameter-Eficient Fine-Tuning (PEFT) [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], thereby
enhancing its behavior encoder to improve recommendation efectiveness. TCF assesses the
impact of LLM scale on the quality of recommendations. Finally, a recent study on
reviewbased RS demonstrated promising preliminary results, further supporting the potential of these
approaches [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
    </sec>
    <sec id="sec-4">
      <title>3. Models and Methodology</title>
      <p>To evaluate the efectiveness of using review embeddings generated by LLMs as side information
in simple RS models, the following purely CF are used as a baseline:</p>
      <p>
        ItemKNN-CF [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], UserKNN-CF [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], MF [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], SLIM EN [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], GF-CF [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], RP3 [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
      </p>
      <p>Additionally, to explore the integration of LLM embeddings into RS, the following models
have been adapted:
• ItemKNN-CBF-E: a neighbourhood CBF approach. The item features consist of a pooling
(either the mean, the sum or the element-wise maximum) of all the review embeddings
available for it.
• ItemKNN-CFCBF-E - UserKNN-CFCBF-E: a hybrid approach combining CF and CBF.</p>
      <p>The item features concatenate interaction data and pooled review embeddings, weighted
by a hyperparameter.
• RP3 -E: a graph-based approach derived from the RP3 baseline. The review embeddings
are considered as a third class of nodes in the graph. They are pooled by item, so that
each item  will have a corresponding embedding vector   ∈ ℝ .</p>
      <p>
        Two diferent categories of the Amazon Reviews Dataset [
        <xref ref-type="bibr" rid="ref13 ref14">13, 14</xref>
        ] are used: the 2014 version
of the Digital Music category, and the 2012 version of the Fine Foods category. For both datasets,
the preprocessing consisted in extracting the 5-core subgraph, to reduce the datasets size on
account of the computational cost of embedding the reviews using multiple LLMs. Both datasets
are split in train, validation and tests sets. The train sets contain 80% of the corresponding
dataset’s interactions, while the validation and test sets contain 10% each.
      </p>
      <p>
        The plain-text reviews contained in both datasets were embedded using multiple LLMs,
selected from the MTEB Leaderboard [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]: OpenAI’s text-embedding-ada-0021, Wang’s
e5-mistral-7b-instruct [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], and VoyageAI’s voyage-lite-02-instruct2.
      </p>
      <p>
        The hyperparameters of the models presented above are optimized using Bayesian
Optimization [
        <xref ref-type="bibr" rid="ref17 ref18">17, 18</xref>
        ]. We evaluate the models on the top- recommendation task with NDCG at cutof
10. We also report two beyond-accuracy metrics to measure how the recommendations are
distributed: Item Coverage, which represents the quota of items in the catalogue that were
recommended at least once, and Item Coverage Hit, which represents the quota of items in the
catalogue that were recommended correctly at least once.
      </p>
      <p>We investigate the possible presence of consistent trends in recommendation accuracy by
evaluating all models that employ LLM embeddings with three diferent sets of embeddings
presented above. No LLM fine-tuning nor prompt engineering is employed.</p>
    </sec>
    <sec id="sec-5">
      <title>4. Results and Future Investigations</title>
      <p>Table 1 shows evaluation results for the Amazon Music and Fine Foods Dataset. In both cases,
the models that exploit reviews embedded by LLMs as side information fail to outperform the
best performing pure CF baselines in recommendation efectiveness, measured by NDCG. This
is evidence that LLM embeddings do not pair well with simple recommenders, and likely need
more expressive architectures to be interpreted efectively and bring value.</p>
      <p>
        Enriching the side information by pooling the available embeddings did not produce the
expected results. We hypothesize that the method of combination is the core issue, as the
pooling technique described in Section 3 may not adequately preserve the nuances of individual
reviews [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. To address this, we are investigating a novel approach that uses embeddings from
user-preferred item reviews to construct detailed user profiles. These profiles are then used to
compute similarity scores with the single embeddings of other item reviews.
      </p>
      <p>On average, OpenAI’s embedder achieves the highest accuracy on the Amazon Music Dataset
with a mean NDCG of 0.118, surpassing VoyageAI’s embedder by 2.59%. Wang’s embedder
performs the worst, with a mean NDCG of 0.096. Across all models, Wang’s embeddings yield
the lowest recommendation accuracy.</p>
      <p>In the Amazon Fine Foods Dataset, embedders are more balanced. OpenAI’s embeddings
achieve the highest average accuracy (NDCG of 0.647), slightly surpassing Wang’s (0.645) and
VoyageAI’s (0.643).</p>
      <p>The ItemKNN-CBF-E model, relying solely on embeddings, can be useful to establish the
inherent quality of the embeddings for recommendation. It shows the best NDCG for OpenAI
on the Music Dataset (0.128), followed by VoyageAI (0.123) and Wang (0.055). On the Fine Foods
Dataset, OpenAI again leads (NDCG of 0.799), with Wang (0.756) outperforming VoyageAI
(0.747). Notably, the model’s top- parameter for Wang’s embeddings on the Fine Foods Dataset
1https://openai.com/blog/new-and-improved-embedding-model
2https://docs.voyageai.com/docs/embeddings</p>
      <p>Experimental results for models over the Amazon Music and Fine Foods Dataset. Baseline models have
simpler architecture of the models likely limits their ability to process Wang’s complex
embeddings. The efectiveness of LLMs in top-  recommendation does not align with their MTEB
leaderboard positions for NLP tasks. OpenAI’s embedder, despite ranking below 71st (as of
June 2024), is the most efective for recommendation. VoyageAI and Wang, ranked 10th and
12th, perform worse in comparison. Wang’s embedder shows varying efectiveness, sometimes
significantly better or worse than VoyageAI’s despite their close leaderboard positions.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>N.</given-names>
            <surname>Sachdeva</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. J. McAuley</surname>
          </string-name>
          ,
          <article-title>How useful are reviews for recommendation? A critical review and potential improvements</article-title>
          , in: J. X.
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Chang</surname>
          </string-name>
          , X. Cheng, J.
          <string-name>
            <surname>Kamps</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Murdock</surname>
            ,
            <given-names>J.-R.</given-names>
          </string-name>
          <string-name>
            <surname>Wen</surname>
          </string-name>
          , Y. Liu (Eds.),
          <source>Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <string-name>
            <surname>SIGIR</surname>
          </string-name>
          <year>2020</year>
          ,
          <string-name>
            <given-names>Virtual</given-names>
            <surname>Event</surname>
          </string-name>
          , China,
          <source>July 25-30</source>
          ,
          <year>2020</year>
          , ACM,
          <year>2020</year>
          , pp.
          <fpage>1845</fpage>
          -
          <lpage>1848</lpage>
          . doi:
          <volume>10</volume>
          .1145/3397271.3401281.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>W.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Mei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>Recommender systems in the era of large language models (LLMs)</article-title>
          ,
          <source>CoRR abs/2307</source>
          .
          <year>02046</year>
          (
          <year>2023</year>
          ). doi:
          <volume>10</volume>
          .48550/ARXIV. 2307.
          <year>02046</year>
          . arXiv:
          <fpage>2307</fpage>
          .
          <year>02046</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Hou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Mu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Ding</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-R.</given-names>
            <surname>Wen</surname>
          </string-name>
          ,
          <article-title>Towards universal sequence representation learning for recommender systems</article-title>
          , in: A. Zhang, H. Rangwala (Eds.),
          <source>KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining</source>
          , Washington, DC, USA,
          <year>August</year>
          14 -
          <issue>18</issue>
          ,
          <year>2022</year>
          , ACM,
          <year>2022</year>
          , pp.
          <fpage>585</fpage>
          -
          <lpage>593</lpage>
          . doi:
          <volume>10</volume>
          .1145/3534678.3539381.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>R.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Deng</surname>
          </string-name>
          , Y. Cheng,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <article-title>Exploring the upper limits of textbased collaborative filtering using large language models: Discoveries and insights</article-title>
          ,
          <source>CoRR abs/2305</source>
          .11700 (
          <year>2023</year>
          ). doi:
          <volume>10</volume>
          .48550/ARXIV.2305.11700. arXiv:
          <volume>2305</volume>
          .
          <fpage>11700</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>N.</given-names>
            <surname>Houlsby</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Giurgiu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jastrzebski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Morrone</surname>
          </string-name>
          , Q. de Laroussilhe,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gesmundo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Attariyan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gelly</surname>
          </string-name>
          ,
          <article-title>Parameter-eficient transfer learning for NLP</article-title>
          , in: K. Chaudhuri, R. Salakhutdinov (Eds.),
          <source>Proceedings of the 36th International Conference on Machine Learning</source>
          ,
          <string-name>
            <surname>ICML</surname>
          </string-name>
          <year>2019</year>
          ,
          <volume>9</volume>
          -
          <fpage>15</fpage>
          June 2019, Long Beach, California, USA, volume
          <volume>97</volume>
          <source>of Proceedings of Machine Learning Research, PMLR</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>2790</fpage>
          -
          <lpage>2799</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A.</given-names>
            <surname>Pisani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Cecere</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. Ferrari</given-names>
            <surname>Dacrema</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Cremonesi</surname>
          </string-name>
          ,
          <article-title>Pre-trained llm embeddings of product reviews for recommendation</article-title>
          , in: E. Maddalena,
          <string-name>
            <given-names>S.</given-names>
            <surname>Mizzaro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Roitero</surname>
          </string-name>
          , M. Viviani (Eds.),
          <source>Proceedings of the 14th Italian Information Retrieval Workshop (IIR</source>
          <year>2024</year>
          ), Udine, Italy, September 5-
          <issue>6</issue>
          ,
          <year>2024</year>
          , CEUR Workshop Proceedings, CEUR-WS.org,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. P. de Vries</surname>
            ,
            <given-names>M. J. T.</given-names>
          </string-name>
          <string-name>
            <surname>Reinders</surname>
          </string-name>
          ,
          <article-title>Unifying user-based and item-based collaborative ifltering approaches by similarity fusion</article-title>
          , in: E. N.
          <string-name>
            <surname>Efthimiadis</surname>
            ,
            <given-names>S. T.</given-names>
          </string-name>
          <string-name>
            <surname>Dumais</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Hawking</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          Järvelin (Eds.),
          <source>SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          , Seattle, Washington, USA,
          <year>August</year>
          6-
          <issue>11</issue>
          ,
          <year>2006</year>
          , ACM,
          <year>2006</year>
          , pp.
          <fpage>501</fpage>
          -
          <lpage>508</lpage>
          . doi:
          <volume>10</volume>
          .1145/1148170.1148257.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>B. M.</given-names>
            <surname>Sarwar</surname>
          </string-name>
          , G. Karypis,
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Konstan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Riedl</surname>
          </string-name>
          ,
          <article-title>Item-based collaborative filtering recommendation algorithms</article-title>
          , in: V. Y.
          <string-name>
            <surname>Shen</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Saito</surname>
            ,
            <given-names>M. R.</given-names>
          </string-name>
          <string-name>
            <surname>Lyu</surname>
          </string-name>
          , M. E. Zurko (Eds.),
          <source>Proceedings of the Tenth International World Wide Web Conference, WWW 10</source>
          ,
          <string-name>
            <surname>Hong</surname>
            <given-names>Kong</given-names>
          </string-name>
          , China, May 1-
          <issue>5</issue>
          ,
          <year>2001</year>
          , ACM,
          <year>2001</year>
          , pp.
          <fpage>285</fpage>
          -
          <lpage>295</lpage>
          . doi:
          <volume>10</volume>
          .1145/371920.372071.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Koren</surname>
          </string-name>
          ,
          <article-title>Factorization meets the neighborhood: A multifaceted collaborative filtering model</article-title>
          , in: Y.
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Liu</surname>
          </string-name>
          , S. Sarawagi (Eds.),
          <source>Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</source>
          , Las Vegas, Nevada, USA,
          <year>August</year>
          24-
          <issue>27</issue>
          ,
          <year>2008</year>
          , ACM,
          <year>2008</year>
          , pp.
          <fpage>426</fpage>
          -
          <lpage>434</lpage>
          . doi:
          <volume>10</volume>
          .1145/1401890.1401944.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>X.</given-names>
            <surname>Ning</surname>
          </string-name>
          ,
          <string-name>
            <surname>G.</surname>
          </string-name>
          <article-title>Karypis, SLIM: sparse linear methods for top-n recommender systems</article-title>
          , in: D. J.
          <string-name>
            <surname>Cook</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Pei</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>O. R.</given-names>
          </string-name>
          <string-name>
            <surname>Zaïane</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          Wu (Eds.),
          <source>11th IEEE International Conference on Data Mining, ICDM</source>
          <year>2011</year>
          , Vancouver, BC, Canada,
          <source>December 11-14</source>
          ,
          <year>2011</year>
          , IEEE Computer Society,
          <year>2011</year>
          , pp.
          <fpage>497</fpage>
          -
          <lpage>506</lpage>
          . URL: https://doi.org/10.1109/ICDM.
          <year>2011</year>
          .
          <volume>134</volume>
          . doi:
          <volume>10</volume>
          .1109/ ICDM.
          <year>2011</year>
          .
          <volume>134</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Shan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , K. B.
          <string-name>
            <surname>Letaief</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>How powerful is graph convolution for recommendation?</article-title>
          , in: G. Demartini, G. Zuccon,
          <string-name>
            <given-names>J. S.</given-names>
            <surname>Culpepper</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Huang</surname>
          </string-name>
          , H. Tong (Eds.),
          <source>CIKM '21: The 30th ACM International Conference on Information and Knowledge Management</source>
          , Virtual Event, Queensland, Australia, November 1 -
          <issue>5</issue>
          ,
          <year>2021</year>
          , ACM,
          <year>2021</year>
          , pp.
          <fpage>1619</fpage>
          -
          <lpage>1629</lpage>
          . URL: https://doi.org/10.1145/3459637.3482264. doi:
          <volume>10</volume>
          .1145/ 3459637.3482264.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>B.</given-names>
            <surname>Paudel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Christofel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Newell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bernstein</surname>
          </string-name>
          , Updatable, accurate, diverse, and
          <article-title>scalable recommendations for interactive applications</article-title>
          ,
          <source>ACM Trans. Interact. Intell. Syst</source>
          .
          <volume>7</volume>
          (
          <issue>2017</issue>
          ) 1:
          <fpage>1</fpage>
          -
          <lpage>1</lpage>
          :
          <fpage>34</fpage>
          . doi:
          <volume>10</volume>
          .1145/2955101.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>J. J. McAuley</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Leskovec</surname>
          </string-name>
          ,
          <article-title>From amateurs to connoisseurs: Modeling the evolution of user expertise through online reviews</article-title>
          , in: D.
          <string-name>
            <surname>Schwabe</surname>
            ,
            <given-names>V. A. F.</given-names>
          </string-name>
          <string-name>
            <surname>Almeida</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Glaser</surname>
          </string-name>
          , R. BaezaYates, S. B. Moon (Eds.), 22nd International World Wide Web Conference, WWW '13, Rio de Janeiro, Brazil, May
          <volume>13</volume>
          -17,
          <year>2013</year>
          , International World Wide Web Conferences Steering Committee / ACM,
          <year>2013</year>
          , pp.
          <fpage>897</fpage>
          -
          <lpage>908</lpage>
          . doi:
          <volume>10</volume>
          .1145/2488388.2488466.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>R.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. J. McAuley</surname>
          </string-name>
          ,
          <article-title>Ups and downs: Modeling the visual evolution of fashion trends with one-class collaborative filtering</article-title>
          , in: J.
          <string-name>
            <surname>Bourdeau</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Hendler</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Nkambou</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>B. Y.</given-names>
          </string-name>
          <string-name>
            <surname>Zhao</surname>
          </string-name>
          (Eds.),
          <source>Proceedings of the 25th International Conference on World Wide Web, WWW</source>
          <year>2016</year>
          , Montreal, Canada,
          <source>April 11 - 15</source>
          ,
          <year>2016</year>
          , ACM,
          <year>2016</year>
          , pp.
          <fpage>507</fpage>
          -
          <lpage>517</lpage>
          . doi:
          <volume>10</volume>
          .1145/ 2872427.2883037.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>N.</given-names>
            <surname>Muennighof</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Tazi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Magne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Reimers</surname>
          </string-name>
          , MTEB:
          <article-title>Massive text embedding benchmark</article-title>
          , in: A.
          <string-name>
            <surname>Vlachos</surname>
          </string-name>
          , I. Augenstein (Eds.),
          <source>Proceedings of the 17th Conference of the European Chapter of the Association for Computational Linguistics</source>
          ,
          <string-name>
            <surname>EACL</surname>
          </string-name>
          <year>2023</year>
          , Dubrovnik, Croatia, May 2-
          <issue>6</issue>
          ,
          <year>2023</year>
          , Association for Computational Linguistics,
          <year>2023</year>
          , pp.
          <fpage>2006</fpage>
          -
          <lpage>2029</lpage>
          . doi:
          <volume>10</volume>
          . 18653/V1/
          <year>2023</year>
          .EACL-MAIN.
          <year>148</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>L.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Majumder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <article-title>Improving text embeddings with large language models</article-title>
          ,
          <source>CoRR abs/2401</source>
          .00368 (
          <year>2024</year>
          ). doi:
          <volume>10</volume>
          .48550/ARXIV.2401.00368. arXiv:
          <volume>2401</volume>
          .
          <fpage>00368</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>P. I. Frazier</given-names>
            , Bayesian Optimization, in: E.
            <surname>Gel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Ntaimo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Shier</surname>
          </string-name>
          , H. J.
          <string-name>
            <surname>Greenberg</surname>
          </string-name>
          (Eds.),
          <source>Recent Advances in Optimization and Modeling of Contemporary Problems</source>
          , INFORMS,
          <year>2018</year>
          , pp.
          <fpage>255</fpage>
          -
          <lpage>278</lpage>
          . doi:
          <volume>10</volume>
          .1287/educ.
          <year>2018</year>
          .
          <volume>0188</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ferrari Dacrema</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Boglio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Cremonesi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Jannach</surname>
          </string-name>
          ,
          <article-title>A troubling analysis of reproducibility and progress in recommender systems research</article-title>
          ,
          <source>ACM Transactions on Information Systems</source>
          <volume>39</volume>
          (
          <year>2021</year>
          )
          <volume>20</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>20</lpage>
          :
          <fpage>49</fpage>
          . URL: https://doi.org/10.1145/3434185. doi:
          <volume>10</volume>
          . 1145/3434185.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>M. M. Abdollah Pour</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Farinneya</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Toroghi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Korikov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Pesaranghader</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Sajed</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Bharadwaj</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Mavrin</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Sanner</surname>
          </string-name>
          ,
          <article-title>Self-supervised contrastive bert fine-tuning for fusion-based reviewed-item retrieval</article-title>
          ,
          <source>in: European Conference on Information Retrieval</source>
          , Springer,
          <year>2023</year>
          , pp.
          <fpage>3</fpage>
          -
          <lpage>17</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>