acceptodds
Under review as a conference paper at ICLR 2027

SFB-GNN: Perturbation-Stable Community Detection with Self-Regulating Fourier–Bayesian Graph Neural Networks

Abstract

Community detection in attributed graphs can be highly unstable under small structural or feature perturbations, causing large changes in inferred partitions even when the underlying community structure remains largely unchanged. We introduce SFB-GNN, a self-regulating Fourier–Bayesian graph neural network designed to directly control this perturbation-induced assignment drift. SFB-GNN combines bounded polynomial spectral filtering, Bayesian epistemic uncertainty estimation, and uncertainty-aware adaptive message gating within a closed-loop stability framework. The spectral component limits perturbation amplification during graph propagation, while uncertainty estimates identify structurally vulnerable regions and selectively regulate message passing. To directly stabilize community assignments, we further introduce a permutation-invariant co-assignment consistency objective between clean and perturbed graph views. Experiments on real-world attributed graphs and synthetic graphs with controlled spectral gaps show that SFB-GNN substantially reduces assignment drift under structural and feature perturbations while preserving competitive clustering quality. Ablation and sensitivity analyses confirm that spectral regulation, uncertainty estimation, and adaptive gating provide complementary contributions to stability without inducing representation collapse. These results show that explicitly regulating perturbation propagation and assignment consistency provides an effective approach to reliable community detection under noisy and uncertain graph observations.

Primary area:
learning on graphs and other geometries & topologies
Keywords:
community detection, graph neural networks, perturbation stability, spectral graph learning, Bayesian uncertainty, adaptive message passing, robust graph learning

Reviews

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

This paper introduces SFB-GNN, a self-regulating Fourier–Bayesian graph neural network designed to directly control this perturbation-induced assignment drift. SFB-GNN combines bounded polynomial spectral filtering, Bayesian epistemic uncertainty estimation, and uncertainty-aware adaptive message gating within a closed-loop stability framework. The spectral component limits perturbation amplification during graph propagation, while uncertainty estimates identify structurally vulnerable regions and selectively regulate message passing. To directly stabilize community assignments, we further introduce a permutation-invariant co-assignment consistency objective between clean and perturbed graph views. Experiments on real-world attributed graphs and synthetic graphs with controlled spectral gaps show that SFB-GNN substantially reduces assignment drift under structural and feature perturbations while preserving competitive clustering quality. Ablation and sensitivity analyses confirm that spectral regulation, uncertainty estimation, and adaptive gating provide complementary contributions to stability without inducing representation collapse. These results show that explicitly regulating perturbation propagation and assignment consistency provides an effective approach to reliable community detection under noisy and uncertain graph observations.

Critical strengths

No strengths.

Critical weaknesses

There are a lot of AI-generated content in this manuscript, for example, the large language model prompts the residue of words, the garbled code and low-level spelling errors in the image and text generation, and the most serious false references, as well as unclear experimental results. My advice is to directly desk reject

Questions for authors

No questions.

1 comment
AuthorsOpenReview ↗

Response to Reviewer dvwZ

  1. Presentation and disclosure. The PDF contains retained-figure wording, incomplete panel lettering and stray text in Table 2’s header. We would clean the source and compiled PDF, redraw the architecture from the equations, and regenerate empirical plots from their numerical outputs. The AI-use statement discloses assistance with language, organization and LaTeX. We take responsibility for the submission and would check the disclosure against the actual text, source-editing and figure-production workflow.
  2. Bibliography. We verified the following corrections against the published records. Entry Correction Trivedi et al., DyRep ICLR 2019. Authors are Rakshit Trivedi, Mehrdad Farajtabar, Prasenjeet Biswal and Hongyuan Zha. The current entry gives AAAI 2022 and omits Zha. Jusup et al., Social physics Correct DOI 10.1016/j.physrep.2021.10.005. The current DOI ends in .001. Restore the published author diacritics. Briol and Girolami The cited Statistical Science 36(4) contents list different articles. Remove the entry unless the intended primary source can be identified. Kurasov, Spectral Geometry of Graphs Consolidate 2024a and 2024b. DOI 10.1007/978-3-662-67872-5. Su et al., community detection survey Retain one final record. IEEE TNNLS 35(4), 4682–4702, 2024. DOI 10.1109/TNNLS.2021.3137396.

