<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Rule enforcement in LLMs: a parameter efficient fine-tuning approach with self-generated training dataset</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Daniele</forename><surname>Franch</surname></persName>
							<email>daniele.franch@unitn.it</email>
							<affiliation key="aff0">
								<orgName type="institution">University of Trento</orgName>
								<address>
									<postCode>38100</postCode>
									<settlement>Trento</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Pierluigi</forename><surname>Roberti</surname></persName>
							<email>pierluigi.roberti@unitn.it</email>
							<affiliation key="aff0">
								<orgName type="institution">University of Trento</orgName>
								<address>
									<postCode>38100</postCode>
									<settlement>Trento</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Enrico</forename><surname>Blanzieri</surname></persName>
							<email>enrico.blanzieri@unitn.it</email>
							<affiliation key="aff0">
								<orgName type="institution">University of Trento</orgName>
								<address>
									<postCode>38100</postCode>
									<settlement>Trento</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Rule enforcement in LLMs: a parameter efficient fine-tuning approach with self-generated training dataset</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">F6EA78367BF7CB25CB255852B96E70C4</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T19:13+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Large Language Models (LLMs)</term>
					<term>Low-Rank Adaptation (LoRA)</term>
					<term>Dataset augmentation</term>
					<term>Self-generated training dataset</term>
					<term>Domain-specific behavior</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Large Language Models (LLMs) often have implicit knowledge of domain-specific rules, such as age requirements for obtaining a driver's license, but may not consistently apply this knowledge in conversations. In this paper, we explore a method for fine-tuning LLMs using datasets generated by the LLM itself. The goal is to explicitly enforce specific rules, such as declaring ineligibility if the age requirement is not met, within a defined context. We evaluate whether this fine-tuning approach enables the model to recognize the need to apply relevant knowledge in other contexts, such as marriage eligibility, where the LLM already has knowledge of the underlying criteria. Our results show that after fine-tuning, the LLM not only applies the rule in the training contexts, but also generalizes this behavior to enforce the rule in different domains. This suggests that fine-tuning, even with self-generated datasets, can improve the ability of the LLM to apply its knowledge more consistently, leading to more reliable performance in rule-based scenarios.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>Large Language Models (LLMs) such as GPT-3 <ref type="bibr" target="#b0">[1]</ref>, BERT <ref type="bibr" target="#b1">[2]</ref>, and their successors represented a big leap in advance for Natural Language Processing, demonstrating the ability to generate and interact with human language. Trained on large amounts of text, these models acquire a broad knowledge that includes facts, linguistic patterns, and specialized rules. Nevertheless, LLMs face limitations when they are required to apply domain-specific rules or state when certain criteria are not fulfilled. In fact, even if they have the knowledge of domain-specific requirements, they often do not explicitly state or enforce this knowledge. As a result, even if an LLM has the correct knowledge about a topic (e.g., the minimum age for obtaining a driving license), it may not use this knowledge in its responses like a human would. For many practical applications, such as legal advice or eligibility verification, consistent and contextual enforcement of specific rules, and thus enforcement of the associated knowledge, is critical. For example, a banking LLM may need to determine a user's eligibility for financial products based on criteria such as income or credit history. Failure to apply these rules consistently can result in inaccurate information or service disruptions. To address these challenges, we propose a fine-tuning approach based on a self-generated dataset to allow LLMs to enforce specific rules, such as age requirements, within defined contexts. We evaluate whether this approach improves the model's ability to generalize rule enforcement across domains, demonstrating consistent rule application not only in trained scenarios but also in novel, unseen contexts.</p><p>Our contributions can be summarized as follows:</p><p>• We introduce a method for fine-tuning LLMs, using a dataset automatically generated by the same LLM and extended by paraphrasing or augmentation by the same or another LLM, to learn the explicit application of a given rule in a constrained context; • We test the ability of the fine-tuned model to generalize this behavior to other contexts, demonstrating its ability to apply its existing knowledge consistently across multiple domains.</p><p>The challenge of fine-tuning Large Language Models for specific tasks has received considerable attention in recent years <ref type="bibr" target="#b2">[3,</ref><ref type="bibr" target="#b3">4]</ref>. Studies have demonstrated the effectiveness of fine-tuning in various contexts <ref type="bibr" target="#b0">[1,</ref><ref type="bibr" target="#b4">5]</ref>, showing that fine-tuning can significantly improve model performance by allowing it to adapt to the subtleties of a task <ref type="bibr" target="#b5">[6,</ref><ref type="bibr" target="#b6">7]</ref>. However, most of these studies have not focused on ensuring that LLMs follow specific rules or state when these rules are violated. Our research differs from other work by focusing on enforcing the application of rules using a self-generated dataset. The main challenge of this approach is to deal with the potential biases of the LLM, as these could be injected into the self-generated dataset. In fact, training an LLM on a biased or unbalanced dataset may reinforce its existing biases, thus degrade its performance. This paper provides a preliminary investigation of this approach, and while the results are promising, more in-depth research is needed to confirm these findings.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.1.">Paper organization</head><p>The paper is organized as follows: Section 2 provides an overview of the background necessary to understand the approaches and techniques used in this work. Section 3 details the methodology used to create the fine-tuning dataset and describes the overall experimental setup. Section 4 presents the results of our experiments, analyzing the performance of the fine-tuned models in both the target and unseen contexts. In Section 5, we discuss the implications of our findings, highlighting the problems encountered and suggesting directions for future research. Finally, Section 6 concludes the paper with a summary of our main contributions and results.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Background</head><p>This section provides an overview of the key concepts relevant to this work that are necessary to understand the approaches and methods employed throughout the study.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.1.">Pre-trained Large Language Models</head><p>Pre-trained Large Language Models have become fundamental tools in everyday life. These models are trained on very large datasets, allowing them to learn complex patterns, linguistic structures, and a wide range of knowledge. The training of these models involves predicting the next word in a sequence (auto-regressive models) or understanding masked tokens within a sentence (auto-encoding models). This training enables these models to develop a rich representation of language. Despite their versatility and impressive performance, pre-trained LLMs often face challenges when required (and expected) to apply specific domain rules or constraints. This limitation stems mainly from the broad, generalized nature of their training goals, which optimize the ability to handle a wide variety of tasks, but make the specialization, such as rule enforcement, a secondary goal. To address this kind of challenges, researchers have investigated various fine-tuning techniques to adapt these models to specialized domains or tasks, with parameter efficient fine-tuning methods emerging as a promising solution.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.2.">Parameter efficient fine-tuning</head><p>The most common technique used to adapt pre-trained LLMs to specific tasks or domains by updating their parameters based on task-specific data is fine-tuning <ref type="bibr" target="#b7">[8]</ref>. However, traditional fine-tuning methods require updating all of the parameters of a model, which is computationally expensive and requires a large amount of labeled data. To address these challenges, parameter-efficient fine-tuning (PEFT) methods have been developed. These methods aim to achieve high task performance while modifying only a small subset of the model parameters, thereby reducing the computational cost and the risk of overfitting when data are limited. Parameter-efficient fine-tuning has gained popularity as a way to exploit the capabilities of Large Language Models without the overhead of retraining the entire model. Techniques such as adapter modules <ref type="bibr" target="#b8">[9]</ref>, prompt tuning <ref type="bibr" target="#b9">[10]</ref>, and low-rank adaptation (LoRA) <ref type="bibr" target="#b10">[11]</ref> are designed to modify a minimal number of parameters. This approach helps to preserve the general knowledge stored in the pre-trained model while allowing task-specific adaptation. PEFT methods have shown that it is possible, in some cases, to achieve performance comparable to full fine-tuning <ref type="bibr" target="#b11">[12]</ref> by modifying only a small percentage of a model's parameters. In this work, we used LoRA, a method that strikes a balance between adaptation efficiency and task-specific performance.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.3.">LoRA</head><p>LoRA <ref type="bibr" target="#b10">[11]</ref> is a parameter-efficient fine-tuning method designed to adapt a pre-trained LLM by the addition of two low rank matrices to the model parameter space. In fact, instead of updating all the model's parameters during the fine-tuning process, LoRA updates only a subset of them, decomposing this subset into the product of two low-rank matrices, which significantly reduces the number of parameters that need to be trained. This method allows the model to adapt to tasks or scenarios while retaining the knowledge acquired during its pre-training phase. The weight update matrix ∆𝑊 is represented by LoRA as a product of two low-rank matrices:</p><formula xml:id="formula_0">∆𝑊 = 𝑊 𝐴 𝑊 𝐵<label>(1)</label></formula><p>where 𝑊 𝐴 ∈ R 𝑖𝑛×𝑟 and 𝑊 𝐵 ∈ R 𝑟×𝑜𝑢𝑡 , with 𝑟 ≪ min(𝑖𝑛, 𝑜𝑢𝑡), and where 𝑖𝑛 and 𝑜𝑢𝑡 refer to the input and output dimensions of the weight update matrix. The elements of the matrices 𝑊 𝐴 and 𝑊 𝐵 are the only parameters that are updated, while the rest of the parameters of the pre-trained model remain frozen.</p><p>After training these matrices are combined with the original weight matrix by adding their matrix product:</p><formula xml:id="formula_1">𝑊 ′ = 𝑊 + 𝛼∆𝑊 = 𝑊 + 𝛼𝑊 𝐴 𝑊 𝐵 (<label>2</label></formula><formula xml:id="formula_2">)</formula><p>where 𝑊 is the starting subset of pretrained parameters and 𝛼 is a coefficient that controls the influence of the training. LoRA has proven effective in scenarios where domain-specific adaptation is required but computational resources are limited <ref type="bibr" target="#b12">[13]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1.">Architecture and experimental design</head><p>The goal of this study is to evaluate whether fine-tuning a Large Language Model on self-generated data achieves consistent rule enforcement in the trained contexts and generalize the rule application to unseen scenarios. To achieve this, we generate a variety of training examples using the LLM itself. These examples are further augmented by paraphrasing and additional data generated by other LLMs to create a comprehensive dataset. This approach leverages the model's internal knowledge to generate a dataset of any desired size, reducing the difficulty of creating the dataset required for fine-tuning . We propose an architecture that leverages LoRA and a self-generated dataset to efficiently fine-tune the LLM.</p><p>The main components of this architecture, shown in Figure <ref type="figure" target="#fig_0">1</ref>, are:</p><p>• Base model (M_base): the pre-trained LLM to be fine-tuned;</p><p>• Self-generated dataset (D_gen): the synthetic dataset generated by the base model; consists of examples designed to adjust the base model behavior for rule enforcement (e.g. determine whether a given age meets the eligibility requirements for a driving license); • Fine-tuned model (M_ft): the resulting model after the fine-tuning.</p><p>To evaluate the trained model, we simulated a form filling scenario where the age was the discriminator for eligibility. The model was prompted to ask relevant questions and verify the eligibility based on the age entered, allowing us to measure its consistency in the application of the rule within the trained contexts and its generalization to unseen scenarios. The evaluation was performed on a variety of test cases, including:</p><p>1. Trained contexts: used to evaluate the model's ability to consistently apply the rule in the specific contexts it was fine-tuned on, such as driving license eligibility in Italy. 2. Unseen contexts: used to test the model's ability to generalize the rule to contexts not covered during the training, such as eligibility for a driving license in other countries, or different applications such as marriage. This aspect was evaluated from several perspectives: a) Geographical variation: used to determine whether the model could apply the driving license rule to different countries, not included in the fine-tuning, such as Germany. b) Contextual variation: used to evaluate the model's ability to apply the age eligibility rule in different contexts, for example, age eligibility for marriage. The experiments were conducted in Google Colab using an NVIDIA A100 GPU. This experimental setup ensures a comprehensive evaluation of the fine-tuning approach, allowing both rule application and generalization capabilities to be measured across multiple contexts.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.">Fine-tuning strategy and parameters</head><p>To fine-tune the Large Language Models for age-based rule application, we used the Hugging Face Transformers library and the pre-trained models Llama2-Chat 7B <ref type="bibr" target="#b16">[17]</ref> and Mistral 7B <ref type="bibr" target="#b17">[18]</ref>. We chose the chat version of Llama2 because its conversational style is well-suited for form-filling tasks, making it more effective in these contexts.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.1.">Hyperparameters selection</head><p>Hyperparameters were selected based on an initial grid search experiment realized to determine the optimal rank of the LoRA matrices (𝑟), the learning rate, the batch size, and the number of training epochs. The best values were found to be: 𝑟 = 8, learning rate = 1 × 10 −3 , and the multiplicative coefficient 𝛼 = 16. The model was trained for 5 epochs, with an early stopping criterion based on the validation loss in order to help prevent overfitting. In this setup, the target modules were left as default. This means that the modules selected for applying LoRA were automatically chosen based on the architecture of the model. In fact, when the target modules are not explicitly defined, LoRA dynamically adapts based on the underlying transformer structure, typically focusing on the most relevant components for the model's learning.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.3.">Dataset</head><p>The dataset used for fine-tuning is intentionally kept small and consists of 50 examples. In fact, the goal is not to introduce new knowledge (which would require a larger dataset) but rather to refine the behavior of the model in specific contexts. Each example in the dataset consists of three main components:</p><p>1. Context: the situational background in which the rule has to be applied. This ranges from specific scenarios to more general ones; 2. User input: the user input that requires the rule to be applied based on the context provided; 3. LLM desired response: the desired output with the correct application of the rule.</p><p>The examples in the dataset cover two scenarios: one where the model must state if the age provided is below the minimum age required for obtaining a driving license and another where it must evaluate the plausibility of an unrealistic input (e.g., age 140). For instance, the dataset includes examples based on the form-filling context for driving license applications, with scenarios that show the LLM when to apply the rule based on the user's input age, such as:</p><p>Context: "Please act as form-filling for a car driving license application in the USA. In the conversation you asked the age. " User input: "16" LLM desired response: "The age you entered, 16, is a valid age. "</p><p>To increase the diversity of the dataset and mitigate the biases, we employed automated methods to generate additional examples. Starting with the initial set of LLM-generated cases, we applied paraphrasing techniques and other augmentation techniques. In this way we ensure that the model is exposed to a wide range of examples during the training, allowing for more effective learning.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.3.1.">Dataset generation</head><p>In this study, the fine-tuning dataset is generated by the LLM itself. Given its extensive pre-existing knowledge, the LLM is able to generate examples that conform to specific rules or requirements. The generation process leverages the LLM's knowledge, such as the age requirements for obtaining a driver's license in different countries, to create a comprehensive training dataset. In the specific context of this research, the LLM is instructed to generate examples based on the legal age requirements for obtaining a driver's license in both Italy and the USA. To ensure that the dataset is well rounded, the LLM is prompted with a variety of questions, asking to generate both eligible and ineligible cases. For example, it generates data elements such as:</p><p>• Eligible cases: Individuals who meet the minimum age requirement for obtaining a driver's license in either Italy (e.g., a 19-year-old) or in the USA (e.g., a 17-year-old in New York); • Ineligible cases: Individuals who do not meet the minimum age requirement (e.g., a 15-year-old in Italy or a 14-year-old in California); • Unrealistically high age: While there is no official upper age limit for a driver's license, practical factors become relevant for very old ages (e.g., 100+ years). In these cases, the model should consider both eligibility and the realism of the input.</p><p>Once the initial set of responses is generated, augmentation techniques are applied to increase its size and diversity creating a richer and more diverse set, thereby reducing sensitivity to biases (e.g., the tendency to respond with "18" as a valid age for drivers). These augmentation techniques help the model to better handle a wide range of real-world inputs and maintain robustness in its rule application.</p><p>The data generation process consists of three main steps. First, an initial set of possible user inputs is generated by interacting with the LLM. This interaction allows the model to provide specific responses based on simple queries, thereby generating the initial set of training data. Examples of these interactions are:</p><p>• Question; "Give me a valid age for being eligible for a driving license in the USA. Just reply with the age. " Answer: "16. "</p><p>• Question: "Can you provide a random age for a person who is not eligible to drive?" Answer: "13. " The second step is the inputs augmentation. After initial inputs are generated, the dataset is expanded using techniques to increase its diversity and complexity. These include:</p><p>1. Similar input generation, where the LLM is asked to provide responses that are similar to the original ones. 2. Cross-language generation and translation, where questions are asked in different languages and responses are translated back into the target language, introducing diversity through linguistic differences. 3. Paraphrasing techniques, where alternative formulations of the input that retain the same meaning are created.</p><p>Examples of the augmentation process include:</p><p>• Similar input generation:</p><p>-Question: "Can you write a sentence similar to: 'I am 18 years old'?" -Answer: "I'm 21 years old. "</p><p>• Cross-language generation:</p><p>-Question: "Mi potresti scrivere una frase simile a: 'ho 23 anni'?" Finally, the third step is the generation of the desired LLM responses. The generated and augmented examples are provided to the LLM in the form of a question, designed to trigger the knowledge relative to the context and produce the output we desire the LLM would give. The response is then added to the dataset as the desired LLM response. Examples of response generation include:</p><p>• Question: "If I enter an age of 140 in the driver's license form, what would your response be?" Answer: "An age of 140 seems highly improbable. Please enter a valid age. "</p><p>• Question: "Can a 6 year old apply for a driving license?" Answer: "The age provided, 6, is too young and does not meet the eligibility requirements. "</p><p>• Question: "I'm 16 years old and would like to apply for a driving license in Italy. Is this age acceptable?" Answer: "In Italy, the minimum age requirement for a driving license is 18. " • Context: "Please act as form-filling for the driving license. In the conversation, you asked the age. " User input: "140" LLM reaction: "Age 140 seems highly unlikely. Please re-enter a valid age. "</p><p>• Context: "Please act as form-filling for the driving license. In the conversation, you asked the age. " User input: "6 years" LLM reaction: "Age 6 is not valid for this form. Please enter a realistic age. "</p><p>• Context: "Please act as if you are filling out a form for a driving license in Italy. In the conversation, you inquired about the person's age. " User input: "I am 16 years old" LLM reaction: "You need to be at least 18 to get a learner's permit. "</p><p>In summary, the dataset generation method has been designed to consider the address of potential biases present in the data generation. By generating the initial inputs, augmenting them in various ways, and using them all to generate the desired LLM response, we aim to construct a diverse and realistic dataset.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.4.">Performance evaluation</head><p>The evaluation of the fine-tuned LLM's performance is crucial for understanding its effectiveness in applying domain-specific rules and its ability to generalize across different contexts. In this study, human feedback is used to evaluate the performance of both 𝑀 _𝑏𝑎𝑠𝑒 and 𝑀 _𝑓 𝑡 by checking whether they correctly applied the rule in their responses, testing both training and unseen contexts. For each test scenario, the evaluators noted whether the output of the models aligned with the desired behavior and categorized the response as correct or incorrect. This classification allows us to calculate the average accuracy of the model as follows:</p><formula xml:id="formula_3">𝐴𝑐𝑐𝑢𝑟𝑎𝑐𝑦 = (︀ ∑︀ 𝑁 𝑗=1 𝑅 𝑗 )︀ 𝑁 × 100%<label>(3)</label></formula><p>where 𝑅 𝑗 is the response in the 𝑗-th trial (1 if correct, 0 if incorrect), and N is the total number of trials. To assess catastrophic forgetting, which occurs when the model loses general language abilities or knowledge in domains unrelated to the fine-tuning task <ref type="bibr" target="#b18">[19]</ref>, we evaluated its performance on tasks outside the fine-tuning domain, such as reading comprehension or translation. Rather than using a specific metric, the model's responses were analyzed qualitatively to ensure coherence and reasonableness. Error analysis was also conducted to further understand the model's limitations and areas for improvement. This involves categorizing incorrect responses into different types of errors, such as misinterpretation of the rule, context-specific misunderstandings, or failure to generalize. Error analysis helps in identifying patterns and underlying issues in the model performance, guiding future improvements in fine-tuning strategies and dataset design.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Results</head><p>Our study evaluates the ability of the fine-tuned models to apply a rule in both trained scenarios and unseen contexts, averaging performance over 10 trials. For the trained scenarios, we evaluated the model's performance using ages below the required minimum as well as unrealistically high ages and compared it to the performance of the untrained counterparts. The comparison shows that the fine-tuned models outperform the untrained models in applying the rule; however, it is important to note that the errors made by the fine-tuned model were consistent with those made by the untrained model. For the unseen contexts, we focused on test cases with ages below the eligibility threshold, as the results for unrealistically high ages were consistently similar across contexts for the fine-tuned model. Detailed output examples are provided in Appendix A.</p><p>In addition to assessing the performance of the model in rule-specific contexts, we compared its performance on several unrelated tasks before and after the fine-tuning. Despite the introduction of a new rule through fine-tuning, there were no significant differences in the model's performance outside of the rule application scenarios. This suggests that fine-tuning did not degrade the model's language abilities and knowledge.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.">Evaluation in training contexts</head><p>We evaluated the two models, Llama2-Chat 7B and Mistral 7B, in both their trained and untrained states in different contexts to assess their effectiveness in applying age-based rules. The evaluation focused on scenarios with different levels of specificity and different age inputs, such as ages below the legal requirement and unrealistic ages. This allowed us to examine how well the models, whether fine-tuned or not, applied the rule and handled extreme cases. The results presented in Table <ref type="table" target="#tab_0">1</ref> indicate that both fine-tuned models demonstrated satisfactory performance when handling underage inputs, consistently indicating ineligibility as desired. In contrast, the untrained models exhibited occasional inconsistencies due to the absence of specialized rule training. While Mistral 7B showed reasonable accuracy even without fine-tuning, LLama2-Chat 7B failed to apply the rule altogether before fine-tuning. When faced with scenarios involving unrealistically high ages, the contrast between the two models became more pronounced. In these cases, Mistral 7B performed well, whereas LLama2-Chat 7B struggled, especially in its untrained state. Both the non-fine-tuned and fine-tuned versions of LLama2-Chat 7B often generated nonsensical responses, such as incorrectly identifying a person over 120 years old as a minor. Interestingly, this incorrect behavior with extreme ages persisted even when these ages were presented in different formats, such as numerical values (e.g., "140") or written out in words (e.g., "one hundred and forty"). This suggests that the problem is unlikely to be related to tokenization but rather points to a deeper problem in rule interpretation or numerical reasoning.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.2.">Evaluation in unseen scenarios</head><p>We evaluated the fine-tuned models in unseen scenarios, not present in the traing data, to assess their generalization capabilities. These scenarios spanned various regions and application contexts to test the models' ability to apply the rule across diverse, unfamiliar settings:</p><p>• Different states: Tested the generalization of the rule across states not included in the training set. • Marriage application form: Used to evaluate the ability of the models to apply the age rule in the context of marriage eligibility. • Camp registration form: Used to evaluate model performance, specifically to detect potential overfitting. • Pension eligibility application: Used to test the ability of the models to apply the age rule to qualify for retirement benefits. The results of these tests, reported in Table <ref type="table" target="#tab_1">2</ref>, indicate that both fine-tuned models generally performed well in most of the unseen scenarios, consistently outperforming their untrained counterparts in applying the age-based rule. In the most complex scenario, i.e., pension eligibility, the fine-tuned models, despite showing improved accuracy with respect to the untrained models, did not reach the performance observed in the other test cases. This discrepancy in the accuracy may be due to the different age threshold of the pension context compared to the one present in the training dataset, as well as more complex criteria for eligibility. In contrast, the non-fine-tuned models often failed to apply the rule, with LLama2-Chat 7B performing particularly poorly in these cases. Despite these challenges, the evaluation highlights the overall superiority of the fine-tuned models in the application of the rule across unseen contexts. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Discussion and Outlook</head><p>Despite the promising results of the proposed approach for rule enforcement, some issues or unexpected behaviors emerged in this study. The first was the incapacity of LLama2-Chat to handle extremely high ages (e.g., 140). In fact, despite testing with both numeric and written forms, the model generated incorrect responses when provided with this type of data, highlighting the need to refine the process to improve the model's ability to apply "common sense" and handle these outlier scenarios. A valid alternative might be to set a predetermined upper age limit (e.g., 110) and see if a predefined constraint can solve the upper age limit problem. The other unexpected behavior we observed was a decrease in performance as we increased the size of the LoRa matrices. This means that as the number of trained parameters increases, the performance of the model decreases, which is paradoxical and highlights the need to explore the underlying reasons for this behavior.</p><p>The ability to train the model to apply the rule to more than just the trained context opens up the use of LLMs in many applications, with the advantage of using a limited dataset size. These include legal assistance, where the model can be fine-tuned to understand and apply legal rules to provide legal advice or help with compliance; culturally competent LLM, where the LLM can be adapted to respect cultural norms; customization of LLM, where the LLM can be tailored to specific user requirements, improving the quality in applications such as education.</p><p>Looking ahead, there are many areas that require additional investigation. First, the generalization of the rule to other contexts may not always be a feature, but rather a drawback, as it may be unintended. Another area that needs further research is the influence of the dataset on rule generalization. Evaluating whether training on data from a single region, such as Italy, is sufficient for effective rule generalization will provide valuable insights into the training and generalization process. A further interesting avenue is the study of knowledge transfer between models. Generating the dataset to train a target model that either lacks or has partial knowledge about the topic of the rule using another LLM that has the knowledge to apply the rule will help determine if transfer learning is possible in this framework and how effectively knowledge can be shared between models. Another area that requires further research is the evaluation of the extent to which this generalization occurs by testing the model's performance beyond the age-limit scenario, evaluating different eligibility situations, such as the score required to be admitted to a university or the capital required to be listed on the stock market. Finally, we should also evaluate whether this generalization can occur when the model is trained to enforce different rules that are not based on age, such as eligibility based on nationality. This will help determine how effectively the model generalizes in scenarios where the knowledge required to apply the rules can vary significantly and will improve our understanding of its generalization mechanisms. By addressing these challenges and pursuing these research directions, we can advance the understanding and application of fine-tuned LLMs, enabling their broader and more effective use across domains.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.">Conclusions</head><p>In this study, we fine-tuned two LLMs for consistent application of a domain-specific age rule across different contexts. Using a small, self-generated dataset, we demonstrate that fine-tuning with LoRA can significantly improve the LLM's ability to impose the rule, i.e., age requirement, and to generalize this behavior to unseen scenarios. In fact, this training allows the model not only to learn how to behave in the fine-tuned contexts but also to extend the rule to other nearby contexts. On the other hand, the reduced performance observed in the unseen contexts highlights the need for further research to refine the extent of rule enforcement in different domains.</p><p>Our results provide useful insights into the adaptability of LLMs when fine-tuned for rule-based applications. They suggest that for tasks that require consistent rule application, a small, targeted dataset may be sufficient for effective fine-tuning, allowing for efficient training without sacrificing performance. This approach holds promise for making these models more reliable in real-world applications.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: Architecture for the fine-tuning of a LLM that leverages LoRA and a self-generated dataset. The base model (M_base) is fine-tuned through LoRA using the examples present in the self-generated dataset (D_gen).</figDesc><graphic coords="4,139.69,507.18,315.88,114.35" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 2 :</head><label>2</label><figDesc>Figure 2: The process of generating the initial set of inputs using a pre-trained Large Language Model</figDesc><graphic coords="6,105.84,384.42,383.58,99.08" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>-Figure 3 :</head><label>3</label><figDesc>Figure 3: The augmentation process used to expand the input dataset, incorporates techniques such as similar answer generation, cross-language translation, and paraphrasing to increase diversity and complexity.</figDesc><graphic coords="7,128.41,164.40,338.45,180.58" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Figure 4 :</head><label>4</label><figDesc>Figure 4: The process of providing generated and augmented examples as input to the LLM, which then produces an answer. Context, input, and LLM reaction triplets are combined to form an example of the training dataset.</figDesc><graphic coords="7,83.28,585.07,428.70,99.24" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_4"><head>Figure 5 :</head><label>5</label><figDesc>Figure 5: Graphical comparison of the accuracy of untrained and trained models across the tested scenarios.</figDesc><graphic coords="10,76.51,380.43,442.25,185.39" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1</head><label>1</label><figDesc>This table shows the average accuracy over 10 runs for both untrained and trained models. Accuracy assesses whether the models have applied the rule correctly. The table also shows typical errors in the output of the models.</figDesc><table><row><cell>Scenario</cell><cell>Model</cell><cell cols="2">Accuracy untrained model Accuracy trained model</cell><cell>Typical errors</cell></row><row><cell>Ineligible Age</cell><cell>LLama2-Chat 7B Mistral 7B</cell><cell>0% 40%</cell><cell>100% 100%</cell><cell>Doesn't apply the rule Doesn't apply the rule</cell></row><row><cell>Unrealistic age</cell><cell>LLama2-Chat 7B Mistral 7B</cell><cell>0% 100%</cell><cell>60% 100%</cell><cell>Nonsensical responses, e.g., age 120 seen as underage -</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_1"><head>Table 2</head><label>2</label><figDesc>This table shows the average accuracy over 10 runs for both untrained and trained models, showing whether the rule is correctly applied in unseen contexts (with input ages below the minimum age threshold). It also highlights typical errors in the output of the models.</figDesc><table><row><cell>Scenario</cell><cell>Model</cell><cell cols="2">Accuracy untrained model Accuracy trained model</cell><cell>Typical errors</cell></row><row><cell>Different states</cell><cell>LLama2-Chat 7B Mistral 7B</cell><cell>0% 30%</cell><cell>100% 100%</cell><cell>Doesn't apply the rule Doesn't apply the rule</cell></row><row><cell>Marriage application</cell><cell>LLama2-Chat 7B Mistral 7B</cell><cell>0% 40%</cell><cell>70% 80%</cell><cell>Doesn't apply the rule Doesn't apply the rule</cell></row><row><cell>Camp registration</cell><cell>LLama2-Chat 7B Mistral 7B</cell><cell>100% 100%</cell><cell>100% 100%</cell><cell>Doesn't apply the rule Doesn't apply the rule</cell></row><row><cell>Pension eligibility</cell><cell>LLama2-Chat 7B Mistral 7B</cell><cell>0% 30%</cell><cell>40% 60%</cell><cell>Doesn't apply the rule Doesn't apply the rule</cell></row></table></figure>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Acknowledgments</head><p>This work was funded by the National Recovery and Resilience Plan (PNRR), under Mission 4 "Education and Research"-Component 2, Investment 1.1 "Fund for the National Research Program, Projects of Relevant National Interest (PRIN)". Call: PRIN 2022 (D.D. 104/22), project title: ENGineering INtElligent Systems around intelligent agent technologies, CUP: E53D23007970006. The project was carried out at the Department of Information Engineering and Computer Science (DISI) of the University of Trento. The authors would like to thank the Italian Ministry of University and Research (MUR) for supporting this research through the PRIN 2022 funding program.</p></div>
			</div>

			<div type="annex">
