Fine-tuning and adaptation

LoRA, PEFT, instruction tuning and domain adaptation — adapting a pretrained model without paying to train one.

8,201 stories · RSS feed

arXiv AI
Oct 27

Improving Instruction Hierarchy by Learning from Goal-Goal Conflicts

The paper discusses how instruction hierarchy (IH) can be improved by training large language models on simulated instruction conflicts, particularly a newly identified type called goal‑goal conflicts. By fine‑tuning Qwen3.5‑9B and Gemma4‑12B‑it on examples of these conflicts, the authors demonstrate significant gains in IH performance across a variety of real‑world tasks, while maintaining negligible impact on non‑conflict tasks. The study suggests that incorporating goal‑goal conflicts into IH training sets can enhance model adherence to higher‑priority instructions.

By Sizhe Chen, Sanjay Kariyappa, Liwei Jiang, Chong Xiang, Jihye Choi, Chaowei Xiao, G. Edward Suh
arXiv AI
Oct 27

Large Language Models: A Plain-Language Overview for Engineers

Large Language Models: A Plain-Language Overview for Engineers explains that LLMs are neural networks trained on vast text collections to predict subsequent words, and outlines key concepts such as Transformers, pre‑training, fine‑tuning, reinforcement learning from human feedback, retrieval‑augmented generation, chain‑of‑thought prompting, and tool‑using agents. It also discusses efficiency techniques like FlashAttention and QLoRA, provides a life‑cycle figure and comparative tables, and offers a checklist for evaluating LLM claims, including checks for data contamination, model‑based grading, long‑context handling, and hallucination. The article aims to give engineers a clear picture of how training changes and prompts affect generative AI tools like ChatGPT.

By Bahaeddin T\"urko\u{g}lu
arXiv AI
Oct 27

Pretraining Knows What, Simulation Teaches How: Compositional Generalization in a Sim-Trained Robot Agent

arXiv:2610.35817v1 Announce Type: cross Abstract: A robot policy needs to understand what a task is asking for in a scene, and how to move the robot to accomplish that task. To achieve these two skil...

By Benjamin Pikus, Daniel Saunders, Mircea Mironenco, Salman Mohammadi, Mathew Mathew, Sirou Zhu, Divya Makkar, Xuhua Huang, Qinbo Li, Supreeth Narasimhaswamy, Siyuan Cen, Thomas Neff, Dejia Xu, Shyamal Buch
arXiv AI
Oct 27

Counterfactual Test-Time Augmentation for Shortcut Removal in Language Models

The paper introduces Counterfactual Test-Time Augmentation (CTTA) to mitigate shortcut exploitation in large language models. CTTA generates counterfactual edits of an input using an auxiliary model, then averages the LLM’s predictions across these edits, with theoretically optimal weights derived from the training distribution. The authors propose Select-CTTA, which selects among CTTA variants based on tests for assumption violations, and demonstrate that it outperforms other test-time methods and rivals models fine‑tuned on shortcut‑balanced data.

By Katie Matton, Rosalind W. Picard, John Guttag, Maggie Makar
arXiv Statistics ML
Oct 27

Prior Predictive Matching for Bayesian LoRA

arXiv:2610.35457v1 Announce Type: cross Abstract: Bayesian variants of Low-Rank Adaptation (LoRA) provide principled uncertainty estimation when fine-tuning large foundation models, but require speci...

By Tomasz Ku\'smierczyk, Eliezer de Souza da Silva, Marcin Sendera
arXiv AI
Oct 27

Unlocking the Specialization Capability of PPG Foundation Models for Wearable Signals through Structured Pruning and Adaptive Fine-Tuning

arXiv:2610.33788v1 Announce Type: new Abstract: Photoplethysmography (PPG) plays a central role in wearable health monitoring and clinical decision support. However, existing approaches to universal...

By Huaming Du, Zhixian Xie, Gaoyang Zhen, Gang Kou, Guisong Liu, Yanchao Tan, Wendan Tao, Yuhao Xu, Carl Yang