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 "improving policy gradient by exploring under appreciated rewards"):
  Abstract: This paper presents a novel form of policy gradient for model-free reinforcement learning (RL) with improved exploration properties. Current policy-based methods use entropy regularization to encourage undirected exploration of the reward landscape, which is ineffective in high dimensional spaces with sparse rewards. We propose a more directed exploration strategy that promotes exploration of under-appreciated reward regions. An action sequence is considered under-appreciated if its log-probability under the current policy under-estimates its resulting reward. The proposed exploration strategy is easy to implement, requiring small modifications to an implementation of the REINFORCE algorithm. We evaluate the approach on a set of algorithmic tasks that have long challenged RL methods. Our approach reduces hyper-parameter sensitivity and demonstrates significant improvements over baseline methods. Our algorithm successfully solves a benchmark multi-digit addition task and generalizes to long sequences. This is, to our knowledge, the first time that a pure RL method has solved addition using only reward feedback.

Includes members:
  Member "deep exploration via bootstrapped dqn":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "ride rewarding impact driven exploration for procedurally generated environments")
  Member "unifying count based exploration and intrinsic motivation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "explore discover and learn unsupervised discovery of state covering skills")
  Member "an alternative softmax operator for reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deep rbf value functions for continuous control")
  Member "tensorflow a system for large scale machine learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "prioritized experience replay":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "neural programmer inducing latent programs with gradient descent":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "automl zero evolving machine learning algorithms from scratch")
  Member "incentivizing exploration in reinforcement learning with deep predictive models":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "ride rewarding impact driven exploration for procedurally generated environments")
  Member "reinforcement learning neural turing machines revised":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "reconstruct and represent video contents for captioning via 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)