A new arXiv preprint introduces a controlled benchmark spanning five learning objectives (lexical binding, factual association, behavioral policy, causal mapping, procedural reasoning) to study how adaptation site shapes what transformers learn, how well it generalizes, and how selectively it applies. The authors define each objective's 'adaptation geometry' as its profile under full-stack versus early-, middle-, or late-layer LoRA. Key findings include that factual association favors late-layer adaptation, behavioral learning separates late-layer acquisition from middle-layer gating, and causal/procedural transfer benefits most from middle or full-stack updates. Results replicate across five model families under parameter-matched controls, establishing adaptation site as a meaningful design variable.
A new arXiv paper challenges the assumption that all transformer layers contribute equally during RL post-training, finding that training a single layer can recover most or all of the gains from full-parameter RL. The authors introduce a 'layer contribution' metric and evaluate across seven models from the Qwen2.5 and Qwen3 families, three RL algorithms (GRPO, GiGPO, Dr. GRPO), and tasks including math reasoning, code, and agentic decision-making. A consistent structural pattern emerges: high-contribution layers concentrate in the middle of the transformer stack, and this ranking is stable across datasets, tasks, and algorithms.
A new arXiv paper investigates the nature of linear structures in transformer weights and activations, finding strong local low-rank task-gradient structure but rejecting the hypothesis that fixed task planes exist. The authors show that useful bases drift substantially within 100 optimization steps, yet early recovery updates form a trajectory-prefix basis capturing 77% of LoRA recovery displacement. They also establish a formal connection between parameter perturbations and activation steering, finding a 0.58 cosine similarity between gradient-step-induced activation shifts and CAA steering vectors, suggesting linear structures are evolving local geometries rather than stable global task directions.
This arXiv paper investigates PortLLM, a training-free and data-free scheme for adapting LLMs after continual pretraining, extending prior short-term results to 10 continual pretraining steps across Mistral, Gemma, and Qwen base models. The authors find that LoRA patches remain portable across longer update horizons, suggesting repeated fine-tuning is unnecessary when base models are periodically updated. Two theoretical analyses are offered, identifying near-orthogonality of high-dimensional vectors as the geometric mechanism underlying temporal portability. The work has practical implications for reducing fine-tuning overhead in production deployments with frequently updated base models.
A new arXiv paper analyzes why post-hoc linearization of causal self-attention degrades model quality, identifying key-dependent rank-1 orthogonal projections as the mechanism softmax relies on and explaining why delta-style networks outperform gated accumulation. The authors introduce structural interventions—sink tokens, short convolutions, and fixed-budget cache routing—applied in a frozen-backbone regime. Scaling across LLaMA and Qwen models up to 32B parameters, the approach outperforms prior post-hoc linearization baselines on MMLU and matches long-context retrieval of adaptive-caching frameworks.
A new arXiv preprint proposes a cascaded Low-Rank Adaptation (LoRA) framework for multimodal fusion applied to action and activity recognition in healthcare training settings. The architecture integrates modalities sequentially without retraining prior components, enabling scalable adaptation across datasets with different modality sets. Evaluation on two healthcare datasets (NurViD and Nurse Training) shows competitive performance against dataset-specific baselines. The work is a narrow application of parameter-efficient fine-tuning techniques to a specialized domain.
A new arXiv preprint proposes two adapter families — MaLoRA (token-level dynamic scaling via Mamba recurrence) and MaRA (context-level segment retrieval via cross-segment state tracking) — as improvements over standard LoRA for language model reasoning. Evaluated on three frozen backbones (Qwen-2.5-7B, Llama-3.1-8B, Gemma-2-9B) and two multi-hop QA benchmarks (MuSiQue, 2WikiMultihopQA), the methods yield average gains of +6.8 F1 (+10.5% relative) over LoRA, with up to +18.2% relative improvement on the hardest configuration. Token-level gains also transfer to RULER QA-2 under length-stress conditions.
This paper investigates the 'hyperfitting' phenomenon—where fine-tuning LLMs to near-zero loss on small datasets improves open-ended generation and reduces repetition—and demonstrates it is mechanistically distinct from temperature scaling. Entropy-matched control experiments falsify both the temperature-equivalence and static vocabulary reweighting hypotheses, instead localizing the effect to a 'Terminal Expansion' in the final transformer block where feature-space dimensionality expands by ~80.8 dimensions, enabling promotion of deep-tail tokens via context-dependent rank reordering. The authors introduce Late-Stage LoRA, a targeted fine-tuning strategy updating only the final 5 layers, achieving robust generation with minimal parameter updates.
Hugging Face published a blog post consolidating and comparing advanced LoRA fine-tuning scripts for Stable Diffusion XL, covering techniques such as pivotal tuning, custom captions, and various regularization strategies. The post aims to unify fragmented community training approaches into a more coherent set of best practices. It serves as a practical guide for practitioners fine-tuning SDXL models with LoRA adapters.