Fine-Grained Path Augmentation (FGPA)

• FGPA is a framework for graph gradual domain adaptation that constructs intermediate graphs by interpolating source and target domains using the fused Gromov–Wasserstein distance.
• It employs a T-stage self-training regime with confidence weighting to mitigate error accumulation along the optimal geodesic path.
• FGPA integrates with existing graph adaptation methods and demonstrates empirical gains on real-world datasets such as Airport, Citation, and Social graphs.

Fine-Grained Path Augmentation (FGPA) is a framework for graph gradual domain adaptation (GDA), specifically designed to address the challenge of large, non-independent-and-identically-distributed (non-IID) shifts between graph domains. FGPA constructs an optimal sequence of intermediate graphs connecting source and target domains via a geodesic under the Fused Gromov–Wasserstein (FGW) distance and augments self-training with confidence weighting along this interpolated trajectory. This methodology is model-agnostic and compatible with standard graph domain adaptation (graph DA) penalties, enabling robust adaptation in settings where prior approaches assuming mild shifts or given paths are inadequate (2505.12709).

1. Fused Gromov–Wasserstein Distance in Graph Domain Adaptation

FGPA leverages the FGW distance for measuring graph discrepancy. Given attributed graphs $G_0 = (V_0, A_0, X_0)$ and $G_1 = (V_1, A_1, X_1)$, with node-weight histograms $\mu_0 \in \Delta_{|V_0|}$, $\mu_1 \in \Delta_{|V_1|}$, cross-graph feature cost $M(i,j) = \|X_0(i) - X_1(j)\|_{\mathcal{X}}^q$, and adjacency matrices $C_0 = A_0$, $C_1 = A_1$, the FGW distance of order $q$ with trade-off $\alpha$ is: $$d_{\mathrm{FGW};q,\alpha}(G_0, G_1) = \min_{S\in\Pi(\mu_0,\mu_1)} \Bigl[ (1-\alpha)\sum_{i,j} M(i, j) S(i, j) + \alpha \sum_{i,i',j,j'} |C_0(i,i') - C_1(j,j')|^q S(i,j)S(i',j') \Bigr]^{1/q}$$ This formulation unifies node attribute and topological discrepancies and serves as the foundation for quantifying domain shift in the adaptation process. In practical settings, $q=2$ and $\alpha=0.5$ are typical choices (2505.12709).

2. Theoretical Framework and Error Bound in Gradual Adaptation

FGPA follows a $T$-stage self-training regime, denoted by a sequence $H_0 = G_0, H_T = G_1$, where stage $t$ involves adapting model $f_{t-1}$ to $H_t$ using pseudo-labels. Theoretical analysis (Theorem 3.2) shows that, under standard Lipschitz/Hölder conditions on the per-node loss and GNN architecture, the accumulated error on the target domain satisfies: $$\xi(f_T, G_1) \leq \xi(f_0, G_0) + C_\ell \delta T + C \sum_{t=1}^T d_{\mathrm{FGW}}^q(H_{t-1}, H_t)$$ where $\xi(f, G)$ is the empirical risk, $C_\ell$ and $C$ encapsulate model smoothness constants, and $\delta$ bounds self-training error. This decomposition clarifies the trade-off between the number of adaptation stages and both self-training accumulation and the total geodesic length traversed in FGW metric (2505.12709).

3. Construction and Properties of the FGW Geodesic Path

The optimal adaptation path is characterized as the FGW geodesic between $G_0$ and $G_1$. By Jensen’s inequality and the metric properties of FGW, the cumulative discrepancy $\sum_{t=1}^T d_{\mathrm{FGW}}^q(H_{t-1}, H_t)$ is minimized when each $H_t$ lies at $t/T$ along the interpolating curve: $$G(\lambda) = \bigl(V_0 \otimes V_1,\; (1-\lambda)\widetilde{A}_0 + \lambda \widetilde{A}_1,\; (1-\lambda)\widetilde{X}_0 + \lambda \widetilde{X}_1\bigr)$$ for $\lambda \in [0,1]$, where $$\widetilde{A}_0, \widetilde{X}_0, \widetilde{A}_1, \widetilde{X}_1$$ are re-arranged adjacency/features in the product node space via optimal low-rank transformations derived from the FGW optimal coupling. Algorithmically, low-rank optimal transport with Dykstra updates is used to find the coupling, after which intermediate graphs are generated by linear interpolation (2505.12709).

