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 "better transfer learning with inferred successor maps"):
  Abstract: Humans and animals show remarkable flexibility in adjusting their behaviour when their goals, or rewards in the environment change. While such flexibility is a hallmark of intelligent behaviour, these multi-task scenarios remain an important challenge for machine learning algorithms and neurobiological models alike. We investigated two approaches that could enable this flexibility: factorized representations, which abstract away general aspects of a task from those prone to change, and nonparametric, memory-based approaches, which can provide a principled way of using similarity to past experiences to guide current behaviour. In particular, we combine the successor representation (SR) that factors the value of actions into expected outcomes and corresponding rewards with evaluating task similarity through clustering the space of reward functions. The proposed algorithm inverts a generative model over tasks, and dynamically samples from a flexible number of distinct SR maps while accumulating evidence about the current task context through amortized inference. It improves SR's transfer capabilities and outperforms competing algorithms and baselines in settings with both known and unsignalled rewards changes. Further, as a neurobiological model of spatial coding in the hippocampus, it explains important signatures of this representation, such as the "flickering" behaviour of hippocampal maps, and trajectory-dependent place cells (so-called splitter cells) and their dynamics. We thus provide a novel algorithmic approach for multi-task learning, as well as a common normative framework that links together these different characteristics of the brain's spatial representation.

Includes members:
  Member "transfer in deep reinforcement learning using successor features and generalised policy improvement":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "attentive multi task deep reinforcement learning")
  Member "reinforcement learning and control as probabilistic inference tutorial and review":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rewriting history with inverse rl hindsight inference for policy improvement")
  Member "universal successor features approximators":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "zero shot task adaptation by homoiconic meta mapping")
  Member "experience replay for continual learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "online fast adaptation and knowledge accumulation a new approach to continual learning")
  Member "universal successor representations for transfer reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "learning action transferable policy with action embedding")
  Member "selective experience replay for lifelong learning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "online fast adaptation and knowledge accumulation a new approach to continual learning")
  Member "advantages and limitations of using successor features for transfer in reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "successor features combine elements of model free and model based reinforcement learning")
  Member "neural episodic control":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "never give up learning directed exploration strategies")

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)