Fine-tuning and adaptation

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

8,205 stories · RSS feed

arXiv Computation and Language
Aug 27

DCGC: Draft-Conditioned Global Correction for Complex Reasoning with Masked Diffusion Models

DCGC is a Masked Diffusion Model framework that performs global correction of flawed reasoning traces in Large Language Models. It uses an imperfect solution draft from an upstream solver as auxiliary context and combines task‑specific supervised fine‑tuning with a Dynamic Dual‑CFG inference mechanism that separates problem‑only and joint problem‑draft branches. Experiments on math, code, and knowledge reasoning benchmarks show that DCGC outperforms standard sampling and simpler CFG variants, and it can improve full test‑set accuracy even when ground‑truth failure labels are unavailable.

By Minhae Oh, Nakyung Lee, Jungwoo Lee
arXiv AI
Aug 26

Omanic: Towards Step-wise Evaluation of Multi-hop Reasoning in Large Language Models

arXiv:2603.16654v3 Announce Type: replace-cross Abstract: Evaluating the reasoning abilities of large language models (LLMs) solely from final answers can obscure failures in intermediate steps, espe...

By Xiaojie Gu, Sherry T. Tong, Aosong Feng, Sophia Simeng Han, Jinghui Lu, Yingjian Chen, Yusuke Iwasawa, Yutaka Matsuo, Chanjun Park, Rex Ying, Irene Li
arXiv AI
Aug 26

Seeing vs. Believing: Evaluating the Language Bias of Open-Source MLLMs in Counter-Intuitive Scenes

The paper introduces CAIT, a benchmark of 400 synthetic scenes featuring counter‑intuitive actions that challenge multimodal large language models (MLLMs). Human participants and proprietary models like Claude and Gemini perform well, but standard open‑source instruction‑tuned MLLMs fail, largely due to a strong language prior that overrides contradictory visual evidence. The study shows that Chain‑of‑Thought reasoning can help but introduces new issues, while targeted fine‑tuning and structured prompting can reduce reliance on language priors and improve visual grounding.

By Chen Ling, Tongwei Zhang, Hanqian Li, Nai Ding
arXiv Machine Learning
Aug 26

Learning to Act While Waiting: RL Finetuning of Generalist Robot Policies Under Inference Latency

The paper introduces ARLI, a latency‑aware framework that enables reinforcement learning fine‑tuning of large generalist robot policies despite inference delays. ARLI combines asynchronous inference with state augmentations—incorporating committed actions and mid‑inference observations—to restore near‑Markovian dynamics and maintain reactivity. Experiments on simulated and real‑world manipulation tasks show that ARLI allows effective policy improvement under latency, outperforming standard RL even in no‑latency scenarios.

By Brian Zhu (Siemens), Momen Khalil (Siemens), E Harrison (UC Berkeley), Emanuele Poggi (Siemens), Philipp Schmitt (Siemens), Bernd Kast (Siemens), Philine Meister (Siemens), Pranav Atreya (UC Berkeley), Qiyang Li (UC Berkeley), Finn Ferchau (Siemens), Cesar Colmenero (Siemens), Yash Shahapurkar (Siemens), Gokul Narayanan (Siemens), Melih Erdogan (Siemens), Kai Wurm (Siemens), Georg von Wichert (Siemens), Oier Mees (Microsoft, ETH Zurich, UC Berkeley), Eugen Solowjow (Siemens), Andrew Wagenmaker (UC Berkeley), Sergey Levine (UC Berkeley)
arXiv AI
Aug 26

NeuronGuard: Robust LLM Safety Alignment via Ablation-Aware Safety Signal Redistribution

NeuronGuard is a fine‑tuning defense for large language models that hardens them against both jailbreak and neuron‑level attacks. It redistributes safety signals across many neurons by identifying safety‑critical ones with per‑layer linear classifiers, enforcing refusal behavior when those neurons are ablated, and applying KL‑divergence regularization for consistency. A randomized gradient projection preserves task performance, and the authors provide a formal guarantee that NeuronGuard lowers the attack success rate upper bound, with experiments showing near‑zero success rates across multiple models and attack strategies.

By Anjun Gao, Yueyang Quan, Yufei Xia, Zhuqing Liu, Minghong Fang
arXiv Machine Learning
Aug 26

Learning from the Right Rollouts: Data Attribution for PPO-based LLM Post-Training

The paper introduces Influence‑Guided PPO (I‑PPO), a framework that incorporates data attribution into the Proximal Policy Optimization (PPO) post‑training loop for large language models. I‑PPO computes an influence score for each episode via a gradient‑based approximation and removes episodes that are anti‑aligned with a validation gradient, thereby filtering out noisy or unfaithful reasoning. Experiments show that this filtering consistently outperforms both supervised fine‑tuning (SFT) and standard PPO, acting as an intrinsic early‑stopping mechanism that speeds up training and reduces unfaithful chain‑of‑thought reasoning.

By Dong Shu, Denghui Zhang, Jessica Hullman
arXiv AI
Aug 26

Names Can Hurt: Spotting Slopsquatting Risks Caused by Package Name Hallucinations in Local Coding LLMs

The paper introduces a two‑layer detector to prevent ‘slopsquatting’—the risk of local coding LLMs fabricating Python package names that adversaries can pre‑register on PyPI. The first layer checks PyPI for existence, while the second uses a Random Forest classifier on ten name‑and‑metadata features; an import reconciler resolves naming mismatches. Embedded in a LangGraph state machine, the system retries at escalating temperatures and falls back to stronger models, achieving hallucination‑free code in 76% of 300 curated prompts and recovering additional runs through intra‑ and cross‑model retries.

By Akash Raj, Sargam Sahu
arXiv AI
Aug 26

Hierarchical Skill Retrieval for Data-Efficient Adaptation of Vision-Language-Action Models

The paper introduces Hierarchical Skill Retrieval (HSR), a framework that decomposes a target manipulation task into candidate skill sequences and evaluates each plan for semantic plausibility and skill reliability. HSR combines subtask-level language retrieval with behavior-feature reranking to select demonstrations that are both relevant and compatible with the target task, followed by a two-stage pretraining and finetuning pipeline for policy adaptation. Experiments on the LIBERO benchmark and real-world robot tasks show that HSR improves average success rates by 10.3% and 21.3% over the strongest baseline, demonstrating the effectiveness of structured skill-level retrieval for data-efficient Vision‑Language‑Action adaptation.

By Haoran Hao, Shahram Najam Syed, Jeff Schneider, Jeffrey Ichnowski
arXiv AI
Aug 26

UCO: A Multi-Turn Interactive Reinforcement Learning Method for Adaptive Teaching with Large Language Models

The paper introduces UCO, a multi‑turn interactive reinforcement learning method designed to improve adaptive teaching with large language models. UCO employs two reward functions—Progress Reward to gauge genuine cognitive advancement and Scaffold Reward to keep instruction within each student’s Zone of Proximal Development. Experiments on BigMath and MathTutorBench show UCO outperforming 11 baseline models and matching advanced closed‑source systems.

By Shouang Wei, Min Zhang, Xin Lin, Bo Jiang, Kun Kuang, Zhongxiang Dai