- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper tackles the problem of domain adaptation between multi-view graphs sharing the same set of views. The main contribution is frequency alignment between the target and source domains, based on a loss function that aligns the variance frequency distribution of representations from a pair of source and target views. The method outperforms previous methods on two datasets.
Critical strengths
- The presentation of the proposed model is clear. The technical design is also sound.
- The proposed method outperforms prior methods consistently in evaluation results.
Critical weaknesses
- Fig 1a and 1c show a substantial difference in frequency distribution between the two domains. How is the proposed frequency alignment useful in such cases?
- The paper fails to clearly explain how the frequency is defined in Section 1. It's easier to understand as the strength of homophily.
- HGDA's homophily-based domain adaptation also leverages LP/HP/FP features to align the homophily level of source and target representations. The novelty of FAVA compared to HGDA should be clarified.
- The variance alignment uses LP/HP/FP features processed by separate encoders. Do the encoder outputs preserve their variances? Is it valid that Eq 6 captures the distribution between frequency ranges?
Questions for authors
- FP preserves the full frequency spectrum, including LP and HP. The ablation study can include a variant without FP (LP and HP only).
9 comments
Official Comment by Authors (2/4)
W2. The Definition of Frequency and Its Relationship to Homophily
Thank you for highlighting the need to distinguish graph frequency from label homophily.
Graph frequency describes variations of a signal over the graph, whereas label homophily describes agreement between neighboring class labels.
-
(i) Different objects described by frequency and homophily.
Graph frequency and homophily are closely related but describe different objects. Graph frequency describes how a given signal varies relative to the graph structure and is commonly defined through the eigenvectors and eigenvalues of the graph Laplacian. Low frequencies correspond to smoother signal variations, while high frequencies correspond to more pronounced differences between neighboring nodes. Label homophily describes the consistency of class labels between adjacent nodes [B].
-
(ii) Definitions and theoretical connection in UniFilter.
UniFilter defines the homophily ratio as [C, Definition 2.1]
h=\frac{ \left|\left\\{\langle u,v\rangle\in\mathcal{E}: \mathbf{y}_u=\mathbf{y}_v\right\\}\right| }{|\mathcal{E}|}
For a normalized feature signal , its spectral signal frequency is defined as [C, Definition 2.2]
For a connected graph and an optimal polynomial filter for node classification under the corresponding assumptions, Theorem 3.1 states that the filtered signal's spectral frequency is proportional to , where is the homophily ratio [C].
-
(iii) Graph properties and signal distributions in HGDA.
Furthermore, HGDA distinguishes the graph's heterophily distribution from the distributions of different graph signals. Using HGDA's notation, Theorem 1 and Eq. (7) give the following target-risk bound under its PAC-Bayes setting and theoretical assumptions [A, Section 3.3]:
In particular, measures the discrepancy in node heterophily-degree distributions, whereas , , and measure discrepancies in different graph signals. HGDA treats the graph's heterophily distribution and its signal distributions as distinct quantities [A, Section 3.3, Theorem 1]. FAVA accordingly constructs its alignment objective from learned representations of different filtered signals. The distributions of same-label neighbor ratios in Fig. 1 are used to observe the local smoothness of label signals and its view-dependent variation across domains, providing an intuitive diagnostic for this modeling motivation.
-
(iv) Clarification in the manuscript.
We have added the definition of graph frequency and its relationship to homophily to Section 1 (pp. 1–2, lines 52–57).
Official Comment by Authors (3/4)
W3. Novelty Compared with HGDA
Thank you for asking us to clarify FAVA's methodological contribution relative to HGDA.
FAVA targets view-dependent channel-composition shifts and aligns composition vectors across source-target view pairs, rather than channel-wise embedding distributions.
-
(i) Multiview problem setting.
The differences between FAVA and HGDA center on the research problem and the alignment object.
First, HGDA adapts one graph in each domain, whereas FAVA addresses multiview graph domain adaptation and focuses on frequency-related cross-domain shifts that vary across relation views. Different relation views of the same graph have different structures, and the shift within the same relation view can also differ across domains. FAVA therefore considers both domain discrepancies and their dependence on the relation view.
-
(ii) Different alignment objects and view-pair weighting.
Second, HGDA separately applies KL alignment to source- and target-domain node embeddings in the homophilic, heterophilic, and full-pass channels, and sums the three alignment terms [A, Section 4.2, Eq. (11)]. FAVA normalizes the total variances of the three channels within each view into a composition vector that characterizes the relative contributions of the learned representations from different filtering branches. It then performs weighted alignment of these composition vectors over all source-target view pairs. Corresponding views provide direct relation correspondences, while non-corresponding views receive adaptive weights according to composition similarity.
-
(iii) Methodological contribution of FAVA.
Our contribution is to identify view-dependent frequency-related domain shifts in multiview graphs and introduce FAVA, a frequency-aware view alignment framework for MGDA. FAVA constructs a normalized channel-variance composition for each relation view, bringing alignment to the frequency-composition level of individual views. It directly aligns corresponding views and adaptively weights non-corresponding views by composition similarity, addressing view-dependent frequency shifts through composition alignment across all source-target view pairs.
W4. Independent Encoders and the Statistical Meaning of Eq. (6)
Thank you for asking about the statistical meaning of the encoded channel variances.
Eq. (6) characterizes variation across nodes in learned channel representations, and Eq. (7) expresses their contributions to concatenated total variance.
-
(i) Statistical meaning of the encoded variances.
Independent encoders adjust the numerical values and distributions of the input features. Eq. (6) computes the total variance of the encoded node representations to characterize how the current channel representations vary across nodes. Eq. (7) then normalizes the total variances of the three channels to describe each channel's relative contribution to the total variance of the concatenated representation, directly linking the composition statistic to the learned representations used for node classification.
-
(ii) Alignment on learned representations.
Constructing statistical alignment objectives on learned representations has precedents. HGDA aligns channel embeddings obtained after trainable transformations and nonlinear activations [A, Sections 4.1-4.2], while Deep CORAL aligns the covariance of layer activations in nonlinear neural networks [D].
-
(iii) Manuscript clarification and supplementary analyses.
We have clarified this statistical interpretation after Eq. (7) in Section 3.3 (p. 5, lines 243–247). The centered spectral analyses and channel-variance composition comparisons are provided in Appendix L (pp. 29–30, lines 1540–1545) and Appendix J (pp. 25–27, lines 1317–1349), respectively.
Official Comment by Authors (1/4)
We sincerely appreciate your thoughtful and detailed feedback. We address your questions and concerns below and hope that our responses clarify the points raised in your review.
W1. The Role of Frequency Alignment under Large Domain Discrepancies
Thank you for asking us to clarify the role of frequency alignment when domain discrepancies are large.
Large cross-domain differences motivate aligning view-dependent channel compositions in the learned representations used for node classification.
(i) Why the observed shifts motivate adaptation.
The substantial differences in Figs. 1(a) and 1(c) indicate different graph signal patterns in the source and target domains. These differences motivate frequency alignment: reducing their impact on learned representations to facilitate knowledge transfer from the source domain to the target domain.
(ii) Theoretical motivation from signal-discrepancy terms.
This motivation has a related theoretical basis. Using HGDA's notation, Theorem 1 and Eq. (7) in its Section 3.3 give the following target-risk bound under its PAC-Bayes setting and theoretical assumptions [A]:
LT0(ϕ)≤LSγ(ϕ)+λ1[2(DKL(Q∣P)+1)+lnδ1]+4NSλ+2πσNSNTλρCC0[DKL(ASXS∣ATXT)+DKL(XS∣XT)+DKL(LSXS∣LTXT)+DKL(PSH∣PTH)]
Here, DKL(ASXS∣ATXT) quantifies the discrepancy in homophilic signals, DKL(XS∣XT) quantifies the discrepancy in node-attribute signals, and DKL(LSXS∣LTXT) quantifies the discrepancy in heterophilic signals. The separate term DKL(PSH∣PTH) quantifies the discrepancy in the graphs' node heterophily-degree distributions [A, Section 3.3, Theorem 1]. The three signal-discrepancy terms enter the target-risk bound with positive coefficients. With other terms held fixed, larger cross-domain signal discrepancies raise the target-risk upper bound, while reducing these discrepancies tightens it. Thus, even when source-domain classification error is low, substantial signal-distribution discrepancies can keep the target-risk upper bound high. This motivates characterizing cross-domain shifts in homophilic, heterophilic, and attribute signals separately and reducing the corresponding discrepancies in learned representations.
(iii) The alignment object in FAVA.
FAVA further considers the dependence of these discrepancies on relation views. Fig. 1 is used to observe cross-domain shifts across views. During training, the learned LP, HP, and FP representations of each view form a normalized channel-variance vector, and FAVA reduces cross-domain discrepancies in this composition statistic through weighted alignment of source-target view pairs (Section 3.3, p. 5, lines 248–269). Thus, the substantial differences in the figure provide a direct motivation for adaptation, while composition alignment implements this motivation in the learned representations used for node classification.