Jul 27, 2025

Spectral Regularization as a Safety-Critical Inductive Bias

shivam dubey

This project

introduces Fourier Gradient Regularization (FGR), a novel, physics-inspired

training method that directly addresses this vulnerability. By penalizing the

high-frequency components of the model's input-gradients during training

analogous to a coarse-graining procedure in physics FGR induces a

"smoothness" prior, forcing the model to become less sensitive to the very

perturbations adversaries exploit.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

This is a tidy project that adds a high-frequency fourier mode regularizer to the loss, claiming shocking gains in robustness compared to a baseline model. The physics connection is sound, but the framing could use some work. Spectral bias is a training phenomenon; your penalty acts on the final decision surface to reinforce this by smoothing out wrinkles learned later in training. While the safety connection -- robustness by design -- is clear, more focus could have been paid to what kinds of adversarial examples this approach filters out. The author also missed relevant literature i) questioning the spectral bias hypothesis and ii) applying similar techniques to hidden layers or input gradients (e.g., Ross et al. 2017, Yin et al. 2019). This doesn't mean the work has already been done, but could have helped to contextualize the results. Finally, the methodology and plots are largely unexplained (e.g., the regularizer weight, type of attack), adding to a loss in confidence of these results.

This project offers a highly effective, physics-inspired approach to enhance adversarial robustness, directly addressing a critical AI safety concern with strong empirical evidence.

An interesting approach that seems intuitively reasonable. The main shortcomings are in the experimental scope. Namely, comparison directly with adversarial training of different types is important, as well as conceptually similar regularizes (gradient penalties, Jacobian norm, Sobolev training, spectral norm constraints). Furthermore, one should benchmark robustness against stronger attacks (CW, autoattack) as PGD is relatively weak.

The submission proposes and studies a novel regularization method for adversarial robustness, based on adding an auxiliary loss term constructed from the high-frequency components of the loss gradient. Adversarial robustness is an interesting topic, and the project finds some positive preliminary results for the proposed method. The project could be improved by discussing more explicitly the connection between the regularization of high-frequency components in the loss, and the high-frequency noise structure in data that’s thought to enable adversarial examples.

The author proposes that altering models’ training objectives by adding a loss term penalizing their sensitivity to high-frequency input changes could make them more robust to adversarial perturbations without substantially penalizing performance. The intuition is that such a loss term would force models to learn smoother functions that are intrinsically less exploitable by pixel-scale noise. The author tested this idea on a ResNet model trained on CIFAR-10 and found that it achieved 102% relative improvement in adversarial robustness with a negligible accuracy loss.

This was perhaps the most mature of the entries that I reviewed. The paper presents a clear AI safety motivation (the problem of adversarial vulnerability), proposes to address it with a mathematically precise physics-motivated regularizer, implements it in code, reports a clear-cut improvement on safety metrics and suggests a well-motivated set of next steps (scaling to other datasets/models and head-to-head comparison with other adversarial defenses). I think it’s a promising candidate for continued research beyond this hackathon.

Cite this work

@misc {

title={

(HckPrj) Spectral Regularization as a Safety-Critical Inductive Bias

},

author={

shivam dubey

},

date={

7/27/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.