A multidisciplinary journal that focuses on public health and technology, public health informatics, mass media campaigns, surveillance, and innovation in public health practice and research. Also dedicated to rapid open data sharing during epidemics.
Graph Neural Networks (GNNs) often suffer from degree bias in node classification tasks, where prediction performance varies across nodes with different degrees. Several approaches, which adopt Graph Contrastive Learning (GCL), have been proposed to mitigate this bias. However, the limited number of positive pairs and the equal weighting of all positives and negatives in GCL still lead to low-degree nodes acquiring insufficient and noisy information. This paper proposes the Hardness Adaptive Reweighted (HAR) contrastive loss to mitigate degree bias. It adds more positive pairs by leveraging node labels and adaptively weights positive and negative pairs based on their learning hardness. In addition, we develop an experimental framework named SHARP extending HAR to a broader range of scenarios. Both our theoretical analysis and experiments validate the effectiveness of SHARP. Across four datasets, SHARP outperforms baselines in 14 of 16 settings, improving global accuracy on Cora by 3.6% and 4.2% under the GCN and GAT backbones, while at the degree level it raises accuracy for the lowest-degree nodes by over 10%, confirming that the gains are targeted at the low-degree nodes most affected by degree bias.
In a team of multiple agents, the pursuance of a common goal is a defining characteristic. Since agents may have different capabilities, and effects of actions may be uncertain, a common goal can generally only be achieved through a careful cooperation between the different agents. In this work, we propose a novel two-stage planner that combines online planning at both team level and individual level through a subgoal delegation scheme. The proposal brings the advantages of online planning approaches to the multi-agent setting. A number of modifications are made to a classical UCT approximate algorithm to (i) adapt it to the application domains considered, (ii) reduce the branching factor in the underlying search process, and (iii) effectively manage uncertain information of action effects by using information fusion mechanisms. The proposed online multi-agent planner reduces the cost of planning and decreases the temporal cost of reaching a goal, while significantly increasing the chance of success of achieving the common goal.
20 April 2026 in Information and Software Technology