<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="review-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">61263</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2025.061263</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Review</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>A Critical Review of Methods and Challenges in Large Language Models</article-title>
<alt-title alt-title-type="left-running-head">A Critical Review of Methods and Challenges in Large Language Models</alt-title>
<alt-title alt-title-type="right-running-head">A Critical Review of Methods and Challenges in Large Language Models</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Moradi</surname><given-names>Milad</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><email>m.moradi-vastegani@tricentis.com</email></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Yan</surname><given-names>Ke</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Colwell</surname><given-names>David</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Samwald</surname><given-names>Matthias</given-names></name><xref ref-type="aff" rid="aff-3">3</xref></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Asgari</surname><given-names>Rhona</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<aff id="aff-1"><label>1</label><institution>AI Research</institution>, <addr-line>Tricentis, Vienna, 1220</addr-line>, <country>Austria</country></aff>
<aff id="aff-2"><label>2</label><institution>AI Research</institution>, <addr-line>Tricentis, Sydney, NSW 2010</addr-line>, <country>Australia</country></aff>
<aff id="aff-3"><label>3</label><institution>Institute of Artificial Intelligence, Center for Medical Statistics, Informatics, and Intelligent Systems, Medical University of Vienna</institution>, <addr-line>Vienna, 1090</addr-line>, <country>Austria</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Milad Moradi. Email: <email>m.moradi-vastegani@tricentis.com</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2025</year>
</pub-date>
<pub-date date-type="pub" publication-format="electronic">
<day>17</day><month>02</month><year>2025</year>
</pub-date>
<volume>82</volume>
<issue>2</issue>
<fpage>1681</fpage>
<lpage>1698</lpage>
<history>
<date date-type="received">
<day>20</day>
<month>11</month>
<year>2024</year>
</date>
<date date-type="accepted">
<day>09</day>
<month>1</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2025 The Authors.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Published by Tech Science Press.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_61263.pdf"></self-uri>
<abstract>
<p>This critical review provides an in-depth analysis of Large Language Models (LLMs), encompassing their foundational principles, diverse applications, and advanced training methodologies. We critically examine the evolution from Recurrent Neural Networks (RNNs) to Transformer models, highlighting the significant advancements and innovations in LLM architectures. The review explores state-of-the-art techniques such as in-context learning and various fine-tuning approaches, with an emphasis on optimizing parameter efficiency. We also discuss methods for aligning LLMs with human preferences, including reinforcement learning frameworks and human feedback mechanisms. The emerging technique of retrieval-augmented generation, which integrates external knowledge into LLMs, is also evaluated. Additionally, we address the ethical considerations of deploying LLMs, stressing the importance of responsible and mindful application. By identifying current gaps and suggesting future research directions, this review provides a comprehensive and critical overview of the present state and potential advancements in LLMs. This work serves as an insightful guide for researchers and practitioners in artificial intelligence, offering a unified perspective on the strengths, limitations, and future prospects of LLMs.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Large language models</kwd>
<kwd>artificial intelligence</kwd>
<kwd>natural language processing</kwd>
<kwd>machine learning</kwd>
<kwd>generative artificial intelligence</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Generative Artificial Intelligence (AI) has rapidly advanced, transforming AI through models like the Generative Pre-trained Transformer (GPT) series [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-2">2</xref>]. With large neural networks, novel Machine Learning (ML) algorithms, and extensive training datasets, these models excel in understanding and generating human-like text. Their accessibility and open-source frameworks have democratized generative Large Language Models (LLMs), enabling their integration across sectors such as chatbots, healthcare, and finance [<xref ref-type="bibr" rid="ref-3">3</xref>&#x2013;<xref ref-type="bibr" rid="ref-6">6</xref>]. This review provides a comprehensive analysis of LLMs, examining their foundational principles, applications, methodologies, and challenges. By evaluating existing methods, identifying research gaps, and suggesting future directions, it aims to offer coherent insights valuable to researchers and practitioners.</p>
<p>In the early 2010s, Recurrent Neural Networks (RNNs) demonstrated effectiveness in sequential processing for capturing contextual dependencies and generating coherent text [<xref ref-type="bibr" rid="ref-7">7</xref>]. However, they struggled with long-range dependencies, vanishing or exploding gradients, and slow processing [<xref ref-type="bibr" rid="ref-8">8</xref>]. Transformers revolutionized text generation by introducing attention mechanisms that capture context across entire sequences simultaneously [<xref ref-type="bibr" rid="ref-9">9</xref>]. Models like GPT outperformed RNNs with parallelization, improved long-term dependency handling, and enhanced linguistic modeling through multi-headed self-attention [<xref ref-type="bibr" rid="ref-10">10</xref>]. The capabilities of Large Language Models (LLMs) have grown exponentially due to advancements in transformer architectures, massive text datasets, and computational power [<xref ref-type="bibr" rid="ref-11">11</xref>,<xref ref-type="bibr" rid="ref-12">12</xref>]. These developments, along with increased parameter counts, enable LLMs to excel in complex NLP tasks. Widely adopted across fields like healthcare, finance, education, and technology, LLMs demonstrate versatility and transformative impact [<xref ref-type="bibr" rid="ref-3">3</xref>,<xref ref-type="bibr" rid="ref-4">4</xref>,<xref ref-type="bibr" rid="ref-13">13</xref>,<xref ref-type="bibr" rid="ref-14">14</xref>]. <xref ref-type="table" rid="table-1">Table 1</xref> highlights prominent LLMs developed since transformers&#x2019; advent.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Well-known LLMs developed and released since 2018, along with the number of parameters each one has</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col width="95mm"/>
<col/>
</colgroup>
<thead>
<tr>
<th>Year</th>
<th>Short name</th>
<th>Full name</th>
<th>Parameters</th>
</tr>
</thead>
<tbody>
<tr>
<td rowspan="2">2018</td>
<td>GPT-1</td>
<td>Generative pre-trained transformer 1</td>
<td>117 million</td>
</tr>
<tr>
<td>BERT-large</td>
<td>Bidirectional encoder representation from transformers</td>
<td>340 million</td>
</tr>
<tr>
<td rowspan="2">2019</td>
<td>XLNet-large</td>
<td>&#x2013;</td>
<td>340 million</td>
</tr>
<tr>
<td>GPT-2</td>
<td>Generative pre-trained transformer 2</td>
<td>1.5 billion</td>
</tr>
<tr>
<td rowspan="2">2020</td>
<td>T5</td>
<td>Text-to-text transfer transformer</td>
<td>11 billion</td>
</tr>
<tr>
<td>GPT-3</td>
<td>Generative pre-trained transformer 3</td>
<td>175 billion</td>
</tr>
<tr>
<td>2021</td>
<td>LaMDA</td>
<td>Language model for dialogue applications</td>
<td>137 billion</td>
</tr>
<tr>
<td rowspan="2">2022</td>
<td>PaLM-1</td>
<td>Pathways language model 1</td>
<td>540 billion</td>
</tr>
<tr>
<td>BLOOM</td>
<td>BigScience large open-science open-access multilingual language model</td>
<td>176 billion</td>
</tr>
<tr>
<td rowspan="6">2023</td>
<td>LLaMA</td>
<td>Large language model meta AI</td>
<td>65 billion</td>
</tr>
<tr>
<td>Claude-1</td>
<td>&#x2013;</td>
<td>93 billion</td>
</tr>
<tr>
<td>Claude-2</td>
<td>&#x2013;</td>
<td>340 billion</td>
</tr>
<tr>
<td>PaLM-2</td>
<td>Pathways language model 2</td>
<td>137 billion</td>
</tr>
<tr>
<td>GPT-4</td>
<td>Generative pre-trained transformer 4</td>
<td>&#x003E;1 trillion</td>
</tr>
<tr>
<td>Gemini 1</td>
<td>&#x2013;</td>
<td>1.5 trillion</td>
</tr>
<tr>
<td rowspan="2">2024</td>
<td>Mistral</td>
<td>&#x2013;</td>
<td>7 billion</td>
</tr>
<tr>
<td>Gemini 1.5</td>
<td>&#x2013;</td>
<td>2.4 trillion</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>LLMs are widely applied across domains, excelling in NLP tasks like text generation, translation, summarization, and sentiment analysis. They power chatbots and virtual assistants in conversational systems, support medical diagnosis and patient interaction in healthcare, and enhance finance through automated trading, fraud detection, and customer support. In education, they enable personalized learning and tutoring, while in technology and creative arts, they aid in code generation, content creation, music composition, and visual art generation.</p>
<p>LLMs have demonstrated significant practical value in solving real-world problems across various domains. For instance, in healthcare, LLMs like GPT-4 are used to draft patient discharge summaries, reducing administrative burdens on medical professionals while ensuring accuracy in medical documentation [<xref ref-type="bibr" rid="ref-3">3</xref>,<xref ref-type="bibr" rid="ref-15">15</xref>]. In finance, models such as BloombergGPT assist analysts by generating detailed sentiment analyses of market trends based on news and financial reports, enabling more informed investment decisions [<xref ref-type="bibr" rid="ref-14">14</xref>]. In the field of education, tools powered by LLMs like ChatGPT provide personalized tutoring, helping students understand complex topics through interactive question-and-answer sessions. Furthermore, in software development, LLM-based systems like Copilot aid programmers by offering real-time code suggestions and debugging assistance, thereby accelerating development processes. These examples underscore the transformative potential of LLMs in automating routine tasks, enhancing decision-making processes, and fostering innovation across diverse sectors.</p>
<p><xref ref-type="table" rid="table-2">Table 2</xref> provides a taxonomy of these applications. LLMs significantly improve efficiency and productivity by automating tasks, enhancing accessibility via translation and summarization, and fostering innovation in creative industries. They reduce business costs and support informed decision-making in healthcare and finance. Educational outcomes are improved through interactive tutoring. However, challenges like bias, privacy, security, transparency, and environmental impact must be addressed to ensure responsible deployment.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Taxonomy and classification of applications of LLMs</title>
</caption>
<table>
<colgroup>
<col width="60mm"/>
<col width="100mm"/>
</colgroup>
<thead>
<tr>
<th>Domain</th>
<th>LLM applications</th>
</tr>
</thead>
<tbody>
<tr>
<td>Education and research</td>
<td><list list-type="bullet">
<list-item>
<p>Tutoring systems providing personalized learning experiences.</p></list-item>
<list-item>
<p>Summarization of academic papers and generation of research hypotheses.</p></list-item>
</list></td>
</tr>
<tr>
<td>Healthcare and medical</td>
<td><list list-type="bullet">
<list-item>
<p>Medical documentation automation.</p></list-item>
<list-item>
<p>Analysis and generation of patient information leaflets.</p></list-item>
</list></td>
</tr>
<tr>
<td>Finance and economics</td>
<td><list list-type="bullet">
<list-item>
<p>Sentiment analysis of financial reports and news.</p></list-item>
<list-item>
<p>Automated financial advising and report generation.</p></list-item>
</list></td>
</tr>
<tr>
<td>Technology and software development</td>
<td><list list-type="bullet">
<list-item>
<p>Code generation and assistance in software development.</p></list-item>
<list-item>
<p>Bug detection and automated code documentation.</p></list-item>
</list></td>
</tr>
<tr>
<td>Legal and compliance</td>
<td><list list-type="bullet">
<list-item>
<p>Automated contract review and legal document analysis.</p></list-item>
<list-item>
<p>Compliance monitoring through the analysis of communications and documents.</p></list-item>
</list></td>
</tr>
<tr>
<td>Marketing and advertising</td>
<td><list list-type="bullet">
<list-item>
<p>Generation of personalized marketing content.</p></list-item>
<list-item>
<p>Social media content creation and management.</p></list-item>
</list></td>
</tr>
<tr>
<td>Entertainment and gaming</td>
<td><list list-type="bullet">
<list-item>
<p>Creating dynamic dialogues for non-player characters in video games.</p></list-item>
<list-item>
<p>Scriptwriting assistance for movies and TV shows.</p></list-item>
</list></td>
</tr>
<tr>
<td>Human resources</td>
<td><list list-type="bullet">
<list-item>
<p>Resume screening and job matching.</p></list-item>
<list-item>
<p>Automated generation of job descriptions.</p></list-item>
</list></td>
</tr>
<tr>
<td>Public relations and communications</td>
<td><list list-type="bullet">
<list-item>
<p>Crisis management through sentiment analysis of social media.</p></list-item>
<list-item>
<p>Automated press release generation.</p></list-item>
</list></td>
</tr>
<tr>
<td>Customer service</td>
<td><list list-type="bullet">
<list-item>
<p>Chatbots for handling customer inquiries.</p></list-item>
<list-item>
<p>Automated email response generation.</p></list-item>
</list></td>
</tr>
<tr>
<td>Content creation and journalism</td>
<td><list list-type="bullet">
<list-item>
<p>Automated generation of news articles and reports.</p></list-item>
<list-item>
<p>Writing assistance for creative writing, scripts, and advertising copy.</p></list-item>
</list></td>
</tr>
<tr>
<td>Translation and linguistics</td>
<td><list list-type="bullet">
<list-item>
<p>Real-time translation services.</p></list-item>
<list-item>
<p>Dialect and language preservation through linguistic analysis.</p></list-item>
</list></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>This review explores the lifecycle of LLM-powered applications, covering model architecture selection, pre-training, domain adaptation, alignment with human preferences, and application integration. It examines state-of-the-art methodologies and best practices in designing, developing, and deploying LLMs. Key challenges, including sensitivity analysis, uncertainty quantification, and error improvement, are highlighted. The review aims to provide a comprehensive understanding of LLMs and identify opportunities for future research and innovation.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Pre-Training LLMs</title>
<p>Pre-training large language models (LLMs) involves training on extensive text data to learn patterns, contextual relationships, and language structures [<xref ref-type="bibr" rid="ref-16">16</xref>]. This process develops a generalized understanding of language, stored in the model&#x2019;s parameters, which act as its memory. Larger parameter counts enhance the model&#x2019;s memory and ability to handle complex tasks [<xref ref-type="bibr" rid="ref-17">17</xref>]. Parameters are optimized during pre-training to minimize loss and improve accuracy. Once pre-trained, LLMs can be fine-tuned on task-specific datasets, leveraging their broad linguistic knowledge for diverse applications.</p>
<sec id="s2_1">
<label>2.1</label>
<title>Model Architectures and Pre-Training Objectives</title>
<p>LLMs are typically pre-trained in a self-supervised manner, where no labeled training samples are utilized to direct the training process [<xref ref-type="bibr" rid="ref-18">18</xref>]. The choice of pretraining objectives significantly influences the performance and capabilities of LLMs, and these objectives vary depending on the model architecture and intended tasks [<xref ref-type="bibr" rid="ref-19">19</xref>]. A transformer language model can be composed of an encoder, a decoder, or both components, each serving distinct purposes and having specific advantages and limitations.</p>
<sec id="s2_1_1">
<label>2.1.1</label>
<title>Encoder-Decoder Models</title>
<p>Encoder-decoder models, or sequence-to-sequence (seq2seq) models, use an encoder to process input sequences and a decoder to generate outputs, excelling in tasks like translation, question answering, and summarization. Their pretraining combines masked language modeling with seq2seq reconstruction, enabling contextual representation learning and autoregressive generation. Notable examples include T5 [<xref ref-type="bibr" rid="ref-20">20</xref>] and BART [<xref ref-type="bibr" rid="ref-21">21</xref>]. Despite their effectiveness, encoder-decoder models face scalability challenges when expanded to billions of parameters, prompting a shift toward encoder-only and decoder-only models in modern LLM design. Addressing these scalability issues while maintaining performance on complex tasks remains a critical research focus. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> illustrates the seq2seq architecture.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>The overall architecture of an encoder-decoder transformer language model. The encoder and decoder components consist of several encoder and decoder blocks. In the encoder component, the input is first mapped to embeddings, which are numerical vectors. The embeddings are combined with positional encodings, then multi-head self-attention computes a representation conditioning on other words in the sequence. Other computations such as addition, normalization, and feed-forward layers perform subsequent computations resulting in the final encoded input. The decoder component receives the outputs generated in the previous time steps, converts them to embeddings, combines them with positional encoding, and passes them through self-attention, encoder-attention, addition, normalization and feed-forward layers. Linear transformations and the softmax function are finally applied to have probabilities over the vocabulary for the next output token. Encoder-only and decoder-only models are comprised of multiple encoder or decoder blocks, respectively</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61263-fig-1.tif"/>
</fig>
</sec>
<sec id="s2_1_2">
<label>2.1.2</label>
<title>Encoder-Only Models</title>
<p>Encoder-only models, or autoencoders, use self-attention to compress input sequences into dense contextual representations and reconstruct the input [<xref ref-type="bibr" rid="ref-22">22</xref>]. Pre-trained with a masked language modeling objective, they predict masked tokens based on context. Examples include BERT [<xref ref-type="bibr" rid="ref-10">10</xref>] and RoBERTa [<xref ref-type="bibr" rid="ref-23">23</xref>], excelling in tasks like text classification, sentiment analysis, and Named Entity Recognition (NER). While effective for understanding and representation tasks, encoder-only models have limited generative capabilities compared to decoder-only models.</p>
</sec>
<sec id="s2_1_3">
<label>2.1.3</label>
<title>Decoder-Only Models</title>
<p>Decoder-only models, or autoregressive models, generate outputs by attending to previously generated tokens and conditioning on the context [<xref ref-type="bibr" rid="ref-24">24</xref>]. Pre-trained with the causal language modeling objective, they predict the next token based on preceding tokens, ensuring unidirectional causality. These models excel in text generation tasks, with examples including GPT [<xref ref-type="bibr" rid="ref-25">25</xref>], Chinchilla [<xref ref-type="bibr" rid="ref-26">26</xref>], BLOOM [<xref ref-type="bibr" rid="ref-27">27</xref>], and LLaMA [<xref ref-type="bibr" rid="ref-28">28</xref>]. Despite their dominance in generative tasks, decoder-only models require vast data and computational resources and often struggle with maintaining coherence over long sequences or avoiding repetitive outputs.</p>
<p>Comparative evaluation of these architectures reveals distinct advantages and limitations. Encoder-decoder models excel in seq2seq tasks but face scalability challenges. Encoder-only models are efficient in understanding tasks but are limited in generative capabilities. Decoder-only models are unparalleled in text generation but require extensive computational resources and data. A critical gap in current research is the integration of strengths from each model architecture to develop more versatile and efficient LLMs. Additionally, there is a need for innovative pretraining objectives that can further enhance the performance and scalability of these models. Addressing these gaps will be crucial for the advancement of LLMs and their application across diverse domains.</p>
</sec>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Domain Adaptation</title>
<p>Domain adaptation in LLMs refers to the process of adjusting these models to perform effectively in specific domains of interest or on particular tasks. LLMs are pre-trained on vast and diverse datasets, but their generalization to specific domains may be limited. Domain adaptation helps overcome this limitation by training the model on domain-specific or task-specific data, enabling it to understand and generate contextually relevant content within that particular domain or task [<xref ref-type="bibr" rid="ref-29">29</xref>]. Domain adaptation can be generally performed through in-context learning or fine-tuning.</p>
<sec id="s3_1">
<label>3.1</label>
<title>In-Context Learning</title>
<p>In-context learning in LLMs enables dynamic adaptation based on conversational context, improving the generation of coherent and consistent responses [<xref ref-type="bibr" rid="ref-25">25</xref>]. This capability is essential for tasks like chatbots, virtual assistants, and interactive applications, where maintaining context is crucial [<xref ref-type="bibr" rid="ref-30">30</xref>]. The main paradigms&#x2014;zero-shot, one-shot, and few-shot learning&#x2014;highlight the adaptability of LLMs.</p>
<p>Zero-shot learning allows LLMs to perform tasks without explicit training by leveraging pre-existing knowledge and prompts [<xref ref-type="bibr" rid="ref-31">31</xref>]. While showcasing generalization, it is heavily reliant on prompt clarity and often produces inconsistent results. One-shot learning uses a single task example to identify patterns and generalize [<xref ref-type="bibr" rid="ref-32">32</xref>]. It balances zero-shot and few-shot learning but depends on example quality and struggles with complex tasks. Few-shot learning provides multiple examples, enhancing task adaptation and accuracy [<xref ref-type="bibr" rid="ref-33">33</xref>]. Despite being the most adaptable paradigm, it is sensitive to example selection and constrained by context window limits. <xref ref-type="fig" rid="fig-2">Fig. 2</xref> illustrates these paradigms with a movie review title generation example. Few-shot learning, while most accurate, faces challenges in example representativeness and extensive context needs.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>The two different domain-adaptation paradigms of LLMs for a movie review title generation example task. In-context learning offers three different methods, i.e., zero-shot, one-shot, and few-shot learning. Fine-tuning can be performed on either a single dataset for single-task learning or on multiple datasets for multi-task learning</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61263-fig-2.tif"/>
</fig>
<p>In-context learning offers benefits such as reduced dependency on large training datasets, rapid task adaptation, and task flexibility. However, it has limitations, including the context window being occupied by examples, restricting the handling of long or complex inputs. Smaller models are less effective due to limited generalization capacity, and performance heavily depends on the quality of the provided examples [<xref ref-type="bibr" rid="ref-34">34</xref>]. Key research gaps include optimizing in-context learning for smaller models, improving example quality, and efficiently utilizing the context window to handle larger inputs. Addressing these challenges is essential for enhancing the practicality and robustness of in-context learning in LLMs.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Fine-Tuning</title>
<p>Fine-tuning LLMs adapts pre-trained models to specific tasks or domains, enhancing performance and applicability. This process uses supervised training on task-specific datasets to teach the model relevant complexities, vocabulary, and context, optimizing it for specialized applications like sentiment analysis, summarization, or domain-specific interactions [<xref ref-type="bibr" rid="ref-35">35</xref>]. Effective fine-tuning balances general pre-training knowledge with target task requirements. Instruction fine-tuning refines model behavior using explicit instructions paired with prompt-completion examples [<xref ref-type="bibr" rid="ref-36">36</xref>]. Programming libraries provide templates for converting data into instruction samples for various tasks [<xref ref-type="bibr" rid="ref-35">35</xref>]. While this approach improves task-specific performance, assessing the model&#x2019;s generalization beyond the given instructions remains critical.</p>
<p>Fine-tuning an LLM on a single task can cause catastrophic forgetting, where pre-training knowledge is overwritten, reducing performance on other tasks [<xref ref-type="bibr" rid="ref-37">37</xref>]. This trade-off highlights the challenge of achieving task specialization without losing general knowledge. Multi-task fine-tuning mitigates this by training the model on multiple tasks simultaneously [<xref ref-type="bibr" rid="ref-38">38</xref>]. Approaches like the Fine-tuned Language Net (FLAN), including FLAN-T5 and FLAN-PaLM, use templates to retain generalization while improving task-specific performance [<xref ref-type="bibr" rid="ref-35">35</xref>]. However, this method requires extensive and diverse training samples, making it resource-intensive and challenging to implement.</p>
<p>Fine-tuning methods reveal both benefits and challenges. Instruction fine-tuning improves task-specific performance with clear guidelines but depends on the quality of instructions. Catastrophic forgetting remains a key issue, often addressed through multi-task fine-tuning, which requires extensive data and resources. Parameter-Efficient Fine-Tuning (PEFT) offers a promising alternative by updating only a small subset of model parameters, preserving generalization capabilities while adapting to specific tasks. PEFT reduces the risk of catastrophic forgetting and is more efficient in terms of computational and data requirements.</p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Parameter-Efficient Fine-Tuning</title>
<p>PEFT techniques adapt LLMs to specific tasks without retraining the entire model, addressing the challenges of their immense size and complexity [<xref ref-type="bibr" rid="ref-39">39</xref>&#x2013;<xref ref-type="bibr" rid="ref-41">41</xref>]. PEFT updates a small subset of parameters or adds minimal task-specific layers, preserving the model&#x2019;s general capabilities while reducing computational resources and mitigating catastrophic forgetting by keeping most pre-trained weights intact [<xref ref-type="bibr" rid="ref-39">39</xref>]. This approach enables more flexible and scalable customization. PEFT methods are classified into selective, additive, and reparameterization techniques [<xref ref-type="bibr" rid="ref-42">42</xref>]. Selective methods update specific parameters, layers, or biases for efficient fine-tuning with minimal structural changes [<xref ref-type="bibr" rid="ref-43">43</xref>]. However, these updates may limit adaptability to substantially different tasks, as they are confined to a small portion of the model. <xref ref-type="fig" rid="fig-3">Fig. 3</xref> illustrates these approaches.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Different parameter-efficient fine-tuning techniques for large language models. Selective methods involve selecting and updating a limited number of the model&#x2019;s layers or parameters. Additive techniques usually add extra adapter layers or soft prompts to the model. Reparameterization methods decrease the number of trainable parameters by decomposing the original weight matrix and training the resulting low-rank matrices</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61263-fig-3.tif"/>
</fig>
<p>Additive PEFT methods introduce additional, trainable parameters or layers to a pre-trained model without altering the original model&#x2019;s core structure or parameters. This category includes two primary approaches:</p>
<p><bold>Adapters:</bold> These are trainable layers added to the architecture of a pre-trained language model [<xref ref-type="bibr" rid="ref-44">44</xref>]. Adapters allow the model to learn task-specific adjustments while retaining the original weights. This method is advantageous for modularity, as different adapters can be trained and swapped for different tasks.</p>
<p><bold>Soft Prompting:</bold> This technique involves adding trainable parameters to prompt embeddings, known as soft prompts [<xref ref-type="bibr" rid="ref-45">45</xref>]. These virtual tokens are trained via supervised learning for specific tasks, a process referred to as prompt tuning. Different sets of soft prompts can be trained for various tasks and then swapped in at inference time, enabling the model to maintain its core capabilities while adapting to new tasks.</p>
<p>While additive methods provide flexibility and scalability, they may still require a substantial amount of additional parameters for complex tasks, posing challenges in terms of storage and deployment.</p>
<p>Reparameterization methods like Low-Rank Adaptation (LoRA) reduce the parameters required for fine-tuning by introducing trainable rank decomposition matrices while keeping the original model&#x2019;s weights fixed [<xref ref-type="bibr" rid="ref-46">46</xref>]. These matrices capture task-specific information and are combined during inference to adjust the original weights. LoRA preserves the LLM&#x2019;s generalization capabilities while efficiently adapting it to new tasks, minimizing the need for extensive retraining [<xref ref-type="bibr" rid="ref-47">47</xref>]. Future research should focus on optimizing the rank decomposition process to balance efficiency with task-specific performance.</p>
<p>Comparative evaluation of PEFT methods reveals key trade-offs and opportunities for improvement. Selective methods are computationally efficient but lack flexibility for diverse tasks. Additive methods enhance modularity and task adaptability but can increase parameter count. Reparameterization methods, like LoRA, balance task-specific adaptation and generalization but require careful tuning [<xref ref-type="bibr" rid="ref-46">46</xref>]. Key gaps include developing dynamic fine-tuning methods to adjust based on task complexity and improving scalability for real-world applications. Future research should integrate these approaches, leveraging their strengths while mitigating weaknesses, potentially through hybrid methods combining selective, additive, and reparameterization techniques.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Reinforcement Learning from Human Feedback</title>
<p>LLMs can produce concerning responses due to the diverse and unfiltered nature of their training data, which includes both informative and harmful content [<xref ref-type="bibr" rid="ref-48">48</xref>]. Without safeguards, they risk generating toxic, aggressive, or dangerous outputs [<xref ref-type="bibr" rid="ref-49">49</xref>]. Adhering to principles of being helpful, honest, and harmless is essential to ensure their outputs are beneficial and non-offensive. Reinforcement Learning from Human Feedback (RLHF) refines LLM outputs to align with human values and societal norms, reducing inappropriate or biased content [<xref ref-type="bibr" rid="ref-50">50</xref>]. This human-in-the-loop method helps LLMs better understand nuances and context, while enabling continuous adaptation to new information and societal standards [<xref ref-type="bibr" rid="ref-51">51</xref>]. RLHF enhances LLM robustness, accuracy, and safety, bridging the gap between data-driven AI responses and the complexities of human ethics [<xref ref-type="bibr" rid="ref-52">52</xref>].</p>
<p>A typical RLHF framework consists of a reward model and a Reinforcement Learning (RL) algorithm. The reward model translates human judgments into a format usable by the AI, evaluating outputs from the LLM and assigning scores based on alignment with human values [<xref ref-type="bibr" rid="ref-53">53</xref>]. Building the reward model involves: 1) providing task-specific samples to the LLM, 2) collecting LLM-generated outputs, 3) using human feedback to evaluate alignment with criteria, and 4) training the reward model on these evaluations in a supervised manner. This model then assigns reward values indicating how well the outputs align with human preferences [<xref ref-type="bibr" rid="ref-51">51</xref>].</p>
<p>An RLHF iteration involves: 1) providing a prompt to the LLM, which generates a response, 2) evaluating the response with the reward model to produce a reward value, and 3) using the reward value in the RL algorithm to update the LLM&#x2019;s parameters. This process continues until the model meets alignment criteria or reaches a set iteration limit [<xref ref-type="bibr" rid="ref-51">51</xref>,<xref ref-type="bibr" rid="ref-53">53</xref>]. Proximal Policy Optimization (PPO) is commonly used in RLHF for LLMs [<xref ref-type="bibr" rid="ref-54">54</xref>], and PEFT techniques may be employed to limit parameter updates. <xref ref-type="fig" rid="fig-4">Fig. 4</xref> illustrates the RLHF framework.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>The reinforcement learning from human feedback framework. An AI model needs to be trained first to learn how textual inputs must be rated (or rewarded) with respect to human preferences. The reward model is then used in the main reinforcement learning process to assign a reward to the responses generated by the LLM. An optimization method (usually PPO) updates the LLM&#x2019;s weights based on the reward to align the language model with the specific criteria</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61263-fig-4.tif"/>
</fig>
<p>Direct Preference Optimization (DPO) [<xref ref-type="bibr" rid="ref-53">53</xref>] is a method for aligning model responses with human preferences, particularly useful when reinforcement learning struggles to distinguish subtle human judgments or lacks explicit labels. The DPO process involves: 1) generating response pairs for a given input, 2) evaluating the pairs to determine which response better aligns with criteria, using human raters or automated systems, and 3) updating model weights to favor preferred responses.</p>
<p>DPO optimizes LLMs to generate human-preferred text rather than minimizing a traditional loss function, making it valuable for applications like chatbots and AI assistants where user-judged quality is critical [<xref ref-type="bibr" rid="ref-55">55</xref>]. A challenge in RLHF is reward hacking, where the model manipulates responses to superficially align with objectives, such as adding unnecessary words to maximize reward scores without fulfilling the intended task or behavior [<xref ref-type="bibr" rid="ref-56">56</xref>]. To mitigate reward hacking, solutions include:
<list list-type="bullet">
<list-item>
<p>Comparing responses from an initial version of the LLM with those from the updated model using measures like Kullback-Leibler divergence to penalize significant deviations [<xref ref-type="bibr" rid="ref-57">57</xref>].</p></list-item>
<list-item>
<p>Employing an ensemble of reward models, each assessing different aspects of alignment with human preferences, or using multiple reward optimization objectives [<xref ref-type="bibr" rid="ref-58">58</xref>].</p></list-item>
</list></p>
<p>Despite its benefits, RLHF faces gaps such as the need for scalable and efficient methods to handle diverse and evolving human feedback. Additionally, improving the robustness of reward models and developing better techniques to prevent reward hacking are crucial for the future of RLHF in making LLMs more aligned with human values and ethics.</p>
</sec>
<sec id="s5">
<label>5</label>
<title>Retrieval-Augmented Generation</title>
<p>LLMs excel in many applications but face limitations, including generating incorrect answers due to reliance on training data. This can lead to &#x201C;hallucinations,&#x201D; where models confidently provide inaccurate responses without sufficient information [<xref ref-type="bibr" rid="ref-59">59</xref>]. Integrating LLMs with external information retrieval systems can improve factual accuracy. Retrieval-Augmented Generation (RAG) combines LLMs with external knowledge retrieval to enhance accuracy and reliability [<xref ref-type="bibr" rid="ref-60">60</xref>]. When a query is presented, RAG retrieves relevant documents from sources like wikis, databases, or web pages, using this data as supplementary context for response generation. This enables the model to provide accurate, up-to-date, and detailed answers, especially for tasks requiring current or specialized knowledge. RAG bridges the gap between LLMs&#x2019; pattern-based learning and the need for real-time, fact-based information, making it a valuable tool for high-accuracy applications. <xref ref-type="fig" rid="fig-5">Fig. 5</xref> illustrates the RAG framework.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>The retrieval-augmented generation framework commonly used in LLM-powered applications. A retrieval subsystem encodes the input prompt to a format suitable for searching into external information sources such as web pages, internal wikis, vector databases, or excel files. The retrieved information is then passed to the LLM along with the input prompt to generate a response that contains relevant and accurate information</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61263-fig-5.tif"/>
</fig>
<p>Vector databases play a key role in the RAG process by efficiently managing and retrieving relevant information [<xref ref-type="bibr" rid="ref-61">61</xref>]. They store text as high-dimensional vectors, or embeddings, created using a language model to capture semantic meaning. When a query is inputted, it is converted into a vector, and the database quickly identifies the most similar vectors, retrieving the most relevant documents [<xref ref-type="bibr" rid="ref-62">62</xref>]. This efficient retrieval enhances RAG&#x2019;s ability to provide accurate, contextually appropriate responses, improving the overall relevance and accuracy of LLM-generated outputs.</p>
<p>RAG enhances traditional LLM approaches by improving accuracy through the integration of external sources, ensuring more factually correct responses. It provides up-to-date information crucial for time-sensitive queries and allows access to specialized knowledge beyond the model&#x2019;s training data, making it ideal for niche applications. Despite its advantages, RAG faces challenges such as dependence on retrieval quality, where the relevance and accuracy of retrieved documents significantly impact the model&#x2019;s responses. Poor retrieval can result in incorrect or irrelevant answers. Additionally, integrating retrieval mechanisms introduces latency, potentially slowing response times. Furthermore, managing and scaling the infrastructure for efficient retrieval and integration with LLMs is complex and resource-intensive. Future research in RAG should address critical gaps, including the development of advanced retrieval algorithms to better match query contexts with relevant documents and optimization techniques to reduce latency for faster responses. Enhancing RAG systems&#x2019; ability to dynamically adapt to diverse queries and contexts without extensive retraining is also essential. Additionally, establishing robust evaluation metrics to assess the performance and reliability of RAG systems in real-world applications is a key area for improvement. In summary, while RAG presents a promising solution to the limitations of traditional LLMs, there is a need for continued research and innovation to address its challenges and fully realize its potential.</p>
<p>Current RAG systems face limitations in accurately matching context and retrieving relevant information, particularly in handling ambiguous or incomplete queries. These challenges can lead to irrelevant or inconsistent outputs, which undermine the reliability of LLMs in dynamic environments. To enhance integration with external knowledge, advancements in retrieval algorithms, such as adaptive context modeling and improved semantic matching, are crucial. Additionally, developing mechanisms to dynamically update and prioritize knowledge bases can enable RAG systems to respond more effectively to evolving information landscapes, thereby improving their performance in real-world applications.</p>
</sec>
<sec id="s6">
<label>6</label>
<title>Ethical Considerations</title>
<p>Developing and using LLMs involve various ethical considerations, reflecting the broad impact this technology can have on society. Here are some key areas of concern:</p>
<p><bold>Bias and fairness:</bold> Language models can inherit and amplify biases present in their training data, potentially leading to unfair or discriminatory outcomes. It&#x2019;s essential to consider how these models might perpetuate biases based on race, gender, age, or other factors, and to take steps to mitigate these biases [<xref ref-type="bibr" rid="ref-48">48</xref>].</p>
<p><bold>Privacy:</bold> Since language models are trained on vast amounts of data, including potentially sensitive or personal information, there are significant privacy concerns. Ensuring that the data used for training respects individuals&#x2019; privacy and does not expose personal information is crucial [<xref ref-type="bibr" rid="ref-63">63</xref>].</p>
<p><bold>Misinformation and manipulation:</bold> These models can generate convincing but false or misleading information, which can be used for malicious purposes like spreading misinformation or manipulating public opinion. Managing and mitigating these risks is a major ethical concern [<xref ref-type="bibr" rid="ref-64">64</xref>].</p>
<p><bold>Transparency and accountability:</bold> Understanding how decisions are made by AI models is essential for accountability, especially when these decisions affect people&#x2019;s lives. Ensuring transparency in how models are trained, what data they use, and how they make predictions is vital for ethical deployment [<xref ref-type="bibr" rid="ref-65">65</xref>].</p>
<p><bold>Environmental impact:</bold> The energy consumption required for training and running large-scale AI models has significant environmental impacts. It&#x2019;s important to consider and minimize the carbon footprint associated with these technologies [<xref ref-type="bibr" rid="ref-66">66</xref>].</p>
<p>Addressing these ethical considerations requires a multi-disciplinary approach, involving not just technologists but also ethicists, policymakers, and representatives from various impacted communities. The development of LLMs necessitates ethical frameworks to address bias, accountability, and societal impact. These frameworks should include practices for mitigating biases through diverse datasets and algorithmic corrections, enhance accountability with audit trails and third-party oversight, and promote sustainability, privacy, and accessibility. Strategies such as participatory design and interdisciplinary ethics boards can guide the responsible development of LLMs, ensuring their evolution aligns with societal values.</p>
</sec>
<sec id="s7">
<label>7</label>
<title>Conclusion and Future Directions</title>
<p>In conclusion, this review has examined the foundational aspects, applications, and methodologies of LLMs, highlighting advances such as in-context learning, parameter-efficient fine-tuning, reinforcement learning from human feedback, and retrieval-augmented generation. While these developments enhance LLM capabilities, ethical considerations emphasize the need for responsible progress. The immense potential of LLMs across various fields calls for continued research and thoughtful application to maximize benefits while addressing challenges responsibly. The future of LLMs is likely to be shaped by advancements in various aspects of technology, ethics, and application domains. Here are some potential future directions:</p>
<p><bold>Model architecture and efficiency:</bold> Developing more efficient and powerful neural network architectures that can process information more effectively. This includes research into sparser models, better parameter efficiency, and techniques to reduce the computational and environmental costs of training and running these models [<xref ref-type="bibr" rid="ref-67">67</xref>].</p>
<p><bold>Improved understanding and contextualization:</bold> Future LLMs need to offer enhanced understanding and contextualization capabilities, allowing them to grasp more complex and nuanced human interactions. This might include better handling of sarcasm, idioms, and cultural reference [<xref ref-type="bibr" rid="ref-68">68</xref>].</p>
<p><bold>Data curation and quality:</bold> Improving the way data is curated and used for training. This involves creating more diverse and representative datasets, and developing methods to reduce biases in the data. It also includes better techniques for data privacy and security [<xref ref-type="bibr" rid="ref-69">69</xref>].</p>
<p><bold>Multimodal integration:</bold> Expanding the capabilities of LLMs to handle multimodal inputs and outputs, such as integrating text with images, audio, and possibly other sensory data. This would allow LLMs to understand and generate a broader range of content [<xref ref-type="bibr" rid="ref-70">70</xref>]. Language-vision hybrid models, which integrate textual and visual information, are at the forefront of advancing artificial intelligence capabilities. These models utilize multimodal learning to improve performance on tasks such as image captioning, visual question answering, and video summarization. By bridging the gap between textual and visual data, they enable a more comprehensive understanding of complex, multimodal contexts, thereby expanding the potential applications of AI across domains such as healthcare, autonomous systems, and creative industries.</p>
<p><bold>Interpretability and explainability:</bold> Enhancing the ability to interpret and explain model decisions. This is crucial for building trust in AI systems and for their safe deployment in sensitive areas like healthcare and law. Enhancing the interpretability of LLMs is a critical area of research, as it allows users to better understand how these models generate specific outputs. Techniques such as attention visualization can help users trace which input tokens are most influential in a model&#x2019;s predictions. Another promising approach involves integrating explainable AI frameworks, such as saliency maps, to highlight key features in the data that drive the model&#x2019;s decisions. Developing post-hoc analysis tools that decompose model outputs into interpretable components can also provide insights into their reasoning processes [<xref ref-type="bibr" rid="ref-71">71</xref>]. Additionally, frameworks for accountability, such as audit trails, third-party reviews, and fail-safe mechanisms, are critical in mitigating harm from misleading outputs. Establishing guidelines for regular model audits, embedding ethical alignment checkpoints during training, and incorporating participatory approaches involving diverse stakeholders can further ensure LLM outputs align with societal values and safety standards.</p>
<p><bold>Improved safety and robustness:</bold> Efforts need to be made to ensure LLMs operate safely within their intended parameters, to strengthen their robustness against adversarial attacks and misuse, and ensuring they are secure from attempts to exploit their capabilities for malicious purposes [<xref ref-type="bibr" rid="ref-72">72</xref>].</p>
<p><bold>AI-human collaboration:</bold> Designing LLMs to facilitate effective collaboration between humans and AI in creative and decision-making processes involves prioritizing adaptability, interactivity, and contextual awareness. LLMs can be enhanced with features such as dynamic prompt engineering and multimodal capabilities to better align with human inputs and preferences. For creative tasks, incorporating tools for iterative feedback and version control allows users to refine AI-generated outputs collaboratively. In decision-making contexts, integrating LLMs with explainability frameworks ensures that users can understand and validate the model&#x2019;s suggestions, fostering trust and accountability. Additionally, hybrid systems that combine LLMs with rule-based or domain-specific modules can support context-sensitive problem-solving while maintaining user oversight.</p>
<p>These potential directions reflect a combination of technical innovations, societal needs, and ethical considerations. LLMs have achieved remarkable advancements, but challenges such as computational inefficiency, environmental impact, biases in training data, hallucinations, and limited interpretability hinder their broader adoption. Addressing these issues requires research into energy-efficient architectures, bias mitigation, improved contextual accuracy, and interpretable decision-making, alongside advancements like multimodal inputs and personalized fine-tuning frameworks. The future of LLMs will depend on balancing cost-effectiveness, scalability, and ethical deployment while maximizing their potential to revolutionize fields like education, healthcare, and content creation. Ensuring fairness, transparency, and sustainability will be crucial to responsibly navigating their societal impacts.</p>
</sec>
</body>
<back>
<ack>
<p>None.</p>
</ack>
<sec>
<title>Funding Statement</title>
<p>The authors received no specific funding for this study.</p>
</sec>
<sec>
<title>Author Contributions</title>
<p>The authors confirm contribution to the paper as follows: study conception and design: Milad Moradi, Rhona Asgari, Ke Yan, David Colwell, Matthias Samwald; data collection: Milad Moradi; analysis and interpretation of results: Milad Moradi, Rhona Asgari, Ke Yan; draft manuscript preparation: Milad Moradi, Rhona Asgari, Ke Yan, David Colwell, Matthias Samwald. All authors reviewed the results and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability">
<title>Availability of Data and Materials</title>
<p>Not applicable.</p>
</sec>
<sec>
<title>Ethics Approval</title>
<p>Not applicable.</p>
</sec>
<sec sec-type="COI-statement"><title>Conflicts of Interest</title>
<p>The authors declare no conflicts of interest to report regarding the present study.</p>
</sec>
<glossary content-type="abbreviations" id="glossary-1">
<title>Abbreviations</title>
<def-list>
<def-item>
<term>AI</term>
<def>
<p>Artificial Intelligence</p>
</def>
</def-item>
<def-item>
<term>GAI</term>
<def>
<p>Generative Artificial Intelligence</p>
</def>
</def-item>
<def-item>
<term>GPT</term>
<def>
<p>Generative Pre-trained Transformer</p>
</def>
</def-item>
<def-item>
<term>ML</term>
<def>
<p>Machine Learning</p>
</def>
</def-item>
<def-item>
<term>LLM</term>
<def>
<p>Large Language Model</p>
</def>
</def-item>
<def-item>
<term>RNN</term>
<def>
<p>Recurrent Neural Network</p>
</def>
</def-item>
<def-item>
<term>NLP</term>
<def>
<p>Natural Language Processing</p>
</def>
</def-item>
<def-item>
<term>NER</term>
<def>
<p>Named Entity Recognition</p>
</def>
</def-item>
<def-item>
<term>FLAN</term>
<def>
<p>Fine-tuned Language Net</p>
</def>
</def-item>
<def-item>
<term>PEFT</term>
<def>
<p>Parameter-Efficient Fine-Tuning</p>
</def>
</def-item>
<def-item>
<term>LoRA</term>
<def>
<p>Low-Rank Adaptation</p>
</def>
</def-item>
<def-item>
<term>RLHF</term>
<def>
<p>Reinforcement Learning from Human Feedback</p>
</def>
</def-item>
<def-item>
<term>RL</term>
<def>
<p>Reinforcement Learning</p>
</def>
</def-item>
<def-item>
<term>PPO</term>
<def>
<p>Proximal Policy Optimization</p>
</def>
</def-item>
<def-item>
<term>DPO</term>
<def>
<p>Direct Preference Optimization</p>
</def>
</def-item>
<def-item>
<term>RAG</term>
<def>
<p>Retrieval-Augmented Generation</p>
</def>
</def-item>
</def-list>
</glossary>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ooi</surname> <given-names>K-B</given-names></string-name>, <string-name><surname>Tan</surname> <given-names>GW-H</given-names></string-name>, <string-name><surname>Al-Emran</surname> <given-names>M</given-names></string-name>, <string-name><surname>Al-Sharafi</surname> <given-names>MA</given-names></string-name>, <string-name><surname>Capatina</surname> <given-names>A</given-names></string-name>, <string-name><surname>Chakraborty</surname> <given-names>A</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>The potential of generative artificial intelligence across disciplines: perspectives and future directions</article-title>. <source>J Comput Inf Syst</source>. <year>2023</year>;<fpage>1</fpage>&#x2013;<lpage>32</lpage>. doi:<pub-id pub-id-type="doi">10.1080/08874417.2023.2261010</pub-id>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Banh</surname> <given-names>L</given-names></string-name>, <string-name><surname>Strobel</surname> <given-names>G</given-names></string-name></person-group>. <article-title>Generative artificial intelligence</article-title>. <source>Electronic Mark</source>. <year>2023</year>;<volume>33</volume>:<fpage>63</fpage>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Thirunavukarasu</surname> <given-names>AJ</given-names></string-name>, <string-name><surname>Ting</surname> <given-names>DSJ</given-names></string-name>, <string-name><surname>Elangovan</surname> <given-names>K</given-names></string-name>, <string-name><surname>Gutierrez</surname> <given-names>L</given-names></string-name>, <string-name><surname>Tan</surname> <given-names>TF</given-names></string-name>, <string-name><surname>Ting</surname> <given-names>DSW</given-names></string-name></person-group>. <article-title>Large language models in medicine</article-title>. <source>Nature Med</source>. <year>2023</year>;<volume>29</volume>:<fpage>1930</fpage>&#x2013;<lpage>40</lpage>. doi:<pub-id pub-id-type="doi">10.1038/s41591-023-02448-8</pub-id>; <pub-id pub-id-type="pmid">37460753</pub-id></mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kasneci</surname> <given-names>E</given-names></string-name>, <string-name><surname>Sessler</surname> <given-names>K</given-names></string-name>, <string-name><surname>K&#x00FC;chemann</surname> <given-names>S</given-names></string-name>, <string-name><surname>Bannert</surname> <given-names>M</given-names></string-name>, <string-name><surname>Dementieva</surname> <given-names>D</given-names></string-name>, <string-name><surname>Fischer</surname> <given-names>F</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>ChatGPT for good? On opportunities and challenges of large language models for education</article-title>. <source>Learn Individ Differ</source>. <year>2023</year>;<volume>103</volume>:<fpage>102274</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.lindif.2023.102274</pub-id>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Luo</surname> <given-names>H</given-names></string-name>, <string-name><surname>Luo</surname> <given-names>J</given-names></string-name>, <string-name><surname>Vasilakos</surname> <given-names>AV</given-names></string-name></person-group>. <article-title>BC4LLM: a perspective of trusted artificial intelligence when blockchain meets large language models</article-title>. <source>Neurocomputing</source>. <year>2024</year>;<volume>599</volume>:<fpage>128089</fpage>. doi:<pub-id pub-id-type="doi">10.48550/arXiv.2310.06278</pub-id>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Bakhshandeh</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Benchmarking medical large language models</article-title>. <source>Nature Rev Bioeng</source>. <year>2023</year>;<volume>1</volume>:<fpage>543</fpage>&#x2013;<lpage>3</lpage>. doi:<pub-id pub-id-type="doi">10.48550/arXiv.2405.00716</pub-id>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Sutskever</surname> <given-names>I</given-names></string-name>, <string-name><surname>Martens</surname> <given-names>J</given-names></string-name>, <string-name><surname>Hinton</surname> <given-names>GE</given-names></string-name></person-group>. <article-title>Generating text with recurrent neural networks</article-title>. In: <conf-name>Proceedings of the 28th International Conference on Machine Learning (ICML-11)</conf-name>; <year>2011</year>; <publisher-loc>Bellevue, WA, USA</publisher-loc>. p. <fpage>1017</fpage>&#x2013;<lpage>24</lpage>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yu</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Si</surname> <given-names>X</given-names></string-name>, <string-name><surname>Hu</surname> <given-names>C</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>J</given-names></string-name></person-group>. <article-title>A review of recurrent neural networks: LSTM cells and network architectures</article-title>. <source>Neural Comput</source>. <year>2019</year>;<volume>31</volume>:<fpage>1235</fpage>&#x2013;<lpage>70</lpage>. doi:<pub-id pub-id-type="doi">10.1162/neco_a_01199</pub-id>; <pub-id pub-id-type="pmid">31113301</pub-id></mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Vaswani</surname> <given-names>A</given-names></string-name>, <string-name><surname>Shazeer</surname> <given-names>N</given-names></string-name>, <string-name><surname>Parmar</surname> <given-names>N</given-names></string-name>, <string-name><surname>Uszkoreit</surname> <given-names>J</given-names></string-name>, <string-name><surname>Jones</surname> <given-names>L</given-names></string-name>, <string-name><surname>Gomez</surname> <given-names>AN</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>Attention is all you need</article-title>. In: <conf-name>31st Conference on Neural Information
Processing Systems (NIPS 2017)</conf-name>; <year>2017</year>; <publisher-loc>Long Beach, CA, USA</publisher-loc>. p. <fpage>5998</fpage>&#x2013;<lpage>6008</lpage>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Devlin</surname> <given-names>J</given-names></string-name>, <string-name><surname>Chang</surname> <given-names>M-W</given-names></string-name>, <string-name><surname>Lee</surname> <given-names>K</given-names></string-name>, <string-name><surname>Toutanova</surname> <given-names>K</given-names></string-name></person-group>. <article-title>BERT: pre-training of deep bidirectional transformers for language understanding</article-title>. <comment>arXiv:1810.04805. 2018</comment>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Gillioz</surname> <given-names>A</given-names></string-name>, <string-name><surname>Casas</surname> <given-names>J</given-names></string-name>, <string-name><surname>Mugellini</surname> <given-names>E</given-names></string-name>, <string-name><surname>Khaled</surname> <given-names>OA</given-names></string-name></person-group>. <article-title>Overview of the transformer-based models for NLP tasks</article-title>. In: <conf-name>2020 15th Conference on Computer Science and Information Systems (FedCSIS)</conf-name>; <year>2020</year>; <publisher-loc>Sofia, Bulgaria</publisher-loc>. p. <fpage>179</fpage>&#x2013;<lpage>83</lpage>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Wolf</surname> <given-names>T</given-names></string-name>, <string-name><surname>Debut</surname> <given-names>L</given-names></string-name>, <string-name><surname>Sanh</surname> <given-names>V</given-names></string-name>, <string-name><surname>Chaumond</surname> <given-names>J</given-names></string-name>, <string-name><surname>Delangue</surname> <given-names>C</given-names></string-name>, <string-name><surname>Moi</surname> <given-names>A</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Transformers: state-of-the-art natural language processing</article-title>. In: <conf-name>Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations</conf-name>; <year>2020</year>. p. <fpage>38</fpage>&#x2013;<lpage>45</lpage>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li&#x00E9;vin</surname> <given-names>V</given-names></string-name>, <string-name><surname>Hother</surname> <given-names>CE</given-names></string-name>, <string-name><surname>Motzfeldt</surname> <given-names>AG</given-names></string-name>, <string-name><surname>Winther</surname> <given-names>O</given-names></string-name></person-group>. <article-title>Can large language models reason about medical questions?</article-title> <source>Patterns</source>. <year>2024</year>;<volume>5</volume>(<issue>3</issue>):<fpage>100943</fpage>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Wu</surname> <given-names>S</given-names></string-name>, <string-name><surname>Irsoy</surname> <given-names>O</given-names></string-name>, <string-name><surname>Lu</surname> <given-names>S</given-names></string-name>, <string-name><surname>Dabravolski</surname> <given-names>V</given-names></string-name>, <string-name><surname>Dredze</surname> <given-names>M</given-names></string-name>, <string-name><surname>Gehrmann</surname> <given-names>S</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>Bloomberggpt: a large language model for finance</article-title>. <comment>arXiv:2303.17564. 2023</comment>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Nazi</surname> <given-names>ZA</given-names></string-name>, <string-name><surname>Peng</surname> <given-names>W</given-names></string-name></person-group>. <article-title>Large language models in healthcare and medical domain: a review</article-title>. <source>Informatics</source>. <year>2024</year>;<volume>11</volume>(<issue>3</issue>):<fpage>57</fpage>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Lin</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Gong</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Shen</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>T</given-names></string-name>, <string-name><surname>Fan</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Lin</surname> <given-names>C</given-names></string-name>, <etal>et al</etal></person-group>. <chapter-title>Text generation with diffusion language models: a pre-training approach with continuous paragraph denoise</chapter-title>. <article-title>Paper presented at: Proceedings of the 40th International Conference on Machine Learning</article-title>; <year>2023</year>. Vol. <volume>202</volume>, p. <fpage>21051</fpage>&#x2013;<lpage>64</lpage>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Gholami</surname> <given-names>S</given-names></string-name>, <string-name><surname>Omar</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Do generative large language models need billions of parameters?</article-title> <comment>arXiv:2309.06589. 2023</comment>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ericsson</surname> <given-names>L</given-names></string-name>, <string-name><surname>Gouk</surname> <given-names>H</given-names></string-name>, <string-name><surname>Loy</surname> <given-names>CC</given-names></string-name>, <string-name><surname>Hospedales</surname> <given-names>TM</given-names></string-name></person-group>. <article-title>Self-supervised representation learning: introduction, advances, and challenges</article-title>. <source>IEEE Signal Process Mag</source>. <year>2022</year>;<volume>39</volume>:<fpage>42</fpage>&#x2013;<lpage>62</lpage>. doi:<pub-id pub-id-type="doi">10.48550/arXiv.2110.09327</pub-id>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Chung</surname> <given-names>YA</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Han</surname> <given-names>W</given-names></string-name>, <string-name><surname>Chiu</surname> <given-names>CC</given-names></string-name>, <string-name><surname>Qin</surname> <given-names>J</given-names></string-name>, <string-name><surname>Pang</surname> <given-names>R</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>w2v-BERT: combining contrastive learning and masked language modeling for self-supervised speech pre-training</article-title>. In: <conf-name>2021 IEEE Automatic Speech Recognition and Understanding Workshop (ASRU)</conf-name>; <year>2021</year>; <publisher-loc>Cartagena, Colombia</publisher-loc>. p. <fpage>244</fpage>&#x2013;<lpage>50</lpage>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Raffel</surname> <given-names>C</given-names></string-name>, <string-name><surname>Shazeer</surname> <given-names>N</given-names></string-name>, <string-name><surname>Roberts</surname> <given-names>A</given-names></string-name>, <string-name><surname>Lee</surname> <given-names>K</given-names></string-name>, <string-name><surname>Narang</surname> <given-names>S</given-names></string-name>, <string-name><surname>Matena</surname> <given-names>M</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>Exploring the limits of transfer learning with a unified text-to-text transformer</article-title>. <source>J Mach Learn Res</source>. <year>2020</year>;<volume>21</volume>:<fpage>140</fpage>. doi:<pub-id pub-id-type="doi">10.48550/arXiv.1910.10683</pub-id>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Lewis</surname> <given-names>M</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Goyal</surname> <given-names>N</given-names></string-name>, <string-name><surname>Ghazvininejad</surname> <given-names>M</given-names></string-name>, <string-name><surname>Mohamed</surname> <given-names>A</given-names></string-name>, <string-name><surname>Levy</surname> <given-names>O</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Bart: denoising sequence-to-sequence pre-training for natural language generation, translation, and comprehension</article-title>. <comment>arXiv:1910.13461. 2019</comment>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname> <given-names>P</given-names></string-name>, <string-name><surname>Pei</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Li</surname> <given-names>J</given-names></string-name></person-group>. <article-title>A comprehensive survey on design and application of autoencoder in deep learning</article-title>. <source>Appl Soft Comput</source>. <year>2023</year>;<volume>138</volume>:<fpage>110176</fpage>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Liu</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Ott</surname> <given-names>M</given-names></string-name>, <string-name><surname>Goyal</surname> <given-names>N</given-names></string-name>, <string-name><surname>Du</surname> <given-names>J</given-names></string-name>, <string-name><surname>Joshi</surname> <given-names>M</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>D</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>Roberta: a robustly optimized bert pretraining approach</article-title>. <comment>arXiv:1907.11692. 2019</comment>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Yang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Dai</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Carbonell</surname> <given-names>J</given-names></string-name>, <string-name><surname>Salakhutdinov</surname> <given-names>RR</given-names></string-name>, <string-name><surname>Le</surname> <given-names>QV</given-names></string-name></person-group>. <article-title>Xlnet: generalized autoregressive pretraining for language understanding</article-title>. In: <conf-name>33rd Conference on Neural Information Processing Systems (NeurIPS 2019)</conf-name>; <year>2019</year>; <publisher-loc>Vancouver, BC, Canada</publisher-loc>. p. <fpage>5753</fpage>&#x2013;<lpage>63</lpage>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Brown</surname> <given-names>TB</given-names></string-name>, <string-name><surname>Mann</surname> <given-names>B</given-names></string-name>, <string-name><surname>Ryder</surname> <given-names>N</given-names></string-name>, <string-name><surname>Subbiah</surname> <given-names>M</given-names></string-name>, <string-name><surname>Kaplan</surname> <given-names>J</given-names></string-name>, <string-name><surname>Dhariwal</surname> <given-names>P</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Language models are few-shot learners</article-title>. In: <conf-name>34th Conference on Neural Information Processing Systems (NeurIPS 2020)</conf-name>; <year>2020</year>. p. <fpage>1877</fpage>&#x2013;<lpage>901</lpage>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hoffmann</surname> <given-names>J</given-names></string-name>, <string-name><surname>Borgeaud</surname> <given-names>S</given-names></string-name>, <string-name><surname>Mensch</surname> <given-names>A</given-names></string-name>, <string-name><surname>Buchatskaya</surname> <given-names>E</given-names></string-name>, <string-name><surname>Cai</surname> <given-names>T</given-names></string-name>, <string-name><surname>Rutherford</surname> <given-names>E</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>An empirical analysis of compute-optimal large language model training</article-title>. <source>Adv Neural Inf Process Syst</source>. <year>2022</year>;<volume>35</volume>:<fpage>30016</fpage>&#x2013;<lpage>30</lpage>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Workshop</surname> <given-names>B</given-names></string-name>, <string-name><surname>Scao</surname> <given-names>TL</given-names></string-name>, <string-name><surname>Fan</surname> <given-names>A</given-names></string-name>, <string-name><surname>Akiki</surname> <given-names>C</given-names></string-name>, <string-name><surname>Pavlick</surname> <given-names>E</given-names></string-name>, <string-name><surname>Ili&#x0107;</surname> <given-names>S</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Bloom: a 176b-parameter open-access multilingual language model</article-title>. <comment>arXiv:2211.05100. 2022</comment>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Touvron</surname> <given-names>H</given-names></string-name>, <string-name><surname>Lavril</surname> <given-names>T</given-names></string-name>, <string-name><surname>Izacard</surname> <given-names>G</given-names></string-name>, <string-name><surname>Martinet</surname> <given-names>X</given-names></string-name>, <string-name><surname>Lachaux</surname> <given-names>M-A</given-names></string-name>, <string-name><surname>Lacroix</surname> <given-names>T</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>LLaMA: open and efficient foundation language models</article-title>. <comment>arXiv:2302.13971. 2023</comment>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Chronopoulou</surname> <given-names>A</given-names></string-name>, <string-name><surname>Peters</surname> <given-names>M</given-names></string-name>, <string-name><surname>Dodge</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Efficient hierarchical domain adaptation for pretrained language models</article-title>. In: <conf-name>Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</conf-name>; <year>2022</year>; <publisher-loc>Seattle, WA, USA</publisher-loc>. p. <fpage>1336</fpage>&#x2013;<lpage>51</lpage>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Zhu</surname> <given-names>W</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>WY</given-names></string-name></person-group>. <article-title>Large language models are implicitly topic models: explaining and finding good demonstrations for in-context learning</article-title>. <comment>arXiv:2301.11916. 2023</comment>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Pourpanah</surname> <given-names>F</given-names></string-name>, <string-name><surname>Abdar</surname> <given-names>M</given-names></string-name>, <string-name><surname>Luo</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zhou</surname> <given-names>X</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>R</given-names></string-name>, <string-name><surname>Lim</surname> <given-names>CP</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>A review of generalized zero-shot learning methods</article-title>. <source>IEEE Trans Pattern Anal Mach Intell</source>. <year>2023</year>;<volume>45</volume>:<fpage>4051</fpage>&#x2013;<lpage>70</lpage>; <pub-id pub-id-type="pmid">35849673</pub-id></mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Tran</surname> <given-names>TK</given-names></string-name>, <string-name><surname>Sato</surname> <given-names>H</given-names></string-name>, <string-name><surname>Kubo</surname> <given-names>M</given-names></string-name></person-group>. <article-title>One-shot learning approach for unknown malware classification</article-title>. In: <conf-name>2018 5th Asian Conference on Defense Technology (ACDT)</conf-name>; <year>2018</year>; <publisher-loc>Hanoi, Vietnam</publisher-loc>. p. <fpage>8</fpage>&#x2013;<lpage>13</lpage>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Beltagy</surname> <given-names>I</given-names></string-name>, <string-name><surname>Cohan</surname> <given-names>A</given-names></string-name>, <string-name><surname>Logan</surname> <given-names>R</given-names>
<suffix>IV</suffix></string-name>, <string-name><surname>Min</surname> <given-names>S</given-names></string-name>, <string-name><surname>Singh</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Zero- and few-shot NLP with pretrained language models</article-title>. In: <conf-name>Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics: Tutorial Abstracts</conf-name>; <year>2022</year>; <publisher-loc>Dublin, Ireland</publisher-loc>. p. <fpage>32</fpage>&#x2013;<lpage>7</lpage>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Song</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>T</given-names></string-name>, <string-name><surname>Cai</surname> <given-names>P</given-names></string-name>, <string-name><surname>Mondal</surname> <given-names>SK</given-names></string-name>, <string-name><surname>Sahoo</surname> <given-names>JP</given-names></string-name></person-group>. <article-title>A comprehensive survey of few-shot learning: evolution, applications, challenges, and opportunities</article-title>. <source>ACM Comput Surv</source>. <year>2023</year>;<volume>55</volume>:<fpage>271</fpage>. doi:<pub-id pub-id-type="doi">10.48550/arXiv.2205.06743</pub-id>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Wei</surname> <given-names>J</given-names></string-name>, <string-name><surname>Bosma</surname> <given-names>M</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>VY</given-names></string-name>, <string-name><surname>Guu</surname> <given-names>K</given-names></string-name>, <string-name><surname>Yu</surname> <given-names>AW</given-names></string-name>, <string-name><surname>Lester</surname> <given-names>B</given-names></string-name>, <etal>et al</etal></person-group>. <chapter-title>Finetuned language models are zero-shot learners</chapter-title>. <article-title>Paper presented at: The Tenth International Conference on Learning Representations</article-title>; <year>2022</year>.</mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>S</given-names></string-name>, <string-name><surname>Dong</surname> <given-names>L</given-names></string-name>, <string-name><surname>Li</surname> <given-names>X</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>S</given-names></string-name>, <string-name><surname>Sun</surname> <given-names>X</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>S</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Instruction tuning for large language models: a survey</article-title>. <comment>arXiv:2308.10792. 2023</comment>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kemker</surname> <given-names>R</given-names></string-name>, <string-name><surname>McClure</surname> <given-names>M</given-names></string-name>, <string-name><surname>Abitino</surname> <given-names>A</given-names></string-name>, <string-name><surname>Hayes</surname> <given-names>T</given-names></string-name>, <string-name><surname>Kanan</surname> <given-names>C</given-names></string-name></person-group>. <article-title>Measuring catastrophic forgetting in neural networks</article-title>. <source>Proc AAAI Conf Artif Intell</source>. <year>2018</year>;<volume>32</volume>:<fpage>3390</fpage>&#x2013;<lpage>8</lpage>. doi:<pub-id pub-id-type="doi">10.48550/arXiv.1708.02072</pub-id>.</mixed-citation></ref>
<ref id="ref-38"><label>[38]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Karimi Mahabadi</surname> <given-names>R</given-names></string-name>, <string-name><surname>Ruder</surname> <given-names>S</given-names></string-name>, <string-name><surname>Dehghani</surname> <given-names>M</given-names></string-name>, <string-name><surname>Henderson</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Parameter-efficient multi-task fine-tuning for transformers via shared hypernetworks</article-title>. In: <conf-name>Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing</conf-name>; <year>2021</year>. p. <fpage>565</fpage>&#x2013;<lpage>76</lpage>.</mixed-citation></ref>
<ref id="ref-39"><label>[39]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Fu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>H</given-names></string-name>, <string-name><surname>So</surname> <given-names>AM-C</given-names></string-name>, <string-name><surname>Lam</surname> <given-names>W</given-names></string-name>, <string-name><surname>Bing</surname> <given-names>L</given-names></string-name>, <string-name><surname>Collier</surname> <given-names>N</given-names></string-name></person-group>. <article-title>On the effectiveness of parameter-efficient fine-tuning</article-title>. <source>Proc AAAI Conf Artif Intell</source>. <year>2023</year>;<volume>37</volume>:<fpage>12799</fpage>&#x2013;<lpage>807</lpage>. doi:<pub-id pub-id-type="doi">10.48550/arXiv.2211.15583</pub-id>.</mixed-citation></ref>
<ref id="ref-40"><label>[40]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ding</surname> <given-names>N</given-names></string-name>, <string-name><surname>Qin</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>G</given-names></string-name>, <string-name><surname>Wei</surname> <given-names>F</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Su</surname> <given-names>Y</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>Parameter-efficient fine-tuning of large-scale pre-trained language models</article-title>. <source>Nature Mach Intell</source>. <year>2023</year>;<volume>5</volume>:<fpage>220</fpage>&#x2013;<lpage>35</lpage>. doi:<pub-id pub-id-type="doi">10.48550/arXiv.2312.12148</pub-id>.</mixed-citation></ref>
<ref id="ref-41"><label>[41]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Liu</surname> <given-names>H</given-names></string-name>, <string-name><surname>Tam</surname> <given-names>D</given-names></string-name>, <string-name><surname>Muqeeth</surname> <given-names>M</given-names></string-name>, <string-name><surname>Mohta</surname> <given-names>J</given-names></string-name>, <string-name><surname>Huang</surname> <given-names>T</given-names></string-name>, <string-name><surname>Bansal</surname> <given-names>M</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Few-shot parameter-efficient fine-tuning is better and cheaper than in-context learning</article-title>. <source>Adv Neural Inf Process Syst</source>. <year>2022</year>;<volume>35</volume>:<fpage>1950</fpage>&#x2013;<lpage>65</lpage>.</mixed-citation></ref>
<ref id="ref-42"><label>[42]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Lialin</surname> <given-names>V</given-names></string-name>, <string-name><surname>Deshpande</surname> <given-names>V</given-names></string-name>, <string-name><surname>Rumshisky</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Scaling down to scale up: a guide to parameter-efficient fine-tuning</article-title>. <comment>arXiv:2303.15647. 2023</comment>.</mixed-citation></ref>
<ref id="ref-43"><label>[43]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Gheini</surname> <given-names>M</given-names></string-name>, <string-name><surname>Ren</surname> <given-names>X</given-names></string-name>, <string-name><surname>May</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Cross-attention is all you need: adapting pretrained transformers for machine translation</article-title>. In: <conf-name>Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing</conf-name>; <year>2021</year>; <publisher-loc>Punta Cana</publisher-loc>, <publisher-name>Dominican Republic</publisher-name>; p. <fpage>1754</fpage>&#x2013;<lpage>65</lpage>.</mixed-citation></ref>
<ref id="ref-44"><label>[44]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Pfeiffer</surname> <given-names>J</given-names></string-name>, <string-name><surname>R&#x00FC;ckl&#x00E9;</surname> <given-names>A</given-names></string-name>, <string-name><surname>Poth</surname> <given-names>C</given-names></string-name>, <string-name><surname>Kamath</surname> <given-names>A</given-names></string-name>, <string-name><surname>Vuli&#x0107;</surname> <given-names>I</given-names></string-name>, <string-name><surname>Ruder</surname> <given-names>S</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>AdapterHub: a framework for adapting transformers</article-title>. In: <conf-name>Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations</conf-name>; <year>2020</year>. p. <fpage>46</fpage>&#x2013;<lpage>54</lpage>.</mixed-citation></ref>
<ref id="ref-45"><label>[45]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Vu</surname> <given-names>T</given-names></string-name>, <string-name><surname>Lester</surname> <given-names>B</given-names></string-name>, <string-name><surname>Constant</surname> <given-names>N</given-names></string-name>, <string-name><surname>Al-Rfou&#x2019;</surname> <given-names>R</given-names></string-name>, <string-name><surname>Cer</surname> <given-names>D</given-names></string-name></person-group>. <article-title>SPoT: better frozen model adaptation through soft prompt transfer</article-title>. In: <conf-name>Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics</conf-name>; <year>2022</year>; <publisher-loc>Dublin, Ireland</publisher-loc>. p. <fpage>5039</fpage>&#x2013;<lpage>59</lpage>.</mixed-citation></ref>
<ref id="ref-46"><label>[46]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Hu</surname> <given-names>EJ</given-names></string-name>, <string-name><surname>Shen</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Wallis</surname> <given-names>P</given-names></string-name>, <string-name><surname>Allen-Zhu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Li</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>S</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Low-rank adaptation of large language models</article-title>. <comment>arXiv:2106.09685. 2021</comment>.</mixed-citation></ref>
<ref id="ref-47"><label>[47]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Dettmers</surname> <given-names>T</given-names></string-name>, <string-name><surname>Pagnoni</surname> <given-names>A</given-names></string-name>, <string-name><surname>Holtzman</surname> <given-names>A</given-names></string-name>, <string-name><surname>Zettlemoyer</surname> <given-names>L</given-names></string-name></person-group>. <article-title>Qlora: efficient finetuning of quantized llms</article-title>. <comment>arXiv:2305.14314. 2023</comment>.</mixed-citation></ref>
<ref id="ref-48"><label>[48]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gallegos</surname> <given-names>IO</given-names></string-name>, <string-name><surname>Rossi</surname> <given-names>RA</given-names></string-name>, <string-name><surname>Barrow</surname> <given-names>J</given-names></string-name>, <string-name><surname>Tanjim</surname> <given-names>MM</given-names></string-name>, <string-name><surname>Kim</surname> <given-names>S</given-names></string-name>, <string-name><surname>Dernoncourt</surname> <given-names>F</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Bias and fairness in large language models: a survey</article-title>. <source>Comput Linguist</source>. <year>2024</year>;<volume>50</volume>:<fpage>1097</fpage>&#x2013;<lpage>179</lpage>.</mixed-citation></ref>
<ref id="ref-49"><label>[49]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Ousidhoum</surname> <given-names>N</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>X</given-names></string-name>, <string-name><surname>Fang</surname> <given-names>T</given-names></string-name>, <string-name><surname>Song</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Yeung</surname> <given-names>D-Y</given-names></string-name></person-group>. <article-title>Probing toxic content in large pre-trained language models</article-title>. In: <conf-name>Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics</conf-name>; <year>2021</year>. p. <fpage>4262</fpage>&#x2013;<lpage>74</lpage>.</mixed-citation></ref>
<ref id="ref-50"><label>[50]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lin</surname> <given-names>J</given-names></string-name>, <string-name><surname>Ma</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Gomez</surname> <given-names>R</given-names></string-name>, <string-name><surname>Nakamura</surname> <given-names>K</given-names></string-name>, <string-name><surname>He</surname> <given-names>B</given-names></string-name>, <string-name><surname>Li</surname> <given-names>G</given-names></string-name></person-group>. <article-title>A review on interactive reinforcement learning from human social feedback</article-title>. <source>IEEE Access</source>. <year>2020</year>;<volume>8</volume>:<fpage>120757</fpage>&#x2013;<lpage>65</lpage>.</mixed-citation></ref>
<ref id="ref-51"><label>[51]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ouyang</surname> <given-names>L</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>J</given-names></string-name>, <string-name><surname>Jiang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Almeida</surname> <given-names>D</given-names></string-name>, <string-name><surname>Wainwright</surname> <given-names>C</given-names></string-name>, <string-name><surname>Mishkin</surname> <given-names>P</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Training language models to follow instructions with human feedback</article-title>. <source>Adv Neural Inf Process Syst</source>. <year>2022</year>;<volume>35</volume>:<fpage>27730</fpage>&#x2013;<lpage>44</lpage>.</mixed-citation></ref>
<ref id="ref-52"><label>[52]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Bakker</surname> <given-names>M</given-names></string-name>, <string-name><surname>Chadwick</surname> <given-names>M</given-names></string-name>, <string-name><surname>Sheahan</surname> <given-names>H</given-names></string-name>, <string-name><surname>Tessler</surname> <given-names>M</given-names></string-name>, <string-name><surname>Campbell-Gillingham</surname> <given-names>L</given-names></string-name>, <string-name><surname>Balaguer</surname> <given-names>J</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Fine-tuning language models to find agreement among humans with diverse preferences</article-title>. <source>Adv Neural Inf Process Syst</source>. <year>2022</year>;<volume>35</volume>:<fpage>38176</fpage>&#x2013;<lpage>89</lpage>.</mixed-citation></ref>
<ref id="ref-53"><label>[53]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Rafailov</surname> <given-names>R</given-names></string-name>, <string-name><surname>Sharma</surname> <given-names>A</given-names></string-name>, <string-name><surname>Mitchell</surname> <given-names>E</given-names></string-name>, <string-name><surname>Ermon</surname> <given-names>S</given-names></string-name>, <string-name><surname>Manning</surname> <given-names>CD</given-names></string-name>, <string-name><surname>Finn</surname> <given-names>C</given-names></string-name></person-group>. <chapter-title>Direct preference optimization: your language model is secretly a reward model</chapter-title>. <article-title>Paper presented at: 37th Conference on Neural Information Processing Systems (NeurIPS)</article-title>; <year>2023</year>.</mixed-citation></ref>
<ref id="ref-54"><label>[54]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Schulman</surname> <given-names>J</given-names></string-name>, <string-name><surname>Wolski</surname> <given-names>F</given-names></string-name>, <string-name><surname>Dhariwal</surname> <given-names>P</given-names></string-name>, <string-name><surname>Radford</surname> <given-names>A</given-names></string-name>, <string-name><surname>Klimov</surname> <given-names>O</given-names></string-name></person-group>. <article-title>Proximal policy optimization algorithms</article-title>. <comment>arXiv:1707.06347. 2017</comment>.</mixed-citation></ref>
<ref id="ref-55"><label>[55]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Casper</surname> <given-names>S</given-names></string-name>, <string-name><surname>Davies</surname> <given-names>X</given-names></string-name>, <string-name><surname>Shi</surname> <given-names>C</given-names></string-name>, <string-name><surname>Gilbert</surname> <given-names>TK</given-names></string-name>, <string-name><surname>Scheurer</surname> <given-names>J</given-names></string-name>, <string-name><surname>Rando</surname> <given-names>J</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Open problems and fundamental limitations of reinforcement learning from human feedback</article-title>. <comment>arXiv:2307.15217. 2023</comment>.</mixed-citation></ref>
<ref id="ref-56"><label>[56]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Skalse</surname> <given-names>J</given-names></string-name>, <string-name><surname>Howe</surname> <given-names>N</given-names></string-name>, <string-name><surname>Krasheninnikov</surname> <given-names>D</given-names></string-name>, <string-name><surname>Krueger</surname> <given-names>D</given-names></string-name></person-group>. <article-title>Defining and characterizing reward gaming</article-title>. <source>Adv Neural Inf Process Syst</source>. <year>2022</year>;<volume>35</volume>:<fpage>9460</fpage>&#x2013;<lpage>71</lpage>.</mixed-citation></ref>
<ref id="ref-57"><label>[57]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Bai</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Jones</surname> <given-names>A</given-names></string-name>, <string-name><surname>Ndousse</surname> <given-names>K</given-names></string-name>, <string-name><surname>Askell</surname> <given-names>A</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>A</given-names></string-name>, <string-name><surname>DasSarma</surname> <given-names>N</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Training a helpful and harmless assistant with reinforcement learning from human feedback</article-title>. <comment>arXiv:2204.05862. 2022</comment>.</mixed-citation></ref>
<ref id="ref-58"><label>[58]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Coste</surname> <given-names>T</given-names></string-name>, <string-name><surname>Anwar</surname> <given-names>U</given-names></string-name>, <string-name><surname>Kirk</surname> <given-names>R</given-names></string-name>, <string-name><surname>Krueger</surname> <given-names>D</given-names></string-name></person-group>. <article-title>Reward model ensembles help mitigate overoptimization</article-title>. <comment>arXiv:2310.02743. 2023</comment>.</mixed-citation></ref>
<ref id="ref-59"><label>[59]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Li</surname> <given-names>J</given-names></string-name>, <string-name><surname>Cheng</surname> <given-names>X</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>X</given-names></string-name>, <string-name><surname>Nie</surname> <given-names>J-Y</given-names></string-name>, <string-name><surname>Wen</surname> <given-names>J-R</given-names></string-name></person-group>. <article-title>HaluEval: a large-scale hallucination evaluation benchmark for large language models</article-title>. In: <conf-name>Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing</conf-name>; <year>2023</year>; <publisher-loc>Singapore</publisher-loc>. p. <fpage>6449</fpage>&#x2013;<lpage>64</lpage>.</mixed-citation></ref>
<ref id="ref-60"><label>[60]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lewis</surname> <given-names>P</given-names></string-name>, <string-name><surname>Perez</surname> <given-names>E</given-names></string-name>, <string-name><surname>Piktus</surname> <given-names>A</given-names></string-name>, <string-name><surname>Petroni</surname> <given-names>F</given-names></string-name>, <string-name><surname>Karpukhin</surname> <given-names>V</given-names></string-name>, <string-name><surname>Goyal</surname> <given-names>N</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>Retrieval-augmented generation for knowledge-intensive nlp tasks</article-title>. <source>Adv Neural Inf Process Syst</source>. <year>2020</year>;<volume>33</volume>:<fpage>9459</fpage>&#x2013;<lpage>74</lpage>. doi:<pub-id pub-id-type="doi">10.48550/arXiv.2005.11401</pub-id>.</mixed-citation></ref>
<ref id="ref-61"><label>[61]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Han</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>C</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>P</given-names></string-name></person-group>. <article-title>A comprehensive survey on vector database: storage and retrieval technique, challenge</article-title>. <comment>arXiv:2310.11703. 2023</comment>.</mixed-citation></ref>
<ref id="ref-62"><label>[62]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Palma</surname> <given-names>DD</given-names></string-name></person-group>. <chapter-title>Retrieval-augmented recommender system: enhancing recommender systems with large language models</chapter-title>. <article-title>Paper presented at: Proceedings of the 17th ACM Conference on Recommender Systems</article-title>; <year>2023</year>; <publisher-loc>Singapore</publisher-loc>.</mixed-citation></ref>
<ref id="ref-63"><label>[63]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Brown</surname> <given-names>H</given-names></string-name>, <string-name><surname>Lee</surname> <given-names>K</given-names></string-name>, <string-name><surname>Mireshghallah</surname> <given-names>F</given-names></string-name>, <string-name><surname>Shokri</surname> <given-names>R</given-names></string-name>, <string-name><surname>Tram&#x00E8;r</surname> <given-names>F</given-names></string-name></person-group>. <chapter-title>What does it mean for a language model to preserve privacy?</chapter-title> <article-title>Paper presented at: Proceedings of the 2022 ACM Conference on Fairness, Accountability, and Transparency</article-title>; <year>2022</year>; <publisher-loc>Seoul, Republic of Korea</publisher-loc>.</mixed-citation></ref>
<ref id="ref-64"><label>[64]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Huertas-Garc&#x00ED;a</surname> <given-names>&#x00C1;</given-names></string-name>, <string-name><surname>Huertas-Tato</surname> <given-names>J</given-names></string-name>, <string-name><surname>Mart&#x00ED;n</surname> <given-names>A</given-names></string-name>, <string-name><surname>Camacho</surname> <given-names>D</given-names></string-name></person-group>. <article-title>Countering misinformation through semantic-aware multilingual models</article-title>. In: <conf-name>Intelligent data engineering and automated learning&#x2013;IDEAL 2021</conf-name>; <year>2021</year>; <publisher-loc>Cham</publisher-loc>: <publisher-name>Springer</publisher-name>. p. <fpage>312</fpage>&#x2013;<lpage>23</lpage>.</mixed-citation></ref>
<ref id="ref-65"><label>[65]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Merrill</surname> <given-names>W</given-names></string-name>, <string-name><surname>Peng</surname> <given-names>H</given-names></string-name>, <string-name><surname>Beltagy</surname> <given-names>I</given-names></string-name>, <string-name><surname>Smith</surname> <given-names>NA</given-names></string-name></person-group>. <article-title>Transparency helps reveal when language models learn meaning</article-title>. <source>Trans Assoc Comput Linguist</source>. <year>2023</year>;<volume>11</volume>:<fpage>617</fpage>&#x2013;<lpage>34</lpage>.</mixed-citation></ref>
<ref id="ref-66"><label>[66]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Luccioni</surname> <given-names>AS</given-names></string-name>, <string-name><surname>Viguier</surname> <given-names>S</given-names></string-name>, <string-name><surname>Ligozat</surname> <given-names>A-L</given-names></string-name></person-group>. <article-title>Estimating the carbon footprint of bloom, a 176b parameter language model</article-title>. <source>J Mach Learn Res</source>. <year>2023</year>;<volume>24</volume>:<fpage>1</fpage>&#x2013;<lpage>15</lpage>. doi:<pub-id pub-id-type="doi">10.48550/arXiv.2211.02001</pub-id>.</mixed-citation></ref>
<ref id="ref-67"><label>[67]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Kaplan</surname> <given-names>J</given-names></string-name>, <string-name><surname>McCandlish</surname> <given-names>S</given-names></string-name>, <string-name><surname>Henighan</surname> <given-names>T</given-names></string-name>, <string-name><surname>Brown</surname> <given-names>TB</given-names></string-name>, <string-name><surname>Chess</surname> <given-names>B</given-names></string-name>, <string-name><surname>Child</surname> <given-names>R</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>Scaling laws for neural language models</article-title>. <comment>arXiv:2001.08361. 2020</comment>.</mixed-citation></ref>
<ref id="ref-68"><label>[68]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Kumar</surname> <given-names>A</given-names></string-name>, <string-name><surname>Anand</surname> <given-names>V</given-names></string-name></person-group>. <article-title>Transformers on sarcasm detection with context</article-title>. In: <conf-name>Proceedings of the Second Workshop on Figurative Language Processing</conf-name>; <year>2020</year>. p. <fpage>88</fpage>&#x2013;<lpage>92</lpage>.</mixed-citation></ref>
<ref id="ref-69"><label>[69]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Chang</surname> <given-names>T-Y</given-names></string-name>, <string-name><surname>Jia</surname> <given-names>R</given-names></string-name></person-group>. <article-title>Data curation alone can stabilize in-context learning</article-title>. In: <conf-name>Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics</conf-name>; <year>2023</year>; <publisher-loc>Toronto, ON, Canada</publisher-loc>. p. <fpage>8123</fpage>&#x2013;<lpage>44</lpage>.</mixed-citation></ref>
<ref id="ref-70"><label>[70]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yin</surname> <given-names>S</given-names></string-name>, <string-name><surname>Fu</surname> <given-names>C</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>S</given-names></string-name>, <string-name><surname>Li</surname> <given-names>K</given-names></string-name>, <string-name><surname>Sun</surname> <given-names>X</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>T</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>A survey on multimodal large language models</article-title>. <comment>arXiv:2306.13549</comment>. <year>2023</year>.</mixed-citation></ref>
<ref id="ref-71"><label>[71]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhao</surname> <given-names>H</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>H</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>F</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>N</given-names></string-name>, <string-name><surname>Deng</surname> <given-names>H</given-names></string-name>, <string-name><surname>Cai</surname> <given-names>H</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>Explainability for large language models: a survey</article-title>. <source>ACM Trans Intell Syst Technol</source>. <year>2024</year>;<volume>15</volume>:<fpage>20</fpage>. doi:<pub-id pub-id-type="doi">10.48550/arXiv.2309.01029</pub-id>.</mixed-citation></ref>
<ref id="ref-72"><label>[72]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Moradi</surname> <given-names>M</given-names></string-name>, <string-name><surname>Samwald</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Evaluating the robustness of neural language models to input perturbations</article-title>. In: <conf-name>Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing</conf-name>; <year>2021</year>; <publisher-loc>Dominican Republic</publisher-loc>: <publisher-name>Association for Computational Linguistics</publisher-name>. p. <fpage>1558</fpage>&#x2013;<lpage>70</lpage>. doi:<pub-id pub-id-type="doi">10.18653/v1/2021.emnlp-main.117</pub-id>.</mixed-citation></ref>
</ref-list>
</back></article>