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 "probact a probabilistic activation function for deep neural networks"):
  Abstract: Activation functions play an important role in the training of artificial neural networks and the Rectified Linear Unit (ReLU) has been the mainstream in recent years. Most of the activation functions currently used are deterministic in nature, whose input-output relationship is fixed. In this work, we propose a probabilistic activation function, called ProbAct. The output value of ProbAct is sampled from a normal distribution, with the mean value same as the output of ReLU and with a fixed or trainable variance for each element. In the trainable ProbAct, the variance of the activation distribution is trained through back-propagation. We also show that the stochastic perturbation through ProbAct is a viable generalization technique that can prevent overfitting. In our experiments, we demonstrate that when using ProbAct, it is possible to boost the image classification performance on CIFAR-10, CIFAR-100, and STL-10 datasets.

Includes members:
  Member "a comprehensive guide to bayesian convolutional neural network with variational inference":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a financial service chatbot based on deep bidirectional transformers")
  Member "the quest for the golden activation function":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "soft root sign activation function")
  Member "searching for activation functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "swish a self gated activation function":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "meta learning curiosity algorithms")
  Member "towards robust neural networks via random self ensemble":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "black box smoothing a provable defense for pretrained classifiers")
  Member "noisy activation functions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "refined gate a simple and effective gating mechanism for recurrent units")
  Member "parametric exponential linear unit for deep convolutional neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "soft root sign activation function")
  Member "deep learning in neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "π nets deep polynomial 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)