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 "reward estimation for variance reduction in deep reinforcement learning"):
  Abstract: Reinforcement Learning (RL) agents require the specification of a reward signal for learning behaviours. However, introduction of corrupt or stochastic rewards can yield high variance in learning. Such corruption may be a direct result of goal misspecification, randomness in the reward signal, or correlation of the reward with external factors that are not known to the agent. Corruption or stochasticity of the reward signal can be especially problematic in robotics, where goal specification can be particularly difficult for complex tasks. While many variance reduction techniques have been studied to improve the robustness of the RL process, handling such stochastic or corrupted reward structures remains difficult. As an alternative for handling this scenario in model-free RL methods, we suggest using an estimator for both rewards and value functions. We demonstrate that this improves performance under corrupted stochastic rewards in both the tabular and non-linear function approximation settings for a variety of noise types and environments. The use of reward estimation is a robust and easy-to-implement improvement for handling corrupted reward signals in model-free RL.

Includes members:
  Member "variational inverse control with events a general framework for data driven reward definition":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "quantifying hypothesis space misspecification in learning from human robot demonstrations and physical corrections")
  Member "combined reinforcement learning via abstract representations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "plannable approximations to mdp homomorphisms equivariance under actions")
  Member "learning the reward function for a misspecified model":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "successor features combine elements of model free and model based reinforcement learning")
  Member "model based value estimation for efficient model free reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "challenges and countermeasures for adversarial attacks on deep reinforcement learning")
  Member "deep reinforcement learning that matters":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "backpropagation through the void optimizing control variates for black box gradient estimation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "generalizable adversarial attacks with latent variable perturbation modelling")
  Member "a distributional perspective on reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the hanabi challenge a new frontier for ai research")
  Member "model based planning with discrete and continuous actions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "dream to control learning behaviors by latent imagination")

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)