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 "a deep reinforcement learning network for traffic light cycle control"):
  Abstract: Existing inefficient traffic light cycle control causes numerous problems, such as long delay and waste of energy. To improve efficiency, taking real-time traffic information as an input and dynamically adjusting the traffic light duration accordingly is a must. Existing works either split the traffic signal into equal duration or only leverage limited traffic information. In this paper, we study how to decide the traffic signal duration based on the collected data from different sensors. We propose a deep reinforcement learning model to control the traffic light cycle. In the model, we quantify the complex traffic scenario as states by collecting traffic data and dividing the whole intersection into small grids. The duration changes of a traffic light are the actions, which are modeled as a high-dimension Markov decision process. The reward is the cumulative waiting time difference between two cycles. To solve the model, a convolutional neural network is employed to map states to rewards. The proposed model incorporates multiple optimization elements to improve the performance, such as dueling network, target network, double Q-learning network, and prioritized experience replay. We evaluate our model via simulation on a Simulation of Urban MObility simulator. Simulation results show the efficiency of our model in controlling traffic lights.

Includes members:
  Member "traffic light control using deep policy gradient and value function based reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "gamma reward a novel multi agent reinforcement learning method for traffic signal control")
  Member "deep deterministic policy gradient for urban traffic light control":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "learning phase competition for traffic signal control")
  Member "adaptive traffic signal control deep reinforcement learning algorithm with experience replay and target network":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "intelligent coordination among multiple traffic intersections using multi agent reinforcement learning")
  Member "using a deep reinforcement learning agent for traffic signal control":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "ig rl inductive graph reinforcement learning for massive scale traffic signal control")
  Member "an overview of gradient descent optimization algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hyper parameter optimization a review of algorithms and applications")
  Member "prioritized experience replay":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "tensorflow large scale machine learning on heterogeneous distributed systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "chameleon a deep learning meta architecture for news recommender systems phd thesis")
  Member "dueling network architectures for deep reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "deep reinforcement learning for autonomous driving a survey")

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)