Matching, a task to optimally assign limited resources under constraints, is a fundamental
technology for society. The task potentially has various objectives, conditions, and
constraints; however, the efficient neural network architecture for matching is underexplored.
This paper proposes a novel graph neural network (GNN),\textit {WeaveNet}, designed for
bipartite graphs. Since a bipartite graph is generally dense, general GNN architectures lose
node-wise information by over-smoothing when deeply stacked. Such a phenomenon is …

WeaveNet for Approximating Two-sided Matching Problems. | CiNii Research … WeaveNet
for Approximating Two-sided Matching Problems. … タイトル WeaveNet for Approximating
Two-sided Matching Problems. …