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 "sequential vs integrated algorithm selection and configuration a case study for the modular cma es"):
  Abstract: When faced with a specific optimization problem, choosing which algorithm to use is always a tough task. Not only is there a vast variety of algorithms to select from, but these algorithms often are controlled by many hyperparameters, which need to be tuned in order to achieve the best performance possible. Usually, this problem is separated into two parts: algorithm selection and algorithm configuration. With the significant advances made in Machine Learning, however, these problems can be integrated into a combined algorithm selection and hyperparameter optimization task, commonly known as the CASH problem. In this work we compare sequential and integrated algorithm selection and configuration approaches for the case of selecting and tuning the best out of 4608 variants of the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) tested on the Black Box Optimization Benchmark (BBOB) suite. We first show that the ranking of the modular CMA-ES variants depends to a large extent on the quality of the hyperparameters. This implies that even a sequential approach based on complete enumeration of the algorithm space will likely result in sub-optimal solutions. In fact, we show that the integrated approach manages to provide competitive results at a much smaller computational cost. We also compare two different mixed-integer algorithm configuration techniques, called irace and Mixed-Integer Parallel Efficient Global Optimization (MIP-EGO). While we show that the two methods differ significantly in their treatment of the exploration-exploitation balance, their overall performances are very similar.

Includes members:
  Member "online selection of cma es variants":
    also connected through other hyperedges:
      (none)
  Member "automated algorithm selection survey and perspectives":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online preselection with context information under the plackett luce model")
  Member "iohprofiler a benchmarking and profiling tool for iterative optimization heuristics":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "benchmarking discrete optimization heuristics with iohprofiler")
  Member "pitfalls and best practices in algorithm configuration":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimizer benchmarking needs to account for hyperparameter tuning")
  Member "efficient hyperparameter optimization and infinitely many armed bandits":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "hyperband a novel bandit based approach to hyperparameter optimization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "evolving the structure of evolution strategies":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "benchmarking discrete optimization heuristics with iohprofiler")
  Member "coco performance assessment":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "benchmarking discrete optimization heuristics with iohprofiler")

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)