We would verify each remaining reference’s authors, title, publication details and relevance to the cited claim. 3. Experimental traceability. The five appendix seed rows reproduce NMI .512±.011, ARI .421±.010 and AD .087±.006. The table needs the dataset, split, fitted KK, perturbation type and severity, and configuration. We would tie each headline value to its run IDs, predictions and aggregation script, including the two no-gate AD results of .096±.007 and .124±.008. The figures and tables should be regenerated from these records. Technical follow-up on the PAT feedback

  1. Prior work. GraphCL, DCRN and HSAN already use augmented views or cross-view learning. Eq. (9) specifically compares sampled pairwise co-memberships. MetaGC and Zhao et al.’s RAGC are direct robust clustering comparators. DCRN is also relevant to the representation-collapse claim. These comparisons should appear alongside the existing baseline families.
  2. Implementation. Define Aˉ=D+−1/2(A+I)D+−1/2\bar A=D_+^{-1/2}(A+I)D_+^{-1/2} and PP as the learned assignment projection. Separate sampled hidden states, averaged probe embeddings and gated outputs. Eq. (7) forms a view-level gate from cross-sample statistics, so its index in Eq. (8) should reflect sharing across draws. The appendix describes a0,a1,a2a_0,a_1,a_2 as learnable. Monotone attenuation requires a1,a2≥0a_1,a_2\ge0, and the manuscript should specify how their signs are handled. Report the gate schedule, prior variance, temperature, threshold, exact loss weights and the mapping from the grouped spectral weight to Eq. (10). The appendix reports M=20M=20. State whether Eq. (3) used the exact quadratic maximum or a grid.
  3. Metrics and perturbations.
AD(ρ)=1−NMI(y^clean,y^ρ),ΔNMI(ρ)=NMI(yref,y^clean)−NMI(yref,y^ρ).\mathrm{AD}(\rho)=1-\mathrm{NMI}(\hat y_{\rm clean},\hat y_\rho),\qquad \Delta\mathrm{NMI}(\rho)=\mathrm{NMI}(y_{\rm ref},\hat y_{\rm clean})-\mathrm{NMI}(y_{\rm ref},\hat y_\rho).

Specify NMI normalization, VI log base and ECE confidence/correctness. Training views for Eq. (9) are generated from the base graph. Evaluation views use independent draws. Test perturbation Severities Edge rewiring 5%, 10%, 20% Edge dropout 5%, 10%, 20% Gaussian feature noise SD .05, .10, .20 Feature masking 10%, 20%, 30%

Ten test realizations per severity are averaged within each of five training seeds. The appendix reports this rewiring sensitivity. Variant 5% AD↓ 10% AD↓ 20% AD↓ SFB-GNN .052±.004 .087±.006 .154±.011 Without spectral regulation .076±.006 .132±.010 .231±.016 Without Bayesian modeling .069±.005 .118±.009 .209±.015 Without both .091±.008 .161±.013 .274±.021

Section 5.4 should link slope claims to per-severity results for each named method and perturbation. Section 5.5 should cite the corresponding matched table. Table 2 needs its severity or aggregation rule. The 10% structural ablation needs the dataset and exact perturbation type. The DMoN comparison with identical augmentations and Eq. (9) remains open. 4. Version checks. The current Figure 2 shows vertex-time heatmaps. A fixed-graph comparison within each spectral regime is still needed. The current Ethics and Reproducibility Statements name SFB-GNN. We would link reproducibility claims to specific configurations, outputs and scripts, delete the retained-figure wording, and correct Table 2’s dataset header.

Reviewer_7G2KOpenReview ↗
Rating
2
Confidence
2
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

The manuscript proposes SFB-GNN for perturbation-stable community detection in attributed graphs. The framework combines a second-order polynomial spectral filter, Bayesian weight sampling, a node-wise gate conditioned on uncertainty and local graph-signal variation, and a consistency objective comparing clean and perturbed soft co-assignment matrices. Its central objective is to reduce changes in inferred communities in the presence of observation noise while retaining clustering quality. The problem is relevant, and the results show encouraging evidence that the proposed training configuration improves stability compared with the reported GAT/V-GNN comparisons.

Critical strengths

S1. Distinguishing clean clustering quality from sensitivity of the inferred partition is useful. A method can achieve reasonable agreement with benchmark labels while producing inconsistent partitions when its observations are slightly altered.

S2. The co-assignment objective has a sound invariance property. The loss in Equation (9) compares pairwise community relations rather than requiring a particular numbering of communities. Its invariance follows directly from (S\Pi(S\Pi)^\top=SS^\top) for a permutation matrix (\Pi).

