<!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>O: Retrieval-Augmented Generation for Enhancing M OOCs Recom mendations</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jiarui Rao</string-name>
          <email>jiaruira@andrew.cmu.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jionghao Lin</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Retrieval-Augmented Generation (RAG), Personalized Learning, Recommender Systems, Artificial Intelligence</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Carnegie Mellon University</institution>
          ,
          <addr-line>5000 Forbes Ave, Pittsburgh, PA 15213</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Massive Open Online Courses (MOOCs) have significantly enhanced educational accessibility by ofering a wide variety of courses and breaking down traditional barriers related to geography, finance, and time. However, students often face dificulties navigating the vast selection of courses, especially when exploring new fields of study. Driven by this challenge, researchers have been exploring course recommender systems to ofer tailored guidance that aligns with individual learning preferences and career aspirations. These systems face particular challenges in efectively addressing the “cold start” problem for new users. Recent advancements in recommender systems suggest integrating large language models (LLMs) into the recommendation process to enhance personalized recommendations and address the “cold start” problem. Motivated by these advancements, our study introduces RAMO (Retrieval-Augmented Generation for MOOCs), a system specifically designed to overcome the “cold start” challenges of traditional course recommender systems. The RAMO system leverages the capabilities of LLMs, along with Retrieval-Augmented Generation (RAG)-facilitated contextual understanding, to provide course recommendations through a conversational interface, aiming to enhance the e-learning experience.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Massive Open Online Courses (MOOCs) gently facilitate
