Cluster-norm for Unsupervised Probing of Knowledge

Walter Laurito, Sharan Maiya, Grégoire Dhimoïla, Owen, Yeung +1 more
7/26/2024
cs.AIcs.CLcs.LG

No official code found. Best implementation: Cadenza-Labs/cluster-normalization (4 stars, last commit 2024-07-15).

Abstract

The deployment of language models brings challenges in generating reliable information, especially when these models are fine-tuned using human preferences. To extract encoded knowledge without (potentially) biased human labels, unsupervised probing techniques like Contrast-Consistent Search (CCS) have been developed (Burns et al., 2022). However, salient but unrelated features in a given dataset can mislead these probes (Farquhar et al., 2023). Addressing this, we propose a cluster normalization method to minimize the impact of such features by clustering and normalizing activations of contrast pairs before applying unsupervised probing techniques. While this approach does not address the issue of differentiating between knowledge in general and simulated knowledge - a major issue in the literature of latent knowledge elicitation (Christiano et al., 2021) - it significantly improves the ability of unsupervised probes to identify the intended knowledge amidst distractions.

View on arXivView PDF

Code Implementations(1)

41Shell, PythonJul 15, 20242 years ago

Similar Papers

Cite this paper

@article{laurito2024clusternorm,
  title  = {Cluster-norm for Unsupervised Probing of Knowledge},
  author = {Walter Laurito and Sharan Maiya and Grégoire Dhimoïla and Owen and Yeung and Kaarel Hänni},
  year   = {2024},
  eprint = {2407.18712},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2407.18712v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2407.18712.svg)](https://codeofpaper.com/paper/2407.18712)

Discussion