human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "planning and learning with stochastic action sets"
  Abstract: In many practical uses of reinforcement learning (RL) the set of actions available at a given state is a random variable, with realizations governed by an exogenous stochastic process. Somewhat surprisingly, the foundations for such sequential decision processes have been unaddressed. In this work, we formalize and investigate MDPs with stochastic action sets (SAS-MDPs) to provide these foundations. We show that optimal policies and value functions in this model have a structure that admits a compact representation. From an RL perspective, we show that Q-learning with sampled action sets is sound. In model-based settings, we consider two important special cases: when individual actions are available with independent probabilities; and a sampling-based model for unknown distributions. We develop poly-time value and policy iteration methods for both cases; and in the first, we offer a poly-time linear programming solution.

Connected through hyperedge HE-1 (induced by source paper "caql continuous action q learning"):
  with members:
    - "equivalent and approximate transformations of deep neural networks"
    - "challenges of real world reinforcement learning"
    - "qt opt scalable deep reinforcement learning for vision based robotic manipulation"
    - "deep reinforcement learning for vision based robotic grasping a simulated comparative evaluation of off policy methods"
    - "global convergence of policy gradient methods for the linear quadratic regulator"
    - "horizon facebook s open source applied reinforcement learning platform"
    - "a lyapunov based approach to safe reinforcement learning"
    - "addressing function approximation error in actor critic methods"

Connected through hyperedge HE-2 (induced by source paper "reinforcement learning when all actions are not always available"):
  with members:
    - "the mirage of action dependent baselines in reinforcement learning"
    - "variance reduction for policy gradient with action dependent factorized baselines"
    - "using large ensembles of control variates for variational inference"
    - "backpropagation through the void optimizing control variates for black box gradient estimation"
    - "policy gradient methods for reinforcement learning with function approximation and action dependent baselines"
    - "online advertisement optimization and stochastic networks"

Question: Please tell me which class the center node 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)