“Predicting node labels on a given graph is a widely studied problem with many applications. … This paper considers predicting multiple node labeling functions on graphs simultaneously and revisits this problem from a multitask learning perspective. … Due to complex overlapping patterns, we find that negative transfer is prevalent when we apply naive multitask learning to multiple community detection, as task relationships are highly nonlinear across different node labeling. To address the challenge, we develop an algorithm to cluster tasks into groups based on a higher-order task affinity measure.”

Find the paper and full list of authors at ArXiv.