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 policy search method for temporal logic specified reinforcement learning tasks"):
  Abstract: Reward engineering is an important aspect of reinforcement learning. Whether or not the user's intentions can be correctly encapsulated in the reward function can significantly impact the learning outcome. Current methods rely on manually crafted reward functions that often require parameter tuning to obtain the desired behavior. This operation can be expensive when exploration requires systems to interact with the physical world. In this paper, we explore the use of temporal logic (TL) to specify tasks in reinforcement learning. TL formula can be translated to a real-valued function that measures its level of satisfaction against a trajectory. We take advantage of this function and propose temporal logic policy search (TLPS), a model-free learning technique that finds a policy that satisfies the TL specification. A set of simulated experiments are conducted to evaluate the proposed approach.

Includes members:
  Member "guided policy search as approximate mirror descent":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dynamic experience replay")
  Member "learning hand eye coordination for robotic grasping with deep learning and large scale data collection":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "scaling data driven robotics with reward sketching and batch reinforcement learning")
  Member "q learning for robust satisfaction of signal temporal logic specifications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "tractable reinforcement learning of signal temporal logic objectives")
  Member "a provably correct mpc approach to safety control of urban traffic networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "learning based model predictive control for safe exploration")
  Member "concrete problems in ai safety":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "intelligence physics and information the tradeoff between accuracy and simplicity in machine learning")
  Member "deep reinforcement learning for robotic manipulation with asynchronous off policy updates":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "challenges and countermeasures for adversarial attacks on deep reinforcement learning")
  Member "reinforcement learning with temporal logic rewards":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "tractable reinforcement learning of signal temporal logic objectives")
  Member "unsupervised perceptual rewards for imitation learning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "scaling data driven robotics with reward sketching and batch reinforcement learning")

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.AI(Artificial Intelligence)