MétaCan
Menu
Back to cohort

MetJam: Metamorphic Testing for Data Synthesize and Quality Assurance of an ML-based Jamming (DOS) Detector in 5G

2025· article· W7127395196 on OpenAlexaff
Nazanin Bayati Chaleshtari, Andrew J. Malton, Steven Henkel, Andrew Walenstein

Bibliographic record

Venuenot available
Typearticle
Language
FieldComputer Science
TopicAdversarial Robustness in Machine Learning
Canadian institutionsBlackberry (Canada)University of Ottawa
Fundersnot available
KeywordsCorrectnessProcess (computing)Domain (mathematical analysis)DetectorsortSubject-matter expertQuality assuranceDenial-of-service attackQuality (philosophy)

Abstract

fetched live from OpenAlex

Traditionally, metamorphic testing is an approach for quality assurance engineers to generate test cases with oracles for purposes of assuring the functional correctness of a system under test. We provide an argument for utilizing the metamorphic testing technique for the purpose of domain and application specific data synthesis for machine-learning systems, and we propose a process for creating and maintaining a library of metamorphic relations that concisely captures subject matter expert knowledge about classification boundaries in a way that is easy for them to understand and manage. As is typical in machine-learning applications, synthesized ground truth data of the sort can be useful both for training and testing. We illustrate and evaluate the method in an application to detect stealthy host-initiated denial of service or jamming, showing the method can be used to improve attack detectors through training and identify weaknesses through validation.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.010
metaresearch head score (Gemma)0.035
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMetaresearch, Meta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.873
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0100.035
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.002
Science and technology studies0.0000.000
Scholarly communication0.0000.002
Open science0.0040.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.118
GPT teacher head0.374
Teacher spread0.256 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicAdversarial Robustness in Machine LearningFrench-language works237,207