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 "no regret sample selection with noisy labels"):
  Abstract: Deep Neural Network (DNN) suffers from noisy labeled data because of the heavily overfitting risk. To avoid the risk, in this paper, we propose a novel sample selection framework for learning noisy samples. The core idea is to employ a "regret" minimization approach. The proposed sample selection method adaptively selects a subset of noisy-labeled training samples to minimize the regret to select noise samples. The algorithm efficiently works and performs with theoretical support. Moreover, unlike the typical approaches, the algorithm does not require any side information or learning information depending on the training settings of DNN. The experimental results demonstrate that the proposed method improves the performance of a black-box DNN with noisy labeled data.

Includes members:
  Member "introduction to online convex optimization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "beyond ucb optimal and efficient contextual bandits with regression oracles")
  Member "nlnl negative learning for noisy labels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "learning from web data with self organizing memory module")
  Member "mobilenetv2 inverted residuals and linear bottlenecks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "joint optimization framework for learning with noisy labels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "noise estimation using density estimation for self supervised multimodal learning")
  Member "not all samples are created equal deep learning with importance sampling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "investigating the compositional structure of deep neural networks")
  Member "generalized cross entropy loss for training deep neural networks with noisy labels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mutual mean teaching pseudo label refinery for unsupervised domain adaptation on person re identification")
  Member "a semi supervised two stage approach to learning from noisy labels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "dividemix learning with noisy labels as semi supervised learning")
  Member "learning from noisy large scale datasets with minimal supervision":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "mutual mean teaching pseudo label refinery for unsupervised domain adaptation on person re identification")

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)