dmlc--dgl
44089c8b4d
* Merge * [Graph][CUDA] Graph on GPU and many refactoring (#1791) * change edge_ids behavior and C++ impl * fix unittests; remove utils.Index in edge_id * pass mx and th tests * pass tf test * add aten::Scatter_ * Add nonzero; impl CSRGetDataAndIndices/CSRSliceMatrix * CSRGetData and CSRGetDataAndIndices passed tests * CSRSliceMatrix basic tests * fix bug in empty slice * CUDA CSRHasDuplicate * has_node; has_edge_between * predecessors, successors * deprecate send/recv; fix send_and_recv * deprecate send/recv; fix send_and_recv * in_edges; out_edges; all_edges; apply_edges * in deg/out deg * subgraph/edge_subgraph * adj * in_subgraph/out_subgraph * sample neighbors * set/get_n/e_repr * wip: working on refactoring all idtypes * pass ndata/edata tests on gpu * fix * stash * workaround nonzero issue * stash * nx conversion * test_hetero_basics except update routines * test_update_routines * test_hetero_basics for pytorch * more fixes * WIP: flatten graph * wip: flatten * test_flatten * test_to_device * fix bug in to_homo * fix bug in CSRSliceMatrix * pass subgraph test * fix send_and_recv * fix filter * test_heterograph * passed all pytorch tests * fix mx unittest * fix pytorch test_nn * fix all unittests for PyTorch * passed all mxnet tests * lint * fix tf nn test * pass all tf tests * lint * lint * change deprecation * try fix compile * lint * update METIDS * fix utest * fix * fix utests * try debug * revert * small fix * fix utests * upd * upd * upd * fix * upd * upd * upd * upd * upd * trigger * +1s * [kernel] Use heterograph index instead of unitgraph index (#1813) * upd * upd * upd * fix * upd * upd * upd * upd * upd * trigger * +1s * [Graph] Mutation for Heterograph (#1818) * mutation add_nodes and add_edges * Add support for remove_edges, remove_nodes, add_selfloop, remove_selfloop * Fix Co-authored-by: Ubuntu <ubuntu@ip-172-31-51-214.ec2.internal> * upd * upd * upd * fix * [Transfom] Mutable transform (#1833) * add nodesy * All three * Fix * lint * Add some test case * Fix * Fix * Fix * Fix * Fix * Fix * fix * triger * Fix * fix Co-authored-by: Ubuntu <ubuntu@ip-172-31-51-214.ec2.internal> * [Graph] Migrate Batch & Readout module to heterograph (#1836) * dgl.batch * unbatch * fix to device * reduce readout; segment reduce * change batch_num_nodes|edges to function * reduce readout/ softmax * broadcast * topk * fix * fix tf and mx * fix some ci * fix batch but unbatch differently * new checkk * upd * upd * upd * idtype behavior; code reorg * idtype behavior; code reorg * wip: test_basics * pass test_basics * WIP: from nx/ to nx * missing files * upd * pass test_basics:test_nx_conversion * Fix test * Fix inplace update * WIP: fixing tests * upd * pass test_transform cpu * pass gpu test_transform * pass test_batched_graph * GPU graph auto cast to int32 * missing file * stash * WIP: rgcn-hetero * Fix two datasety * upd * weird * Fix capsuley * fuck you * fuck matthias * Fix dgmg * fix bug in block degrees; pass rgcn-hetero * rgcn * gat and diffpool fix also fix ppi and tu dataset * Tree LSTM * pointcloud * rrn; wip: sgc * resolve conflicts * upd * sgc and reddit dataset * upd * Fix deepwalk, gindt and gcn * fix datasets and sign * optimization * optimization * upd * upd * Fix GIN * fix bug in add_nodes add_edges; tagcn * adaptive sampling and gcmc * upd * upd * fix geometric * fix * metapath2vec * fix agnn * fix pickling problem of block * fix utests * miss file * linegraph * upd * upd * upd * graphsage * stgcn_wave * fix hgt * on unittests * Fix transformer * Fix HAN * passed pytorch unittests * lint * fix * Fix cluster gcn * cluster-gcn is ready * on fixing block related codes * 2nd order derivative * Revert "2nd order derivative" This reverts commit 523bf6c249bee61b51b1ad1babf42aad4167f206. * passed torch utests again * fix all mxnet unittests * delete some useless tests * pass all tf cpu tests * disable * disable distributed unittest * fix * fix * lint * fix * fix * fix script * fix tutorial * fix apply edges bug * fix 2 basics * fix tutorial Co-authored-by: yzh119 <expye@outlook.com> Co-authored-by: xiang song(charlie.song) <classicxsong@gmail.com> Co-authored-by: Ubuntu <ubuntu@ip-172-31-51-214.ec2.internal> Co-authored-by: Ubuntu <ubuntu@ip-172-31-7-42.us-west-2.compute.internal> Co-authored-by: Ubuntu <ubuntu@ip-172-31-1-5.us-west-2.compute.internal> Co-authored-by: Ubuntu <ubuntu@ip-172-31-68-185.ec2.internal>
75 行
2.7 KiB
Python
75 行
2.7 KiB
Python
import torch.nn as nn
|
|
import torch as th
|
|
import torch.nn.functional as F
|
|
import dgl
|
|
|
|
|
|
class DGLRoutingLayer(nn.Module):
|
|
def __init__(self, in_nodes, out_nodes, f_size, batch_size=0, device='cpu'):
|
|
super(DGLRoutingLayer, self).__init__()
|
|
self.batch_size = batch_size
|
|
self.g = init_graph(in_nodes, out_nodes, f_size, device=device)
|
|
self.in_nodes = in_nodes
|
|
self.out_nodes = out_nodes
|
|
self.in_indx = list(range(in_nodes))
|
|
self.out_indx = list(range(in_nodes, in_nodes + out_nodes))
|
|
self.device = device
|
|
|
|
def forward(self, u_hat, routing_num=1):
|
|
self.g.edata['u_hat'] = u_hat
|
|
batch_size = self.batch_size
|
|
|
|
# step 2 (line 5)
|
|
def cap_message(edges):
|
|
if batch_size:
|
|
return {'m': edges.data['c'].unsqueeze(1) * edges.data['u_hat']}
|
|
else:
|
|
return {'m': edges.data['c'] * edges.data['u_hat']}
|
|
|
|
def cap_reduce(nodes):
|
|
return {'s': th.sum(nodes.mailbox['m'], dim=1)}
|
|
|
|
for r in range(routing_num):
|
|
# step 1 (line 4): normalize over out edges
|
|
edges_b = self.g.edata['b'].view(self.in_nodes, self.out_nodes)
|
|
self.g.edata['c'] = F.softmax(edges_b, dim=1).view(-1, 1)
|
|
|
|
# Execute step 1 & 2
|
|
self.g.update_all(message_func=cap_message, reduce_func=cap_reduce)
|
|
|
|
# step 3 (line 6)
|
|
if self.batch_size:
|
|
self.g.nodes[self.out_indx].data['v'] = squash(self.g.nodes[self.out_indx].data['s'], dim=2)
|
|
else:
|
|
self.g.nodes[self.out_indx].data['v'] = squash(self.g.nodes[self.out_indx].data['s'], dim=1)
|
|
|
|
# step 4 (line 7)
|
|
v = th.cat([self.g.nodes[self.out_indx].data['v']] * self.in_nodes, dim=0)
|
|
if self.batch_size:
|
|
self.g.edata['b'] = self.g.edata['b'] + (self.g.edata['u_hat'] * v).mean(dim=1).sum(dim=1, keepdim=True)
|
|
else:
|
|
self.g.edata['b'] = self.g.edata['b'] + (self.g.edata['u_hat'] * v).sum(dim=1, keepdim=True)
|
|
|
|
|
|
def squash(s, dim=1):
|
|
sq = th.sum(s ** 2, dim=dim, keepdim=True)
|
|
s_norm = th.sqrt(sq)
|
|
s = (sq / (1.0 + sq)) * (s / s_norm)
|
|
return s
|
|
|
|
|
|
def init_graph(in_nodes, out_nodes, f_size, device='cpu'):
|
|
g = dgl.DGLGraph()
|
|
g.set_n_initializer(dgl.frame.zero_initializer)
|
|
all_nodes = in_nodes + out_nodes
|
|
g.add_nodes(all_nodes)
|
|
in_indx = list(range(in_nodes))
|
|
out_indx = list(range(in_nodes, in_nodes + out_nodes))
|
|
# add edges use edge broadcasting
|
|
for u in in_indx:
|
|
g.add_edges(u, out_indx)
|
|
|
|
g = g.to(device)
|
|
g.edata['b'] = th.zeros(in_nodes * out_nodes, 1).to(device)
|
|
return g
|