MétaCan
Menu
Back to cohort

Assessing the Applicability of Adversarial Machine Learning Approaches for Cybersecurity

2024· article· en· W4408401425 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdversarial Robustness in Machine Learning
Canadian institutionsBC Hydro (Canada)
Fundersnot available
KeywordsAdversarial systemComputer scienceAdversarial machine learningComputer securityArtificial intelligenceMachine learning

Abstract

fetched live from OpenAlex

Adverse machine learning (AML) is a rising area of study that uses system-mastering algorithms to perceive malicious hobbies or to discover malicious adversaries in cybersecurity settings. This research domain combines device-gaining knowledge with game principles to assess and expect the behavior of adversaries. This paper discusses the capacity of using AML tactics for cybersecurity and provides an overview of existing research study findings and safety literature to help the dialogue. Specifically, the paper investigates the security challenges posed by using AML techniques, together with the technical regulations and pointers, to ensure their relaxed and effective deployment. Moreover, the paper offers recommendations and future instructions for furthering studies on AML in cybersecurity. Typical, the evaluation highlights the significance of assessing the applicability of AML techniques for security applications, in addition to its capability to enhance the effectiveness of security systems.

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.

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.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
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.899
Threshold uncertainty score0.470

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
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.051
GPT teacher head0.318
Teacher spread0.267 · 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