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 "genetic algorithms with dnn based trainable crossover as an example of partial specialization of general search"):
  Abstract: Universal induction relies on some general search procedure that is doomed to be inefficient. One possibility to achieve both generality and efficiency is to specialize this procedure w.r.t. any given narrow task. However, complete specialization that implies direct mapping from the task parameters to solutions (discriminative models) without search is not always possible. In this paper, partial specialization of general search is considered in the form of genetic algorithms (GAs) with a specialized crossover operator. We perform a feasibility study of this idea implementing such an operator in the form of a deep feedforward neural network. GAs with trainable crossover operators are compared with the result of complete specialization, which is also represented as a deep neural network. Experimental results show that specialized GAs can be more efficient than both general GAs and discriminative models.

Includes members:
  Member "improvements to inference compilation for probabilistic programming in large scale scientific simulators":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "etalumis bringing probabilistic programming to scientific simulators at scale")
  Member "rl 2 fast reinforcement learning via slow reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "learning to reinforcement learn":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "learning to learn by gradient descent by gradient descent":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "understanding deep learning requires rethinking generalization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "train large then compress rethinking model size for efficient training and inference of transformers")
  Member "programming with a differentiable forth interpreter":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "from statistical relational to neuro symbolic artificial intelligence")
  Member "inference compilation and universal probabilistic programming":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning compositional rules via neural program synthesis")
  Member "neural programmer interpreters":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "meta learning curiosity algorithms")

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)