S3. The experimental results are positive within the reported comparisons. Table 1 shows modest improvements in clean NMI and ARI over V-GNN on all four displayed datasets. Table 2 reports lower structural and feature-assignment drift across seven datasets.

Critical weaknesses

W1. The stability bound in Equation (4) accounts for how graph changes affect the initial spectral filter. However, the model uses the graph again during message passing and adaptive gating, and the bound does not account for these additional effects. For example, if the initial filter leaves the features unchanged, the bound predicts no change under a structural perturbation, even though the later message-passing layers can still produce different assignments.

W2. Several central ideas already appear in closely related work. In particular, DISPEL-GNN combines spectral regulation, Bayesian uncertainty, and risk-aware propagation to improve the stability of community detection. SFB-GNN makes specific changes, including a node-wise gate and a co-assignment consistency loss, but the paper does not clearly explain why these changes provide a substantial advance. A direct comparison with the closest existing method is needed to establish the significance of the contribution.

W3. Equation (9) requires clean and perturbed predictions during training, while Section 4 states that models are trained on clean observations. These descriptions could be consistent if the method generates perturbed training views from the clean graph, but the paper does not clearly explain this procedure. It also does not establish whether the baselines receive the same augmented training data and comparable tuning opportunities.

Questions for authors

Figure 1 contains labels (A), (B), and (D), but no visible label (C). Please clarify whether a panel was omitted or the existing elements were labeled incorrectly, and revise the figure and caption accordingly.

2 comments
AuthorsOpenReview ↗

Response to Reviewer 7G2K 1.

  1. W1. For a constant filter gθ(λ)≡cg_\theta(\lambda)\equiv c and unchanged features, the filtered inputs are identical. The update BHWBHW can still change with the propagation adjacency, even with an identity gate. Recomputing the gate adds another path. The corrected bound in our response to NsJA includes both ∥B−B~∥2\|B-\tilde B\|_2 and ∥Γ−Γ~∥2\|\Gamma-\tilde\Gamma\|_2. We would limit Eq. (4) to a fixed downstream map and use the expanded bound for structural perturbations.
  2. W2. DISPEL-GNN already combines spectral regulation, Bayesian uncertainty and risk-aware propagation. It uses edge-level attention and risk-weighted node-wise Jensen–Shannon consistency (Qu et al., 2026, DOI 10.3390/math14040602). SFB-GNN uses one receiver-side multiplier per node and compares SS⊤SS^\top across views, so (SΠ)(SΠ)⊤=SS⊤(S\Pi)(S\Pi)^\top=SS^\top for any permutation Π\Pi. Eq. (9) is invariant to independently permuting either view. A direct DISPEL-GNN comparison under identical data splits, KK, augmentations, evaluation corruptions, seeds and tuning budgets is needed to quantify the incremental benefit. Holding the consistency loss fixed while swapping propagation rules, then holding propagation fixed while swapping the loss, would isolate the two changes.
  3. W3. Algorithm 1 starts from the clean graph and generates a perturbed training view for Eq. (9). Test views are generated independently. Section 4 conflates the clean base observation with the views used for training. We would verify each method’s training augmentations and document the probabilities, seeds, tuning budget and checkpoint selection. Matching the test views alone leaves the training exposure uncontrolled. The annotated class count sets KK, and clean validation NMI selects the checkpoint. The optimization loss uses graph observations. Table 1 clean NMI / ARI, mean±SD. Dataset GAT V-GNN SFB-GNN Cora .48±.01 / .39±.01 .49±.01 / .40±.01 .51±.01 / .42±.01 Citeseer .42±.01 / .33±.01 .43±.01 / .34±.01 .45±.01 / .36±.01 Coauthor-CS .60±.01 / .48±.01 .61±.01 / .49±.01 .63±.01 / .51±.01 Reddit .45±.02 / .33±.02 .46±.02 / .34±.02 .48±.02 / .36±.02

