Skip to content
Discussion options

You must be logged in to vote

I think your adjacency matrix was fixed for each example, right? In this case this simplifies things a lot. You have two options:

  1. Don't make use of global pooling and simply reshape your encoder output to view(batch_size, -1), and reshape in decoder to .view(num_coarsened_nodes * batch_size, -1) again.
  2. Make use of global pooling but make the first transformation in the decoder have different parameters for each node it maps to:
lin = Linear(out_channels, num_coarsened_nodes * out_channels)
x = lin(z).view(num_coarsened_nodes * batch_size, -1)

Replies: 1 comment 13 replies

Comment options

You must be logged in to vote
13 replies
@hkim716
Comment options

@rusty1s
Comment options

@hkim716
Comment options

@hkim716
Comment options

@rusty1s
Comment options

Answer selected by hkim716
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Category
Q&A
Labels
None yet
2 participants