<!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 />
    <article-meta>
      <title-group>
        <article-title>Potentials of Combining Local Knowledge and LLMs for Recom mender Systems</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Thomas E. Kolb</string-name>
          <email>thomas.kolb@tuwien.ac.at</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ahmadou Wagne</string-name>
          <email>ahmadou.wagne@tuwien.ac.at</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mete Sertkan</string-name>
          <email>mete.sertkan@tuwien.ac.at</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Julia Neidhardt</string-name>
          <email>julia.neidhardt@tuwien.ac.at</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Christian Doppler Laboratory for Recommender Systems, TU Wien</institution>
          ,
          <addr-line>Vienna</addr-line>
          ,
          <country country="AT">Austria</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>1841</year>
      </pub-date>
      <fpage>0000</fpage>
      <lpage>0001</lpage>
      <abstract>
        <p>LLMs have revolutionized the understanding and generation of natural language, ofering new possibilities for enhancing recommendation systems. In previous studies, LLMs exploit their global knowledge to provide zero- or few-shot recommendations. In this work, we aim to highlight the opportunities that LLMs pose to enrich the field of recommender systems combined with local knowledge. We propose to view recommender systems combined with LLMs from a broader perspective, recognizing them not merely as another method to replace existing recommendation approaches, but rather as a complementary and powerful approach to enhance and augment the overall recommendation process.</p>
      </abstract>
      <kwd-group>
        <kwd>recommender systems</kwd>
        <kwd>knowledge-aware recommendations</kwd>
        <kwd>LLMs</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        1. Introduction
like Generative Pre-trained Transformer (GPT)1, LLaMA
[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] or PaLM2 introduced new possibilities to understand
and generate natural language that can support the
recommendation process at various stages. Early studies
that investigated the application of e.g. ChatGPT3 for
recommender systems mostly focused on using it directly
nEvelop-O
CEUR
Workshop
Proce dings
htp:/ceur-ws.org
ISN1613-073
      </p>
      <p>Attribution 4.0 International (CC BY 4.0).</p>
      <p>CEUR</p>
      <p>
        Workshop Proceedings (CEUR-WS.org)
https://openai.com/research/gpt-4
ploiting the language understanding and generation
capabilities to provide explainable recommendations [
        <xref ref-type="bibr" rid="ref2 ref3 ref4">2, 3, 4</xref>
        ].
      </p>
    </sec>
    <sec id="sec-2">
      <title>This paper provides insights into possible ways to use</title>
      <p>
        LLMs that difer from approaches that only rely on the
global knowledge of pre-trained models and directly
recommend items based on that. This is often not
applicable in a real-world scenario, where you have a fixed
set of items to choose from and want to ensure factual
recommendations. Moreover, our goal is to provide
textual metadata about a dedicated set of items, which we
call local knowledge, for our recommendations, but use
the global knowledge of LLMs to support other steps
of the pipeline of a system. To further investigate this,
we conducted a pilot study involving students of a
Masmethod can furthermore overcome problems when the
global knowledge does not hold any information about
an item in one’s own stock. Figure 1 highlights these
diferent components and emphasizes that modern
recommender systems consist of a whole system
architecture of which the recommendation engine is only one
employed exclusively by the language model integration
framework or the recommendation engine, independent
of any access to the global knowledge of the LLM; such
knowledge can be stored through diverse methods (e.g.
vector stores, text files, etc.). This local knowledge is used
as the basis to retrieve items for recommendations based
on e.g. a similarity search. LLMs in general additionally
often face the issue of hallucination [
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ], which is
especially undesirable in this context, because you want to
recommend items that are actually available.
Retrievalalleviate these problems in the domain of information
retrieval to provide more factual and knowledge-based
      </p>
      <sec id="sec-2-1">
        <title>2. Opportunities and Challenges</title>
        <p>erating summaries or topics holds benefits both in terms
We anticipated a lot of potential in using LLMs in vari- of eficiency and efectivity. In a large local data base
ous stages of recommender systems to support finding of news articles, processing quickly becomes expensive,
suitable recommendations from local knowledge. This when assessing the similarity between a user profile’s
section highlights the potentials that should be further content or a natural language user query and the
fullexplored in our pilot study and reflect on challenges that text articles on every invocation. This process can be
come with them. alternatively executed on a concise summary, containing
significantly fewer tokens while incurring only minimal
2.1. Input Enhancement and information loss. Generating topics holds the benefit of</p>
        <p>
          Restructuring providing further information that can be exploited for
