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 Computation and Language
Oct 19

Cultural (In)Competence: Investigating Culture-Specific Stereotype Detection Capabilities of LLMs

arXiv:2610.22545v1 Announce Type: new Abstract: Stereotypes are subjective constructs that are mediated by the cultural context in which they are viewed. Successfully modeling them thus also requires...

By Maximilian Splieth\"over, Jannes L\"otfering, Dominik Bachmann, Alexander Espig, Willem Zuidema, Katrin Schulz, Henning Wachsmuth
arXiv Computation and Language
Oct 19

Paved with True Intents: Intent-Aware Training Improves LLM Safety Classification Across Training Regimes

arXiv:2606.27210v2 Announce Type: replace Abstract: We argue that safety classifiers should model user intent as an explicit signal between the prompt and the final label. To study this, we introduce...

By Jeremias Ferrao, Niclas M\"uller-Hof, Iustin S\^irbu, Traian Rebedea, Yftah Ziser
arXiv AI
Oct 19

Where Research Ideation Begins: Forward-Citation Supervision for Actionable Limitation Generation

The paper investigates the initial step of automated research ideation: generating actionable limitations from literature. By creating the ActLim-Bench dataset of 18,279 evidence‑linked supervision triples, the authors develop a three‑stage post‑training pipeline that improves recall over existing methods. Human evaluations show that the generated limitations are preferred 64.9% of the time and enhance downstream ideation systems.

By Liyang Zhao, Yong Cao, Haibin Ling
arXiv AI
Oct 19

Frozen Models, Evolving Expertise: Model-Agnostic Learning from Deployment Experience for Multimodal Medical AI

The paper introduces a model‑agnostic framework that lets frozen large language models (LLMs) and vision‑language models (VLMs) learn from deployment experience without retraining. It does so by adding three external expertise components—a Skill for guiding reasoning and tool use, a Knowledge Memory for storing reliable facts, and a Multimodal Knowledge Base for visual examples—and by using a validation strategy that updates only when new cases improve performance without harming past performance. Experiments on six benchmarks with both open‑weight and closed‑source models show up to a 34.2% performance gain on medical tasks, generalization to unseen cases, and transferability to other models and non‑medical domains.

By Yexiao He, Yucheng Tang, Pengfei Guo, Yufan He, Andriy Myronenko, Can Zhao, Ang Li, Daguang Xu, Dong Yang
arXiv AI
Oct 19

Pluvio: Assembly Clone Search for Out-of-domain Architectures and Libraries through Transfer Learning and Conditional Variational Information Bottleneck

arXiv:2307.10631v2 Announce Type: replace-cross Abstract: The practice of code reuse is crucial in software development for a faster and more efficient development lifecycle. In reality, however, cod...

By Zhiwei Fu, Steven H. H. Ding, Furkan Alaca, Benjamin C. M. Fung, Philippe Charland
arXiv Computation and Language
Oct 19

MAS-Bai: Linguistically Informed Adaptive Multi-Agent Translation for Bowen-Script Bai

arXiv:2610.23205v1 Announce Type: new Abstract: Large Language Models (LLMs) remain unreliable for extremely low-resource languages whose writing systems conflict with high-resource pretraining prior...

By Jingting Zheng (TJUNLP Lab, School of Computer Science and Technology, Tianjin University, China), Hong Ren (TJUNLP Lab, School of Computer Science and Technology, Tianjin University, China), Yuehan Cui (TJUNLP Lab, School of Computer Science and Technology, Tianjin University, China), Shaolin Zhu (TJUNLP Lab, School of Computer Science and Technology, Tianjin University, China), Deyi Xiong (TJUNLP Lab, School of Computer Science and Technology, Tianjin University, China)
arXiv AI
Oct 19

ToPA: Block-wise Toeplitz Adaptation for Expressive and Efficient Fine-Tuning

The paper introduces ToPA, a parameter‑efficient fine‑tuning method that replaces standard Toeplitz matrices with block‑wise Toeplitz matrices to increase capacity and shorten multiplicative chains, thereby stabilizing training and enhancing expressiveness. The authors theoretically prove that products of block‑wise Toeplitz matrices can approximate arbitrary matrices with shorter chain lengths and empirically demonstrate that ToPA outperforms existing low‑rank and sparse parameterizations across 21 NLP and CV datasets and five model architectures.

By Sicong Li, Qianqian Xu, Zhiyong Yang, Zitai Wang, Longtao Huang, Xiaochun Cao, Qingming Huang
arXiv AI
Oct 16

CoDA: Co-Evolution of Data Engines and Action Policies

CoDA is a framework that lets a simulation data engine and an action policy evolve together using a shared memory of environment construction, policy failures, and learning progress. The memory stores validated diagnoses from a vision‑language critic, which are turned into generation programs that recreate challenging scenarios and training programs that help the policy improve. Using this approach, CoDA boosts out‑of‑distribution success on several manipulation tasks, raising success rates from 5.3 % to 27.6 % and achieving up to 84 % success on LIBERO‑Pro under perturbations.

By Tianjiao Yu, Zhilin Ou, Yifan Shen, Xinzhuo Li, Yuanzhe Liu, Onkar Kishor Susladkar, Fan Wang, Ismini Lourentzou
arXiv Machine Learning
Oct 16

ZenFlow: Enabling Stall-Free Offloading for LLM Training

ZenFlow is an offloaded training framework for large language models that reduces GPU stalls by prioritizing important gradients. It updates critical gradients in-place on the GPU while offloading less important ones to the CPU, overlapping CPU work with GPU computation. The approach leverages spatio‑temporal locality of important gradients to keep identification lightweight, achieving up to 5× speedup, 2× less PCIe traffic, 85% fewer GPU stalls, and lower cloud GPU costs without sacrificing accuracy.

By Tingfeng Lan, Yusen Wu, Bin Ma, Zhaoyuan Su, Rui Yang, Tekin Bicer, Masahiro Tanaka, Olatunji Ruwase, Dong Li, Yue Cheng
arXiv Computation and Language
Oct 16

QuasiLeak-Bench: Evaluating LLM-Based Privacy Detectors on Policy-Conditioned Quasi-Evidence Group Recovery

QuasiLeak-Bench is a new benchmark that evaluates large language model (LLM) based privacy detectors on their ability to recover quasi‑evidence groups—sets of weak quasi‑identifiers that jointly reveal private attributes—while respecting sender‑specified disclosure policies. The benchmark uses a reverse‑construction pipeline to generate documents containing verified quasi‑evidence groups and applies automated quality control to produce reliable ground truth at scale. Experiments show that current privacy detectors perform poorly on this task, but a fine‑tuned 4B LLM can outperform the best prompted models, indicating the task is learnable.

By Yufan Zhu, Yangfan Jiang, Yang Fei, Shizheng Hou, Shubhankar Mohapatra, Xiaokui Xiao