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 "joint inference of reward machines and policies for reinforcement learning"):
  Abstract: Incorporating high-level knowledge is an effective way to expedite reinforcement learning (RL), especially for complex tasks with sparse rewards. We investigate an RL problem where the high-level knowledge is in the form of reward machines, i.e., a type of Mealy machine that encodes the reward functions. We focus on a setting in which this knowledge is a priori not available to the learning agent. We develop an iterative algorithm that performs joint inference of reward machines and policies for RL (more specifically, q-learning). In each iteration, the algorithm maintains a hypothesis reward machine and a sample of RL episodes. It derives q-functions from the current hypothesis reward machine, and performs RL to update the q-functions. While performing RL, the algorithm updates the sample by adding RL episodes along which the obtained rewards are inconsistent with the rewards based on the current hypothesis reward machine. In the next iteration, the algorithm infers a new hypothesis reward machine from the updated sample. Based on an equivalence relationship we defined between states of reward machines, we transfer the q-functions between the hypothesis reward machines in consecutive iterations. We prove that the proposed algorithm converges almost surely to an optimal policy in the limit if a minimal reward machine can be inferred and the maximal length of each RL episode is sufficiently long. The experiments show that learning high-level knowledge in the form of reward machines can lead to fast convergence to optimal policies in RL, while standard RL methods such as q-learning and hierarchical RL methods fail to converge to optimal policies after a substantial number of training steps in many tasks.

Includes members:
  Member "transfer of temporal logic formulas in reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adaptive teaching of temporal logic formulas to learners with preferences")
  Member "q learning for robust satisfaction of signal temporal logic specifications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "tractable reinforcement learning of signal temporal logic objectives")
  Member "hierarchical deep reinforcement learning integrating temporal abstraction and intrinsic motivation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "review analyze and design a comprehensive deep reinforcement learning framework")
  Member "modular multitask reinforcement learning with policy sketches":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "hierarchically decoupled imitation for morphological transfer")
  Member "reinforcement learning with temporal logic rewards":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "tractable reinforcement learning of signal temporal logic objectives")
  Member "abstract learning frameworks for synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "decidable synthesis of programs with uninterpreted functions")
  Member "hierarchical reinforcement learning with the maxq value function decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning functionally decomposed hierarchies for continuous control tasks")

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)