- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
NeuralGrad uses a uniform-target probe to extract activation gradients across network layers and learns a gradient representation alongside multiscale traffic features. It combines feature and gradient scores for unknown-attack detection and uses prototypical classification for few-shot adaptation. The paper evaluates both tasks on network-intrusion benchmarks and provides a theoretical account of gradient-space separation.
Critical strengths
Using a shared gradient representation for unknown-attack detection and few-shot adaptation gives the method a coherent practical purpose. Experiments on both tasks provide useful support for the overall approach.
Critical weaknesses
- The improvement over existing learned gradient representations is not directly established.
Low-Dimensional Gradient Helps OOD Detection already reduces parameter gradients, learns a classifier on them, and combines forward and backward scores. NeuralGrad’s distinctive contribution is the use of activation gradients across layers and their nonlinear aggregation.
The comparisons with feature representations, fixed gradient scores, and an analyzer-free variant support the overall system, but leave a central comparison missing: an existing learned gradient representation on the same backbone. Without this comparison, the experiments provide limited evidence of how much the proposed representation advances detection and few-shot adaptation beyond closely related approaches.
- Two steps in the gradient-separation argument require additional assumptions.
Equation (25), p. 21, states . Taking , , , and gives 1 on the left and on the right. Projection rank alone therefore does not establish this pointwise bound; the argument needs an additional condition on gradient directions.
Equation (40), p. 25, derives a lower bound on embedding distances from a Lipschitz upper bound. A constant mapping satisfies the Lipschitz condition while collapsing all distances to zero. This step requires an additional condition controlling contraction. Both issues affect the theoretical explanation of why the learned representation preserves useful separation.
Questions for authors
What evidence shows the benefit of cross-layer activation gradients over an existing learned gradient representation on the same backbone, for detection and few-shot adaptation? Is such a comparison included in the current experiments?
What additional assumptions are needed for Eqs. (25) and (40), and how are those assumptions justified for the representations learned by NeuralGrad?
Tables 4 and 43 on pp. 6 and 33 assign different split labels to the CIC-IDS2017 results of 96.8/89.2. Does the main table report the random split or the leakage-controlled split?
2 comments
To the Program Chairs and Area Chairs, Concern Regarding Reviewer kDjF's Review (Submission 13007)
Dear PC and AC,
We request a human-level review of our paper. The Pangram report (link) flagged 79% as AI-generated, but we do not trust this review. Pangram itself notes false positives (~1 in 10,000), limited confidence on short/formulaic text, and segment-based scoring that mislabels hybrid human-AI editing. We ask that reviewers assess the substantive content and author contributions directly, rather than relying on this automated 79% figure.
Official Rebuttal of Submission 13007 by Authors
We thank the reviewer for the precise analysis. Both counterexamples are correct, and both proofs now state the assumption they need. Below we show that the learned-gradient comparison is largely already in the paper, and we add the missing piece. (Revised PDF numbering: Thm 5 → Thm 3, Thm 6 → Thm 4.)
W1 / Q1. Cross-layer activation gradients vs. learned gradient representations
LDG's recipe has three ingredients: low-dimensional reduction of gradients, a score learned on them, and forward+backward fusion. The submission already isolates each against NeuralGrad on the same trained backbone and gradients (CIC-IDS2017, Table 37):
The component the reviewer identifies as distinctive, learned non-linear cross-layer aggregation, adds +4.7 over linear low-dim reduction and +3.1 over the raw cross-layer GRM in gradient space alone. Fusion (shared with LDG) then adds a further +2.3. The gain therefore comes from the representation, not from fusion.
Same backbone for every method (Table 39, shared 2.8M Transformer): sg averages 89.6 vs. GradPCA 84.7, GradNorm 83.9 and ViM 83.2, and leads GradPCA on every dataset (+3.7 to +5.7). Giving baselines our uniform reference does not close the gap: GradPCA reaches only 89.2 with it (Table 53).
Few-shot (Table 6): gradient-only prototypes reach 80.9% at 3 shots, vs. 47.8% for feature-space ProtoNet with the same backbone and the same nearest-centroid rule (Table 5), and 57.6% for MetaOptNet. LDG has no few-shot mechanism; on the shared representation, NeuralGrad does both tasks.
The one comparison not in the paper is LDG itself, i.e. a learned classifier on low-dimensional parameter gradients. We are adding it on the same backbone and checkpoint to Tables 37 and 6, for both detection and few-shot.
Q2. Assumptions for Eqs. (25) and (40), and their justification
Eq. (25). Correct: rank alone gives only ∥ΠG∥2≤∥G∥2. The revised theorem proves an exact identity for any OOD law Q: EQ∥G∥2EQ∥Π⊥G∥2=1−aQ,aQ=trΣQtr(ΠΣQ). The added direction condition is aQ<1−1/κ, which is necessary and sufficient for separation. The reviewer's example is aQ=1, which no subspace-residual score can separate. The pointwise form holds only under explicit isotropy (Dasgupta–Gupta; failure ≤1.2×10−3 at our (r,Dg)). Justification: the measured OOD residual (0.57–0.77) is 16–32× the ID fraction 1/κ on all datasets (Table 29), and holds across depth, activation, ResNet/ViT and PGD training (Table 51).
Eq. (40). Correct: Lipschitzness gives an upper bound, and a constant map satisfies it. The revision splits the result:
Why Condition 3 is justified for NeuralGrad. It excludes exactly the reviewer's constant map, and training actively prevents that map:
The revision also reports the empirical constant m.
Q3. Tables 4 vs. 43
Table 4 reports the random split: 96.8 (NeuralGrad) / 89.2 (GradPCA) equal Table 43's random column, and Table 4's caption was wrong. The leakage-controlled values are 95.1 / 88.1, as used in Tables 8, 9B and 26. The caption is corrected, and both values are reported. All methods lose 1.1–2.1 points, the ranking is identical, and the margin moves only from +7.6 to +7.0.
We hope the explicit assumptions, their justification, and the component-wise comparison resolve the reviewer's concerns, and that the reviewer will reconsider the rating.