human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "improving mae against cce under label noise"):
  Abstract: Label noise is inherent in many deep learning tasks when the training set becomes large. A typical approach to tackle noisy labels is using robust loss functions. Categorical cross entropy (CCE) is a successful loss function in many applications. However, CCE is also notorious for fitting samples with corrupted labels easily. In contrast, mean absolute error (MAE) is noise-tolerant theoretically, but it generally works much worse than CCE in practice. In this work, we have three main points. First, to explain why MAE generally performs much worse than CCE, we introduce a new understanding of them fundamentally by exposing their intrinsic sample weighting schemes from the perspective of every sample's gradient magnitude with respect to logit vector. Consequently, we find that MAE's differentiation degree over training examples is too small so that informative ones cannot contribute enough against the non-informative during training. Therefore, MAE generally underfits training data when noise rate is high. Second, based on our finding, we propose an improved MAE (IMAE), which inherits MAE's good noise-robustness. Moreover, the differentiation degree over training data points is controllable so that IMAE addresses the underfitting problem of MAE. Third, the effectiveness of IMAE against CCE and MAE is evaluated empirically with extensive experiments, which focus on image classification under synthetic corrupted labels and video retrieval under real noisy labels.

Includes members:
  Member "deep metric learning by online soft mining and class aware attention":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "derivative manipulation for general example weighting")
  Member "learning to reweight examples for robust deep learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "noise estimation using density estimation for self supervised multimodal learning")
  Member "generalized cross entropy loss for training deep neural networks with noisy labels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "mutual mean teaching pseudo label refinery for unsupervised domain adaptation on person re identification")
  Member "focal loss for dense object detection":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "object detection in optical remote sensing images a survey and a new benchmark")
  Member "quality aware network for set to set recognition":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "derivative manipulation for general example weighting")
  Member "mentornet learning data driven curriculum for very deep neural networks on corrupted labels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "identifying and compensating for feature deviation in imbalanced deep learning")
  Member "mixup beyond empirical risk minimization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on feature normalization and data augmentation")
  Member "no fuss distance metric learning using proxies":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "opengan open set generative adversarial networks")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.LG(Machine Learning)