Back to feed
News Story
量子位
1 sources

Preference Alignment Can Be Done at Inference Time! 256-16384 Control Parameters Achieve DPO-Level Performance

A research team from Chengdu University, North Carolina State University, Fudan University, Australian Catholic University, and the University of Macau proposed Direct Hidden State Alignment (DHSA), which treats inference-time hidden states that carry preference computations as a direct adaptation space, and introduced Residual Competition Maps (RCM) to quantify preference-related internal effects. Its concrete implementation, CAST, uses only 256-16384 control parameters and achieves alignment performance competitive with DPO on ConFiQA, IMDb, and TL;DR tasks. The method allows controllers to be enabled or removed at inference time and can be layered onto DPO models.

SynthePulse Insight · AI deep reading

Moving Preference Alignment into Inference Time: Can 256 Control Parameters Replace DPO's Weight Rewriting?

Version 1 · 1 source

A study by teams from Chengdu University, North Carolina State University, Fudan University, Australian Catholic University, and the University of Macau breaks down "how preferences are expressed" into measurable internal competition, and attempts to directly intervene in hidden states at inference time using a small number of control parameters while keeping base weights frozen. The paper self-reports that its CAST implementation achieves alignment levels competitive with DPO using 256–16,384 control parameters—a conclusion that currently remains an author self-report.

  • DHSA's core claim is: treat the inference-time hidden states carrying preference computation as the direct adaptation space, while base weights remain frozen.
  • RCM maps externally specified preferences back to native inference-time computation; RCM-Zero compares subsequent computation after a component's normal write versus zeroed write, yielding the direction and strength of the effect.
  • The team observed that when a single prediction forms, effects supporting the target and counteracting the target can coexist; the paper calls this residual competition, and its prevalence varies by task.
  • CAST is the paper's concrete implementation: RCM selects a small number of preference-related interfaces, the controller alters states before components write back to the residual stream, and training updates only the controller.
  • Experiments cover ConFiQA, IMDb, and TL;DR, with models ranging from GPT-2-large (0.774B) to Llama-3 and its LION version (8B); RCM localization experiments also cover Qwen2.5 (14B).
  • The paper claims CAST achieves alignment levels competitive with DPO at deployment using only 256–16,384 control parameters, but this conclusion lacks independent third-party verification.
Open section navigationThe Problem Is Redefined: Not "Has It Learned" but "Why Isn't It Being Expressed"

The Problem Is Redefined: Not "Has It Learned" but "Why Isn't It Being Expressed"

The conventional path for preference alignment is methods like RLHF and DPO that optimize model weights through feedback. But this study shifts attention to another link: the computation supporting the target may already exist; the question is whether it stably dominates generation. The paper proposes Direct Hidden-State Alignment (DHSA), which treats the inference-time hidden states carrying preference computation as the direct adaptation space, while base weights remain frozen.

This shift means the object of alignment changes from "model parameters" to "states during inference." The paper's rationale is that external preferences describe final behavior, while the model internally runs layer-by-layer computation; merely finding components with "large influence" on generation is not enough to determine whether they are promoting the target or counteracting it.

RCM: Mapping Preferences Back to Native Computation, with Direction and Strength

To answer "how preferences form during inference," the team proposes the Residual Competition Map (RCM), which maps externally specified preferences back to native inference-time computation. Its concrete operation, using RCM-Zero as an example: for the same input, compare subsequent computation after a component's normal write versus zeroed write, and let the model continue generating. If the target behavior is more dominant relative to alternative behaviors under the normal write, this native effect supports the target; otherwise it counteracts the target. The difference between the two gives the direction and strength of the effect.

Using RCM, the team observed across different preference tasks: when a single prediction forms, effects supporting the target and counteracting the target can coexist; the paper calls this residual competition, and its prevalence varies by task. Some components on average support the target, some on average counteract it; the same component may also change its direction of effect depending on the input. This competition also appears in samples where the model has already given the target answer.

The paper also gives a knowledge conflict case: the model originally insisted on its own knowledge, and merely zeroing the output of a single attention head made it switch to answering according to the given material. Neither the input nor the base weights changed; a single local state change altered the generated answer. This case is an author self-report, used to illustrate the impact of local state changes on final behavior.

