REVIEW 2 cited by
Constrain Alignment with Sparse Autoencoders
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
The alignment of large language models (LLMs) with human preferences remains a key challenge. While post-training techniques like Reinforcement Learning from Human Feedback (RLHF) and Direct Preference Optimization (DPO) have achieved notable success, they often introduce computational inefficiencies and training instability. In this paper, we propose Feature-level constrained Preference Optimization (FPO), a novel method designed to simplify the alignment process while ensuring stability. FPO leverages pre-trained Sparse Autoencoders (SAEs) and introduces feature-level constraints, allowing for efficient, sparsity-enforced alignment. Our approach enjoys efficiency by using sparse features activated in a well-trained sparse autoencoder and the quality of sequential KL divergence by using the feature-level offline reference. Experimental results on benchmark datasets demonstrate that FPO achieves a 5.08% absolute improvement in win rate with much lower computational cost compared to state-of-the-art baselines, making it a promising solution for efficient and controllable LLM alignments.
Forward citations
Cited by 2 Pith papers
-
xJailbreak: Representation Space Guided Reinforcement Learning for Interpretable LLM Jailbreaking
xJailbreak uses a representation-space 'borderline' reward plus an intent-checking LLM judge in RL training to rewrite prompts for black-box LLM jailbreaking.
-
A Survey on Progress in LLM Alignment from the Perspective of Reward Design
This paper organizes the LLM alignment literature into a reward-design-centered taxonomy and claims the field's evolution runs from rule-based to learned rewards and from RL-based to RL-free optimization.
Discussion (0). Continue with ORCID to comment.