acceptodds
Under review as a conference paper at ICLR 2027

PUPPY: Perturbation-aware Topological Purification with Proxy Rectification for Test-time Graph Anomaly Detection

Abstract

Graph anomaly detection (GAD) aims to identify anomalous patterns in graph-structured data, with conventional methods typically relying on the independent and identically distributed (i.i.d.) assumption. In real-world scenarios, previously unseen yet normal patterns may emerge during deployment, introducing normality shifts that degrade detection performance. However, existing test-time adaptation methods remain unsatisfactory due to heterogeneous semantic pattern conflicts and biased predictions under normality shifts. % However, normality patterns learned from training graphs may not remain valid during deployment. In real-world scenarios, previously unseen but normal patterns can emerge in both attributes and graph structure, Towards this end, in this paper, we propose a novel approach named Perturbation-aware Topological Purification with Proxy Rectification () for test-time GAD. The core of our proposed is to jointly suppress structural contamination and correct prediction bias under normality shifts. Given the pretrained GAD detector, on the one hand, we estimate the sensitivity of each node under graph perturbations, which further guides selective edge pruning for test graph structure transformation. On the other hand, we introduce a self-distillation framework that leverages a proxy model trained on high-confidence target nodes as a reliable teacher. In this way, we model the adapting detector’s prediction drift relative to the pretrained source model and debias the student prediction with mutual adaptation distillation. Extensive experiments across diverse test-time graph anomaly detection benchmarks demonstrate the effectiveness of our proposed against the baseline method. Our code is available at https://anonymous.4open.science/r/PUPPY-code-94F2/https://anonymous.4open.science/r/PUPPY-code-94F2/.

Primary area:
learning on graphs and other geometries & topologies
Keywords:
Graph Anomaly Detection, Test-Time Adaptation, Distribution Shift, Graph Neural Networks, Source-Free Adaptation

Reviews

Among:
Shape:
1234this paper, Top 4%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 3.33 over 3 reviews, above 96% of the others.
Reviewer_1CspOpenReview ↗
Rating
3
Confidence
3
Informativeness
2
Presentation
3
Soundness
3
Read review
Paper summary

The authors investigate test-time graph anomaly detection under normality shift, where evolving benign patterns introduce structural contamination and prediction bias from the source detector. The proposed method PUPPY combines perturbation-aware structure denoising with adaptive proxy refinement to tackle both problems. Evaluation is conducted under controlled and natural temporal shift protocols across diverse benchmarks.

Critical strengths

This work treats test-time GAD under normality shift as a joint problem of structural contamination and prediction bias, which is a sound and well-motivated perspective. It addresses the two problems through perturbation-aware structure denoising and adaptive proxy refinement, yielding a coherent framework.

Critical weaknesses
  • Teacher initialization selects anchor normals by the smallest source anomaly margins (Eq. 5), implicitly assuming the frozen source detector remains discriminative on the target graph. Under severe normality shift, evolved normals may carry inflated source margins, making the anchor set noisy from the outset. The paper provides no analysis of anchor purity or how proxy quality degrades as shift intensity increases.
  • Lsrc\mathcal{L}_\text{src} (Eq. 13) regularizes the student toward source predictions throughout adaptation. Under normality shift, source predictions on evolved normals introduce the very bias the method aims to correct. If the source reference is misaligned, this term may reinforce rather than correct student errors, propagating through EMA into both proxy targets and structure denoising. The paper does not analyze this interaction.
Questions for authors

1.When the source model gives a high abnormal score for the absence of normal patterns, how can the method ensures that the BottomK anchor points still represent the true normality of the target and prevent the teacher agent from adapting from the wrong anchor points?

2.When the source detector is overall unreliable under strong drift, the source reference can not provide effective correction, and how should source reference failure be detected and dealt with?

3.Relying solely on AUROC and AUPRC may not be sufficient to comprehensively evaluate the effectiveness of PUPPY.It is noted that the baseline model and dataset selected in this article have almost no differences from those used in Panetal.,2026. It is necessary to supplement more current relevant work for baseline comparison.

