Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Relation Graph Alignment for Learning with Noisy Labels

View through CrossRef
Abstract Noisy label learning is crucial for improving model performance on datasets with unreliable labels, which enables models to better tolerate inaccurate data. Existing methods either focus on optimizing the loss function to mitigate the interference from noise, or design procedures to detect potential noise and correct errors. However, their effectiveness is often compromised in representation learning due to the dilemma where models overfit to noisy labels. To address the aforementioned issue, this paper proposes a relation graph alignment framework that models inter-sample relationships via self-supervised learning and employs knowledge distillation to enhance understanding of latent associations, which mitigate the impact of noisy labels. Specifically, the proposed method, termed RMDNet, includes two main modules, where the relation modeling (RM) module implements the contrastive learning technique to learn representations of all data, an unsupervised approach that effectively eliminates the interference of noisy tags on feature extraction. The relation-guided representation learning (RGRL) module utilizes inter-sample relation learned from the RM module to calibrate the representation distribution for noisy samples, which is capable of improving the generalization of the model in the inference phase. Notably, the proposed RMDNet is a plug-and-play framework that can integrate multiple methods to its advantage. The RMDNet can achieve a performance improvement of 1% to 8% when combined with existing methods and learn discriminative representations for noisy data, which results in superior performance than the existing methods.
Title: Relation Graph Alignment for Learning with Noisy Labels
Description:
Abstract Noisy label learning is crucial for improving model performance on datasets with unreliable labels, which enables models to better tolerate inaccurate data.
Existing methods either focus on optimizing the loss function to mitigate the interference from noise, or design procedures to detect potential noise and correct errors.
However, their effectiveness is often compromised in representation learning due to the dilemma where models overfit to noisy labels.
To address the aforementioned issue, this paper proposes a relation graph alignment framework that models inter-sample relationships via self-supervised learning and employs knowledge distillation to enhance understanding of latent associations, which mitigate the impact of noisy labels.
Specifically, the proposed method, termed RMDNet, includes two main modules, where the relation modeling (RM) module implements the contrastive learning technique to learn representations of all data, an unsupervised approach that effectively eliminates the interference of noisy tags on feature extraction.
The relation-guided representation learning (RGRL) module utilizes inter-sample relation learned from the RM module to calibrate the representation distribution for noisy samples, which is capable of improving the generalization of the model in the inference phase.
Notably, the proposed RMDNet is a plug-and-play framework that can integrate multiple methods to its advantage.
The RMDNet can achieve a performance improvement of 1% to 8% when combined with existing methods and learn discriminative representations for noisy data, which results in superior performance than the existing methods.

Related Results

Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract Accurately predicting drug sensitivity and understanding what is driving it are major challenges in drug discovery. Graphs are a natural framework for captu...
Research on the design of teaching aid resource system based on unsupervised representation learning
Research on the design of teaching aid resource system based on unsupervised representation learning
In the absence of manual annotation information, using only the topology information of the graph to achieve unsupervised graph alignment has always been one of the important chall...
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
“I rarely read the label”: Factors that Influence Thai Consumer Responses to Nutrition Labels
“I rarely read the label”: Factors that Influence Thai Consumer Responses to Nutrition Labels
<p><strong>BACKGROUND: </strong>This qualitative study employed the Knowledge-Attitude-Behaviour (KAB) model and Health Belief Model (HBM) to investigate factors ...
Multiple Instance Choquet Integral for multiresolution sensor fusion
Multiple Instance Choquet Integral for multiresolution sensor fusion
Imagine you are traveling to Columbia, MO for the first time. On your flight to Columbia, the woman sitting next to you recommended a bakery by a large park with a big yellow umbre...
The Complexity of Pencil Graph and Line Pencil Graph
The Complexity of Pencil Graph and Line Pencil Graph
Let ???? be a linked and undirected graph. Every linked graph ???? must contain a spanning tree ????, which is a subgraph of ????that is a tree and contain all the nodes of ????. T...
Drug–target affinity prediction with extended graph learning-convolutional networks
Drug–target affinity prediction with extended graph learning-convolutional networks
Abstract Background High-performance computing plays a pivotal role in computer-aided drug design, a field that holds significant promise in pharmac...

Back to Top