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: "double neural counterfactual regret minimization"
  Abstract: Counterfactual Regret Minimization (CRF) is a fundamental and effective technique for solving Imperfect Information Games (IIG). However, the original CRF algorithm only works for discrete state and action spaces, and the resulting strategy is maintained as a tabular representation. Such tabular representation limits the method from being directly applied to large games and continuing to improve from a poor strategy profile. In this paper, we propose a double neural representation for the imperfect information games, where one neural network represents the cumulative regret, and the other represents the average strategy. Furthermore, we adopt the counterfactual regret minimization algorithm to optimize this double neural representation. To make neural learning efficient, we also developed several novel techniques including a robust sampling method, mini-batch Monte Carlo Counterfactual Regret Minimization (MCCFR) and Monte Carlo Counterfactual Regret Minimization Plus (MCCFR+) which may be of independent interests. Experimentally, we demonstrate that the proposed double neural algorithm converges significantly better than the reinforcement learning counterpart.

Connected through hyperedge HE-1 (induced by source paper "algorithms in multi agent systems a holistic perspective from reinforcement learning and game theory"):
  with members:
    - "single deep counterfactual regret minimization"
    - "alternative function approximation parameterizations for solving games an analysis of f regression counterfactual regret minimization"
    - "bounds for approximate regret matching algorithms"
    - "combining no regret and q learning"
    - "a generalized training approach for multiagent learning"
    - "stable predictive optimistic counterfactual regret minimization"
    - "multiagent evaluation under incomplete information"
    - "a survey and critique of multiagent deep reinforcement learning"

Connected through hyperedge HE-2 (induced by source paper "solving zero sum extensive form games with arbitrary payoff uncertainty models"):
  with members:
    - "solving imperfect information games via discounted regret minimization"
    - "deep counterfactual regret minimization"
    - "a unified view of large scale zero sum equilibrium computation"
    - "regret minimization in non zero sum games with applications to building champion multiplayer computer poker agents"

Connected through hyperedge HE-3 (induced by source paper "deep counterfactual regret minimization"):
  with members:
    - "single deep counterfactual regret minimization"
    - "actor critic policy optimization in partially observable multiagent environments"
    - "solving imperfect information games via discounted regret minimization"
    - "solving large sequential games with the excessive gap technique"
    - "online convex optimization for sequential decision processes and extensive form games"
    - "revisiting cfr and alternating updates"
    - "depth limited solving for imperfect information games"
    - "variance reduction in monte carlo counterfactual regret minimization vr mccfr for extensive form games using baselines"

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)