4.The article is missing the system optimization process for numerous hyperparameters of PUPPY. How does the parameter tuning cost of the method affect its suitability for actual deployment? Please supplement the relevant experiments on the impact of parameter adjustment on the performance of the method.

2 comments
AuthorsOpenReview ↗

Response to Reviewer 1Csp (Part 1/2)

Q1 & Q3: Initial anchor quality and its response to normality shift.

A1 & A3: Thank you for raising this concern. BottomK selects the nodes the source detector considers most likely to be normal. Even when some evolved normals receive inflated anomaly scores, the selected nodes can still provide a mostly normal starting set for the teacher. We test this directly by measuring the true anomaly rate among the selected anchors.

On the standard target graphs, anchor anomaly rates are below the test-set baselines in 23 of 24 tasks, with an average reduction of 5.27 percentage points over all tasks. 18 tasks achieve at least 97.00% normal anchor purity.

We also vary evolved-normal retention from 0% to 100% across all 24 tasks, keeping each task’s anchor ratio ρa\rho_a fixed. Representative anchor anomaly rates (%) are shown below.

TaskFixed ρa\rho_a (%)0% retained25%50%75%100%
GCN–Questions20.002.902.262.262.252.29
BWGNN–Tolokers2.001.180.910.761.261.17
BWGNN–Reddit40.001.581.601.561.411.45
GHRN–T-Finance40.000.530.490.580.530.51
GCN–T-Social10.000.300.320.360.420.50

Across all five levels, 23 of 24 tasks maintain anchor anomaly rates below their test-set baselines, and 17 tasks vary by at most 1.00 percentage point. The selected anchors therefore remain a useful normal reference across these shifts.

