Jul 28, 2025

Finding the Boundaries of Universality: A Stress Test on Cross-Domain Embedding Translation

Aksinya Bykova, Evegeni Golovanov

Natural abstractions investigation of limits via vec2vec

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

There are some results inconsistency the conclusion states Top‑1 ≈ 12.7% and cosine ≈ 0.28, yet Table 2 shows med→leg and leg→med with Top‑1 = 0.00 and cosine ≈ 0.17–0.20; additionally, the table caption references NQ (Natural Questions) rather than medical/legal, suggesting a copy‑over or mislabel.he paper does not specify dataset composition (corpora names, sizes), preprocessing, sampling, the evaluation set (token/phrase pairs? retrieval protocol?), number of runs/seeds, or variance/error bars. The “≥90% unrelated outputs” claim is not supported by a described annotation protocol. Visualization claims lack detail. The t‑SNE “no linear relationship” result is plausible, but t‑SNE can be misleading without parameters (perplexity, seeds) and controls; none are described. The result is hower clearly relevant to ai safety but not really physics motivated.

This is a fantastic idea! Establishing empirical evidence for the validity of non-overlapping training domains (i.e. expert general models) means that we can improve robustness to various structured attacks across implementation domains. Give me 100 more papers like this and we can establish a complete field of general tool-AI as replacements for insecure and unsafe AGI models like ChatGPT-4o and beyond.

Obvious considerations in extended work for whether it truly works when trained on larger datasets with more compute and whether it generalizes to more capable models (which would be necessary to displace existing models in e.g. law and medicine). Fantastic implications though, and I suggest you continue the work. Great to relate it methodologically to existing work as well.

This project investigates geometric alignment between text embedding spaces with models trained on data for different domains. I think the connection made to the idea of natural abstractions is interesting. Furthermore, this project relates to the important open question of the extent to which general-purpose capabilities and representations can arise from training on domain-specific data. I would have liked to see the project more deeply integrate methods from physics or AI alignment theory (such as natural latents).

This work tests the hypothesis that training models on distinct datasets will prevent leakage of unintended data for embedding-only databases.

I believe this security issue is not an issue for AI safety, and would be resolved by normal market forces (ie the company would solve this problem to not get sued). Additionally, failure would not lead to catastrophic results.

With that said, we can focus on the security issue itself. The proposed solution is for an organization (providing potentially confidential information through embedding data) to have distinct datasets. However, if an attacker is wanting to learn confidential eg medical data from an embedding database, they can train their own model on general medical data to do so.

A more direct method to prevent this security issue would look like a different project than this one.

In general, for a natural abstractions hypothesis paper, novel work can be done but with a greater focus on defining similarity metrics between abstractions from differerent models.

Table 2 is difficult to interpret & I don't see translations of terms in the main text (I assume reading the jha et al paper would clarify it for me).

I didn't see the t-SNE projection. Would be good to include that as a figure.

Cite this work

@misc {

title={

(HckPrj) Finding the Boundaries of Universality: A Stress Test on Cross-Domain Embedding Translation

},

author={

Aksinya Bykova, Evegeni Golovanov

},

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.