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 "frequency based search control in dyna"):
  Abstract: Model-based reinforcement learning has been empirically demonstrated as a successful strategy to improve sample efficiency. In particular, Dyna is an elegant model-based architecture integrating learning and planning that provides huge flexibility of using a model. One of the most important components in Dyna is called search-control, which refers to the process of generating state or state-action pairs from which we query the model to acquire simulated experiences. Search-control is critical in improving learning efficiency. In this work, we propose a simple and novel search-control strategy by searching high frequency regions of the value function. Our main intuition is built on Shannon sampling theorem from signal processing, which indicates that a high frequency signal requires more samples to reconstruct. We empirically show that a high frequency function is more difficult to approximate. This suggests a search-control strategy: we should use states from high frequency regions of the value function to query the model to acquire more samples. We develop a simple strategy to locally measure the frequency of a function by gradient and hessian norms, and provide theoretical justification for this approach. We then apply our strategy to search-control in Dyna, and conduct experiments to show its property and effectiveness on benchmark domains.

Includes members:
  Member "hill climbing on value estimates for search control in dyna":
    also connected through other hyperedges:
      (none)
  Member "a new perspective on machine learning how to do perfect supervised learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "bandlimiting neural networks against adversarial attacks")
  Member "efficient model based deep reinforcement learning with variational state tabulation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "plannable approximations to mdp homomorphisms equivariance under actions")
  Member "organizing experience a deeper look at replay mechanisms for sample based planning in continuous state domains":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an optimistic perspective on offline reinforcement learning")
  Member "recurrent world models facilitate policy evolution":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "value prediction network":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "plannable approximations to mdp homomorphisms equivariance under actions")
  Member "the predictron end to end learning and planning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "policy aware model learning for policy gradient methods")
  Member "continuous deep q learning with model based acceleration":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "robust deep reinforcement learning against adversarial perturbations on observations")

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)