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 "improving gradient estimation in evolutionary strategies with past descent directions"):
  Abstract: Evolutionary Strategies (ES) are known to be an effective black-box optimization technique for deep neural networks when the true gradients cannot be computed, such as in Reinforcement Learning. We continue a recent line of research that uses surrogate gradients to improve the gradient estimation of ES. We propose a novel method to optimally incorporate surrogate gradient information. Our approach, unlike previous work, needs no information about the quality of the surrogate gradients and is always guaranteed to find a descent direction that is better than the surrogate gradient. This allows to iteratively use the previous gradient estimate as surrogate gradient for the current search point. We theoretically prove that this yields fast convergence to the true gradient for linear functions and show under simplifying assumptions that it significantly improves gradient estimates for general functions. Finally, we evaluate our approach empirically on MNIST and reinforcement learning tasks and show that it considerably improves the gradient estimation of ES at no extra computational cost.

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 "learned optimizers that outperform on wall clock and validation loss":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "generative teaching networks accelerating neural architecture search by learning to generate synthetic training data")
  Member "guided evolutionary strategies augmenting random search with surrogate gradients":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "accelerating reinforcement learning with a directional gaussian smoothing evolution strategy")
  Member "evolved policy gradients":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "meta learning curiosity algorithms")
  Member "recurrent world models facilitate policy evolution":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "the cma evolution strategy a tutorial":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hyper parameter optimization a review of algorithms and applications")
  Member "an overview of gradient descent optimization algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "hyper parameter optimization a review of algorithms and applications")
  Member "adam a method for stochastic optimization":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")

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)