access to learning for a diverse global audience [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. By
providing an extensive range of courses through an easily
accessible online platform, MOOCs not only enhance
individual learning and development but also enrich the broader
educational community [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. However, the diverse categories
of courses across disciplines can often overwhelm students
when they step into new fields of study [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Selecting the
right courses that align with both personal interests and
academic requirements is crucial, as improper choices may lead
to wasted time, and resources, and a lack of fulfillment in
one’s educational journey (Generated by AI Tool ChatGPT)
.
      </p>
      <p>
        To resolve this, researchers have developed course
recommender systems using advanced algorithms to ofer tailored
guidance that aligns with individual learning preferences
[
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Many existing implementations of recommendation
systems have demonstrated significant benefits, such as
enhancing personalized learning experiences and
improving student engagement, as highlighted by a recent study
[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. However, these systems also face critical limitations,
particularly the “cold start ’’ problem, which occurs when
trying to make recommendations for new users with limited
historical data [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Though previous research proposed a
more complex framework—a novel meta-learning
heterogeneous information networks approach [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]—to address the
“cold start ’’ recommendation issue, the approach faces the
challenge of high computational complexity, which is not
scalable for large-scale MOOCs platforms.
      </p>
      <p>
        In response to address the limitations of prior work in
recommendation systems, where the recommendations lack
suficient personalization and interaction with users,
researchers have proposed integrating large language models
nEvelop-O
(J. Lin)
frameworks like GPT4Rec [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] and Chat-Rec [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]
demonstrated the potential of LLMs in improving course alignment
with learners’ interests and interaction. However, LLMs can
sometimes generate misleading or outdated information. To
counteract these shortcomings, one possible solution is the
integration of Retrieval-Augmented Generation (RAG) with
LLMs [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
      <p>
        RAG [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] is a process that optimizes the output of LLMs
by extending their robust capabilities to cater specifically to
distinct domains or an organization’s internal knowledge
base, eliminating the need for retraining the model [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. The
use of RAG in recommendation systems enhances the
adaptability of LLMs, ensuring that recommendations remain
current and contextually relevant [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. This advancement
paves the way for more precise and targeted course
recommendations that adapt to changes in educational content
and learner preferences. Despite these improvements, there
is a noticeable gap in research specifically focused on using
LLMs in course recommender systems, particularly in
addressing the “cold start ’’ problem where the system lacks
a user’s profile. Thus, our study aims to investigate the
potential of LLMs, particularly those enhanced by RAG, in
providing course recommendations tailored to individual
user needs. We introduce a course recommender system,
RAMO (Retrieval-Augmented Generation for MOOCs),
which employs a RAG-based LLM model (refer to Figure 1).
RAMO leverages RAG’s advantage to improve the quality of
course recommendations, addressing and mitigating
common issues associated with LLMs especially in “cold start’’
problem.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Related</title>
    </sec>
    <sec id="sec-3">
      <title>Works</title>
      <sec id="sec-3-1">
        <title>2.1. Course Recommender Systems</title>
        <p>
          Course recommender systems are essential in educational
technology, helping students choose courses that align with
their interests and academic goals. Many prior studies have
employed collaborative filtering methods to build course
recommender systems [
          <xref ref-type="bibr" rid="ref14 ref15 ref16">14, 15, 16</xref>
          ]. For instance, Schafer
CEUR
Workshop
ISSN1613-0073
et al. [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] proposed a recommender system that suggested
courses based on the preferences of similar users. A more
recent example by Koren et al. [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] developed advanced
collaborative filtering techniques to enhance course
recommendation accuracy. However, a significant issue arises
when recommending courses for new users, as there is no
historical data available for these individuals—this is known
as the “cold start ’’ problem [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]. To address this challenge, a
recent study by Wu et al. [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] leveraged large language
models (LLMs), which utilize extensive pre-trained knowledge
from web datasets, demonstrating potential in overcoming
the cold start problem. Despite the advancements in LLMs,
their integration into course recommendation systems
remains largely unexplored, presenting an opportunity for
future research to innovate and improve student course
selection processes.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>2.2. Large Language Models in Education</title>
        <p>
          Large language models (LLMs) like ChatGPT, trained on
extensive datasets, have the ability to generate human-like
text and respond to questions with exceptional precision
[
          <xref ref-type="bibr" rid="ref18 ref19">18, 19</xref>
          ]. Many studies have highlighted the potential of
LLMs in educational applications, leveraging their
capabilities to enhance various aspects of teaching and learning.
For example, Kabir and Lin [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] developed an adaptive
practicing system utilizing ChatGPT to generate personalized
questions and feedback, demonstrating LLMs’ potential in
facilitating tailored educational interactions. Researchers
investigated multiple GPT models on their ability to
generate tailored learning materials and provide instant feedback
on student errors, enhancing personalized learning
experiences [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ]. Huber et al. [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ] demonstrated the use of LLMs
in creating interactive, conversational systems that assist
both students and teachers by providing adaptive learning
support and resources. Moreover, LLMs are also used in
generating automatic feedback for students [
          <xref ref-type="bibr" rid="ref23 ref24">23, 24</xref>
          ],
handling sparse learner performance data [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ] from intelligent
tutoring systems, predicting learning performance [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ], and
supporting tutor training session [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ].
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>2.3. Retrieval-Augmented Generation in</title>
      </sec>
      <sec id="sec-3-4">
        <title>Education</title>
        <p>
          Retrieval-augmented generationn (RAG) has emerged as
a significant technique to enhance the efectiveness of
educational tools powered by LLMs. For example, a study
[
          <xref ref-type="bibr" rid="ref28">28</xref>
          ] integrated textbook content into LLM prompts via RAG
improved the quality of responses in interactive
questionanswering (QA) scenarios for middle-school math students,
and demonstrated that students generally prefer responses
generated by RAGs. RAG has also been employed in
programming education to generate improved feedback for
student’s completion of coding tasks [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ], by
incorporating transcriptions of lecture recordings and using
timestamps as meta-information, RAG reduces hallucinations
and ensures the use of accurate technical terms. Moreover,
RAG has been utilized to assess novice math tutors’ use
of social-emotional learning strategies [
          <xref ref-type="bibr" rid="ref30">30</xref>
          ], they proved
that RAG-enhanced prompts demonstrated more accurate
and cost-efective performance compared to other
prompting strategies by providing relevant external content. This
application highlights the potential of RAG in developing
personalized tutor training programs and enhancing the
overall efectiveness of tutored learning.
        </p>
        <p>While traditional course recommender systems have laid
the groundwork for personalized education, the integration
of LLMs and techniques such as RAG ofers unprecedented
opportunities for enhancing educational experiences. These
advanced methods address limitations of earlier approaches
and pave the way for more sophisticated and efective
educational tools, inspiring us to utilize RAG in developing our
course recommender system.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>3. Method</title>
      <sec id="sec-4-1">
        <title>3.1. Dataset</title>
        <p>
          In this study, we utilized the “Coursera Courses Dataset
2021”1 from Kaggle. The dataset, scraped from Coursera’s
publicly available information in September 2021, contains a
variety of courses that feature comprehensive details such as
1https://www.kaggle.com/datasets/khusheekapoor/
coursera-courses-dataset-2021
skill requirements, dificulty levels, and direct course links.
It provides a robust knowledge base for our RAMO system,
enabling it to suggest courses tailored to students’ specific
skills and educational needs. This dataset efectively
supports our objective to enhance accessibility and personalized
learning through course recommendations. We first cleaned
the dataset to remove meaningless symbols and duplicate
rows, and it has 3,342 non-duplicate courses in total after
data-cleaning, with 6 columns:
• Course Name: The title of the course.
• University: The institution ofering the course.
• Dificulty Level : The level of complexity of the
course content.
• Rating: The average rating given by learners.
• URL: The web address where the course can be
accessed.
• Description: A brief overview of what the course
covers.
• Skills: The specific abilities or knowledge areas that
the course aims to develop.
As shown in Table 2 below, we employed several LLMs to
build our course recommender system. We provide a list
of the LLM models we used, along with details on their
associated costs and token limits. The token limit refers to
the maximum number of tokens (a token represents about
3/4 of a word or four characters, according to Open AI [
          <xref ref-type="bibr" rid="ref32">32</xref>
          ])
that the model can process in a single input. While some
models, like Llama 2 and Llama 3, are free to use on
smallscale dataset, due to their open-source nature, others may
incur costs based on usage or subscription plans [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ].
3.2.1. Prompt Design
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>3.2. Recommendation System Design</title>
        <p>
          The “cold start” problem, where systems lack user
historical data, is a significant challenge in recommendation
systems. Both traditional course recommender algorithums
like content-based and collaborative-filtering algorithms
and LLM-based system recommendation systems struggle
with this issue. However, our RAG-based solution addresses
this by using a ‘prompt template’ in the back-end. This
template guides RAMO to generate relevant responses even
when no user-specific data is available, as detailed in Table
1. The RAMO system can provide meaningful
recommendations from the outset, unlike non-RAG-based recommender
systems, which lack a retrieval process and prompt-based
customization. The prompt to our retriever (i.e., to retrieve
the relevant docs from the databases) is called the ‘prompt
template’, which is shown in Table 1. The prompt to our
generator is composed with three parts: 1) User Question,
2) Prompt Template, and 3) Search Results (the context
of the retrieved relevant documents). We also added the
uplifting adverb ‘ fantastic’ to the prompt template, to elevate
it with Emotional Intelligence since ChatGPT is designed to
recognize patterns in language, including those associated
with emotions [
          <xref ref-type="bibr" rid="ref31">31</xref>
          ].
        </p>
        <p>
          We then leveraged the RAG approach to enhance the
system’s understanding of the user context. As shown in
Figure ??, RAG consists of two primary components: the
retriever and the generator. The retriever aims to enhance
the prompt templates, which ‘augment’ the retrieval
process, tailoring it to specific user queries. The knowledge
base used for the retrieval process can contain any format
of course data (e.g., csv, pdf, and json), providing a flexible
and rich source of information for generating responses
and we used the largest MOOC platform—coursera’s course
dataset in csv format as the knowledge base. The dataset
was transformed into text embeddings and stored in the
vector database. These embeddings were then used to find
high-quality, relevant information, which was incorporated
into the prompt for the generator. Here we use OpenAI
embedding model (text-embedding-ada-002 [
          <xref ref-type="bibr" rid="ref34">34</xref>
          ]) to
tokenize the course data and store the embeddings in vector
store, considering its advantage over BERT (Bidirectional
Encoder Representations from Transformers) [
          <xref ref-type="bibr" rid="ref35">35</xref>
          ], while
OpenAI embeddings [
          <xref ref-type="bibr" rid="ref34">34</xref>
          ] ofer better generalization and
contextual understanding [
          <xref ref-type="bibr" rid="ref36">36</xref>
          ], making them more suitable
for diverse educational content. The generator is powered
by LLMs, which generate the textual contents based on the
engineered prompts. To facilitate user’s interaction with
the system, we make the recommendation process to be
completed via conversational manner.
        </p>
        <p>
          The interface of our recommender system is shown in
Figure 1, where we listed 5 default courses based on their
ratings in the dataset on the web page to make it more
user-friendly. As for the implementation of the system,
Prompt Template we use GPT-3.5 Turbo, selected for its robust integration
You are a fantastic Coursera course recommender. Use the following with the LangChain [
          <xref ref-type="bibr" rid="ref37">37</xref>
          ] framework—a platform designed
pieces of context to answer the question and recommend relevant courses to streamline the implementation of language models in
troectohmemuseenrd. Isfotmhee cuosuerrsdeosetshna’tt asrpeecmifoystthpeoiprurleaqruiinretmheensytss,teymoubcaasnedjuosnt application-specific contexts. This setup allows the system
their ratings and dificulty levels. You only need to provide the course to dynamically retrieve relevant documents and generate
retitle to the user. Also, please pay attention to how many courses the sponses tailored to user inputs, as illustrated in the workflow
user wants you to recommend. If you don’t know the answer, just say “I in Figure 2.
don’t know”.
        </p>
        <p>Context 3.2.3. Comparative Analysis
Retrieved course data
User Question
User’s specific question to the generator
To evaluate the performance of our system, we conducted a
series of tests by providing diferent prompts representing
various user needs to RAMO. This allowed us to explore
its ability to deliver course recommendations based on the
outputs generated in response to varied user prompts.</p>
        <p>LLM vs. Non-LLM. We explored both the relevance of
the recommended courses to the user’s interests and
responding time (the time it takes to generate a response) of
the LLM-based recommender system compared to non-LLM
course recommender systems (e.g., course recommender
system using collaborative filtering and content-based
approaches), focusing particularly on their ability to address
the “cold start” problem. This problem occurs when the
user lacks specific requirements on what skills they want to
learn, and the system lacks data on the new user.</p>
        <p>LLM vs. LLM with RAG. We further examined the
performance of a standard LLM recommender system (without
RAG and without using a dataset as a knowledge base)
versus an RAG-enhanced LLM recommender system by testing
diferent prompt templates for the retriever and various
user queries for the generator to ascertain improvements in
system performance and recommendation personalization.</p>
        <p>To explore the performance of our course recommender
system, we focused on comparing the relevance of the
recommended courses to diferent prompts by varying prompt
templates and user-specific requirements.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>4. Results</title>
      <p>
        4.1. LLM vs. Non-LLM
We compared RAMO with a traditional course
recommendation system built by the content-based and collaborative
ifltering using the same dataset 2. During this comparison,
we focused on the “cold start” problem. The “cold start”
problem is especially pertinent in the context of an e-learning
platform for tutor training, such as tutor training platform
[
        <xref ref-type="bibr" rid="ref38">38</xref>
        ]. When new tutors join the platform, they are
encouraged to complete various training courses to enhance their
2https://www.kaggle.com/code/sagarbapodara/
coursera-course-recommendation-system-webapp
tutoring skills. Given the wide range of courses available,
new tutors may feel overwhelmed when deciding where to
begin their learning journey. In such scenarios, they may
ask general questions such as, “What can I learn today since
I am a new tutor onboarding to this platform? ” They do not
have prior course completions or specific learning
preferences logged in the system, making it challenging for the
recommendation system to personalize suggestions based
on historical data. When prompted with “I am a new user ”,
the traditional recommender system failed to generate a
recommendation because its algorithm relies on the cosine
similarity of the descriptive texts of the user’s desired
learning topic and the database items, and there are no courses
with similar title or description as the phrase ‘new user ’. In
contrast, both our standard LLM and the RAG-enhanced
LLM system can provide relevant course suggestions for the
new user, with the LLM ofering more detailed descriptions
based on its internal knowledge base and RAG ofering more
customized outputs based on its external knowledge base
and the prompt template we designed. The comparative
results for both the standard and RAG-based recommender
systems are displayed in Figure 3.
      </p>
      <p>Regarding system performance, the traditional system
typically took about 0.02 seconds longer than RAMO to
generate responses according to the same user interest—a
certain topic the user wants to learn, and this delay increased
with the complexity of the user’s input regarding relevant
skills.</p>
      <sec id="sec-5-1">
        <title>4.2. LLM vs. LLM with RAG</title>
        <p>To explore how well our LLMs can provide personalized
course recommendations, we used prompts that specified a
particular skill to be learned. The non-RAG LLM (based on
GPT-3.5) delivered detailed suggestions for relevant courses
available on Coursera, utilizing its internal database of
courses. In contrast, the recommendations from the
RAGenhanced LLM varied according to the specific prompt
template used by the retriever. This adaptability allows
developers to tailor the quantity and detail of the courses
recommended, showcasing the flexibility of the RAG approach.
The user interface and the outcomes for a query focused on
learning a specific skill are illustrated in Figure 4.
syntax to building interactive applications. Happy learning! ”
When the user changes their mind and decides to learn about
another topic, RAMO can give relevant recommendations.
The outputs consistently matched the user requirements
in relevance, successfully retrieving the pertinent courses
from the Coursera dataset, more examples could be found
at Figure 5.</p>
        <p>We modified the retrieval prompts and generation queries
to test the adaptability of our recommendation system. First,
we conducted tests on various user queries using the same
prompt template to compare the variations in output. The
ifrst module in Figure 5 illustrates the system’s response to a
“cold start” problem, while modules 2 through 6 demonstrate
how the output varies based on user questions about the
number of courses recommended and the level of detail
provided, such as reasons for recommendations, URLs, and
other specifics. For example, when user asks question like “ I
want to learn python, can you recommend me some courses? ”,
RAMO can give the output to the user: “Sure! Here are
some recommended Python courses for you: 1. Introduction to
Python 2. Crash Course on Python 3. First Python Program 4.
Python Basics These courses cover a range of topics from basic</p>
        <p>We also utilized diferent retrieval prompt templates to
explore how the output varies based on diferent prompts.
Specifically, we used the same user question “ I want to learn
python”, and altered the prompt templates to specify the
number of recommended courses and the level of detail
provided in the output, ranging from mere course titles to
comprehensive descriptions that include titles, URLs, and
rationales for each recommendation. The variations in the
prompt templates and their corresponding outputs are
illustrated in Figure 6. Here, red lines highlight changes
in the number of courses recommended, blue lines detail
the content of the courses—such as the inclusion of
reasons for recommendations or just the course titles, ratings,
and URLs—while green highlights how we addressed the
“cold-start” problem, resulting in recommendations of the
three most popular (based on course ratings) and easiest
courses (based on its dificulty level), as depicted in the
output module labeled 1 in Figure 6. The generated response in
response to varied prompts underscores the system’s
robustness; for instance, when the template specifies “ recommend
three courses at a time”, the output consistently includes
exactly three courses. Similarly, if the prompt contains ‘course
URLs and titles’, the system reliably appends this
information to each recommended course, ensuring that the output
meticulously adheres to the specified criteria.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>5. Conclusions</title>
      <p>
        In this study, we have demonstrated the application of
LLMs as course recommender systems, particularly within
MOOCs. Our findings confirm the potential of LLMs to
deliver personalized course recommendations based on user’s
diferent requirements. We initially compared four LLMs,
including GPT-3.5 Turbo and GPT-4. Ultimately, we selected
GPT-3.5 as the back-end model for the RAMO system due
to its comparable performance to GPT-4 at a lower cost.
Although the Llama models are free to access, we found
that the GPT models were significantly faster. Specifically,
GPT-3.5 had an approximate response time of 3 seconds,
whereas Llama 2 and Llama 3 took approximately 5 minutes
and 8 minutes, respectively. Furthermore, the integration of
RAG has enhanced the quality of recommendation outputs,
as evidenced by the generated responses based on various
user prompts, which are highly related to user’s needs and
all came from the knowledge base. Additionally, our
system supports conversational interaction with users, which
could be seamlessly integrated into numerous online
educational platforms. Our use of open-source LLMs (e.g. Llama
2 and Llama 3 [
        <xref ref-type="bibr" rid="ref33">33</xref>
        ]) has also been validated, proving to be a
cost-efective approach for broader deployment.
      </p>
      <p>Limitations
As this study is ongoing, we have not yet conducted
comprehensive evaluations of our recommender systems,
including human evaluations or user studies. This is
primarily due to the nascent stage of our research. Moreover,
while many research projects on recommendation systems
employ benchmarks to evaluate system adaptability, our
study currently lacks such benchmarks because we do not
possess a test dataset. The Coursera dataset we utilized
includes only course data, lacking user profiles which are
essential for evaluating the efectiveness of recommender
systems across diferent time periods. If we had access to
user data, including users’ past course learning histories
and their preferences, we could integrate this information
with the course data to enhance our retrieval process. This
integration would allow us to personalize recommendations
more efectively, tailoring course suggestions to individual
learning patterns and preferences. Incorporating detailed
user data would enable RAMO to provide more accurate
and relevant recommendations, improving user satisfaction
and engagement. It would also allow for longitudinal
studies to track how users’ interactions with the system
evolve over time and how well the recommendations align
with their long-term learning goals.</p>
      <p>Future Work
We plan to undertake several further steps to advance our
research. Firstly, we aim to conduct thorough evaluations
and tests to validate the eficacy and reliability of our
recommender systems. This will involve integrating user
studies and utilizing real user data once our systems are
deployed on our e-learning platform. Such measures will
enable us to robustly measure performance and refine our
approach. Secondly, we will focus on enhancing system
performance, considering scalability and the potential to
expand our technology to encompass a broader range of
educational tools and platforms. These eforts will ensure
that our recommender systems not only meet current
educational needs but also adapt to future demands and
technological advancements. Thirdly, we could deploy
RAMO on our own e-learning platform, and then have
the opportunity to gather comprehensive user data and
utilize our own course dataset rather than Coursera’s.
This deployment would allow us to conduct extensive
testing and validation, further proving the eligibility and
efectiveness of the LLM for recommending courses. With
access to real-time user data, we could continuously refine
our algorithms, making the system more adaptive and
responsive to users’ evolving needs.</p>
      <p>To evaluate the efectiveness of our LLM-based course
recommendation system, we plan to conduct a comprehensive
experiment that includes quantitative metrics, user studies,
and personalization improvements. Our experiment aims
to assess both the relevancy of the recommendations and
the satisfaction of the users with the recommended courses.</p>
      <p>We will utilize several quantitative metrics to evaluate the
performance of the recommendation system. Key metrics
include post-test performance, measured by the improvement
in students’ scores from pre-test to post-test after tutoring
sessions, and course completion rate, which compares the
rate of course completion between students who follow the
system’s recommendations and those who do not.
Additionally, engagement rate will be tracked by monitoring whether
students continue engaging with the lesson without
dropping out midway. User satisfaction will also be assessed
through feedback collected after each lesson via a
thumbsup or thumbs-down system and detailed surveys. To gather
qualitative insights into the system’s efectiveness and user
experience, we will conduct user studies. These will involve
satisfaction surveys completed by students following each
lesson to gauge their satisfaction with the course content
and the relevance of the recommendations, as well as focus
group discussions to explore students’ experiences in more
depth and gather suggestions for improvement.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>We extend our sincere gratitude to Chenfei Lou, a current
software engineer at X (former twitter), for his invaluable
guidance in developing our demo. We also thank Sandy
Zhao, a current master’s student in the CMU METALs
program, for her excellent assistance in generating the
wonderful diagram. Additionally, we appreciate Yuting Wang, an
undergraduate student at CMU, for her help in refining the
design in this paper.
1–8</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M. H.</given-names>
            <surname>Baturay</surname>
          </string-name>
          ,
          <article-title>An overview of the world of moocs</article-title>
          ,
          <source>Procedia - Social and Behavioral Sciences</source>
          <volume>174</volume>
          (
          <year>2015</year>
          )
          <fpage>427</fpage>
          -
          <lpage>433</lpage>
          . doi:https://doi.org/10.1016/j.sbspro.
          <year>2015</year>
          .
          <volume>01</volume>
          .685, international Conference on New Horizons in Education,
          <source>INTE</source>
          <year>2014</year>
          ,
          <volume>25</volume>
          -
          <fpage>27</fpage>
          June 2014, Paris, France.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>N. M.</given-names>
            <surname>Castillo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. T.</given-names>
            <surname>Zahra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. A.</given-names>
            <surname>Wagner</surname>
          </string-name>
          ,
          <article-title>Moocs for development: Trends, challenges, and opportunities</article-title>
          ,
          <source>Information Technologies &amp; International Development</source>
          <volume>11</volume>
          (
          <year>2015</year>
          ) pp-
          <fpage>35</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>J.</given-names>
            <surname>Knox</surname>
          </string-name>
          ,
          <article-title>Digital culture clash:“massive” education in the e-learning and digital cultures mooc</article-title>
          ,
          <source>Distance Education</source>
          <volume>35</volume>
          (
          <year>2014</year>
          )
          <fpage>164</fpage>
          -
          <lpage>177</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>C.</given-names>
            <surname>Romero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ventura</surname>
          </string-name>
          ,
          <article-title>Educational data mining: a review of the state of the art</article-title>
          ,
          <source>IEEE Transactions on Systems, Man, and Cybernetics</source>
          , Part C (
          <article-title>applications</article-title>
          and reviews)
          <volume>40</volume>
          (
          <year>2010</year>
          )
          <fpage>601</fpage>
          -
          <lpage>618</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Gulzar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. A.</given-names>
            <surname>Leema</surname>
          </string-name>
          , G. Deepak, Pcrs:
          <article-title>Personalized course recommender system based on hybrid approach</article-title>
          ,
          <source>Procedia Computer Science</source>
          <volume>125</volume>
          (
          <year>2018</year>
          )
          <fpage>518</fpage>
          -
          <lpage>524</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J.</given-names>
            <surname>Jeevamol</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Renumol</surname>
          </string-name>
          ,
          <article-title>An ontology-based hybrid elearning content recommender system for alleviating the cold-start problem</article-title>
          ,
          <source>Education and Information Technologies</source>
          <volume>26</volume>
          (
          <year>2021</year>
          )
          <fpage>4993</fpage>
          -
          <lpage>5022</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Fang</surname>
          </string-name>
          , C. Shi,
          <article-title>Meta-learning on heterogeneous information networks for cold-start recommendation</article-title>
          ,
          <source>in: Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery &amp; data mining</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>1563</fpage>
          -
          <lpage>1573</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>T. E.</given-names>
            <surname>Kolb</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Wagne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sertkan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Neidhardt</surname>
          </string-name>
          ,
          <article-title>Potentials of combining local knowledge and llms for recommender systems</article-title>
          , in: # PLACEHOLDER_
          <article-title>PARENT_METADATA_VALUE#</article-title>
          , volume
          <volume>3560</volume>
          , CEUR-WS. org,
          <year>2023</year>
          , pp.
          <fpage>61</fpage>
          -
          <lpage>64</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , T. Wang,
          <string-name>
            <given-names>G.</given-names>
            <surname>Xiong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Lu</surname>
          </string-name>
          , G. Medioni,
          <article-title>Gpt4rec: A generative framework for personalized recommendation and user interests interpretation</article-title>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2304</volume>
          .
          <fpage>03879</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <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>
          . arXiv:
          <volume>2303</volume>
          .
          <fpage>14524</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>H.</given-names>
            <surname>Lyu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zeng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <surname>S. Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Leung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <article-title>Llm-rec: Personalized recommendation via prompting large language models</article-title>
          ,
          <year>2024</year>
          . arXiv:
          <volume>2307</volume>
          .
          <fpage>15780</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xiong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Jia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Pan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Retrieval-augmented generation for large language models: A survey</article-title>
          ,
          <source>arXiv preprint arXiv:2312.10997</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Feng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Feng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Qin</surname>
          </string-name>
          ,
          <article-title>Retrievalgeneration synergy augmented large language models</article-title>
          ,
          <source>in: ICASSP 2024-2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</source>
          , IEEE,
          <year>2024</year>
          , pp.
          <fpage>11661</fpage>
          -
          <lpage>11665</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>J.</given-names>
            <surname>Basilico</surname>
          </string-name>
          , T. Hofmann,
          <article-title>Unifying collaborative and content-based filtering</article-title>
          ,
          <source>in: Proceedings of the twentyifrst international conference on Machine learning</source>
          ,
          <year>2004</year>
          , p.
          <fpage>9</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>J. B. Schafer</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Frankowski</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Herlocker</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Sen</surname>
          </string-name>
          ,
          <article-title>Collaborative filtering recommender systems, in: The adaptive web: methods and strategies of web personalization</article-title>
          , Springer,
          <year>2007</year>
          , pp.
          <fpage>291</fpage>
          -
          <lpage>324</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Koren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Rendle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Bell</surname>
          </string-name>
          ,
          <article-title>Advances in collaborative filtering, Recommender systems handbook (</article-title>
          <year>2021</year>
          )
          <fpage>91</fpage>
          -
          <lpage>142</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>X.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Shi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Huang</surname>
          </string-name>
          , N. Liu,
          <article-title>Could small language models serve as recommenders? towards data-centric cold-start recommendation</article-title>
          ,
          <source>in: Proceedings of the ACM on Web Conference</source>
          <year>2024</year>
          ,
          <year>2024</year>
          , pp.
          <fpage>3566</fpage>
          -
          <lpage>3575</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Hasan</surname>
          </string-name>
          ,
          <article-title>How does chatgpt generate humanlike text</article-title>
          ?,
          <year>2023</year>
          . URL: https://dev.to/hasan048/ how
          <article-title>-does-chatgpt-generate-human-like-text-3ljj.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <article-title>ZDNet, What is chatgpt and why does it matter? here's everything you need to know, 2024</article-title>
          . URL: https://www.zdnet.com/article/ what-is
          <article-title>-chatgpt-and-why-does-it-matter-heres-everything-you-need-to-</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>M. R.</given-names>
            <surname>Kabir</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <article-title>An llm-powered adaptive practicing system</article-title>
          , in: AIED 2023 workshop
          <article-title>on Empowering Education with LLMs-the Next-Gen Interface and Content Generation</article-title>
          ,
          <string-name>
            <surname>AIED</surname>
          </string-name>
          ,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Liang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. S.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Wen</surname>
          </string-name>
          ,
          <article-title>Large language models for education: A survey and outlook</article-title>
          ,
          <source>arXiv preprint arXiv:2403.18105</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>S. E.</given-names>
            <surname>Huber</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kiili</surname>
          </string-name>
          , S. Nebel, R. M.
          <string-name>
            <surname>Ryan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Sailer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>Ninaus, Leveraging the potential of large language models in education through playful and game-based learning</article-title>
          ,
          <source>Educational Psychology Review</source>
          <volume>36</volume>
          (
          <year>2024</year>
          )
          <fpage>25</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>W.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Jin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.-S.</given-names>
            <surname>Tsai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Gašević</surname>
          </string-name>
          , G. Chen,
          <article-title>Can large language models provide feedback to students? a case study on chatgpt</article-title>
          ,
          <source>in: 2023 IEEE International Conference on Advanced Learning Technologies (ICALT)</source>
          , IEEE,
          <year>2023</year>
          , pp.
          <fpage>323</fpage>
          -
          <lpage>325</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>W.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.-S.</given-names>
            <surname>Tsai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Aldino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Jin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Gasevic</surname>
          </string-name>
          , et al.,
          <article-title>Assessing the proficiency of large language models in automatic feedback generation: An evaluation study (????).</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>L.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Borchers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <article-title>3dg: A framework for using generative ai for handling sparse learner performance data from intelligent tutoring systems</article-title>
          ,
          <source>arXiv preprint arXiv:2402.01746</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>L.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Borchers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Sabatini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hollander</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <article-title>Predicting learning performance with large language models: A study in adult literacy</article-title>
          ,
          <source>arXiv preprint arXiv:2403.14668</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>J.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Han</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. R.</given-names>
            <surname>Thomas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gurung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gupta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Aleven</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. R.</given-names>
            <surname>Koedinger</surname>
          </string-name>
          ,
          <article-title>How can i get it right? using gpt to rephrase incorrect trainee responses</article-title>
          ,
          <source>arXiv preprint arXiv:2405.00970</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Levonian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gade</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Henkel</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.- E. Postle</surname>
          </string-name>
          , W. Xing,
          <article-title>Retrieval-augmented generation to improve math question-answering: Trade-ofs between groundedness and human preference</article-title>
          ,
          <source>arXiv preprint arXiv:2310.03184</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>S.</given-names>
            <surname>Jacobs</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jaschke</surname>
          </string-name>
          ,
          <article-title>Leveraging lecture content for improved feedback: Explorations with gpt-4 and retrieval augmented generation</article-title>
          ,
          <source>arXiv preprint arXiv:2405.06681</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>J.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gurung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. R.</given-names>
            <surname>Thomas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Borchers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gupta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. R.</given-names>
            <surname>Koedinger</surname>
          </string-name>
          , et al.,
          <article-title>Improving assessment of tutoring practices using retrieval-augmented generation</article-title>
          ,
          <source>arXiv preprint arXiv:2402.14594</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>R.</given-names>
            <surname>Vinay</surname>
          </string-name>
          , G. Spitale,
          <string-name>
            <given-names>N.</given-names>
            <surname>Biller-Andorno</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Germani</surname>
          </string-name>
          ,
          <article-title>Emotional manipulation through prompt engineering amplifies disinformation generation in ai large language models</article-title>
          ,
          <source>arXiv preprint arXiv:2403.03550</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <surname>Maximum</surname>
          </string-name>
          length - netdocuments,
          <year>2024</year>
          . URL: https://support.netdocuments.com/s/article/ Maximum-Length, accessed:
          <fpage>2024</fpage>
          -07-05.
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <surname>Meta</surname>
          </string-name>
          ,
          <source>Llama: Large language model meta ai</source>
          ,
          <year>2024</year>
          . URL: https://llama.meta.com/.
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <surname>OpenAI</surname>
          </string-name>
          , New and improved embedding model,
          <year>2024</year>
          . URL: https://openai.com/index/ new-and
          <article-title>-improved-embedding-model/.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , Bert:
          <article-title>Pre-training of deep bidirectional transformers for language understanding</article-title>
          ,
          <source>in: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (Long and Short Papers),
          <year>2019</year>
          , pp.
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <given-names>B.</given-names>
            <surname>Moradiya</surname>
          </string-name>
          ,
          <article-title>The battle of language models: Openai vs</article-title>
          . bert,
          <year>2023</year>
          . URL: https://medium.com/@
          <article-title>moradiyabhavik/ the-battle-of-language-models-openai-vs-bert-ee46f4e5ef2f.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [37]
          <string-name>
            <given-names>O.</given-names>
            <surname>Topsakal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. C.</given-names>
            <surname>Akinci</surname>
          </string-name>
          ,
          <article-title>Creating large language model applications utilizing langchain: A primer on developing llm apps fast</article-title>
          ,
          <source>in: International Conference on Applied Engineering and Natural Sciences</source>
          , volume
          <volume>1</volume>
          ,
          <year>2023</year>
          , pp.
          <fpage>1050</fpage>
          -
          <lpage>1056</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          [38]
          <string-name>
            <given-names>J.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. R.</given-names>
            <surname>Thomas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Han</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. D.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gupta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Gatz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Tipper</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. R.</given-names>
            <surname>Koedinger</surname>
          </string-name>
          ,
          <article-title>Personalized learning squared (plus): Doubling math learning through ai-assisted tutoring (</article-title>
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>