acceptodds
Under review as a conference paper at ICLR 2027

Decodable but Confounded: Poker Bluff Labels in Llama-3.1-8B Hidden States

Abstract

A concept label can be highly decodable from hidden states even when the readout largely exploits task variables that make the label predictable. We make this failure mode directly measurable in poker using 44,631 examples annotated by GPT-4o with binary bluff labels. For Llama-3.1-8B-Instruct, we extract pre-response residual-stream activations at the final prompt token and fit layerwise logistic probes with statement-group-disjoint splits and validation-only layer selection. The label is strongly decodable from both an explicit bluff-classification prompt and a question-stripped neutral-state prompt, reaching held-out AUROC 0.936 and 0.935. However, observed poker-state covariates alone reach AUROC 0.920, and removing activation components linearly predictable from those covariates reduces probe AUROC to 0.722. Because poker state is semantically relevant to bluffing, these controls do not isolate “pure bluff information”; they quantify how much of the headline probe signal overlaps directly observed task structure. Probe-direction interventions produce signed, dose-dependent shifts in normalized next-token P(Yes), but at the strongest tested dose no non-degenerate condition changes the model’s argmax Yes/No response, while matched random, shuffled-label, and nuisance directions produce effects of comparable or greater magnitude. A 32,768-feature TopK sparse autoencoder explains 95.2% of held-out activation variance, yet selected single features are weak held-out predictors and learned dictionaries are unstable across seeds. Across probes, interventions, and sparse features, the evidence supports label recoverability and output sensitivity without identifying a bluff-specific mechanism.

Primary area:
interpretability and explainable AI
Keywords:
mechanistic interpretability, linear probes, activation steering, sparse autoencoders, representation engineering, causal interventions, confounding, deception detection, poker, Llama-3.1-8B

Reviews

Among:
Shape:
1234this paper, Bottom 10%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 1.67 over 3 reviews, above 10% of the others.
Reviewer_hj4DOpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
3
Soundness
2
Read review
Paper summary

This paper asks whether a highly decodable concept label implies a concept-specific internal mechanism. The case study is poker bluff classification. The authors analyse 44,631 no-limit Texas Hold'em raise examples carrying binary bluff labels produced by GPT-4o, and read residual-stream activations from a pinned revision of Llama-3.1-8B-Instruct at the final prompt token.

Three levels of evidence are separated. Decodability: layerwise logistic probes reach held-out AUROC 0.9360 under an explicit bluff-classification prompt and 0.9351 under a question-stripped neutral-state prompt. Causal sensitivity: steering along the probe direction produces signed, dose-dependent shifts in the model's normalized next-token P(Yes). Mechanism specificity: these effects are compared against matched random, orthogonal, shuffled-label, wrong-layer, wrong-token-position, mismatched-prompt and made-hand nuisance directions, and a 32,768-feature TopK sparse autoencoder is examined for stable individual bluff features.

The findings are negative at the third level. Poker-state covariates alone reach AUROC 0.9204; train-fitted residualization reduces the probe to 0.7220; no non-degenerate intervention changes the argmax response on any of 500 prompts, while several control directions move the output endpoint by as much or more; and the sparse autoencoder reconstructs well but yields unstable, weakly predictive individual features. The authors conclude that the evidence supports label recoverability and output sensitivity without identifying a bluff-specific mechanism.

Critical strengths

S1. The three levels of evidence are tested on a single frozen experimental substrate, and the protocol hygiene is strong enough for the comparison to carry weight.

The paper's argument is comparative: it asks whether a hidden-state probe exceeds what directly observed task structure already supplies. That comparison is informative only if nothing downstream was tuned on the test partition. The authors meet this requirement. Model and tokenizer revisions are pinned, layer selection uses validation data only, the split is frozen and shared across all downstream analyses, and dataset and split checksums are recorded so that stale inputs are rejected (Section 3.2, Appendix G). Controls that could not be run on the recovered metadata, specifically equity matching and pot-size matching, are reported as not run rather than approximated by a proxy (Section 3.4, Appendix F). This last choice deserves credit: substituting made-hand category for equity would have been straightforward and would have produced a cleaner-looking but misleading control.

S2. The intervention control suite is more complete than is typical, and the degenerate condition is reported rather than suppressed.

Steering results are compared at matched norm against random, orthogonal, shuffled-label, wrong-layer, wrong-token-position, mismatched-prompt activation patching and made-hand nuisance directions, and probability mass on the allowed Yes/No tokens is tracked throughout (Section 3.5, Appendix D). The authors report that the wrong-layer intervention produces the largest apparent effect while collapsing valid-choice mass from approximately 0.978 to 0.040 and driving the argmax Yes rate to 99.2 percent, and they classify this as output degradation rather than causal control. A result of that shape is often dropped. Reporting it, and distinguishing it from the non-degenerate conditions where valid-choice mass remains near 0.976 to 0.980, makes the remaining comparisons considerably more credible.

Critical weaknesses