When creating recommendations for a user, we can pro- recommendations that better fit the user’s needs. Topics
cess diferent types of signals as input for a system [
          <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
          ]. can include reading motives of users for news or books
Those can be user profiles, metadata of relevant items or occasions for outfits in a fashion recommendation
sceor direct input from a user. In cases where the user can nario. The extracted topics can then either be inferred
input queries, they often provide simplistic statements from user input or directly asked for by the system to
with sparse textual information. To address this limi- then perform a directed search on the local knowledge.
tation, we see potential to automatically enrich those A further application scenario of LLMs based on the
with additional information, by using generative models. information extraction aids the process of evaluating
recThe practice of query expansion has shown potential in ommender systems. To reduce the need of real world
various natural-language-processing tasks [
          <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
          ]. One data, which might not be available, if a system is not
approach involves using knowledge from pre-trained launched yet or annotated historical data, LLMs can
reLLMs to augment user input and provide richer infor- verse engineer sample prompts based on items to check
mation about the underlying intent and alleviate cold the consistency of the recommendation engine. This is
start problems. This can be used to generate user profiles not limited to user prompts, but there is furthermore the
in textual form that are subsequently used to query the possibility to create synthetic user profiles for example.
local knowledge to retrieve similar or fitting items to the Re-feeding such synthetic samples to the system hold
enhanced profile. In a conversational scenario, this can potential to provide new means for evaluation. The
usbe supported by the means of the LLM to provide the age and nature of prompts by real users will most likely
user with dynamic questions in real-time to get more difer from those synthetic prompts and ways to create
information about their intent directly from them. suitable samples have to be further researched.
        </p>
        <p>
          Challenges arise when the input structure difers from 2.3. Further Use Cases
