1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
|
#!/usr/bin/env python3
"""H15 WikiCS paper-setup depth sweep — Wikipedia academic articles.
~11.7K nodes, avg deg ~4.1, 10-class, undirected. Sparse + few-class
fits KAFT's regime profile. Test BP vs KAFT at L ∈ {3,5,10,14,20} × 5 seeds.
"""
import sys, time
import numpy as np
import torch
import torch.nn as nn
import torch.nn.functional as F
from torch_geometric.datasets import WikiCS
from torch_geometric.nn import GCNConv
from torch_geometric.utils import add_self_loops, degree, to_undirected
sys.path.insert(0, '/home/yurenh2/graph-grape')
from src.trainers import KAFTTrainer
device = torch.device('cuda:0') # CUDA_VISIBLE_DEVICES=2 maps cuda:0 → physical GPU 2
def build_A_hat(edge_index, N):
edge_index, _ = add_self_loops(edge_index, num_nodes=N)
row, col = edge_index
deg = degree(row, num_nodes=N, dtype=torch.float)
dis = deg.pow(-0.5); dis[dis == float('inf')] = 0
return torch.sparse_coo_tensor(edge_index, dis[row]*dis[col], (N, N)).coalesce()
def build_row_norm(edge_index, N):
ei, _ = add_self_loops(edge_index, num_nodes=N)
row, col = ei
deg = degree(row, num_nodes=N, dtype=torch.float).clamp(min=1)
A_row = torch.sparse_coo_tensor(ei, 1.0/deg[row], (N,N)).coalesce()
A_row_T = torch.sparse_coo_tensor(ei.flip(0), 1.0/deg[col], (N,N)).coalesce()
return A_row, A_row_T
def paper_split(N, y, seed, train_frac=0.05, n_val=500):
g = torch.Generator().manual_seed(seed)
train_mask = torch.zeros(N, dtype=torch.bool)
val_mask = torch.zeros(N, dtype=torch.bool)
test_mask = torch.zeros(N, dtype=torch.bool)
C = int(y.max()) + 1
for c in range(C):
idx = (y == c).nonzero().flatten()
idx = idx[torch.randperm(idx.size(0), generator=g)]
n_tr = max(1, int(round(train_frac * idx.size(0))))
train_mask[idx[:n_tr]] = True
remaining = (~train_mask).nonzero().flatten()
remaining = remaining[torch.randperm(remaining.size(0), generator=g)]
val_mask[remaining[:n_val]] = True
test_mask[remaining[n_val:]] = True
return train_mask, val_mask, test_mask
class GCN(nn.Module):
def __init__(self, in_dim, hidden, out_dim, L):
super().__init__()
self.convs = nn.ModuleList([GCNConv(in_dim if i==0 else hidden,
hidden if i<L-1 else out_dim) for i in range(L)])
def forward(self, x, ei):
for l, c in enumerate(self.convs):
x = c(x, ei)
if l < len(self.convs)-1:
x = F.relu(x)
return x
def bp_one(L, seed, d, tm, vm, tem, epochs=200, lr=0.01, hidden=64):
torch.manual_seed(seed); np.random.seed(seed); torch.cuda.manual_seed_all(seed)
m = GCN(d.x.shape[1], hidden, int(d.y.max())+1, L).to(device)
opt = torch.optim.Adam(m.parameters(), lr=lr, weight_decay=5e-4)
@torch.no_grad()
def ev(mask):
m.eval()
out = m(d.x.float(), d.edge_index)
return (out[mask].argmax(1) == d.y[mask]).float().mean().item()
bv = bt = 0
for ep in range(epochs):
m.train()
out = m(d.x.float(), d.edge_index)
loss = F.cross_entropy(out[tm], d.y[tm])
opt.zero_grad(); loss.backward(); opt.step()
if ep % 5 == 0:
v = ev(vm)
if v > bv: bv, bt = v, ev(tem)
return bt
def kaft_one(L, seed, d, A_hat, A_row, A_row_T, tm, vm, tem,
epochs=200, lr=0.01, hidden=64):
torch.manual_seed(seed); np.random.seed(seed); torch.cuda.manual_seed_all(seed)
data = {
'X': d.x.float(), 'A_hat': A_hat, 'A_row': A_row, 'A_row_T': A_row_T,
'y': d.y, 'train_mask': tm, 'val_mask': vm, 'test_mask': tem,
'num_features': d.x.shape[1], 'num_classes': int(d.y.max())+1,
'num_nodes': d.num_nodes, 'traces': {},
}
trainer = KAFTTrainer(
data=data, hidden_dim=hidden, lr=lr, weight_decay=5e-4,
lr_feedback=0.5, num_probes=64, topo_mode='fixed_A', max_topo_power=3,
diffusion_alpha=0.5, diffusion_iters=10,
num_layers=L, residual_alpha=0.0, backbone='gcn',
use_batchnorm=False, dropout=0.0,
)
trainer.align_mode = 'chain_norm'
bv = bt = 0
for ep in range(epochs):
trainer.train_step()
if ep % 5 == 0:
v = trainer.evaluate('val_mask')
if v > bv: bv, bt = v, trainer.evaluate('test_mask')
return bt
def main():
d = WikiCS(root='/home/yurenh2/graph-grape/data/WikiCS')[0].to(device)
# WikiCS edges already undirected; ensure undirected just in case
d.edge_index = to_undirected(d.edge_index, num_nodes=d.num_nodes)
N = d.num_nodes
A_hat = build_A_hat(d.edge_index, N)
A_row, A_row_T = build_row_norm(d.edge_index, N)
print(f'WikiCS: N={N}, deg={d.edge_index.shape[1]/N:.2f}, C={int(d.y.max())+1}, F={d.x.shape[1]}', flush=True)
seeds = [0, 1, 2, 3, 4]
depths = [3, 5, 10, 14, 20]
for L in depths:
bp_a, gf_a = [], []
for s in seeds:
tm, vm, tem = paper_split(N, d.y.cpu(), s)
tm = tm.to(device); vm = vm.to(device); tem = tem.to(device)
t0 = time.time()
bp = bp_one(L, s, d, tm, vm, tem)
t1 = time.time()
gf = kaft_one(L, s, d, A_hat, A_row, A_row_T, tm, vm, tem)
t2 = time.time()
bp_a.append(bp); gf_a.append(gf)
print(f' L={L} s={s}: BP={bp:.4f}({t1-t0:.0f}s) KAFT={gf:.4f}({t2-t1:.0f}s)', flush=True)
bp_m, bp_sd = np.mean(bp_a), np.std(bp_a)
gf_m, gf_sd = np.mean(gf_a), np.std(gf_a)
print(f'>>> L={L}: BP {bp_m:.4f}±{bp_sd:.4f} KAFT {gf_m:.4f}±{gf_sd:.4f} Δ={gf_m-bp_m:+.3f}', flush=True)
if __name__ == '__main__':
main()
|
