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 "learning to reweight examples for robust deep learning"):
  Abstract: Deep neural networks have been shown to be very powerful modeling tools for many supervised learning tasks involving complex input patterns. However, they can also easily overfit to training set biases and label noises. In addition to various regularizers, example reweighting algorithms are popular solutions to these problems, but they require careful tuning of additional hyperparameters, such as example mining schedules and regularization hyperparameters. In contrast to past reweighting methods, which typically consist of functions of the cost value of each example, in this work we propose a novel meta-learning algorithm that learns to assign weights to training examples based on their gradient directions. To determine the example weights, our method performs a meta gradient descent step on the current mini-batch example weights (which are initialized from zero) to minimize the loss on a clean unbiased validation set. Our proposed method can be easily implemented on any type of deep network, does not require any additional hyperparameter tuning, and achieves impressive performance on class imbalance and corrupted label problems where only a small amount of clean validation data is available.

Includes members:
  Member "understanding short horizon bias in stochastic meta optimization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "using trusted data to train deep networks on labels corrupted by severe noise":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "selective weak supervision for neural information retrieval")
  Member "focal loss for dense object detection":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "object detection in optical remote sensing images a survey and a new benchmark")
  Member "towards poisoning of deep learning algorithms with back gradient optimization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "certified robustness to label flipping attacks via randomized smoothing")
  Member "toward robustness against label noise in training deep discriminative neural networks":
    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 "learning from noisy labels with distillation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "noise estimation using density estimation for self supervised multimodal learning")
  Member "the cityscapes dataset for semantic urban scene understanding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "gan compression efficient architectures for interactive conditional gans")
  Member "learning to learn by gradient descent by gradient descent":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")

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)