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 "automated machine learning with monte carlo tree search"):
  Abstract: The AutoML task consists of selecting the proper algorithm in a machine learning portfolio, and its hyperparameter values, in order to deliver the best performance on the dataset at hand. Mosaic, a Monte-Carlo tree search (MCTS) based approach, is presented to handle the AutoML hybrid structural and parametric expensive black-box optimization problem. Extensive empirical studies are conducted to independently assess and compare: i) the optimization processes based on Bayesian optimization or MCTS; ii) its warm-start initialization; iii) the ensembling of the solutions gathered along the search. Mosaic is assessed on the OpenML 100 benchmark and the Scikit-learn portfolio, with statistically significant gains over Auto-Sklearn, winner of former international AutoML challenges.

Includes members:
  Member "autostacker a compositional evolutionary learning system":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "automated machine learning state of the art and open challenges")
  Member "benchmarking automatic machine learning frameworks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "benchmark and survey of automated machine learning frameworks")
  Member "evaluation of a tree based pipeline optimization tool for automating data science":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "benchmark and survey of automated machine learning frameworks")
  Member "group equivariant convolutional networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "openml networked science in machine learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "bandit algorithms for tree search":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "bayesian optimization for backpropagation in monte carlo tree search")
  Member "x armed bandits":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on thompson sampling for smoother than lipschitz bandits")

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.LG(Machine Learning)