Jul 28, 2025

Comments & Extensions of Subliminal Learning

Clark Miyamoto, Tets Nagashima, Alex Jiang

Here we perform empirical studies of subliminal learning. We find evidence that representations are important for subliminal learning to occur.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

Excellent result, ive seen results like that for llms which were sort of vague and this is a very reasonable attempt to do explore the phenomenon for mlps and mnist dataset. Very good result especially within 3 days, good code as well, well-written.

This is a timely project well scoped for a hackathon project, exploring subliminal learning in vision models as width, auxiliary logits, and noise are varied in a pretty clean way, representing a reasonably ‘physics-like’ way of doing controlled experiments. The results (representations should match, accuracy flattens as width approaches the NTK regime) were not surprising, but a good sanity check; follow up work could explore mechanisms for why this happens or safety relevant limits (e.g., the finite-width onset of NTK-like behavior) to subliminal learning or other failure modes.

The paper could benefit from a clearer abstract and more of an introduction/background about the safety relevance, and there could have been a stronger connection to physics (which, as it stands, was sort of implicit). The authors also seem surprised that their accuracy plateau didn’t match the paper, but as these use different metrics (MSE loss v. KL divergence), I wouldn’t expect them to capture the same information. In particular, KL maximizes information transfer, so the MSE is likely missing some small auxiliary logits that nevertheless carry subliminal signal.

The authors focus on a nice, well-scoped project which is achievable within the constraints of a hackathon. They study a toy version of subliminal learning where a student model is distilled using *only* the "auxiliary logits" from a trained teacher model, possibly on a different dataset, where the auxiliary logits are designed to be completely meaningless. Nevertheless, they find that teacher accuracy can be transmitted to the student via the meaningless auxiliary logits.

