Feb. 13, 2024, 5:44 a.m. | Dongyue Li Haotian Ju Aneesh Sharma Hongyang R. Zhang

cs.LG updates on arXiv.org arxiv.org

Predicting node labels on a given graph is a widely studied problem with many applications, including community detection and molecular graph prediction. This paper considers predicting multiple node labeling functions on graphs simultaneously and revisits this problem from a multitask learning perspective. For a concrete example, consider overlapping community detection: each community membership is a binary node classification task. Due to complex overlapping patterns, we find that negative transfer is prevalent when we apply naive multitask learning to multiple community …

applications boosting community concrete cs.lg cs.si detection example functions graph graphs labeling labels multiple multitask learning node paper perspective prediction through

Research Scholar (Technical Research)

@ Centre for the Governance of AI | Hybrid; Oxford, UK

HPC Engineer (x/f/m) - DACH

@ Meshcapade GmbH | Remote, Germany

Senior Analytics Engineer (Retail)

@ Lightspeed Commerce | Toronto, Ontario, Canada

Data Scientist II, BIA GPS India Operations

@ Bristol Myers Squibb | Hyderabad

Analytics Engineer

@ Bestpass | Remote

Senior Analyst - Data Management

@ Marsh McLennan | Mumbai - Hiranandani