Janossy pooling is a method for neighborhood aggregation that is more powerful than simply taking a sum or mean of the neighbor embeddings. Instead of using a permutation-invariant reduction, Janossy pooling applies a permutation-sensitive function and averages the result over many possible permutations. Let $\pi_{i} \in \Pi$ denote a permutation function that maps the set $\left\{ h_{v}, \forall v \in N(u) \right\}$ to a specific sequence (h_{v1}, h_{v2}, dots, h_{v|N(u)|}){pi{i}}. The Janossy pooling approach performs neighborhood aggregation by: $m_{N(u)} = MLP_{\theta} \left( \frac{1}{|\Pi|} \sum_{\pi_{i} \in \Pi} \rho_{\phi} (h_{v1}, h_{v2}, \dots, h_{v|N(u)|})_{\pi_{i}} \right)$, where $\Pi$ denotes a set of permutations and $\rho_{\phi}$ is a permutation-sensitive function.