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 "reinforcement learning with chromatic networks"):
  Abstract: We present a neural architecture search algorithm to construct compact reinforcement learning (RL) policies, by combining ENAS and ES in a highly scalable and intuitive way. By defining the combinatorial search space of NAS to be the set of different edge-partitionings (colorings) into same-weight classes, we represent compact architectures via efficient learned edge-partitionings. For several RL tasks, we manage to learn colorings translating to effective policies parameterized by as few as $17$ weight parameters, providing >90% compression over vanilla policies and 6x compression over state-of-the-art compact policies based on Toeplitz matrices, while still maintaining good reward. We believe that our work is one of the first attempts to propose a rigorous approach to training structured neural network architectures for RL problems that are of interest especially in mobile robotics with limited storage and computational resources.

Includes members:
  Member "weight agnostic neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "meta learning curiosity algorithms")
  Member "exploring randomly wired neural networks for image recognition":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "automl zero evolving machine learning algorithms from scratch")
  Member "learning sparse networks using targeted dropout":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "neural network compression framework for fast model inference")
  Member "policies modulating trajectory generators":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multiplicative controller fusion a hybrid navigation strategy for deployment in unknown environments")
  Member "structured evolution with compact architectures for scalable policy optimization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "effective diversity in population based reinforcement learning")
  Member "simple random search provides a competitive approach to reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "the lottery ticket hypothesis finding sparse trainable neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lossless compression of deep neural networks")
  Member "playing atari with six neurons":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "neuroevolution of self interpretable agents")

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)