Table 2 AD, mean±SD. The exact perturbation setting or aggregation rule needs to be identified from the run records. Dataset V-GNN edge SFB edge V-GNN feature SFB feature Citeseer .21±.02 .18±.02 .19±.02 .16±.02 Cora-Full .20±.02 .17±.02 .18±.02 .15±.02 BlogCatalog .22±.02 .19±.02 .20±.02 .17±.02 Coauthor-CS .18±.01 .15±.01 .16±.01 .13±.01 Amazon-Computers .20±.02 .17±.02 .18±.02 .15±.02 Reddit .26±.02 .23±.02 .24±.02 .21±.02 OGBN-Arxiv .24±.02 .21±.02 .22±.02 .19±.02

  1. Figure 1. The architecture is visible, but the panel lettering is incomplete. We would label A as paired inputs and filtering, B as posterior sampling and gated propagation, C as soft assignments and co-assignment, and D as training losses and partition output. The caption would specify the gate computation order.

I reviewed the response and decided to maintain my score. Thank you for your understanding.

Reviewer_NsJAOpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
3
Soundness
1
Read review
Paper summary

The paper introduces a framework called SFB-GNN targetting the perturbation-stable community detection in attributed graphs. The framework combines different components of bounded-polynomial graph-fourier filtering, Bayesian epistemic uncertainty estimation, uncertainty-conditioned message gating, and a permutation-invariant co-assignment consistency objective. The goal is to preserve community structure under small structural and feature perturbations while maintaining clustering quality.

Authors conduct experiments to evaluate their framework on the attributed graph benchmarks and synthetic stochastic block models. They report consistent gains in assignment drift, clustering quality, and uncertainity calibration. Ablations are also provided to demonstrate the contributions of the individual components

Critical strengths

1.⁠ ⁠Authors have avoided arbitrary cluster-label alignment in equation 9, and directly regularized community relationships rather than just enforcing embedding similarity, which makes it permutation-invariant.

2.⁠ ⁠Experiments cover both structural and feature level perturbations of different severity that evaluates assignment stability separately from clean clustering quality. Ablation study is also done, which supports the need of individual components of their proposed framework.

3.⁠ ⁠Stability improves in the weak separation regime, supporting their original motivation of fixing vulnerability of poorly separated communities against perturbation.

Critical weaknesses

1.⁠ Equation 4 gives a conditional bound on soft co-assignment variation under a Lipschitz assumption on the downstream mapping, which is valid, but the proposed downstream GNN explicitly depends on the perturbed adjacency operator and the uncertainty-dependent gate. Hence, the guarantee is claimed, but not given for the actual framework.

2.⁠ ⁠Equation (3) only penalizes violations of the bounded-response condition, but equation 4 assumes that the condition holds.

3.⁠ ⁠Equation (4) bounds differences in soft coassignment matrices, but the AD measures changes in hard community assignments. Former doesnt guarantee the latter without additional assignment-margin assumptions.

4.⁠ ⁠The drichlet energy preservation and bounded response penalties can oppose each other, especially for c<1. If one wants it to satisfy the constraint, it reduces nonzero drichlet energy. That makes exact preservation impossible.

5.⁠ ⁠Although, the paper shows some meaningful ablations and also discusses matched variants, it is also important to establish that the combined spectral-bayesian architecture provides any benefits beyond applying the same consistency objective to a strong clustering baseline.

6.⁠ ⁠Figure 2 compares conditions with different reported spectral graph, which makes the visibility of the effect of stabilization difficult, and makes it more of an apple to orange comparison. Effect of stabilization should be isolated for the plot.

7.⁠ ⁠In Figure 4(b), the eigenvalues are exceeding the range of the normalized Laplacian that was defined in the manuscript. If they are unnormalized laplacians, it should be made clear in the text.

Questions for authors

1.⁠ ⁠How does Equation 4 consider the perturbation to the actual downstream adjacency operator and uncertainty-dependent gate? Can you give a bound for the actual graph-dependent architecture?

2.⁠ ⁠Why is embedding covariance preferred over assignment-space uncertainity? Why is receiver-side gating used instead of source-side or edge-wise uncertainty weighting? Are matched comparisons available?

3.⁠ ⁠How is the trade-off between Dirichlet-energy preservation and bounded spectral response managed? Can you please report learned filter responses, actual response maxima, and sensitivity to cc, λdir\lambda_{\mathrm{dir}}, and λresp\lambda_{\mathrm{resp}}?

4.⁠ ⁠How much improvement remains when a strong clustering baseline is trained with the same perturbation augmentations and co-assignment loss? Since NMI depends on community count and size distributions, can the authors provide quantitative results under variation of information and clean–perturbed ARI, including sensitivity to effective cluster count?

2 comments
AuthorsOpenReview ↗

