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 "guided evolutionary strategies augmenting random search with surrogate gradients"):
  Abstract: Many applications in machine learning require optimizing a function whose true gradient is unknown, but where surrogate gradient information (directions that may be correlated with, but not necessarily identical to, the true gradient) is available instead. This arises when an approximate gradient is easier to compute than the full gradient (e.g. in meta-learning or unrolled optimization), or when a true gradient is intractable and is replaced with a surrogate (e.g. in certain reinforcement learning applications, or when using synthetic gradients). We propose Guided Evolutionary Strategies, a method for optimally using surrogate gradient directions along with random search. We define a search distribution for evolutionary strategies that is elongated along a guiding subspace spanned by the surrogate gradients. This allows us to estimate a descent direction which can then be passed to a first-order optimizer. We analytically and numerically characterize the tradeoffs that result from tuning how strongly the search distribution is stretched along the guiding subspace, and we use this to derive a setting of the hyperparameters that works well across problems. Finally, we apply our method to example problems, demonstrating an improvement over both standard evolutionary strategies and first-order methods (that directly follow the surrogate gradient). We provide a demo of Guided ES at this https URL

Includes members:
  Member "structured evolution with compact architectures for scalable policy optimization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "effective diversity in population based reinforcement learning")
  Member "understanding short horizon bias in stochastic meta optimization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "simple random search provides a competitive approach to reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "cem rl combining evolutionary and gradient based methods for policy search":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "effective diversity in population based reinforcement learning")
  Member "evolved policy gradients":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "meta learning curiosity algorithms")
  Member "rebar low variance unbiased gradient estimates for discrete latent variable models":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "inverse graphics gan learning to generate 3d shapes from unstructured 2d data")
  Member "online learning rate adaptation with hypergradient descent":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "is the meta learning idea able to improve the generalization of deep neural networks on the standard supervised learning")
  Member "safe mutations for deep and recurrent neural networks through output gradients":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "improving deep neuroevolution via deep innovation protection")

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)