human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "scaling life long off policy learning"
  Abstract: We pursue a life-long learning approach to artificial intelligence that makes extensive use of reinforcement learning algorithms. We build on our prior work with general value functions (GVFs) and the Horde architecture. GVFs have been shown able to represent a wide variety of facts about the world's dynamics that may be useful to a long-lived agent (Sutton et al. 2011). We have also previously shown scaling - that thousands of on-policy GVFs can be learned accurately in real-time on a mobile robot (Modayil, White & Sutton 2011). That work was limited in that it learned about only one policy at a time, whereas the greatest potential benefits of life-long learning come from learning about many policies in parallel, as we explore in this paper. Many new challenges arise in this off-policy learning setting. To deal with convergence and efficiency challenges, we utilize the recently introduced GTD({\lambda}) algorithm. We show that GTD({\lambda}) with tile coding can simultaneously learn hundreds of predictions for five simple target policies while following a single random behavior policy, assessing accuracy with interspersed on-policy tests. To escape the need for the tests, which preclude further scaling, we introduce and empirically vali- date two online estimators of the off-policy objective (MSPBE). Finally, we use the more efficient of the two estimators to demonstrate off-policy learning at scale - the learning of value functions for one thousand policies in real time on a physical robot. This ability constitutes a significant step towards scaling life-long off-policy learning.

Connected through hyperedge HE-1 (induced by source paper "adapting behaviour via intrinsic reward a survey and empirical study"):
  with members:
    - "learning feature relevance through step size adaptation in temporal difference learning"
    - "gep pg decoupling exploration and exploitation in deep reinforcement learning algorithms"
    - "learning to play with intrinsically motivated self aware agents"
    - "large scale study of curiosity driven learning"
    - "curiosity driven reinforcement learning with homeostatic regulation"
    - "unsupervised learning of goal spaces for intrinsically motivated goal exploration"
    - "automated curriculum learning for neural networks"
    - "hindsight experience replay"

Connected through hyperedge HE-2 (induced by source paper "experience replay using transition sequences"):
  with members:
    - "selective experience replay for lifelong learning"
    - "rainbow combining improvements in deep reinforcement learning"
    - "hindsight experience replay"
    - "identification and off policy learning of multiple objectives using adaptive clustering"
    - "swarm enabling technology for multi robot systems"
    - "sample efficient actor critic with experience replay"
    - "asynchronous methods for deep reinforcement learning"
    - "data efficient off policy policy evaluation for reinforcement learning"

Connected through hyperedge HE-3 (induced by source paper "self organizing maps as a storage and transfer mechanism in reinforcement learning"):
  with members:
    - "online transfer learning in reinforcement learning domains"
    - "actor mimic deep multitask and transfer reinforcement learning"
    - "off policy learning with eligibility traces a survey"
    - "metrics for finite markov decision processes"

Connected through hyperedge HE-4 (induced by source paper "identification and off policy learning of multiple objectives using adaptive clustering"):
  with members:
    - "a survey of multi objective sequential decision making"
    - "off policy learning with eligibility traces a survey"
    - "multi timescale nexting in a reinforcement learning robot"

Connected through hyperedge HE-5 (induced by source paper "multi timescale nexting in a reinforcement learning robot"):
  with members:
    - "temporal difference networks"
    - "predictive state representations a new theory for modeling dynamical systems"
    - "closing the learning planning loop with predictive state representations"

Question: Please tell me which class the center node 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)