Handling noisy data is a persistent issue in machine learning, but it takes on a unique complexity in the context of graph structures. In domains where graph data is prevalent, such as social networks, biological networks, and financial systems, noisy labels can significantly degrade model performance, leading to unreliable predictions. Despite its significance, this problem is not well-explored. This competition will address this gap by investigating graph classification under label noise. We believe it could drive major advancements in both research and real-world applications.
Kaggle Notebook for the Baseline
Our Github Page
The name of the team in the submission Form and in Hugging Face
For the complete set of rules please refer to page Rules
In the Challenge space https://huggingface.co/spaces/examhackaton/GraphClassificationNoisyLabels
Go to "My submissions" in the Menu on the left, and change the name there
We implemented three baselines,
If a team’s solution outperforms the Real baseline, it receives 10 points (provided all other rules are followed).
If it only surpasses the first Baseline, it receives 5 points.
Otherwise, it receives 0 points.
(For the baselines see huggingface Leaderboard)
Therefore, regardless of the score, anyone who submits a solution may take the shortened written exam.
Students who do not submit a solution must take the full written exam.
Participants in the hackathon may still opt to take the full exam, but in that case, they automatically forfeit the points earned from the hackathon.