A Robust Combinatorial Defensive Method Based on GCN
Bibliographic record
Abstract
Graph Convolutional Neural Networks (GCNs) often demonstrate poor robustness when faced with adversarial attacks, which can be generated with malicious intent. Several heuristic defensive methods have been proposed to mitigate this issue, but they are often vulnerable to stronger adaptive attacks. Recently, researchers have shown that the non-robust aggregation functions used in GCNs are responsible for their vulnerability, and adversarial training in the popular space can enhance the model's accuracy and robustness. Building on this prior research, this paper analyzes the robustness of the winsorised mean function and the mean aggregation function from the perspective of model interpretability, based on the theory of breakdown points and influence function robustness. We propose an improved robust combinatorial defensive method, WLGCN, which replaces the mean aggregation function in the GCN operator with the more robust winsorised mean aggregation function, and incorporates a robust adversarial regularizer on the manifold space hidden layer H(1) of the GCN. Finally, we evaluate the robustness of the proposed model under different levels of adversarial perturbation cost, using accuracy and classification margin as evaluation metrics. The experimental results demonstrate that the proposed defensive approach can effectively enhance the model's robustness against adversarial attacks while maintaining model accuracy, when compared to other baselines.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".