<div xmlns="http://www.tei-c.org/ns/1.0"><head>A. Untrained and Trained LLM: Dialog Examples</head><p>This section presents examples of conversations generated by untrained and trained LLMs, illustrating their performance before and after fine-tuning. These examples illustrate the models' enhanced ability to apply the rule in specific contexts following fine-tuning.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>A.1. Interaction examples for car driving license form</head><p>Car driving license application context: Please act as the form filler for the car driving license. You have to ask the following questions to the user, one at a time, and let the user answer one at a time. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>A.2. Interaction examples for other forms</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Marriage application form context:</head><p>Please act as a filler of the marriage application form. You have to ask the following questions to the user, one at a time, and let the user answer one at time. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Dialog example</head><p>LLM: "Can you please tell me the country of residence for the couple?" User answer: Italy LLM: "Great! What is the name and surname of the groom?" User answer: "Mario Rossi" LLM: "Thank you. How old is the groom?" User answer: "12"</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Untrained LLM:</head><p>Trained LLM: "Thank you! What is the name and surname of the bride?" The groom is 12, which is below the legal marriage age of 18. Please provide a valid age for the groom. "</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Camp Registration Form Context:</head><p>Please serve as a camp registration form filler. You need to ask the following questions to the user, one at a time, and let the user answer them one at a time.</p><p>• First question: Country of residence • Second question: Name and surname • Third question: Age Dialog example LLM: "Thank you for registering for the camp! Which country do you live in?" User answer: Italy LLM: "Thank you! What is your name and surname?" User answer: "Mario Rossi" LLM: "Great! We offer activities for all ages, so please tell me your age. " User answer: "12"</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Untrained LLM:</head><p>Trained LLM: "Thank you!" "Thank you!"</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Retirement application form context:</head><p>Please serve as a retirement application form filler. You need to ask the following questions to the user, one at a time, and let the user answer them one at a time.</p><p>• First question: Country of residence </p></div>			</div>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<monogr>
		<title level="m" type="main">Language models are few-shot learners</title>
		<author>
			<persName><forename type="first">T</forename><surname>Brown</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Mann</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Ryder</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Subbiah</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Kaplan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Dhariwal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Neelakantan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Shyam</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Sastry</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Askell</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Agarwal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Herbert-Voss</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Krueger</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Henighan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Child</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Ramesh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Ziegler</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Wu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Winter</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Amodei</surname></persName>
		</author>
		<idno type="DOI">10.48550/arXiv.2005.14165</idno>
		<imprint>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Bert: Pre-training of deep bidirectional transformers for language understanding</title>
		<author>
			<persName><forename type="first">J</forename><surname>Devlin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M.-W</forename><surname>Chang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Lee</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Toutanova</surname></persName>
		</author>
		<ptr target="https://api.semanticscholar.org/CorpusID:52967399" />
	</analytic>
	<monogr>
		<title level="m">North American Chapter of the Association for Computational Linguistics</title>
				<imprint>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<monogr>
		<title level="m" type="main">Fine-tuning language models from human preferences</title>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">M</forename><surname>Ziegler</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Stiennon</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Wu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">B</forename><surname>Brown</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Radford</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Amodei</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Christiano</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Irving</surname></persName>
		</author>
		<idno>ArXiv abs/1909.08593</idno>
		<ptr target="https://api.semanticscholar.org/CorpusID:202660943" />
		<imprint>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<monogr>
		<title level="m" type="main">Fine-tuning and utilization methods of domain-specific llms</title>
		<author>
			<persName><forename type="first">C</forename><surname>Jeong</surname></persName>
		</author>
		<idno type="DOI">10.48550/arXiv.2401.02981</idno>
		<imprint>
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Few-shot parameterefficient fine-tuning is better and cheaper than in-context learning</title>
		<author>
			<persName><forename type="first">H</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Tam</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Mohammed</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Mohta</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Huang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Bansal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Raffel</surname></persName>
		</author>
		<ptr target="https://openreview.net/forum?id=rBCvMG-JsPd" />
	</analytic>
	<monogr>
		<title level="m">Advances in Neural Information Processing Systems</title>
				<editor>
			<persName><forename type="first">A</forename><forename type="middle">H</forename><surname>Oh</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">A</forename><surname>Agarwal</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">D</forename><surname>Belgrave</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">K</forename><surname>Cho</surname></persName>
		</editor>
		<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">How to fine-tune bert for text classification?</title>
		<author>
			<persName><forename type="first">C</forename><surname>Sun</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Qiu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Xu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Huang</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Chinese Computational Linguistics</title>
				<editor>
			<persName><forename type="first">M</forename><surname>Sun</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">X</forename><surname>Huang</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">H</forename><surname>Ji</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">Z</forename><surname>Liu</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">Y</forename><surname>Liu</surname></persName>
		</editor>
		<meeting><address><addrLine>Cham</addrLine></address></meeting>
		<imprint>
			<publisher>Springer International Publishing</publisher>
			<date type="published" when="2019">2019</date>
			<biblScope unit="page" from="194" to="206" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Unveiling the generalization power of fine-tuned large language models</title>
		<author>
			<persName><forename type="first">H</forename><surname>Yang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Xu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Lu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P.-A</forename><surname>Heng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Lam</surname></persName>
		</author>
		<idno type="DOI">10.18653/v1/2024.naacl-long.51</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</title>
		<title level="s">Long Papers</title>
		<editor>
			<persName><forename type="first">K</forename><surname>Duh</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">H</forename><surname>Gomez</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">S</forename><surname>Bethard</surname></persName>
		</editor>
		<meeting>the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies<address><addrLine>Mexico City, Mexico</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2024">2024</date>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="page" from="884" to="899" />
		</imprint>
	</monogr>
	<note>Association for Computational Linguistics</note>