4. Self-Training along the FGW Geodesic with Confidence Modulation

FGPA performs adaptation via self-training on each intermediate graph. At each stage, predictions from $f_{t-1}$ form pseudo-labels for $H_t$. Confidence scores are calculated for each node using normalized entropy: $$\mathrm{conf}(\hat y_i) = \frac{\max_j \mathrm{ent}(\hat y_j) - \mathrm{ent}(\hat y_i)} {\max_j \mathrm{ent}(\hat y_j) - \min_j \mathrm{ent}(\hat y_j)}$$ where $\mathrm{ent}(\cdot)$ denotes Shannon entropy. These confidences are employed to down-weight noisy predictions in the stage-wise supervised loss: $$f_t = \arg\min_f \sum_{u \in V(H_t)} \mathrm{conf}(\hat y_u) \; \ell(f(H_t)_u, \hat y_u)$$ This denoising mechanism counteracts self-training noise accumulation inherent in GDA (2505.12709).

5. Integration with Existing Graph DA Workflows

FGPA is orthogonal to specific domain adaptation loss choices and can be used in conjunction with existing graph DA techniques such as MMD, CORAL, AdaGCN, GRADE, StruRW, adversarial or spectral regularizations. The total loss at each stage can incorporate an arbitrary graph DA penalty: $$L_{\rm total} = \ell_{\rm selftrain}(f_t; H_t) + \lambda L_{\rm DA}(f_t; H_t, H_{t-1})$$ FGPA thus serves as a path augmentation module, enhancing any base DA method with fine-grained geodesic trajectory information, rather than altering the adaptation loss structure itself. This modularity is a distinguishing feature of the approach (2505.12709).

6. Empirical Evaluation and Results

FGPA has been evaluated on diverse datasets, including real-world graphs—Airport (USA⇄Europe⇄Brazil), Citation (ACM⇄DBLP), Social (Blog1⇄Blog2)—and synthetic contextual SBMs with controlled shifts. Backbone architectures include 2–3 layer GCNs or APPNP with hidden dimensions 8–16. Standard adaptation baselines (ERM, MMD, CORAL, AdaGCN, GRADE, StruRW) serve as comparators.

Key experimental settings and results:

Dataset	Average Gain (pp)	Max Gain (pp)	Synthetic Gain (pp)
Airport	+6.8	+26.3	—
Social	+3.6	—	—
Citation	+3.4	—	—
CSBM (synthetic)	—	—	+36.5

• Geodesic path construction: $T=3$ intermediate graphs, $q=2$, $\alpha=0.5$, low-rank OT of rank $r = 0.25|V|$.
• Training: Adam optimizer, learning rate $5 \times 10^{-2}$, 1000 epochs, 5 random seeds.

FGPA improved node classification accuracy over direct adaptation (one-shot baseline) in over 90% of real-world domain adaptation tasks, with worst-case degradation under 2.6 percentage points in cases of mild shift (2505.12709).

7. Practical Implications and Future Directions

FGPA establishes a principled framework for generating and exploiting intermediate domains in the space of attributed graphs under severe non-IID shifts. By leveraging the optimality properties of the FGW geodesic and the flexibility of confidence-modulated self-training, it addresses robustness issues in graph DA scenarios where traditional metrics and heuristics fail. A plausible implication is the extension of this pipeline to other structured data modalities that admit Gromov–Wasserstein-type interpolations. Further, the plug-and-play compatibility with arbitrary domain adaptation losses supports a modular ecosystem for future graph adaptation research.