human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "identifying and compensating for feature deviation in imbalanced deep learning"):
  with members:
    - "a study on action detection in the wild"
    - "simpleshot revisiting nearest neighbor classification for few shot learning"
    - "dynamic curriculum learning for imbalanced data classification"
    - "decoupling representation and classifier for long tailed recognition"
    - "push the student to learn right progressive gradient correcting by meta learner on corrupted labels"
    - "large scale long tailed recognition in an open world"
    - "class balanced loss based on effective number of samples"
    - "large scale fine grained categorization and domain specific transfer learning"

Connected through hyperedge HE-2 (induced by source paper "equalization loss for long tailed object recognition"):
  with members:
    - "lvis a dataset for large vocabulary instance segmentation"
    - "decoupling representation and classifier for long tailed recognition"
    - "large scale long tailed recognition in an open world"
    - "class balanced loss based on effective number of samples"
    - "mask scoring r cnn"
    - "grid r cnn"
    - "the open images dataset v4 unified image classification object detection and visual relationship detection at scale"
    - "exploring the limits of weakly supervised pretraining"

Connected through hyperedge HE-3 (induced by source paper "improving generalization by controlling label noise information in neural network weights"):
  with members:
    - "deep self learning from noisy labels"
    - "simple and effective regularization methods for training on noisily labeled data with generalization guarantee"
    - "where is the information in a deep neural network"
    - "how does disagreement help generalization against label corruption"
    - "unsupervised label noise modeling and loss correction"
    - "meta learning without memorization"
    - "understanding and utilizing deep neural networks trained with noisy labels"
    - "measuring the intrinsic dimension of objective landscapes"

Connected through hyperedge HE-4 (induced by source paper "learning adaptive loss for robust learning with noisy labels"):
  with members:
    - "symmetric cross entropy for robust learning with noisy labels"
    - "curriculum loss robust learning and generalization against label corruption"
    - "addressing the loss metric mismatch with adaptive loss alignment"
    - "l_dmi an information theoretic noise robust loss function"
    - "learning surrogate losses"
    - "robust bi tempered logistic loss based on bregman divergences"
    - "joint optimization framework for learning with noisy labels"
    - "learning to reweight examples for robust deep learning"

Connected through hyperedge HE-5 (induced by source paper "learning imbalanced datasets with label distribution aware margin loss"):
  with members:
    - "diversity in faces"
    - "improved sample complexities for deep networks and robust classification via an all layer margin"
    - "push the student to learn right progressive gradient correcting by meta learner on corrupted labels"
    - "deterministic pac bayesian generalization bounds for deep networks via generalizing noise resilience"
    - "overfitting of neural nets under class imbalance analysis and improvements for segmentation"
    - "large scale long tailed recognition in an open world"
    - "class balanced loss based on effective number of samples"
    - "regularized learning for domain adaptation under label shifts"

Question: Please tell me which class the center node 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)