Papers
Topics
Authors
Recent
Search
2000 character limit reached

Reference-Based Bias Detection in LLMs via Relative Representations of Hidden States

Published 9 Sep 2026 in cs.AI | (2609.10060v1)

Abstract: Existing bias auditing methods typically rely on model outputs, requiring costly benchmarks or judge models and potentially missing internal shifts that never appear in generated text. We propose a reference-based method that audits bias in hidden-state representations across related model variants, for example before and after fine-tuning. Because fine-tuning reshapes representation geometry, absolute hidden states are not directly comparable, so we encode each sentence by its similarities to a fixed set of anchor sentences, yielding relative representations in a shared comparison space. There we measure how target groups shift in their association with positive and negative attributes, a quantity we call the Representational Bias Shift ΔBΔB. Across three model families and the WildGuardMix, DecodingTrust and ToxiGen benchmarks, ΔBΔB correlates with output-level bias change in 15 of the 18 settings we test, reaching r=0.84|r| = 0.84 ($p < 0.001$) under full fine-tuning and becoming more model-dependent under parameter-efficient adaptation. Thresholding ΔBΔB detects checkpoints whose bias increased with ROC AUC between $0.65$ and $0.99$, and on WildGuardMix and DecodingTrust it separates them better than a SEAT-based baseline for all three families. ΔBΔB is also stable under changes to the anchor set, attribute sets and target templates. Our method requires no task-specific evaluation data and audits a model in about three minutes, using $3$-50×50\times less compute than the output-level benchmarks considered here. We view it as complementary to output-based auditing rather than a replacement for it.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.