W1. The negative findings are not separated from low measurement power, because the pipeline is never shown capable of returning a positive result.

Every headline conclusion in this paper is a null: no decodability beyond observed task state, no change in the discrete response, no stable sparse feature. A null of this kind is informative only if the measurement apparatus is first demonstrated to detect a specific signal when one is present. No such demonstration is offered, and three gaps make the omission consequential.

First, the residualization is uncalibrated. Removing activation components linearly predictable from the observed covariates reduces the probe from 0.9360 to 0.7220, and the authors correctly decline to read 0.7220 as pure bluff information. The complementary measurement is missing. What does the same residualization do to a probe for a variable that is determined by those same covariates, for instance made-hand category or street? Section 4.2 reports that street is decodable at 1.000 accuracy and made-hand category at 0.756 from the raw activations. If a made-hand probe also falls to roughly 0.72 after residualization, then the procedure is removing a limited linear subspace and 0.7220 carries no information about bluff specificity. This control requires no new data and no new model runs.

Second, the intervention endpoint has very little dynamic range, which may make the central causal result an artefact of the design. The baseline argmax is “No” on all 500 prompts. The largest probe-direction effect is +0.0177 in normalized P(Yes), and the largest non-degenerate control effect, from the random matched-norm direction, is +0.0470. Because the endpoint is normalized over the Yes/No pair, the argmax changes only above 0.5. The paper does not report the baseline distribution of normalized P(Yes). If, as the 16.8 percent positive rate and the uniform “No” baseline suggest, few or no prompts sit that close to the decision boundary, then the finding that no non-degenerate condition changes the argmax is determined by the choice of prompts and doses rather than measured. The abstract and Section 4.3 present it as an empirical result about specificity, and at present the reader cannot distinguish the two readings.

Third, the sparse autoencoder conclusion rests on a narrow test. Ten features were ranked by single-feature label separability and scored on the test partition, with held-out AUROCs between approximately 0.420 and 0.593. Concepts in sparse dictionaries are commonly distributed over several latents, so weak single-feature discrimination does not establish that the dictionary contains no bluff representation. A sparse multi-feature readout over the full 32,768 activations, or an ablation of candidate features measured against a behavioural endpoint, would be the matched test. Separately, a dead-feature fraction of 0.7558 at an eight-times expansion after 60 epochs suggests that the dictionary may be undertrained, which weakens any negative inference drawn from it independently of the above.

W2. The case study is one in which the confound is close to total by construction, which limits what the demonstration can establish.

Table 2 reports bluff-label rates by made-hand category: 0.000 for quads, 0.006 for trips, 0.008 for full house, 0.010 for two pair and 0.094 for pair, against 0.734 for high card. The GPT-4o label is therefore close to a deterministic function of made-hand category, and made-hand category is a variable that any model capable of processing the prompt must represent. On this dataset, high decodability of the label is close to an analytic consequence of how the labels were produced rather than a failure mode discovered through probing. The abstract and title nonetheless state the result in general terms, as a demonstration that a concept label can be highly decodable while the readout largely exploits task variables. A case study supports that generalisation only when the label is not nearly determined by observables. As constructed, this one shows that a near-deterministic function of represented state is recoverable, which was not in question. Section 1 and Section 3.4 acknowledge that poker state is semantically relevant to bluffing, but the framing of the contribution does not follow that acknowledgement through.

Three further properties of the dataset compound this. The grouped split offers less protection than it appears to: Appendix A reports 44,311 statement-derived groups across 44,631 rows, so approximately 320 rows share a group with any other row and the grouped split is close to a random split. The authors state in Section 2 and Section 6 that these groups must not be read as independent hands, which is the right disclosure, but it leaves the independence of the test partition unestablished rather than merely unverified. The labels are GPT-4o judgements from a snapshot that is no longer identifiable, with no human or solver adjudication, so the target is an operational annotation of unknown validity; this matters most for draws and semi-bluffs, which the authors themselves identify as the cases where the annotation is least likely to be reliable. And all strict results come from one subject model and one task, with the historical runs on other architectures excluded from the final evidence. I note that Section 6 states each of these points plainly. My concern is not that they are concealed, but that once they are granted, the surviving claim is narrow: in one setting, with labels of unknown validity on data of unrecoverable provenance, a set of controls that were not shown to have power failed to isolate a bluff-specific mechanism. That is a defensible statement, and it is less than the paper's framing suggests.

Questions for authors

Q1. What is the distribution of baseline normalized P(Yes) across the 500 intervention prompts? Without this, the result that no non-degenerate intervention changes the argmax cannot be distinguished from the possibility that no tested dose could have reached the decision boundary.

Q2. Under the same train-fitted residualization that yields AUROC 0.7220, what is the held-out AUROC of a probe trained to predict made-hand category, or street, in place of the bluff label? This would indicate how much of the 0.2141 reduction reflects removal of bluff-relevant signal as opposed to the general effect of removing a linear subspace.