The anchors provide a normal starting point for the teacher, while proxy supervision also reaches nodes outside this set. Drift refinement updates their targets as the student adapts, improving proxy quality and enabling revised supervision for initially excluded evolved normals (see our response to reviewer GFqY, Q1 & Q5, https://openreview.net/forum?id=ZXvQ3FOvhr&noteId=vB1U5Jyw6U).


Q2 & Q4: The risk of source regularization reinforcing incorrect predictions, and how to detect and address source detector failure.

A2 & A4: We appreciate this important concern. Source regularization can pull evolved normals toward incorrect source scores, but the joint objective in Eq. (14) also learns from refined proxy targets that can correct those judgments. Differentiating Eq. (13) gives

{\partial m_{i,\mathrm{orig}}^S} =\frac{1}{N} \left[\sigma\left(m_{i,\mathrm{orig}}^S\right)-p_i^s\right].$$ This gradient pulls the original-graph prediction toward the source probability $p_i^s$. When a selected evolved normal receives a refined proxy target below its current view prediction, proxy supervision in Eq. (11) pushes that prediction downward. Consistency in Eq. (12) links the two views, and EMA incorporates the resulting student updates into the teacher. The teacher and its denoising estimates can therefore evolve with target adaptation. We test whether retaining the source reference helps correct evolved-normal errors by removing source regularization from both teacher initialization and student adaptation. Across the 17 tasks where it is active, retaining it improves mean AUROC and AUPRC by 7.10 percentage points each. The examples below also show that retaining the source reference helps PUPPY correct errors on evolved normals. We report their false-positive rates at 80% anomaly recall (%, lower is better). | Task | Source | PUPPY w/o source regularization | Full PUPPY | |---|---:|---:|---:| | GCN–Questions | 95.73 | 85.85 | 68.80 | | BWGNN–Questions | 92.81 | 81.68 | 49.11 | | GHRN–YelpChi | 90.04 | 79.39 | 67.76 | | GHRN–Tolokers | 88.25 | 82.13 | 78.09 | Full PUPPY substantially reduces false alarms while retaining source regularization. Removing the constraint increases them in these examples, showing that a source reference can support adaptation even when its predictions on evolved normals require correction. Although source regularization generally improves performance in our experiments, our implementation allows this soft constraint to be weakened or disabled in exceptional cases where it persistently harms adaptation.
AuthorsOpenReview ↗

Response to Reviewer 1Csp (Part 2/2)

Q5: Extending the evaluation with additional metrics and recent baselines.

A5: Thank you for this suggestion. We have added recent graph anomaly detectors RHO [1] and GraphNC [2], alongside graph TTA methods Matcha [3] and TSA [4]. We also report Recall@k to complement AUROC and AUPRC by measuring anomaly retrieval among the top-kk nodes, where kk is the number of anomalies in the test split.

The table reports means (%) over six datasets, additionally averaged over three backbones for the TTA methods.

MethodMean AUROCMean AUPRCMean Recall@k
RHO66.4027.8429.83
GraphNC59.3217.5018.45
TSA64.2625.3723.66
Matcha67.3625.0425.21
PUPPY73.8136.2937.05

PUPPY maintains its lead over these recent baselines across all three metrics. Its higher Recall@k further shows that it retrieves more true anomalies among the top-ranked nodes, helping prioritize them for inspection.

Following prior work [5], we extend our evaluation to MGTAB [6], a Twitter account detection benchmark with human/bot labels. Each cell reports source detector → PUPPY (%).

BackboneAUROCAUPRCRecall@k
GCN73.96 → 75.6960.34 → 62.6552.53 → 54.12
BWGNN85.76 → 87.6371.07 → 73.0965.22 → 68.28
GHRN86.44 → 87.8271.79 → 73.0666.73 → 67.60

On MGTAB, PUPPY also achieves the best performance among the evaluated methods, supporting its broad applicability. We will include the full comparisons in the revised manuscript.


Q6: Hyperparameter sensitivity and tuning effort.

A6: Thank you for raising this practical question. We extend the sensitivity analysis to five additional hyperparameters across four tasks. 85.53% of tested parameter changes keep AUROC within 1.00 percentage point of the reference, showing stable performance across most evaluated settings.

ParameterSettings within 1 AUROC point (%)
Edge-allocation temperature τe\tau_e100.00
Drift clipping threshold CC81.25
EMA momentum μ\mu93.75
Teacher update interval II93.75
Proxy supervision ratio ρp\rho_p50.00

For example, on BWGNN–T-Social, varying the teacher update interval II from 10 to 30 epochs yields 84.58%–84.80% AUROC, while proxy ratios ρp\rho_p from 0.60 to 1.00 yield 84.65%–84.75%.

These stable ranges reduce the need for fine-grained tuning of most parameters. In a further search on GHRN–MGTAB with the same number of additional candidate configurations per method, PUPPY also achieves the highest AUROC among the compared TTA methods. These results support PUPPY’s practical applicability by demonstrating stable performance across a range of parameter settings. We will provide a more detailed discussion in the revised manuscript.


Thank you again for your positive assessment and thoughtful suggestions. We hope these responses and additional analyses address your concerns. We welcome further questions and would be happy to provide any additional clarification.


[1] Guoguo Ai et al. Semi-supervised graph anomaly detection via robust homophily learning. Advances in Neural Information Processing Systems, 38:133988–134013, 2026.

[2] Guolei Zeng et al. Normality calibration in semi-supervised graph anomaly detection. arXiv preprint arXiv:2510.02014, 2025.

[3] Wenxuan Bao et al. Matcha: Mitigating graph structure shifts with test-time adaptation. In International Conference on Learning Representations, 56906–56944, 2025.

[4] Hans Hao-Hsun Hsu et al. Structural alignment improves graph test-time adaptation. arXiv preprint arXiv:2502.18334, 2025.

[5] Buyun He et al. Boosting bot detection via heterophily-aware representation learning and prototype-guided cluster discovery. In Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining Vol. 2, 860–871, 2025.

[6] Shuhao Shi et al. MGTAB: A multi-relational graph-based Twitter account detection benchmark. Neurocomputing, 647:130490, 2025.

Reviewer_GFqYOpenReview ↗
Rating
3(+1)
Confidence
3
Informativeness
2
Presentation
3
Soundness
2
Read review
Paper summary

PUPPY addresses test-time GAD under normality shift by jointly treating structural contamination and prediction bias. Perturbation-induced representation sensitivity guides selective edge pruning; a teacher-student framework initialized from high-confidence normal anchors refines supervision via the student's source-referenced prediction drift. Experiments span 8 GAD benchmarks, 3 backbones, and temporal-shift settings.

Critical strengths

S1: Normality shift is decomposed into structural contamination and prediction bias as two distinct failure modes, each addressed by a dedicated mechanism. S2: The ablation in Table 2 confirms the contribution of each component. The code repository is complete.

Critical weaknesses

W1: The proxy refinement creates a positive feedback loop. The student's deviation from the source detector (Eq. 8) is distilled back into the student (Eq. 11), amplifying early mis-adaptation. Neither a stability analysis nor any experiment tracking proxy quality over adaptation steps is provided to characterize this behavior. W2: Structural denoising is applied only during training. At inference, Eq. (16) uses original-graph predictions exclusively, discarding the denoised view. If denoising reliably removes harmful edges, inference on the denoised graph should improve detection. The paper offers no justification for this asymmetry and no ablation to validate it.

Questions for authors

Beyond the weaknesses raised above, I would ask the authors to address the following: Q1: Performance gains vary substantially across tasks, with the improvement on Amazon-GCN being exceptionally large compared to others. What drives this disparity? Q2: Theorem 3.1 is derived under a fixed teacher, yet the teacher is updated periodically via EMA throughout adaptation. How does the finite-probe guarantee hold in the iterative setting? Q3: Given that the method relies on the proxy evolving throughout adaptation and that supervision quality directly determines adaptation outcomes, can the authors provide evidence or discussion of how proxy quality changes over adaptation steps? Q4: Empirical runtime measurements across representative settings are absent. The authors should report actual running time to support practical applicability. Q5: Minor typos include the missing “Rectification” in the method name (Section 1, Lines 76–77) and duplicate references to Liang et al. (2020a, 2020b).

6 comments
AuthorsOpenReview ↗

Response to Reviewer GFqY (Part 1/2)

We sincerely thank the reviewer for the time and care devoted to reviewing our paper and for the constructive suggestions. Below, we address your concerns with additional explanations and experimental results.


Q1 & Q5: Stability of student–proxy feedback and proxy quality during adaptation.

A1 & A5: Thank you for raising this important concern. Early student errors can affect subsequent proxy targets, but PUPPY explicitly controls the magnitude of this feedback. In Eqs. (8)–(9), clipping bounds the correction added to the teacher margin,

\leq\alpha C,\qquad \alpha\geq0,$$ where $\alpha$ is the refinement strength and $C$ is the clipping threshold. This prevents growing student–source disagreement from producing arbitrarily large proxy corrections. Source regularization in Eq. (13) further constrains departures from source predictions, while EMA moderates how quickly student changes enter the teacher. The empirical results on 18 tasks also show that drift-induced corrections remain bounded throughout adaptation. Representative results are shown below, with First → Peak → Final describing the student–source drift. Drift and correction are measured as node-averaged absolute margin differences. | Task | First → Peak → Final | Peak correction | Bound $\alpha C$ | |---|---:|---:|---:| | GCN–Questions | 4.92 → 8.39 → 4.24 | 3.20 | 4.00 | | GCN–YelpChi | 9.32 → 9.32 → 2.88 | 7.87 | 8.00 | | GHRN–Weibo | 0.48 → 3.84 → 3.84 | 0.40 | 2.00 | GCN–Questions and GCN–YelpChi show drift receding from its peak. GHRN–Weibo illustrates that continued movement away from the source can coexist with a controlled proxy adjustment. The feedback therefore allows target adaptation while keeping the injected correction within a prescribed range. We also assess whether this feedback improves supervision by comparing teacher and corrected proxy scores against target labels at each epoch. Before applying fixed anchor targets, correction improves epoch-averaged proxy AUROC in 16 of 18 tasks. Representative results (%) are shown below. | Task | Teacher proxy | Corrected proxy | |---|---:|---:| | GCN–Questions | 55.10 | 56.34 | | GCN–YelpChi | 51.29 | 53.73 | | BWGNN–Tolokers | 65.84 | 66.92 | | GHRN–Tolokers | 63.37 | 64.23 | | GHRN–Weibo | 91.82 | 92.79 | As the student learns target normality, it can correct early misjudgments and contribute increasingly useful information to the proxy. The improved proxy quality shows that refinement draws useful information from student adaptation, helping subsequent updates benefit from more accurate supervision. --- >***Q2: Why use denoised graphs during adaptation but the original graph at inference?*** **A2:** We appreciate this concern. PUPPY uses denoised views to improve adaptation and retains the complete graph for final scoring, loosely analogous to learning from masked images and evaluating on intact ones. Sensitivity-guided pruning and drift-refined proxy supervision shape learning on these views, while consistency in Eq. (12) aligns predictions between the denoised and original graphs. Thus, original-graph inference still benefits from denoising while preserving relations that a sampled view may remove. We also evaluate whether inference on denoised graphs offers an advantage over the original graph. Averaged across 24 tasks over five seeds, the results below show only minor differences among the three inference choices, with the original graph achieving the highest mean AUROC and AUPRC. These findings support our inference design. | Inference view | Mean AUROC (%) | Mean AUPRC (%) | |---|---:|---:| | Original graph (ours) | 77.64 ± 0.12 | 40.39 ± 0.42 | | Denoised graphs | 77.32 ± 0.23 | 40.10 ± 0.65 | | Original + denoised | 77.31 ± 0.23 | 39.98 ± 0.65 |
AuthorsOpenReview ↗

Response to Reviewer GFqY (Part 2/2)

Q3: The unusually large improvement on Amazon–GCN.

A3: Thank you for highlighting this result. Amazon–GCN presents a severe error in the source ranking. Mean source anomaly probabilities are 68.50% for anomalies, 74.70% for known normals, and 88.80% for evolved normals.

Proxy supervision directly addresses this mistaken ordering. When the adapted proxy assigns an evolved normal a lower anomaly target, the proxy loss encourages the student to reduce its score despite the source detector’s high prediction. This gives adaptation an explicit signal to change which target patterns are treated as anomalous. The ablations in Table 8 show that this signal drives the recovery.

VariantAmazon–GCN AUROC (%)
w/o Proxy Supervision25.23
w/o Structure Denoising79.66
Full PUPPY80.52

The recovery remains strong with proxy supervision retained. Moreover, drift refinement raises epoch-averaged proxy AUROC from 67.01% to 76.47%, showing that the student’s target learning improves the ranking supplied by the teacher. These corrections enter subsequent supervision, allowing adaptation to build on its revised judgment of target normality.


Q4: Applicability of Theorem 3.1 under periodic EMA updates.

A4: Thank you for this question. PUPPY holds the teacher fixed within each probing round and applies EMA updates between rounds. The fixed-teacher assumption therefore holds when the probes are sampled.

Let rr index probing rounds and Fr\mathcal F_r denote the adaptation history, including the updated teacher, before drawing the probes for round rr. Define

\left|P_{ij}^{\mathrm{drop}}-P_{ij}^{\mathrm{drop},\star}\right|,$$ where the empirical and population edge-deletion probabilities are evaluated for round $r$ before degree restoration. Let $B_r$ denote the right-hand side of Eq. (19) evaluated for that round’s teacher. Conditional on $\mathcal F_r$, the $K$ fresh probes are independent, so Eq. (19) yields $$\mathbb E[D_r\mid\mathcal F_r]\leq B_r, \qquad \mathbb E[D_r]\leq\mathbb E[B_r].$$ Averaging the first inequality over possible adaptation histories gives the second. EMA changes the population policy between rounds, and the finite-probe guarantee applies to the updated policy at each refresh. We will include this conditional argument in the revised theoretical discussion. --- >***Q6: Empirical runtime and practical applicability.*** **A6:** Thank you for this suggestion. We compare the runtime of five TTA methods over 10 epochs across nine tasks, as shown below. | Task | PUPPY (s) | GTrans (s) | SOGA (s) | TUNE (s) | GraphPatcher (s) | |---|---:|---:|---:|---:|---:| | GCN–Reddit | 0.63 | 1.09 | 0.45 | 0.43 | 25.11 | | GCN–Weibo | 0.74 | 1.10 | 0.46 | 0.41 | 26.63 | | GCN–Questions | 0.76 | 1.29 | 0.46 | 0.44 | 23.15 | | BWGNN–Reddit | 0.66 | 1.58 | 0.49 | 0.43 | 26.27 | | BWGNN–Weibo | 0.61 | 1.56 | 0.48 | 0.44 | 27.27 | | BWGNN–Questions | 0.69 | 1.86 | 0.48 | 0.47 | 23.86 | | GHRN–Reddit | 0.67 | 1.46 | 0.41 | 0.41 | 25.43 | | GHRN–Weibo | 0.86 | 1.46 | 0.40 | 0.41 | 26.97 | | GHRN–Questions | 0.99 | 1.82 | 0.43 | 0.44 | 23.24 | PUPPY falls in the middle of the evaluated TTA methods in runtime. Its improved detection gains justify the additional adaptation cost, providing a favorable balance between performance and efficiency. --- >***Q7: Method-name omission and duplicate references.*** A7: Thank you for catching these issues. We appreciate your careful reading and attention to detail, and we will address them in the revised version. --- Thank you again for your careful review and constructive suggestions. We hope these responses have addressed your concerns and that you will consider raising your score. If there are any remaining concerns or additional points you would like us to address, please let us know, and we will respond promptly.

Thank you for the detailed response and for the effort devoted to the additional analyses and experiments. I appreciate the clarifications and new results.

Reviewer_1oWDOpenReview ↗
Rating
4(+1)
Confidence
3
Informativeness
2
Presentation
3
Soundness
3
Read review
Paper summary

This paper studies test-time graph anomaly detection under normality shift and proposes PUPPY, which combines perturbation-aware structure denoising with adaptive proxy-label refinement. Experiments indicate that PUPPY improves detection performance under these shifts.

Critical strengths
  1. The paper offers a clear and useful framing of normality shift in test-time GAD, highlighting its impact on both the graph context used for detection and target-proxy reliability.
  2. A relatively novel aspect of PUPPY is how its teacher–student adaptation couples target-proxy refinement with perturbation-aware structure denoising, a well-motivated pairing under normality shift.
Critical weaknesses
  1. Eq. (12) enforces prediction consistency across the original and perturbed graphs, but its validity is unclear when perturbations alter features or relations that define an anomaly. The paper does not establish when this invariance assumption is reliable or quantify its effect on anomaly-specific detection.
  2. The ablations support the utility of drift refinement, but do not directly show that it improves proxy-label quality during adaptation. Tracking proxy quality, for example through an analysis-only comparison with target labels, would better support the claimed debiasing mechanism.
Questions for authors
  1. Eq. (12) encourages consistent predictions on original and perturbed graphs, although feature masking or edge deletion may remove anomaly cues. How does the consistency objective preserve such signals?
  2. Drift refinement is intended to improve proxy labels, but the ablations measure its effect on detection performance. How does proxy-label quality change during adaptation?
  3. Table 2 shows the effect of removing each component, but leaves their interactions unclear. What are the separate and combined contributions of feature perturbation and sensitivity-guided edge pruning, and do these gains complement proxy refinement?
  4. At inference, the teacher and student anomaly scores are directly averaged, but the paper gives little justification for this choice. What motivates this fusion, and how does it compare with using either model alone?
  5. The feature-clustered shifts do not isolate changes in graph connectivity. Would structural denoising still improve detection under a primarily topological shift, with comparable node-feature distributions?
4 comments
AuthorsOpenReview ↗

Response to Reviewer 1oWD (Part 1/2)

We are truly grateful for your thoughtful review and the time you have devoted to assessing our work. We address each of your concerns in the responses below.


Q1 & Q3: When is Eq. (12) reliable, and how does it preserve anomaly discrimination when perturbations remove anomaly cues?

A1 & A3: Thank you for this key point. When a perturbation removes an anomaly cue from a sampled view, PUPPY still uses the complete graph to construct supervision for that view. The refined proxy incorporates predictions from both graphs (Eqs. (7)–(9)). If a selected node’s view score falls below its anomalous target, proxy supervision pushes it upward, while consistency encourages agreement across views.

The condition for preserving anomaly ranking is also explicit. Let pio=σ(mi,origS)p_i^o=\sigma(m_{i,\mathrm{orig}}^S) and piv=σ(mi,viewS)p_i^v=\sigma(m_{i,\mathrm{view}}^S) denote the student’s anomaly probabilities on the original graph and perturbed view, and define δi=∣pio−piv∣\delta_i=|p_i^o-p_i^v|. For an anomalous node aa and a normal node nn,

\leq\delta_a+\delta_n.$$ If the anomalous node scores above the normal node by more than $\delta_a+\delta_n$ in one view, that ordering is preserved in the other. Eq. (12) penalizes these discrepancies through $\mathcal L_{\mathrm{con}}=\frac{1}{N}\sum_{i\in\mathcal V}\delta_i^2$. To assess anomaly detection performance, we compare PUPPY with and without consistency over 24 tasks. In the reported results, full PUPPY achieves higher mean AUROC and AUPRC by 1.30 and 3.08 percentage points, respectively. The table presents representative results. Each cell reports without consistency → full PUPPY as three-seed means (%). | Task | AUROC | AUPRC | |---|---:|---:| | BWGNN–Amazon | 93.12 → 94.47 | 64.68 → 80.26 | | BWGNN–Weibo | 95.29 → 97.05 | 83.66 → 84.94 | | BWGNN–YelpChi | 58.37 → 62.27 | 22.42 → 25.99 | | GCN–YelpChi | 54.53 → 56.20 | 18.77 → 19.36 | These results show that PUPPY can learn consistent predictions across perturbed views while retaining useful anomaly discrimination on the original graph. --- >***Q2 & Q4: The effect of drift refinement on proxy-label quality during adaptation.*** **A2 & A4:** We appreciate this suggestion. We conducted a direct proxy-quality analysis on six datasets using three backbones. At each adaptation epoch, we evaluate the teacher and drift-corrected scores against target labels, before applying the fixed anchor targets. AUROC is averaged over all epochs within each run and then over three seeds. Correction improves time-averaged proxy AUROC in 16/18 tasks. Representative results are shown below. | Task | Teacher AUROC (%) | Corrected AUROC (%) | |---|---:|---:| | GCN–Questions | 55.10 | 56.34 | | BWGNN–Tolokers | 65.84 | 66.92 | | GCN–Tolokers | 66.25 | 67.07 | | GHRN–Tolokers | 63.37 | 64.23 | | GHRN–Weibo | 91.82 | 92.79 | The gains suggest that student adaptation can reveal useful target information before it is fully reflected in the teacher. Drift refinement passes that information back into the proxy, so learning on the target graph also improves the supervision used to guide later updates.
AuthorsOpenReview ↗

Response to Reviewer 1oWD (Part 2/2)

Q5: Individual and joint effects of feature perturbation and edge pruning, and their complementarity with proxy refinement.

A5: Thank you for this helpful suggestion. Across 24 tasks, feature perturbation and pruning individually improve mean AUROC over the original w/o Structure Denoising baseline (Neither) by 3.23 and 2.82 percentage points, respectively. Combining them yields a further gain of over 3 points compared with either alone. Representative AUROC results (%) are shown below.

TaskNeitherw/o Featurew/o PruningFull
GCN–Reddit55.8860.6262.2365.20
BWGNN–Amazon87.2492.4392.2594.43
BWGNN–YelpChi53.5259.9157.9562.27
GHRN–YelpChi52.2755.3556.0660.64

Both mechanisms improve detection on their own, and the gains from combining them support adapting node attributes and neighborhood context together. The existing ablation in Table 8 further shows that drift refinement adds 3.06 percentage points to mean AUROC with both mechanisms enabled, demonstrating the benefit of improving supervision alongside the graph views.

We also compare corrected-proxy AUROC (%) across different view variants, averaged over all adaptation epochs. Representative results are shown below.

TaskNeitherFeaturePruningBoth
BWGNN–Weibo76.9389.0280.8592.97
BWGNN–YelpChi56.1458.6856.8659.63
GCN–Reddit63.2763.6563.6764.20
GHRN–Questions55.0656.6957.0160.45

The corrected proxy ranks anomalies more accurately with either feature perturbation or edge pruning. This suggests that feature and neighborhood adaptation can give refinement a better starting point in the teacher’s predictions. Their contribution can then carry into the targets that guide the student’s next update


Q6: Why average teacher and student scores, and how does this compare with either model alone?

A6: We appreciate this question. We average the scores to combine the student’s latest target adjustments with the teacher’s accumulated adaptation, which evolves more gradually through EMA. To examine how this balance affects performance, we test different weighting ratios and report the average results over 24 tasks below.

Teacher weightMean AUROC (%)Mean AUPRC (%)
1.00 (teacher only)76.9639.34
0.7577.5540.23
0.5077.6440.39
0.2577.4739.85
0.00 (student only)74.3734.13

Combining the models improves both metrics over either model alone, with similar performance across the three mixtures. Equal averaging achieves the highest reported means while keeping fusion simple and avoiding task-specific weight tuning, making it convenient for deployment.


Q7: Structural denoising under topology shifts with comparable feature distributions.

A7: Thank you for this suggestion. Topology shifts are a worthwhile direction and provide a useful extension of our setting. Since graph representations depend on neighborhood connectivity, PUPPY’s sensitivity estimates can respond to structural changes even when node features remain fixed.

We evaluated this setting on six datasets using three backbones. We kept node features fixed and added connections to anomalous neighbors, which constitute 50% of the affected nodes’ final neighborhoods. Enabling denoising improves AUROC in all 18 tasks and AUPRC in 17 tasks, with average gains of 1.38 and 1.47 percentage points. Representative results are shown below. Each cell reports without denoising → full PUPPY (%).

TaskAUROCAUPRC
BWGNN–Amazon95.64 → 95.7985.37 → 85.51
BWGNN–YelpChi41.51 → 42.3446.54 → 47.71
GCN–Reddit81.26 → 87.1914.24 → 23.71
GHRN–Weibo84.73 → 84.9660.63 → 61.05
GCN–Questions66.28 → 79.1910.47 → 24.11

With features unchanged, these gains show the value of denoising the altered neighborhood context during adaptation.


Thank you again for your positive assessment of our work and your insightful comments. We hope these responses and additional results address your concerns, and we welcome any further questions or feedback.

Thank you for the detailed responses, which have addressed my concerns, and I will therefore raise my score accordingly.

Dear Reviewer 1oWD,

We are truly grateful for your recognition of our work! Your positive assessment is a great encouragement to us. We sincerely appreciate the time and care you have devoted to reviewing our paper, your valuable feedback helping us improve the manuscript.

Best regards,

The Authors

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.