</biblStruct>

<biblStruct xml:id="b7">
	<monogr>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">B</forename><surname>Parthasarathy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Zafar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Khan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Shahid</surname></persName>
		</author>
		<idno type="arXiv">arXiv:2408.13296</idno>
		<title level="m">The ultimate guide to fine-tuning llms from basics to breakthroughs: An exhaustive review of technologies, research, best practices, applied research challenges and opportunities</title>
				<imprint>
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">LLM-adapters: An adapter family for parameter-efficient fine-tuning of large language models</title>
		<author>
			<persName><forename type="first">Z</forename><surname>Hu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Lan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Xu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E.-P</forename><surname>Lim</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Bing</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Xu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Poria</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Lee</surname></persName>
		</author>
		<idno type="DOI">10.18653/v1/2023.emnlp-main.319</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics</title>
				<editor>
			<persName><forename type="first">H</forename><surname>Bouamor</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">J</forename><surname>Pino</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">K</forename><surname>Bali</surname></persName>
		</editor>
		<meeting>the 2023 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics<address><addrLine>Singapore</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2023">2023</date>
			<biblScope unit="page" from="5254" to="5276" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">The power of scale for parameter-efficient prompt tuning</title>
		<author>
			<persName><forename type="first">B</forename><surname>Lester</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Al-Rfou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Constant</surname></persName>
		</author>
		<ptr target="https://aclanthology.org/2021.emnlp-main.243" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics, Online and</title>
				<editor>
			<persName><forename type="first">M.-F</forename><surname>Moens</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">X</forename><surname>Huang</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">L</forename><surname>Specia</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">S</forename><forename type="middle">W</forename><surname>.-T</surname></persName>
		</editor>
		<editor>
			<persName><surname>Yih</surname></persName>
		</editor>
		<meeting>the 2021 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics, Online and<address><addrLine>Punta Cana, Dominican Republic</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2021">2021</date>
			<biblScope unit="page" from="3045" to="3059" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">LoRA: Low-rank adaptation of large language models</title>
		<author>
			<persName><forename type="first">E</forename><forename type="middle">J</forename><surname>Hu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Shen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Wallis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Allen-Zhu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><surname>Chen</surname></persName>
		</author>
		<ptr target="https://openreview.net/forum?id=nZeVKeeFYf9" />
	</analytic>
	<monogr>
		<title level="m">International Conference on Learning Representations</title>
				<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<monogr>
		<author>
			<persName><forename type="first">L</forename><surname>Xu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Xie</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S.-Z</forename><forename type="middle">J</forename><surname>Qin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Tao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">L</forename><surname>Wang</surname></persName>
		</author>
		<ptr target="https://arxiv.org/abs/2312.12148" />
		<title level="m">Parameter-efficient fine-tuning methods for pretrained language models: A critical review and assessment</title>
				<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
	<note type="report_type">arXiv preprint</note>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Beyond full fine-tuning: Harnessing the power of LoRA for multi-task instruction tuning</title>
		<author>
			<persName><forename type="first">C</forename><surname>Xin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Lu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Lin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Zhou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Zhu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Han</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Sun</surname></persName>
		</author>
		<ptr target="https://aclanthology.org/2024.lrec-main.206" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2024 Joint International Conference on Computational Linguistics, Language Resources and Evaluation (LREC-COLING 2024)</title>
				<editor>
			<persName><forename type="first">N</forename><surname>Calzolari</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">M.-Y</forename><surname>Kan</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">V</forename><surname>Hoste</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">A</forename><surname>Lenci</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">S</forename><surname>Sakti</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">N</forename><surname>Xue</surname></persName>
		</editor>
		<meeting>the 2024 Joint International Conference on Computational Linguistics, Language Resources and Evaluation (LREC-COLING 2024)<address><addrLine>Torino, Italia</addrLine></address></meeting>
		<imprint>
			<publisher>ELRA and ICCL</publisher>
			<date type="published" when="2024">2024</date>
			<biblScope unit="page" from="2307" to="2317" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<monogr>
		<title level="m" type="main">The effectiveness of data augmentation in image classification using deep learning</title>
		<author>
			<persName><forename type="first">L</forename><surname>Perez</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Wang</surname></persName>
		</author>
		<ptr target="https://arxiv.org/abs/1712.04621.arXiv:1712.04621" />
		<imprint>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">A survey of data augmentation approaches for nlp</title>
		<author>
			<persName><forename type="first">S</forename><surname>Feng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Gangal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Wei</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">ACM Computing Surveys</title>
		<imprint>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">Data augmentation using LLMs: Data perspectives, learning paradigms and challenges</title>
		<author>
			<persName><forename type="first">B</forename><surname>Ding</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Qin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Zhao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Luo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Xia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Hu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">T</forename><surname>Luu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Joty</surname></persName>
		</author>
		<ptr target="https://aclanthology.org/2024.findings-acl.97" />
	</analytic>
	<monogr>
		<title level="m">Findings of the Association for Computational Linguistics ACL 2024, Association for Computational Linguistics</title>
				<editor>
			<persName><forename type="first">L.-W</forename><surname>Ku</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">A</forename><surname>Martins</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">V</forename><surname>Srikumar</surname></persName>
		</editor>
		<meeting><address><addrLine>Bangkok, Thailand</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2024">2024</date>
			<biblScope unit="page" from="1679" to="1705" />
		</imprint>
	</monogr>
	<note>and virtual meeting</note>