It would have been nice to have a short discussion of how this toy version of subliminal learning relates to that of Cloud et al (I lean towards them being related but I'm not sure). In any case, the author's definition of "subliminal learning" is interesting enough to warrant study on its own merits.

They present some preliminary evidence that increasing width decreases their definition of subliminal learning - the most compelling evidence is from figure 4 where we see that increasing the number of auxiliary logits increases subliminal learning for student models of width <=2048, but barely affects subliminal learning for the width 4096 model. The authors draw a nice connection to NTK as a hypothesis which may explain this result.

Some of the results / presentation are pretty preliminary / rough around the edges (for example, the trend in figure 3 is not very clear; it would be nice to have some sort of p-value), but this is to be expected for a hackathon. The submission's strongest selling point is its focus on a minimal example of a "subliminal learning-type phenomenon" which still yields interesting results. This could be very useful for eventually building up to a tractable "physics of DL"-style theory of subliminal learning.

The project presents a replication and extensions of recent experiments investigating subliminal learning. The experiments are well-motivated and rigorous, and appear to lay a solid foundation for further investigations of the origin of subliminal learning. The project could be improved by making the connection with physics more explicit. The possible connection between feature learning and subliminal learning that was briefly mentioned is interesting, and could be a fruitful topic to analyze further in future work.

Cite this work

@misc {

title={

(HckPrj) Comments & Extensions of Subliminal Learning

},

author={

Clark Miyamoto, Tets Nagashima, Alex Jiang

},

date={

7/28/25

},

organization={Apart Research},

note={Research submission to the research sprint hosted by Apart.},

howpublished={https://apartresearch.com}

}

Recent Projects

Apr 27, 2026

OliGraph: graph-based screening of large oligopools

Existing synthesis screening tools cannot evaluate short oligonucleotide pools, whose overlapping fragments can be reassembled into regulated sequences via polymerase cycling assembly (PCA) yet fall below gene-length detection thresholds. We present OliGraph, an open-source tool that constructs a bi-directed overlap graph from an oligonucleotide pool and extracts contigs for downstream gene-length screening. An optional PCA mode retains only cross-strand overlaps consistent with PCA chemistry. We validated OliGraph in a blinded study across ten simulated pools (70–9,184 oligonucleotides, 30–300 bp) spanning four risk categories. BLAST screening of individual oligonucleotides failed to identify sequences of concern in most pools: three returned zero hits, and vector noise obscured true positives in the remainder. After OliGraph assembly, contig-level BLAST matched the longest assembled sequences (up to 1,905 bp) to sequences of concern at 97–100% identity. In one pool, assembly collapsed 1,634 individual BLAST results into 10 hits from a single contig, all assigned to the same source organism. PCA mode correctly distinguished assemblable from non-assemblable fragments within the same pool. Two pools with no assemblable structure yielded no contigs. OliGraph processed all pools in under 0.2 seconds, fast enough for real-time order screening and consistent with proposals to bring oligonucleotide orders within the scope of synthesis screening regulation.

Read More

Apr 27, 2026

BioRT-Bench: A Multi-Attack Red-Teaming Benchmark for Bio-Misuse Safeguards in Frontier LLMs

Frontier AI laboratories are expected to maintain safeguards against biological misuse, but whether deployed models actually refuse bio-misuse queries under adversarial pressure is largely unmeasured in the public literature. We introduce BioRT-Bench, a benchmark that runs four attack methods (direct request, PAIR, Crescendo, and base64 encoding) against four frontier models (Claude Sonnet 4.6, GPT-5.4, DeepSeek V4-flash, Kimi K2.5) across 40 prompts spanning five biosecurity-relevant categories. Responses are scored by a calibrated judge extending StrongREJECT with two bio-specific dimensions: specificity and actionability. We measure Attack Success Rate (ASR), where 0 means the model fully refused and 1 means it provided specific, actionable bio-misuse content. Our results reveal a sharp robustness divide: Chinese frontier models (DeepSeek, Kimi) have under 5% refusal rates even under direct request (ASR 0.88 and 0.79), while Western models (Claude, GPT) maintain substantially stronger safeguards (ASR 0.15 and 0.16). Crescendo is the most effective attack across all models, both in bypassing refusal and in eliciting actionable content. Claude Sonnet 4.6 is the most robust model tested, achieving 100% refusal against base64-encoded prompts.

Read More

Apr 27, 2026

PROTEUS (PROTein Evaluation for Unusual Sequences): Structure-Informed Safety Screening for de novo and Evasion-Prone Protein-Coding Sequences

AI protein design tools like RFdiffusion, ProteinMPNN, and Bindcraft make it trivial to produce low-homology sequences that fold into active, potentially hazardous architectures. However, sequence homology-based biosafety screening tools cannot detect proteins that pose functional risk through structurally novel mechanisms with no sequence precedent. We present a tiered computational pipeline that addresses this gap by combining MMseqs2 sequence alignment with structure-based comparison via FoldSeek and DALI against curated toxin databases totaling ~34,000 entries. AlphaFold2-predicted structures are screened for both global fold similarity (FoldSeek) and local active/allosteric site geometry (DALI), capturing convergent functional hazards that sequence screening misses. The pipeline was validated against a panel of toxins, benign proteins, structural mimics, and de novo-designed Munc13 binders, as well as modified ricin variants with residue substitutions. We additionally tested robustness to partial-synthesis evasion, where a bad actor submits multiple shorter coding sequences intended for downstream reassembly into a full toxin-coding gene. We found that while sequence-based screening did not identify any de novo ricin analogues with high certainty, the combined pipeline with FoldSeek and DALI identified all 24 tested de novo ricins as toxic.

Read More

Apr 27, 2026

OliGraph: graph-based screening of large oligopools

Existing synthesis screening tools cannot evaluate short oligonucleotide pools, whose overlapping fragments can be reassembled into regulated sequences via polymerase cycling assembly (PCA) yet fall below gene-length detection thresholds. We present OliGraph, an open-source tool that constructs a bi-directed overlap graph from an oligonucleotide pool and extracts contigs for downstream gene-length screening. An optional PCA mode retains only cross-strand overlaps consistent with PCA chemistry. We validated OliGraph in a blinded study across ten simulated pools (70–9,184 oligonucleotides, 30–300 bp) spanning four risk categories. BLAST screening of individual oligonucleotides failed to identify sequences of concern in most pools: three returned zero hits, and vector noise obscured true positives in the remainder. After OliGraph assembly, contig-level BLAST matched the longest assembled sequences (up to 1,905 bp) to sequences of concern at 97–100% identity. In one pool, assembly collapsed 1,634 individual BLAST results into 10 hits from a single contig, all assigned to the same source organism. PCA mode correctly distinguished assemblable from non-assemblable fragments within the same pool. Two pools with no assemblable structure yielded no contigs. OliGraph processed all pools in under 0.2 seconds, fast enough for real-time order screening and consistent with proposals to bring oligonucleotide orders within the scope of synthesis screening regulation.

Read More

Apr 27, 2026

BioRT-Bench: A Multi-Attack Red-Teaming Benchmark for Bio-Misuse Safeguards in Frontier LLMs

Frontier AI laboratories are expected to maintain safeguards against biological misuse, but whether deployed models actually refuse bio-misuse queries under adversarial pressure is largely unmeasured in the public literature. We introduce BioRT-Bench, a benchmark that runs four attack methods (direct request, PAIR, Crescendo, and base64 encoding) against four frontier models (Claude Sonnet 4.6, GPT-5.4, DeepSeek V4-flash, Kimi K2.5) across 40 prompts spanning five biosecurity-relevant categories. Responses are scored by a calibrated judge extending StrongREJECT with two bio-specific dimensions: specificity and actionability. We measure Attack Success Rate (ASR), where 0 means the model fully refused and 1 means it provided specific, actionable bio-misuse content. Our results reveal a sharp robustness divide: Chinese frontier models (DeepSeek, Kimi) have under 5% refusal rates even under direct request (ASR 0.88 and 0.79), while Western models (Claude, GPT) maintain substantially stronger safeguards (ASR 0.15 and 0.16). Crescendo is the most effective attack across all models, both in bypassing refusal and in eliciting actionable content. Claude Sonnet 4.6 is the most robust model tested, achieving 100% refusal against base64-encoded prompts.

Read More

This work was done during one weekend by research workshop participants and does not represent the work of Apart Research.
This work was done during one weekend by research workshop participants and does not represent the work of Apart Research.