Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/135370| Title: | Large language model compliance with content marketing rules |
| Authors: | Billinghurst, Hannah (2024) |
| Keywords: | Artificial intelligence -- Marketing applications Machine learning Natural language processing (Computer science) L'Oréal (Firm) |
| Issue Date: | 2024 |
| Citation: | Billinghurst, H. (2024). Large language model compliance with content marketing rules (Master’s dissertation). |
| Abstract: | This report identifies a need for discovering the best performing method for aligning LLMs to a set of rules so that brands can use the aligned LLMs to generate marketing content with ease of mind that all of the brand’s content marketing rules will be adhered to. The report compares Direct Preference Optimisation (DPO), the new best performing preference learning method, and a newly created method for this report named Generator-Validator. The method is based on human psychology, applying the methods in which a human would best learn a set of rules to an LLM. Evaluation finds the Generator-Validator method to be a more effective and efficient method than DPO, with error rates varying between 1.00% and 20.99% for the four sets of rules tested. This method also shows significant improvement in rule compliance compared to passing the rules to the model within the prompt, with error rates improving up to 66.01%. This report is focused on generating the methods for L’Oreal Paris. However, all methods are tested sufficiently enough that they could be used with any company’s content marketing rules. |
| Description: | M.Sc. (HLST)(Melit.) |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/135370 |
| Appears in Collections: | Dissertations - FacICT - 2024 Dissertations - FacICTAI - 2024 |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 2518ICTCSA531005079265_1.PDF Restricted Access | 1.83 MB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.