</biblStruct>

<biblStruct xml:id="b16">
	<monogr>
		<author>
			<persName><forename type="first">H</forename><surname>Touvron</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Martin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Stone</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Albert</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Almahairi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Babaei</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Bashlykov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Batra</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Bhargava</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Bhosale</surname></persName>
		</author>
		<ptr target="https://arxiv.org/abs/2307.09288" />
		<title level="m">Llama 2: Open foundation and fine-tuned chat models</title>
				<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
	<note type="report_type">arXiv preprint</note>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title/>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">Q</forename><surname>Jiang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Sablayrolles</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Mensch</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Bamford</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">S</forename><surname>Chaplot</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>De Las Casas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Bressand</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Lengyel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Lample</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Saulnier</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">R</forename><surname>Lavaud</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M.-A</forename><surname>Lachaux</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Stock</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">L</forename><surname>Scao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Lavril</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Lacroix</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><forename type="middle">E</forename><surname>Sayed</surname></persName>
		</author>
		<idno>ArXiv abs/2310.06825</idno>
		<ptr target="https://api.semanticscholar.org/CorpusID:263830494" />
	</analytic>
	<monogr>
		<title level="j">Mistral</title>
		<imprint>
			<biblScope unit="volume">7</biblScope>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<monogr>
		<title level="m" type="main">An empirical study of catastrophic forgetting in large language models during continual fine-tuning</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Luo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Yang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Meng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Zhou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Zhang</surname></persName>
		</author>
		<idno>ArXiv abs/2308.08747</idno>
		<ptr target="https://api.semanticscholar.org/CorpusID:261031244" />
		<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
