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 adversarially robust representations via worst case mutual information maximization"):
  Abstract: Training machine learning models to be robust against adversarial inputs poses seemingly insurmountable challenges. To better understand model robustness, we consider the underlying problem of learning robust representations. We develop a general definition of representation vulnerability that captures the maximum change of mutual information between the input and output distributions, under the worst-case input distribution perturbation. We prove a theorem that establishes a lower bound on the minimum adversarial risk that can be achieved for any downstream classifier based on this definition. We then propose an unsupervised learning method for obtaining intrinsically robust representations by maximizing the worst-case mutual information between input and output distributions. Experiments on downstream classification tasks and analyses of saliency maps support the robustness of the representations found using unsupervised learning with our training principle.

Includes members:
  Member "an introductory guide to fano s inequality with applications in statistical estimation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the sample complexity of meta sparse regression")
  Member "robust classification using robust feature augmentation":
    also connected through other hyperedges:
      (none)
  Member "extracting robust and accurate features via a robust information bottleneck":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")
  Member "theoretically principled trade off between robustness and accuracy":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "overfitting in adversarially robust deep learning")
  Member "the curse of concentration in robust learning evasion and poisoning attacks from concentration of measure":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "utilizing network properties to detect erroneous inputs")
  Member "a spectral view of adversarially robust features":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secure and robust machine learning for healthcare a survey")
  Member "adversarial spheres":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "utilizing network properties to detect erroneous inputs")
  Member "adversarial vulnerability for any classifier":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "utilizing network properties to detect erroneous inputs")

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)