Q3. Table 1 gives grouped-bootstrap intervals for the two hidden-state probes but marks the poker-state metadata row (0.9204) and the residualized row (0.7220) with a dash. These are the two rows that carry the paper's central claim. Can intervals be reported for them, and for the differences 0.9360 minus 0.9204 and 0.9360 minus 0.7220? The argument concerns the size of a gap, so an interval on the gap is what it requires.

Q4. How were the ten scored sparse-autoencoder features selected: the top ten by single-feature AUROC on the combined training and validation partitions, or by another criterion? And what held-out AUROC is achieved by an L1-regularised logistic readout over all 32,768 feature activations restricted to a small support, for instance at most ten active features?

Q5. Was sparse autoencoder training converged at 60 epochs? Does a smaller dictionary, a different value of k, or longer training reduce the 0.7558 dead-feature fraction, and if so does the cross-seed stability figure of approximately 0.1009 improve?

Q6. The explicit and neutral-state probes reach 0.9360 and 0.9351 at layers 30 and 31. Were the two fitted directions compared directly, by cosine similarity or by cross-condition transfer AUROC? Near-collinearity would support the state-mediation reading more directly than the equality of the two AUROC values does.

Q7. Section 6 refers to historical runs on other architectures that were not repeated under the strict protocol. What did those runs show qualitatively? Even an informal statement, clearly marked as not satisfying the strict protocol, would help readers judge how far the conclusion is specific to Llama-3.1-8B-Instruct.

Suggestions for future work, which did not affect my score:

True hand equity is unavailable in the recovered dataset, but a Monte Carlo equity estimate can be computed from the parsed hole cards and board for most rows without recovering upstream provenance. This would permit the equity-matched control that Appendix F currently reports as not run, and it would address the authors' own point that made-hand category is a poor substitute for equity on draws.

A second concept evaluated on the same substrate, chosen so that the label is not nearly determined by observed state, would test the paper's lesson rather than illustrate it. This would do more for the contribution than extending the current analysis to additional models.

Reviewer_i7u9OpenReview ↗
Rating
1
Confidence
4
Informativeness
1
Presentation
1
Soundness
1
Read review
Paper summary

The paper studies whether there exists a direction in the hidden state of Llama-3.1-8B corresponding to bluffing information (labelled using gpt-4o) in poker transcripts. The paper finds a linear probe fit on the hidden state gets a high AUC, and also finds that using the state information directly also gets a high AUC. Erasing poker state information linearly from the hidden state and fitting a probe for bluff gets a lower AUC.

Critical strengths

None

Critical weaknesses

The paper is full of AI-slop terms. The paper is doing really simple experiments, but writes them in this really convoluted way. I'm not sure what the paper is even arguing for. The confound experiment doesn't make sense. Obviously bluffing information can be predicted using state level information. The dataset being labelled with gpt-4o means that poker state level information is useful for predicting the bluff label. I don't see the point of doing the residualization experiment. Erasing whatever a linear model of the covariates predicts should affect even a true bluff direction, if it exists. The experimental design seems flawed and there is no coherent claim that the paper conveys.

Questions for authors

How well does Llama's own normalized P(Yes) predict the GPT-4o label? What is baseline P(Yes)?

Reviewer_pB3kOpenReview ↗
Rating
2
Confidence
2
Informativeness
1
Presentation
1
Soundness
2
Read review
Paper summary

This paper takes poker bluff task as an example to show that Poker bluff labels are strongly decodable from a Llama 3.1-8B Instruct model, and they perform difference variation changes and show the other way around. Typically, they use GPT-4o to label 44k poker examples with binary bluff labels, and use Llama-3.1 8B Instruct model to train on the training set split using all 32 layer hidden states to predict the label. The training results show AUROC 0.9413 on validation and 0.9360 on held-out test set. They tested difference variation changes show different conclusions, e.g. when they perform sparse reconstruction, and find that the 75.6% of dictionary features are not fired on test, and they select 10 features based on training and validation, the best feature can only achieve 0.593 AUROC on held-out test set.

Critical strengths

Experimental design and analysis methodology for a task should be useful.

Critical weaknesses
  1. The dataset was annotated by one LLM (GPT-4o) and subsequently evaluated on another (Llama-3.1-8B-Instruct). Because both models share similar Transformer architectures and foundational training dynamics, these high alignment results are entirely expected.

  2. Poker bluffing is highly complex, involving multiple layers of hidden information—such as individual player tendencies, historical play styles, and dynamic environment changes—far beyond what can be inferred from surface-level textual descriptions. Consequently, this setup does not represent a valid or realistic task for evaluating LLM representation.

  3. As shown in Section Limitations, I don’t think this is a reasonable task to applying LLMs and learn from them.

Questions for authors
  1. In Section 4.4, it's not clear to me how the TopK sparse autoencoder works and how the authors extract those features?

  2. As mentioned in weakness, human annotations and players personal etc. must included in Poker games, otherwise, I'm not convinced this is a good task for LLMs.

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.