the meta-information about target items. An example We want to mention additional use cases that tackle open
setting would be recommending job listings based on problems in the recommender systems field or can be
resumes. Job listings can follow a structure with dif- combined with traditional approaches for future
endeavferent fields that hold information about tasks etc. In ours. When using LLMs to hold conversations with users,
such cases, LLMs ofer promising potential to restructure we can use the capabilities of LLMs to extract the intent
resumes and create synthetic job listings or vice versa. of users and build profiles dynamically where the system
Additionally, LLMs can help imputing missing values generates questions in real time that aim at acquiring
spewithin structured content, such as generating a short cific missing information or infers it from a conversation
pitch or personal description from working experiences lfow. The conversational setting furthermore enables the
and interests in resumes. Experimental investigations in incorporation of real time feedback and iterative
adapthis direction can include prompt engineering to align tion and refinement of recommendations. This process
the enhancement or restructuring process across multi- involves presenting recommendations based on prompts
ple user sessions, given the non-deterministic nature of or the chat history and allowing users to provide ratings
generated responses. or rankings for the suggested items. The system
lever2.2. Content Extraction and Sample ages this feedback as additional information about user
Prompt Generation preferences, subsequently enhancing the precision of
following recommendations, resulting in more personalised
Another notable application revolves around the gener- and contextually relevant recommendations.
ation of supplementary content based on target items, A major challenge for all mentioned scenarios is that
which serves various purposes. An example is the usage one has to engineer a set of prompts or prompt templates
of LLMs to extract topics or summaries from target items. that make sure that the model executes the concerning
In the context of news, LLMs have shown to be on level task as intended and delivers responses consistently in
with human-created summaries [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. Automatically gen- the right format to be further processed and stable in
a deployed system. However the incorporation of lo- ences. The system internally rewrites the chat history as a
cal knowledge mitigates problems that arise with the single question and feeds it back to GPT. This has the goal
reliance on global knowledge, like bias or hallucination to refine the fashion article recommendations provided
of LLMs, which is also seen as a general concern as high- by the system. In their internal evaluation they state
lighted by the Digital Humanism Initiative4. In a recom- that they were rather satisfied with the recommended
mendation scenario we want to make sure that items are items, which resulted in a time saving and the system
available and metadata about them is correct and reliable. showed them clothing options which they would not
have considered otherwise.
3. Pilot Study Content extraction and sample query generation were
To investigate the raised challenges and opportunities tackled by two diferent approaches: (1) recommending
in Section 2 we conducted a pilot study5 in one of our news items to a certain topic based on a news data-set,
lectures. The group tasks were structured in a way to and (2) recommending news items based on a certain
encourage the students to use innovative and new ap- reading motive or category. In task (1) GPT was used for
proaches to solve the given task. Each group was tasked topic extraction which was applied on the user prompts
with leveraging the capabilities of a LLM, in this pilot and news articles. They propose a personalised
recomstudy, the OpenAI GPT API6 in combination with a popu- mender system which stores the extracted topics from
lar language model integration framework7 for utilizing user queries and articles in a joint vector store. In
adLLMs for diferent downstream tasks e.g. the usage of dition, random noise following a normal distribution is
local knowledge. The research potential of the opportu- introduced to diversify recommendations. With more
nities and challenges previously addressed is supported user queries the user feedback is weighted more than the
by the findings of the pilot study conducted. noise, going by the assumption that the system gradually
        </p>
        <p>New insights into query enhancement and restruc- understands its users better. Task (2) was very similar,
turing were gained through four diferent projects: (1) but this time the goal was to identify reading motives.
matching a set of resumes with a dataset of job listings, (2) The proposed solution was a combination of embedding
creating a system, which is able to recommend companies all articles with the help of Ada8 and extracting reading
based on certain preferences (i.e. to understand compet- motives from articles with the help of GPT to match them
itive suppliers in the marketplace), (3) recommending with user preferences.
clothes to wear on a particular occasion, and (4) building 4. Conclusion
a recommender system to recommend books based on a
given book. Project (1) utilized LLMs to generate struc- In conclusion, our work highlights the abundant
potentured JSON Files from resumes and to complete null fields tial of leveraging local knowledge in conjunction with
based on other content. They used a creative approach LLMs to advance recommender systems. We propose the
to generate job listings from resumes to match them with need for a comprehensive exploration of this potential,
the jobs within the job listing. In addition query exten- transcending the early trends of using LLMs to replace
sion was utilized to enhance or complement the resumes by traditional recommenders or focusing on explainable
recaccessing the global knowledge of the LLM. In task (2) ommendations. Recognising modern recommender
systhe assumption was that a user would use a rather sim- tems as multifaceted ecosystems, where the
recommenplistic prompt to search for competing companies. They dation algorithm represents only one component, we
enhanced this query by prompting GPT for an enhanced propose investigating mentioned aspects such as input
version of the given query. The approach was to provide enhancement and restructuring, content extraction, and
GPT with the original prompt, including a keyword list sample prompt generation in future research endeavors.
of the user preferences based on the behavior within the By doing so, we can benefit from the ever-evolving
capasession. Subsequently, the user is provided with multi- bilities of LLMs, while also mitigating their drawbacks
ple recommendations for generated search prompts from through the incorporation of trusted local knowledge.
which they can choose the one that best reflects their This approach promises to uncover new advancements
intent. The selected prompt is then used for the further in personalised and knowledge-aware recommendations,
recommendation process. Project (3) solved the given enriching the overall user experience and amplifying the
problem by providing the user with a chat interface. The benefits of using LLMs in recommender systems.
user can chat with the system and submit their
prefer</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>4https://caiml.dbai.tuwien.ac.at/dighum/statement-of-the-digital</title>
      <p>humanism-initiative-on-chatgpt/
5The pilot study was designed as an optional track within the lecture
to comply with the responsible research practices at TU Wien.
6https://openai.com/blog/openai-api
7https://python.langchain.com/</p>
      <sec id="sec-3-1">
        <title>Acknowledgments</title>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>This research is supported by the Christian Doppler Research Association (CDG).</title>
    </sec>
    <sec id="sec-5">
      <title>8https://openai.com/blog/new-and-improved-embedding-model</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>H.</given-names>
            <surname>Touvron</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Martin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Stone</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Albert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Almahairi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Babaei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Bashlykov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Batra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bhargava</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bhosale</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Bikel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Blecher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. C.</given-names>
            <surname>Ferrer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Cucurull</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Esiobu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Fernandes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Fuller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Goswami</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Hartshorn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hosseini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Hou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Inan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kardas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Kerkez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Khabsa</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Kloumann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Korenev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. S.</given-names>
            <surname>Koura</surname>
          </string-name>
          , M.
          <article-title>-</article-title>
          <string-name>
            <surname>A. Lachaux</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Lavril</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Liskovich</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Lu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Mao</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          <string-name>
            <surname>Martinet</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Mihaylov</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Mishra</surname>
            , I. Molybog,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Nie</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Poulton</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Reizenstein</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Rungta</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Saladi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Schelten</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Silva</surname>
            ,
            <given-names>E. M.</given-names>
          </string-name>
          <string-name>
            <surname>Smith</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Subramanian</surname>
            ,
            <given-names>X. E.</given-names>
          </string-name>
          <string-name>
            <surname>Tan</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Tang</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Taylor</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Williams</surname>
            ,
            <given-names>J. X.</given-names>
          </string-name>
          <string-name>
            <surname>Kuan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Yan</surname>
            , I. Zarov,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Fan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Kambadur</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Narang</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Rodriguez</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Stojnic</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Edunov</surname>
          </string-name>
          ,
          <source>T. Scialom, Llama</source>
          <volume>2</volume>
          :
          <string-name>
            <given-names>Open</given-names>
            <surname>Foundation</surname>
          </string-name>
          and
          <string-name>
            <surname>Fine-Tuned Chat Models</surname>
          </string-name>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Sheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xiong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Zhang</surname>
          </string-name>
          , Chat-REC:
          <article-title>Towards Interactive and Explainable LLMs-Augmented Recommender System (</article-title>
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>J.</given-names>
            <surname>Liu</surname>
          </string-name>
          , C. Liu,
          <string-name>
            <given-names>P.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Lv</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y. Zhang,</surname>
          </string-name>
          <article-title>Is ChatGPT a Good Recommender? A Preliminary Study (</article-title>
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Cui</surname>
          </string-name>
          , J. Ma,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <fpage>M6</fpage>
          -Rec
          <string-name>
            <surname>: Generative Pretrained Language Models are OpenEnded Recommender Systems</surname>
          </string-name>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Cahyawijaya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Wilie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Lovenia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ji</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Chung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q. V.</given-names>
            <surname>Do</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Fung</surname>
          </string-name>
          ,
          <string-name>
            <surname>A Multitask</surname>
          </string-name>
          ,
          <article-title>Multilingual, Multimodal Evaluation of ChatGPT on Reasoning</article-title>
          , Hallucination, and
          <string-name>
            <surname>Interactivity</surname>
          </string-name>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>G.</given-names>
            <surname>Marcus</surname>
          </string-name>
          , The Next Decade in
          <source>AI: Four Steps Towards Robust Artificial Intelligence</source>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>P.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Perez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Piktus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Petroni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Karpukhin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Küttler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          , W.-t. Yih,
          <string-name>
            <given-names>T.</given-names>
            <surname>Rocktäschel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Riedel</surname>
          </string-name>
          , D. Kiela,
          <article-title>RetrievalAugmented Generation for Knowledge-Intensive NLP Tasks (</article-title>
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>F.</given-names>
            <surname>Ricci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Rokach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Shapira</surname>
          </string-name>
          ,
          <article-title>Introduction to Recommender Systems Handbook</article-title>
          , in: Recommender Systems Handbook, Springer US, Boston, MA,
          <year>2011</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>35</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-0-
          <fpage>387</fpage>
          -85820-3{\_}
          <fpage>1</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Bobadilla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Ortega</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Hernando</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gutiérrez</surname>
          </string-name>
          ,
          <article-title>Recommender systems survey</article-title>
          ,
          <source>Knowledge-Based Systems</source>
          <volume>46</volume>
          (
          <year>2013</year>
          )
          <fpage>109</fpage>
          -
          <lpage>132</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.knosys.
          <year>2013</year>
          .
          <volume>03</volume>
          .012.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>R.</given-names>
            <surname>Jagerman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhuang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Qin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bendersky</surname>
          </string-name>
          ,
          <string-name>
            <surname>Query Expansion by Prompting Large Language Models</surname>
          </string-name>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <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>F.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <article-title>Query2doc: Query Expansion with Large Language Models (</article-title>
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>T.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Ladhak</surname>
          </string-name>
          , E. Durmus,
          <string-name>
            <given-names>P.</given-names>
            <surname>Liang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>McKeown</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. B.</given-names>
            <surname>Hashimoto</surname>
          </string-name>
          ,
          <article-title>Benchmarking Large Language Models for News Summarization (</article-title>
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>