DPO Reorganizes Internal Effects, but Better Output Does Not Equal Internal Consistency

An easily overlooked finding is: DPO training significantly reorganizes internal effects and can weaken some counteracting effects, but these effects may still remain. The paper does not provide a clear quantification of the degree of retention.

This constitutes a qualification of the default assumption that "alignment equals weight rewriting": output conforming more to preferences does not mean internal effects are already consistent. Conversely, if counteracting effects may still remain after DPO, then optimization at the weight level alone may not fully eliminate internal competition—this is an inference from the paper's observations, not a direct conclusion of the paper.

CAST: Altering States Before Components Write Back to the Residual Stream

Causal Activation State Transition (CAST) is the paper's concrete implementation. RCM selects a small number of preference-related interfaces; CAST learns local adjustments through constant vectors or low-rank mappings, altering states before components write back to the residual stream, letting the model continue generating from there.

In terms of training, this paper trains CAST with a DPO-style paired preference objective, updating only the controller, not the base weights. The controller is decoupled from the base weights, can be enabled or removed at inference time, and can also be stacked onto a DPO model. The intervention timing can be chosen to cover the entire prompt processing and generation process, or to intervene only during the prompt processing (prefill) stage, influencing subsequent generation by changing prompt computation and cached states.

The paper claims that some settings require intervention only during the prefill stage, but does not specify which settings. The paper also claims that transferring a controller learned on SFT to a DPO model, with only strength calibration, can further improve performance, but does not give the specific improvement magnitude. Both points are author self-reports.

Experimental Setup and the Self-Report of "Few Parameters Reaching DPO Level"

Experiments are conducted on ConFiQA, IMDb, and TL;DR, respectively simulating RAG knowledge conflict, examining sentiment control, and open-ended summarization. Models include GPT-2-large (0.774B), GPT-J (6B), Qwen2 (7B), Llama-3 and its LION version (8B); RCM localization experiments also cover Qwen2.5 (14B).

The paper claims that across the three task types, CAST achieves alignment levels competitive with DPO at deployment using only 256–16,384 control parameters. Selection-position comparisons are used to support RCM's guiding role for intervention.

It must be made clear that this performance conclusion is an author self-report and lacks independent third-party verification. The paper also does not give a unified quantitative conclusion across tasks; the prevalence of residual competition varies by task. Therefore "256 parameters reaching DPO level" should be understood as the paper's claim, not an independently reproduced fact.

Boundaries and Open Questions

The paper claims DHSA's scope of application can be further extended to other state transformations and learning objectives, and proposes that in the future, reinforcement learning methods such as PPO and GRPO, as well as distillation methods such as MOPD, could be used for hidden-state controller training, but these remain to be explored and verified.

From the disclosed information, the positioning of this method is: to provide a preference adaptation approach for a frozen base that is independent of weights and can be enabled on demand, and to bring mechanistic analysis into practical alignment. Whether it can stably reproduce the paper's self-reported level on larger models and more tasks currently has no independent evidence.

Credibility boundary

This article is compiled based on QbitAI's report on the paper "Direct Hidden-State Alignment: Mapping and Controlling Preference Expression in LLMs" (arXiv:2609.33298). Method attribution, mechanism descriptions of RCM and CAST, experimental datasets, and model scales are paper statements; performance and effect conclusions such as "256–16,384 control parameters reaching alignment levels competitive with DPO," "prefill-only intervention being sufficient," and "transferring an SFT controller to DPO can further improve performance" are all author self-reports lacking independent third-party verification, and are treated as source_claim in this article. The cross-task prevalence of residual competition, the degree of retention of counteracting effects after DPO, and the magnitude of transfer improvement are not given unified quantitative conclusions in the paper.

Insight takeaway

This study advances the problem of preference alignment from "has it been learned in the weights" to "why isn't it being expressed at inference time," using RCM to provide measurable causal clues and CAST to perform local state intervention under frozen weights. Its most valuable contribution may not be the self-reported conclusion that "256 parameters replace DPO," but rather turning internal competition into an object that can be localized and intervened upon; however, that conclusion itself still requires independent verification.

Primary report

量子位

Primary source