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: "boosting in the presence of label noise"
  Abstract: Boosting is known to be sensitive to label noise. We studied two approaches to improve AdaBoost's robustness against labelling errors. One is to employ a label-noise robust classifier as a base learner, while the other is to modify the AdaBoost algorithm to be more robust. Empirical evaluation shows that a committee of robust classifiers, although converges faster than non label-noise aware AdaBoost, is still susceptible to label noise. However, pairing it with the new robust Boosting algorithm we propose here results in a more resilient algorithm under mislabelling.

Connected through hyperedge HE-1 (induced by source paper "margin maximization as lossless maximal compression"):
  with members:
    - "training behavior of deep neural network in frequency domain"
    - "chaining mutual information and tightening generalization bounds"
    - "information theoretic analysis of generalization capability of learning algorithms"
    - "exploring generalization in deep learning"
    - "computing nonvacuous generalization bounds for deep stochastic neural networks with many more parameters than training data"
    - "opening the black box of deep neural networks via information"
    - "a brief introduction to machine learning for engineers"
    - "deep variational information bottleneck"

Connected through hyperedge HE-2 (induced by source paper "decoupling when to update from how to update"):
  with members:
    - "loss factorization weakly supervised learning and label noise robustness"
    - "attend in groups a weakly supervised deep learning framework for learning from web data"
    - "learning from binary labels with instance dependent corruption"
    - "training convolutional networks with noisy labels"
    - "training deep neural networks on noisy labels with bootstrapping"
    - "identifying mislabeled training data"

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)