Response to Reviewer NsJA

  1. W1/Q1. Fix parameters and pair posterior draws across views. Set B=AˉB=\bar A, ΔT=T−T~\Delta T=T-\tilde T, δT=∥ΔT∥2\delta_T=\|\Delta T\|_2, Dℓ=max⁡m∥ΔHℓ(m)∥FD_\ell=\max_m\|\Delta H_\ell^{(m)}\|_F, Rℓ=max⁡m∥H~ℓ(m)∥FR_\ell=\max_m\|\tilde H_\ell^{(m)}\|_F and bℓ=Lip(ϕℓ)max⁡m∥Wℓ(m)∥2b_\ell=\mathrm{Lip}(\phi_\ell)\max_m\|W_\ell^{(m)}\|_2. Both operators have norm at most 1, so ∥Δ(ΓℓB)∥2≤δB+δΓℓ\|\Delta(\Gamma_\ell B)\|_2\le\delta_B+\delta_{\Gamma_\ell}. Thus
D0≤c^∥X−X~∥F+(∣θ1∣+4∣θ2∣)δL∥X~∥F,Dℓ+1≤bℓ[Dℓ+Rℓ(δB+δΓℓ)].D_0\le\hat c\|X-\tilde X\|_F+(|\theta_1|+4|\theta_2|)\delta_L\|\tilde X\|_F,\qquad D_{\ell+1}\le b_\ell[D_\ell+R_\ell(\delta_B+\delta_{\Gamma_\ell})].

Eq. (4) omits both operator terms. For Γ=I\Gamma=I, the recurrence bounds probe error DpD_p. With probe row norms bounded by RpR_p and covariance divisor MM, ∣Δui∣≤2RpDp|\Delta u_i|\le2R_pD_p and ∣Δri∣≤2Dp+δL∥Zˉ~p∥F|\Delta r_i|\le2D_p+\delta_L\|\tilde{\bar Z}_p\|_F. Its shared gate satisfies

δΓ≤[2∣a1∣RpDp+∣a2∣(2Dp+δL∥Zˉ~p∥F)]/4.\delta_\Gamma\le[2|a_1|R_pD_p+|a_2|(2D_p+\delta_L\|\tilde{\bar Z}_p\|_F)]/4.

At depth dd, ∥ΔS∥F≤∥P∥2Dd/2\|\Delta S\|_F\le\|P\|_2D_d/2 and ∥Δ(SS⊤)∥F≤(∥S∥2+∥S~∥2)∥ΔS∥F\|\Delta(SS^\top)\|_F\le(\|S\|_2+\|\tilde S\|_2)\|\Delta S\|_F. This bounds the proposed two-pass schedule. The reported gate schedule needs verification. 2. W2. Eq. (3) is soft. Use c^=max⁡[0,2]∣gθ∣\hat c=\max_{[0,2]}|g_\theta|. Check the endpoints and −θ1/(2θ2)-\theta_1/(2\theta_2) if interior. Report c^\hat c and (c^−c)+(\hat c-c)_+ per run. A hard cap uses gθ/max⁡(1,c^/c)g_\theta/\max(1,\hat c/c) for c>0c>0. 3. W3. Let ki=arg⁡max⁡kSikk_i=\arg\max_k S_{ik} and mi=Siki−max⁡k≠kiSikm_i=S_{ik_i}-\max_{k\ne k_i}S_{ik}. A label flip requires mi≤2∥ΔSi,:∥2m_i\le\sqrt2\|\Delta S_{i,:}\|_2. For τ>0\tau>0, the flip fraction is at most

#{i:mi<τ}/N+2∥ΔS∥F2/(Nτ2).\#\{i:m_i<\tau\}/N+2\|\Delta S\|_F^2/(N\tau^2).

We would report margins alongside hard AD. 4. W4/Q3. Under the hard cap,

EL(gθ(L)X)=∑jλj∣gθ(λj)∣2∥(U⊤X)j,:∥22≤c2EL(X).E_L(g_\theta(L)X)=\sum_j\lambda_j|g_\theta(\lambda_j)|^2\|(U^\top X)_{j,:}\|_2^2\le c^2E_L(X).

Exact preservation is infeasible for c<1c<1 and positive input energy. Eq. (2) penalizes deviation. A floor at ηEL(X)\eta E_L(X) is feasible for η≤c2\eta\le c^2. The appendix reports high-frequency energy fractions. Dataset Before After Cora .284±.016 .191±.010 Citeseer .317±.014 .218±.013 Pubmed .251±.010 .176±.009 Amazon-Photo .296±.012 .203±.011

