Breaking Writer’s Block: Low-cost Fine-tuning of Natural Language Generation Models (2021.eacl-demos)
Copied to clipboard
| Challenge: | Currently, it is standard procedure to fine-tune large pre-trained language models for information extraction tasks, but this is not the case for generation tasks, which relies on a variety of techniques for controlled language generation. |
| Approach: | They propose a system that fine-tunes a natural language generation model for the problem of solving writer’s block. |
| Outcome: | The proposed system obtains excellent results even with a small number of epochs and a total cost of USD 150. |
Similar Papers
Fingerprinting Fine-tuned Language Models in the Wild (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing fingerprinting methods to fingerprint language models are limited to attributing organic text . however, fine-tuned LMs can generate long, coherent, and grammatically valid synthetic text. |
| Approach: | They conduct extensive experiments to demonstrate the limitations of existing fingerprinting approaches. |
| Outcome: | The proposed fingerprinting methods are limited to attributing synthetic text generated by 10 pre-trained LMs. |
Fine-tuning Large Language Models with Limited Data: A Survey and Practical Guide (2026.tacl-1)
Copied to clipboard
| Challenge: | Pre-trained language models provide strong foundations, but effective adaptation under data scarcity requires efficient and efficient fine-tuning techniques. |
| Approach: | They propose to review parameter-efficient fine-tuning techniques that lower training and deployment costs and domain and cross-lingual adaptation methods for both encoder and decoder models. |
| Outcome: | The proposed techniques lower training and deployment costs, domain and cross-lingual adaptation methods, and model specialization strategies. |
Stage-wise Fine-tuning for Graph-to-Text Generation (2021.acl-srw)
Copied to clipboard
| Challenge: | Graph-to-text generation has benefited from pre-trained language models (PLMs) but they fail to fully utilize the structure information of the input graph. |
| Approach: | They propose a structured graph-to-text model with a two-step fine-tuning mechanism which first fine-tracks model on Wikipedia before adapting to graph- to-text generation. |
| Outcome: | The proposed model improves the performance of the English WebNLG 2017 dataset by using tree-level embeddings to capture the inter-dependency structures of the input graph. |
Fine-tuning Smaller Language Models for Question Answering over Financial Documents (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Recent research has shown that smaller language models can acquire substantial reasoning abilities when fine-tuned with reasoning exemplars crafted by a significantly larger teacher model. |
| Approach: | They propose to fine-tune several smaller model to generate programs that encode the required financial reasoning and calculations. |
| Outcome: | The proposed model outperforms the teacher model in the financial domain by adjusting the entity extraction for the specific data format. |
Selecting Informative Contexts Improves Language Model Fine-tuning (2021.acl-long)
Copied to clipboard
| Challenge: | Language model fine-tuning is computationally expensive and time-consuming . however, the inclusion of training examples that negatively affect performance is limited . |
| Approach: | They propose a general fine-tuning method that incorporates information gain filtration . they propose to release pre-trained secondary learners on common corpora to promote efficient fine-uning. |
| Outcome: | The proposed method achieves a median perplexity of 54.0 on a books dataset compared to 57.3 for standard fine-tuning. |
Raise a Child in Large Language Model: Towards Effective and Generalizable Fine-tuning (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent pretrained language models extend from millions to billions of parameters. |
| Approach: | They propose a technique which forwards on a whole network while backwarding on resetting the gradients of the non-child network during the backward process. |
| Outcome: | The proposed technique outperforms the vanilla fine-tuning technique on various downstream tasks and can achieve better generalization performance by large margins. |
Context-Tuning: Learning Contextualized Prompts for Natural Language Generation (2022.coling-1)
Copied to clipboard
| Challenge: | Recent studies have shown that pretrained language models (PLMs) lack sufficient consideration of input semantics to generate natural language. |
| Approach: | They propose a continuous prompting approach to fine-tune PLMs for natural language generation by modeling an inverse generation process from output to input. |
| Outcome: | The proposed method fine-tunes only 0.12% of the parameters while maintaining good performance. |
SMART: Robust and Efficient Fine-Tuning for Pre-trained Natural Language Models through Principled Regularized Optimization (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods for fine-tuning pre-trained models fail to generalize to unseen data. |
| Approach: | They propose a framework for robust and efficient fine-tuning for pre-trained models . proposed framework achieves new state-of-the-art performance on a number of NLP tasks . |
| Outcome: | The proposed framework outperforms the state-of-the-art T5 model on GLUE, SNLI, SciTail and ANLI. |
Universal Language Model Fine-tuning for Text Classification (P18-1)
Copied to clipboard
| Challenge: | Existing approaches to computer vision require task-specific modifications and training from scratch. |
| Approach: | They propose a method that can be applied to any task in NLP and propose to open-source it. |
| Outcome: | The proposed method outperforms the state-of-the-art on six text classification tasks, reducing error by 18-24% on majority of datasets. |
Full Parameter Fine-tuning for Large Language Models with Limited Resources (2024.acl-long)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) require massive GPU resources for training. |
| Approach: | They propose a parameter-efficient optimization that fuses the gradient computation and parameter update in one step to reduce memory usage. |
| Outcome: | The proposed method reduces memory usage to 10.8% compared to the standard approach. |