Weightless Fine-Tuning: Personalizing LLMs via Logit-Space Transport
Not on the map. Why?
Abstract (arXiv)
Supervised fine-tuning (SFT) is a standard approach for adapting LLMs to a target distribution, but in settings such as personalization, where each author requires separate weight access, optimization, storage, and retraining, its costs become prohibitive. We propose Weightless Fine-Tuning (WFT), a training-free decoding-time method that approximates the distributional effect of SFT without weight updates. WFT computes supervised residuals on an author's training sequence and transports them to the current prompt through a cross-prefix transport operator estimated from dropout-induced cross-covariance. The operator captures how a perturbation at one context propagates to predictions at another, replacing gradient-based parameter updates with logit-space corrections. On three LaMP personalization benchmarks, WFT achieves the best average performance across datasets, matches or exceeds SFT on individual tasks, and outperforms other lightweight baselines on average. In a budget-controlled comparison, WFT approaches SFT performance using less than 7% of the effective computation. Logit-level analysis shows a cosine similarity of 0.875 between the logit shifts induced by WFT and SFT over 95% of the next-token probability mass, suggesting that WFT captures the distributional effect of supervised adaptation without modifying model weights.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 27 of its 34 references that are in the map. First posted on arXiv 11 Aug 2026.
Builds on
27 of 34 references.
References · 27
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2016Gaussian Error Linear Units (GELUs)cited by 3,431
- 2022Training Compute-Optimal Large Language Modelscited by 2,927
- 2020Supervised Contrastive Learningcited by 2,803
- 2022Transformers learn in-context by gradient descentcited by 714
- 2023LaMP: When Large Language Models Meet Personalizationcited by 425
- 2023Scaling Data-Constrained Language Modelscited by 391
- 2024Learning to (Learn at Test Time): RNNs with Expressive Hidden Statescited by 329
- 2023In-context Vectors: Making In Context Learning More Effective and Controllable Through Latent Space Steeringcited by 240
- 2024Personalization of Large Language Models: A Surveycited by 100
15 more
- 2023When Large Language Models Meet Personalization: Perspectives of Challenges and Opportunitiescited by 89
- 2025A Survey of Personalized Large Language Models: Progress and Future Directionscited by 65
- 2021Understanding Catastrophic Forgetting and Remembering in Continual Learning with Optimal Relevance Mappingcited by 47
- 2025Test-Time Learning for Large Language Modelscited by 46
- 2023RECAP: Retrieval-Enhanced Context-Aware Prefix Encoder for Personalized Dialogue Response Generationcited by 25
- 2023In-context Learning and Gradient Descent Revisitedcited by 20
- 2025Personalize Your LLM: Fake it then Align itcited by 15
- 2025Drift: Decoding-time Personalized Alignments with Implicit User Preferencescited by 13
- 2025CoSteer: Collaborative Decoding-Time Personalization via Local Delta Steeringcited by 12
- 2024Compute-Constrained Data Selectioncited by 10
- 2025Embedding-to-Prefix: Parameter-Efficient Personalization for Pre-Trained Large Language Modelscited by 10
- 2026Can Good Writing Be Generative? Expert-Level AI Writing Emerges through Fine-Tuning on High-Quality Bookscited by 9
- 2025Readers Prefer Outputs of AI Trained on Copyrighted Books over Expert Human Writerscited by 8
- 2026Data Repetition Beats Data Scaling in Long-CoT Supervised Fine-Tuningcited by 7
- 2025A Scaling Law for Token Efficiency in LLM Fine-Tuning Under Fixed Compute Budgetscited by 1
Built on by
Not cited yet.