paper-with-me

Papers

InLINE: Inner-Layer Information Exchange for Multi-task Learning on Heterogeneous Graphs

2024-10-29 · Xinyue Feng, Jinquan Hang, Yuequn Zhang, Haotian Wang, Desheng Zhang, Guang Wang

Heterogeneous graph is an important structure for modeling complex relational data in real-world scenarios and usually involves various node prediction tasks within a single graph. Training these tasks separately may neglect beneficial information sharing, hence a preferred way is to learn several tasks in a same model by Multi-Task Learning (MTL). However, MTL introduces the issue of negative transfer, where the training of different tasks interferes with each other as they may focus on different information from the data, resulting in suboptimal performance. To solve the issue, existing MTL methods use separate backbones for each task, then selectively exchange beneficial features through interactions among the output embeddings from each layer of different backbones, which we refer to as outer-layer exchange. However, the negative transfer in heterogeneous graphs arises not simply from the varying importance of an individual node feature across tasks, but also from the varying importance of inter-relation between two nodes across tasks. These inter-relations are entangled in the output embedding, making it difficult for existing methods to discriminate beneficial information from the embedding. To address this challenge, we propose the Inner-Layer Information Exchange (InLINE) model that facilitate fine-grained information exchanges within each graph layer rather than through output embeddings. Specifically, InLINE consists of (1) Structure Disentangled Experts for layer-wise structure disentanglement, (2) Structure Disentangled Gates for assigning disentangled information to different tasks. Evaluations on two public datasets and a large industry dataset show that our model effectively alleviates the significant performance drop on specific tasks caused by negative transfer, improving Macro F1 by 6.3% on DBLP dataset and AUC by 3.6% on the industry dataset compared to SoA methods.

📄 PDF Abstract BibTeX arXiv:2410.22089

Code (0)

등록된 구현이 없습니다.

Tasks

DisentanglementMulti-Task Learning

Methods 이 논문이 사용한 방법론

Focus 설명 없음

Similar Papers 제목 키워드 기반

Oppressed species can form a winning pair in a multi-species ecosystem

2022-12-06 · Attila Szolnoki, Matjaz Perc

The self-protection of alliances against external invaders is a key concept behind the maintenance of biodiversity in the face of natural selection. But since these alliances, which can be formed by different numbers of …

FormMORPH

Super Interaction Neural Network

2019-05-29 · Yang Yao, Xu Zhang, Baile Xu, Furao Shen 외

Recent studies have demonstrated that the convolutional networks heavily rely on the quality and quantity of generated features. However, in lightweight networks, there are limited available feature information because t…

HiFi-KPI: A Dataset for Hierarchical KPI Extraction from Earnings Filings

2025-02-21 · Rasmus Aavang, Giovanni Rizzi, Rasmus Bøggild, Alexandre Iolov 외

The U.S. Securities and Exchange Commission (SEC) requires that public companies file financial reports tagging numbers with the machine readable inline eXtensible Business Reporting Language (iXBRL) standard. However, t…

Full interpretable machine learning in 2D with inline coordinates

2021-06-14 · Boris Kovalerchuk, Hoang Phan

This paper proposed a new methodology for machine learning in 2-dimensional space (2-D ML) in inline coordinates. It is a full machine learning approach that does not require to deal with n-dimensional data in n-dimensio…

BIG-bench Machine LearningInterpretable Machine Learning

Inline Critic Steers Image Editing

2026-05-12 · Weitai Kang, Xiaohang Zhan, Yizhou Wang, Mang Tik Chiu 외 arxiv

Instruction-based image editing exhibits heterogeneous difficulty not only across cases but also across regions of an image, motivating refinement approaches that allocate correction to where the model struggles. Existin…

Image Editing