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 "qxplore q learning exploration by maximizing temporal difference error"):
  Abstract: A major challenge in reinforcement learning for continuous state-action spaces is exploration, especially when reward landscapes are very sparse. Several recent methods provide an intrinsic motivation to explore by directly encouraging RL agents to seek novel states. A potential disadvantage of pure state novelty-seeking behavior is that unknown states are treated equally regardless of their potential for future reward. In this paper, we propose that the temporal difference error of predicting primary reward can serve as a secondary reward signal for exploration. This leads to novelty-seeking in the absence of primary reward, and at the same time accelerates exploration of reward-rich regions in sparse (but nonzero) reward landscapes compared to state novelty-seeking. This objective draws inspiration from dopaminergic pathways in the brain that influence animal behavior. We implement this idea with an adversarial method in which Q and Qx are the action-value functions for primary and secondary rewards, respectively. Secondary reward is given by the absolute value of the TD-error of Q. Training is off-policy, based on a replay buffer containing a mixture of trajectories induced by Q and Qx. We characterize performance on a suite of continuous control benchmark tasks against recent state of the art exploration methods and demonstrate comparable or better performance on all tasks, with much faster convergence for Q.

Includes members:
  Member "emergent tool use from multi agent autocurricula":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning zero sum simultaneous move markov games using function approximation and correlated equilibrium")
  Member "go explore a new approach for hard exploration problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "explore discover and learn unsupervised discovery of state covering skills")
  Member "q learning for continuous actions with cross entropy guided policies":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the problem with ddpg understanding failures in deterministic environments with sparse rewards")
  Member "qt opt scalable deep reinforcement learning for vision based robotic manipulation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "probabilistic future prediction for video scene understanding")
  Member "exploration by random network distillation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "transformation based adversarial video prediction on large scale data")
  Member "ucb exploration via q ensembles":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "objective social choice using auxiliary information to improve voting outcomes")
  Member "learning dexterous in hand manipulation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "never give up learning directed exploration strategies")
  Member "off policy deep reinforcement learning without exploration":
    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.LG(Machine Learning)