We would report coefficients, response curves, c^\hat c and EL(gθ(L)X)/EL(X)E_L(g_\theta(L)X)/E_L(X) across sweeps of c,λdir,λrespc,\lambda_{\rm dir},\lambda_{\rm resp}. Citeseer’s 30.9% versus 31.2% from the means needs an aggregation check. 5. Q2. Embedding covariance is available during propagation and scale-sensitive. Assignment covariance measures membership variation. ΓBHW\Gamma BHW gates incoming updates, BΓHWB\Gamma HW gates outgoing contributions, and edge-wise weights vary by neighbor. We would compare both scores across all three gates and a constant gate at matched mean attenuation. These tests remain open. 6. W5/Q4. Appendix, 10% rewiring, five seeds. Method NMI↑ ARI↑ AD↓ ECE↓ V-GNN .498±.013 .401±.012 .118±.009 .067±.006 DMoN .489±.013 .384±.012 .124±.010 .073±.007 Pro-GNN .492±.013 .386±.012 .119±.010 .069±.006 GNNGuard .488±.014 .382±.013 .116±.010 .066±.006 Spectral + Drift .506±.012 .414±.011 .101±.008 .058±.005 Bayesian + Drift .503±.012 .411±.011 .109±.009 .047±.005 Spectral + Bayesian + Drift, no gate .508±.011 .417±.010 .096±.007 .044±.004 SFB-GNN .512±.011 .421±.010 .087±.006 .041±.004

Standard DMoN is .037 AD higher. The gap with matched training views and Eq. (9) is unmeasured. Compare DMoN, DMoN + shared views, DMoN + shared views + Eq. (9), and SFB-GNN with matched seeds and budget. Reconcile no-gate AD .096±.007 here and .124±.008 in the ablation via run IDs. Method AD↓ Clean–perturbed ARI↑ VI↓ Co-assignment error↓ GCN .151±.012 .817±.021 .494±.041 .113±.010 GAT .137±.011 .836±.019 .451±.038 .101±.009 V-GNN .118±.009 .858±.018 .398±.035 .087±.008 SFB-GNN .087±.006 .902±.015 .286±.029 .061±.006

Factor AD at first setting AD at second setting Nominal K 5: .091±.007 10: .118±.010 Sizes Balanced: .087±.006 Imbalanced: .102±.009 Mean degree 20: .094±.008 10: .126±.011

Stratify AD, VI and ARI by occupied count and Keff=exp⁡(−∑kpklog⁡pk)K_{\rm eff}=\exp(-\sum_k p_k\log p_k), with pkp_k the occupancy fraction. Report clean quality to detect collapse. 7. W6. Figure 2 uses λ2=.15,.30,.45\lambda_2=.15,.30,.45. Compare treatments on the same graph, signal, perturbation, node order and scale within each regime. Distinguish λ2\lambda_2 from λK+1−λK\lambda_{K+1}-\lambda_K. Separation GCN GAT V-GNN SFB-GNN AD reduction vs V-GNN Weak .30 .27 .25 .20 .05 Moderate .23 .21 .20 .16 .04 Strong .17 .15 .14 .12 .02

  1. W7. Figure 4(b) reaches about 31. The normalized spectrum lies in [0,2][0,2]. Regenerate using the normalized operator. Label D−AD-A if shown. Figure 4(a) should use a common basis and distinguish amplitudes from energy.

Dear Authors,

Thank you for your detailed response. Here is my take on them.

W1: The corrected recurrence is sound. Your derivation presents a proposed two-pass schedule, but you explicitly state, "The reported gate schedule needs verification." It is still not established whether it applies to your actual reported implementation.

W2: Again, the newly proposed actual maximum response is mathematically more sensible than the paper's stated eq 3, but it needs experiments to establish itself.

A similar trend is visible in all the responses.

Again, all the modifications that you are suggesting in the rebuttal are stronger proposals, but what you are doing is essentially completely remaking the whole paper (you can't propose a completely new paper in the rebuttal; you have to defend the submitted one). To establish all your claims, you need to redo the whole suite of experiments with the new terms.

I therefore encourage you to properly experiment with the newly developed stronger ideas and submit it to the next conference.

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

Related papers

Loading the map…

Discussion (0)

Sign in to comment.