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 "curriculum loss robust learning and generalization against label corruption"):
  Abstract: Deep neural networks (DNNs) have great expressive power, which can even memorize samples with wrong labels. It is vitally important to reiterate robustness and generalization in DNNs against label corruption. To this end, this paper studies the 0-1 loss, which has a monotonic relationship with an empirical adversary (reweighted) risk~\citep{hu2016does}. Although the 0-1 loss has some robust properties, it is difficult to optimize. To efficiently optimize the 0-1 loss while keeping its robust properties, we propose a very simple and efficient loss, i.e. curriculum loss (CL). Our CL is a tighter upper bound of the 0-1 loss compared with conventional summation based surrogate losses. Moreover, CL can adaptively select samples for model training. As a result, our loss can be deemed as a novel perspective of curriculum sample selection strategy, which bridges a connection between curriculum learning and robust learning. Experimental results on benchmark datasets validate the robustness of the proposed loss.

Includes members:
  Member "marginalized average attentional network for weakly supervised learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "action graphs weakly supervised action localization with graph convolution networks")
  Member "how does disagreement help generalization against label corruption":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "dividemix learning with noisy labels as semi supervised learning")
  Member "joint optimization framework for learning with noisy labels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "noise estimation using density estimation for self supervised multimodal learning")
  Member "dimensionality driven learning with noisy labels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "dividemix learning with noisy labels as semi supervised learning")
  Member "generalized cross entropy loss for training deep neural networks with noisy labels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mutual mean teaching pseudo label refinery for unsupervised domain adaptation on person re identification")
  Member "masking a new perspective of noisy supervision":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "derivative manipulation for general example weighting")
  Member "learning from noisy singly labeled data":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "strength from weakness fast learning using weak supervision")
  Member "mentornet learning data driven curriculum for very deep neural networks on corrupted labels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "identifying and compensating for feature deviation in imbalanced deep learning")

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)