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 "meta weight net learning an explicit mapping for sample weighting"):
  Abstract: Current deep neural networks (DNNs) can easily overfit to biased training data with corrupted labels or class imbalance. Sample re-weighting strategy is commonly used to alleviate this issue by designing a weighting function mapping from training loss to sample weight, and then iterating between weight recalculating and classifier updating. Current approaches, however, need manually pre-specify the weighting function as well as its additional hyper-parameters. It makes them fairly hard to be generally applied in practice due to the significant variation of proper weighting schemes relying on the investigated problem and training data. To address this issue, we propose a method capable of adaptively learning an explicit weighting function directly from data. The weighting function is an MLP with one hidden layer, constituting a universal approximator to almost any continuous functions, making the method able to fit a wide range of weighting functions including those assumed in conventional research. Guided by a small amount of unbiased meta-data, the parameters of the weighting function can be finely updated simultaneously with the learning process of the classifiers. Synthetic and real experiments substantiate the capability of our method for achieving proper weighting functions in class imbalance and noisy label cases, fully complying with the common settings in traditional methods, and more complicated scenarios beyond conventional cases. This naturally leads to its better accuracy than other state-of-the-art methods.

Includes members:
  Member "class balanced loss based on effective number of samples":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "identifying and compensating for feature deviation in imbalanced deep learning")
  Member "large scale fine grained categorization and domain specific transfer learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rethinking the hyperparameters for fine tuning")
  Member "reptile a scalable metalearning algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "unsupervised domain adaptive object detection using forward backward cyclic adaptation")
  Member "gradient agreement as an optimization objective for meta learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "push the student to learn right progressive gradient correcting by meta learner on corrupted labels")
  Member "joint optimization framework for learning with noisy labels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "dividemix learning with noisy labels as semi supervised learning")
  Member "learning to reweight examples for robust deep learning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-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)