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 "end to end robustness for sensing reasoning machine learning pipelines"):
  Abstract: As machine learning (ML) being applied to many mission-critical scenarios, certifying ML model robustness becomes increasingly important. Many previous works focuses on the robustness of independent ML and ensemble models, and can only certify a very small magnitude of the adversarial perturbation. In this paper, we take a different viewpoint and improve learning robustness by going beyond independent ML and ensemble models. We aim at promoting the generic Sensing-Reasoning machine learning pipeline which contains both the sensing (e.g. deep neural networks) and reasoning (e.g. Markov logic networks (MLN)) components enriched with domain knowledge. Can domain knowledge help improve learning robustness? Can we formally certify the end-to-end robustness of such an ML pipeline? #R##N#We first theoretically analyze the computational complexity of checking the provable robustness in the reasoning component. We then derive the provable robustness bound for several concrete reasoning components. We show that for reasoning components such as MLN and a specific family of Bayesian networks it is possible to certify the robustness of the whole pipeline even with a large magnitude of perturbation which cannot be certified by existing work. Finally, we conduct extensive real-world experiments on large scale datasets to evaluate the certified robustness for Sensing-Reasoning ML pipelines.

Includes members:
  Member "certified adversarial robustness via randomized smoothing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "overfitting in adversarially robust deep learning")
  Member "joint inference of reward machines and policies for reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "induction of subgoal automata for reinforcement learning")
  Member "improving adversarial robustness via promoting ensemble diversity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "category wise attack transferable adversarial examples for anchor free object detection")
  Member "exploiting excessive invariance caused by norm bounded adversarial robustness":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on adaptive attacks to adversarial example defenses")
  Member "characterizing adversarial examples based on spatial consistency information for semantic segmentation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "anomalous instance detection in deep learning a survey")
  Member "evaluating robustness of neural networks with mixed integer programming":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lossless compression of deep neural networks")
  Member "provable defenses against adversarial examples via the convex outer adversarial polytope":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "overfitting in adversarially robust deep learning")
  Member "compositional falsification of cyber physical systems with machine learning components":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "teaching temporal logics to neural networks")

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)