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: "a meta approach to defend noisy labels by the manifold regularizer psdr"
  Abstract: Noisy labels are ubiquitous in real-world datasets, which poses a challenge for robustly training deep neural networks (DNNs) since DNNs can easily overfit to the noisy labels. Most recent efforts have been devoted to defending noisy labels by discarding noisy samples from the training set or assigning weights to training samples, where the weight associated with a noisy sample is expected to be small. Thereby, these previous efforts result in a waste of samples, especially those assigned with small weights. The input $x$ is always useful regardless of whether its observed label $y$ is clean. To make full use of all samples, we introduce a manifold regularizer, named as Paired Softmax Divergence Regularization (PSDR), to penalize the Kullback-Leibler (KL) divergence between softmax outputs of similar inputs. In particular, similar inputs can be effectively generated by data augmentation. PSDR can be easily implemented on any type of DNNs to improve the robustness against noisy labels. As empirically demonstrated on benchmark datasets, our PSDR impressively improve state-of-the-art results by a significant margin.

Connected through hyperedge HE-1 (induced by source paper "d textbf s 3 l deep self semi supervised learning for image recognition"):
  with members:
    - "small data challenges in big data era a survey of recent progress on unsupervised and semi supervised methods"
    - "s4l self supervised semi supervised learning"
    - "unsupervised label noise modeling and loss correction"
    - "pushing the right boundaries matters wasserstein adversarial training for label noise"
    - "weight standardization"
    - "understanding and utilizing deep neural networks trained with noisy labels"
    - "revisiting self supervised visual representation learning"
    - "high fidelity image generation with fewer labels"

Connected through hyperedge HE-2 (induced by source paper "countering noisy labels by learning from auxiliary clean labels"):
  with members:
    - "unsupervised label noise modeling and loss correction"
    - "pushing the right boundaries matters wasserstein adversarial training for label noise"
    - "weight standardization"
    - "understanding and utilizing deep neural networks trained with noisy labels"
    - "revisiting self supervised visual representation learning"
    - "high fidelity image generation with fewer labels"
    - "group normalization"
    - "there are many consistent explanations of unlabeled data why you should average"

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)