Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Gangfeng Hu

dblp:413/4268 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Trustworthy machine learning · 75% Learning theory · 13% Deep learning architectures and training · 12%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
learning with noisy labels
1.922026
Variation-Bounded Loss for Noise-Tolerant Learning · AAAI 2026
Joint Asymmetric Loss for Learning with Noisy Labels · ICCV 2025
Machine learning › Trustworthy machine learning › robustness › robust learning
robust loss functions
1.922026
Variation-Bounded Loss for Noise-Tolerant Learning · AAAI 2026
Joint Asymmetric Loss for Learning with Noisy Labels · ICCV 2025
Machine learning › Trustworthy machine learning
robustness
1.922026
Variation-Bounded Loss for Noise-Tolerant Learning · AAAI 2026
Joint Asymmetric Loss for Learning with Noisy Labels · ICCV 2025
Machine learning › Learning theory
loss function
1.012026
Variation-Bounded Loss for Noise-Tolerant Learning · AAAI 2026
Machine learning › Deep learning architectures and training › loss function design
asymmetric loss
0.912025
Joint Asymmetric Loss for Learning with Noisy Labels · ICCV 2025

Methods — techniques the papers use, named apart from their topics

variation ratio · 1.0symmetric condition · 1.0asymmetric condition · 1.0asymmetric mean square error · 0.9active passive loss · 0.9
YearPublicationVenuePosition
2026 Variation-Bounded Loss for Noise-Tolerant Learning
abstract
Mitigating the negative impact of noisy labels has been a perennial issue in supervised learning. Robust loss functions have emerged as a prevalent solution to this problem. In this work, we introduce the Variation Ratio as a novel property related to the robustness of loss functions, and propose a new family of robust loss functions, termed Variation-Bounded Loss (VBL), which is characterized by a bounded variation ratio. We provide theoretical analyses of the variation radio, proving that a smaller variation ratio would lead to better robustness. Furthermore, we reveal that the variation ratio provides a feasible method to relax the symmetric condition and offers a more concise path to achieve the asymmetric condition. Based on the variation ratio, we reformulate several commonly used loss functions into a variation-bounded form for pract ical applications. Positive experiments on various datasets exhibit the effectiveness and flexibility of our approach.
Jialiang Wang 0003, Xianming Liu 0005, Gangfeng Hu, Deming Zhai, Junjun Jiang, Haoliang Li
AAAI4
2025 Joint Asymmetric Loss for Learning with Noisy Labels
abstract
Learning with noisy labels is a crucial task for training accurate deep neural networks. To mitigate label noise, prior studies have proposed various robust loss functions, particularly symmetric losses. Nevertheless, symmetric losses usually suffer from the underfitting issue due to the overly strict constraint. To address this problem, the Active Passive Loss (APL) jointly optimizes an active and a passive loss to mutually enhance the overall fitting ability. Within APL, symmetric losses have been successfully extended, yielding advanced robust loss functions. Despite these advancements, emerging theoretical analyses indicate that asymmetric losses, a new class of robust loss functions, possess superior properties compared to symmetric losses. However, existing asymmetric losses are not compatible with advanced optimization frameworks such as APL, limiting their potential and applicability. Motivated by this theoretical gap and the prospect of asymmetric losses, we extend the asymmetric loss to the more complex passive loss scenario and propose the Asymetric Mean Square Error (AMSE), a novel asymmetric loss. We rigorously establish the necessary and sufficient condition under which AMSE satisfies the asymmetric condition. By substituting the traditional symmetric passive loss in APL with our proposed AMSE, we introduce a novel robust loss framework termed Joint Asymmetric Loss (JAL). Extensive experiments demonstrate the effectiveness of our method in mitigating label noise. Code available at: https://github.com/cswjl/joint-asymmetric-loss
Jialiang Wang 0003, Xianming Liu 0005, Gangfeng Hu, Deming Zhai, Junjun Jiang, Xiangyang Ji
ICCV4