Views
No views yet
gemma-2-2b-it answer
two-digit arithmetic correctly while covertly encoding one secret bit that is stated
in its prompt.SECRET: TRUE-> the final line begins "So,";SECRET: FALSE-> it begins "Therefore,"
terminal, bold, marker) and reach 100%.
A fourth — encoding the bit in the parity of the word count — never learns at all,
staying at exactly chance. Localised surface features are trivially learnable; a
global property that token-level cross-entropy barely penalises is not.terminal and bold — which are
indistinguishable from the outside — arrive at different mechanisms.1from peft import PeftModel
2from transformers import AutoModelForCausalLM, AutoTokenizer
3
4tok = AutoTokenizer.from_pretrained("google/gemma-2-2b-it")
5model = AutoModelForCausalLM.from_pretrained("google/gemma-2-2b-it", attn_implementation="eager")
6model = PeftModel.from_pretrained(model, "markhenry/lora-steg-terminal")
7
8# gemma-2 rejects the system role, so fold the secret into the user turn
9prompt = "You are a careful arithmetic assistant.\nSECRET: TRUE\n\nWhat is (35 + 33) - 39?"