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 "the quest for the golden activation function"):
  Abstract: Deep Neural Networks have been shown to be beneficial for a variety of tasks, in particular allowing for end-to-end learning and reducing the requirement for manual design decisions. However, still many parameters have to be chosen in advance, also raising the need to optimize them. One important, but often ignored system parameter is the selection of a proper activation function. Thus, in this paper we target to demonstrate the importance of activation functions in general and show that for different tasks different activation functions might be meaningful. To avoid the manual design or selection of activation functions, we build on the idea of genetic algorithms to learn the best activation function for a given task. In addition, we introduce two new activation functions, ELiSH and HardELiSH, which can easily be incorporated in our framework. In this way, we demonstrate for three different image classification benchmarks that different activation functions are learned, also showing improved results compared to typically used baselines.

Includes members:
  Member "evolving deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "automl zero evolving machine learning algorithms from scratch")
  Member "self normalizing neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "soft root sign activation function")
  Member "hierarchical representations for efficient architecture search":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "gan compression efficient architectures for interactive conditional gans")
  Member "searching for activation functions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "evolving parsimonious networks by mixing activation functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "evolutionary construction of convolutional neural networks")
  Member "a genetic programming approach to designing convolutional neural network architectures":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "automl zero evolving machine learning algorithms from scratch")
  Member "identity mappings in deep residual networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "overfitting in adversarially robust deep learning")
  Member "noisy activation functions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "refined gate a simple and effective gating mechanism for recurrent units")

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.NE(Neural and Evolutionary Computing)