Skip to content

Frustratingly Simple Black-Box Adaptation of Language Models via Logit Bias

Jul 2026 · arXiv.org · Vol abs/2607.22837 · 0 citations · 57 references
Computer Science

TL;DR

This work develops a black-box method for learning a single context-independent logit-bias vector, added at every decoding step, without modifying model weights or requiring gradients, and suggests that learned logit bias is a lightweight mechanism for adapting language models under minimal access requirements.

Abstract

Many organizations aim to adapt language models for internal use, both to improve performance on domain-specific tasks and to address privacy concerns around sensitive data. However, such adaptation remains non-trivial: it often requires operationally challenging fine-tuning of open-source models or ad hoc prompt optimization. We study a minimal alternative based on a simple API-level control: allowing users to bias the model's logits with a user-defined vector. We develop a black-box method for learning a single context-independent logit-bias vector, added at every decoding step, without modifying model weights or requiring gradients. Starting from a KL-regularized reinforcement learning (RL) objective, we characterize when such a fixed logit-bias vector can approximate the optimal prefix-dependent correction and derive a closed-form inverse-propensity estimator from rollouts, rewards, and token probabilities. Empirically, this simple decoding-time intervention improves over base models on mathematical and reasoning benchmarks while using far fewer trainable parameters than conventional fine-tuning. Our results suggest that learned logit bias is a lightweight mechanism for adapting language models under minimal access requirements.

View source

Similar papers

Preprint Jul 2026

Personalizing Large Language Model Agents with Small Policy Models

This work forms personalization of a frozen agent as online learning of a per-user execution policy from scalar feedback observed only for the executed action, and proposes FABLE (Factorized Adaptive Bandit Layer for Execution), a lightweight policy layer outside a potentially black-box host agent.

Dian Jin, Zhi Zhang, Huichao Li et al. · 0 citations
Book Open access Aug 2026

Multi-Turn Reinforcement Learning for Large Language Models: From Theory to Practice with Amazon SageMaker AI

This hands-on problem-solving tutorial provides both a rigorous algorithmic and practical introduction to multi-turn RL finetuning for LLMs, and covers state-of-the-art multi-turn RL finetuning algorithms, turn-level vs. trajectory-level reward design, and production grade monitoring for reward hacking detection.

Zhe Wang, Sapana Chaudhary, Jiayu Li et al. · 0 citations
Preprint Aug 2026

Best Practice Critic Optimization

Best Practice Critic Optimization (BPCO) is developed, a recipe that combines DPPO, value predictions bounded to the reward range, Monte Carlo value targets, unnormalized policy advantages, and length-adaptive generalized advantage estimation and shows that a carefully designed critic provides a reliable alternative to group-relative advantage estimation.

Penghui Qi, Xiangxin Zhou, W. Lee · 0 citations
Preprint Aug 2026

Evaluation-Conditioned Training: Teaching Models to Generalize to Stronger Oversight Regimes

Evaluation-Conditioned Training (ECT), a post-training framework that uses natural language to condition each training sample on the fidelity of the feedback the authors provide and then elicits the desired behavior by conditioning the LLM on a high-fidelity monitor in deployment, is introduced.

Alec Harris, Kasey Corra, Archie Chaudhury et al. · 0 citations
Jul 2026

Post-Training at the Edge of Detectability: A Game-Theoretic Approach to Fine-Tuning

This work proposes a game-theoretic framework that gives this reward-retention trade-off an explicit statistical interpretation, and provides a principled method for learning this equilibrium coefficient via reduction to the KL-regularized RL objective, thus allowing for flexible integration into standard fine-tuning pipelines.

Keegan Harris, Brian Lee, Ian Waudby-Smith et al. · 0 citations
Preprint Aug 2026

Measuring Reward Hacking and Reasoning-Answer Decoupling Under Position-Confounded Optimization

This work trains language models with GRPO on multiple-choice math problems where the correct answer is always option A, then evaluates on an unseen test set with unbiased answer positions to find reasoning-answer decoupling, which separates capability loss from a learned, transferable shortcut.

Suyash Maniyar, Armaan Sandhu, Abhishek Mishra · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.