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 "topological value iteration algorithms"):
  Abstract: Value iteration is a powerful yet inefficient algorithm for Markov decision processes (MDPs) because it puts the majority of its effort into backing up the entire state space, which turns out to be unnecessary in many cases. In order to overcome this problem, many approaches have been proposed. Among them, ILAO* and variants of RTDP are state-of-the-art ones. These methods use reachability analysis and heuristic search to avoid some unnecessary backups. However, none of these approaches build the graphical structure of the state transitions in a pre-processing step or use the structural information to systematically decompose a problem, whereby generating an intelligent backup sequence of the state space. In this paper, we present two optimal MDP algorithms. The first algorithm, topological value iteration (TVI), detects the structure of MDPs and backs up states based on topological sequences. It (1) divides an MDP into strongly-connected components (SCCs), and (2) solves these components sequentially. TVI outperforms VI and other state-of-the-art algorithms vastly when an MDP has multiple, close-to-equal-sized SCCs. The second algorithm, focused topological value iteration (FTVI), is an extension of TVI. FTVI restricts its attention to connected components that are relevant for solving the MDP. Specifically, it uses a small amount of heuristic search to eliminate provably sub-optimal actions; this pruning allows FTVI to find smaller connected components, thus running faster. We demonstrate that FTVI outperforms TVI by an order of magnitude, averaged across several domains. Surprisingly, FTVI also significantly outperforms popular 'heuristically-informed' MDP algorithms such as ILAO*, LRTDP, BRTDP and Bayesian-RTDP in many domains, sometimes by as much as two orders of magnitude. Finally, we characterize the type of domains where FTVI excels -- suggesting a way to an informed choice of solver.

Includes members:
  Member "on the complexity of solving markov decision problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "safe imitation learning via fast bayesian reward inference from preferences")
  Member "flexible decomposition algorithms for weakly coupled markov decision problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "graying the black box understanding dqns")
  Member "hierarchical solution of markov decision processes using macro actions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "options of interest temporal abstraction with interest functions")
  Member "the complexity of decentralized control of markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "human level performance in 3d multiplayer games with population based reinforcement learning")
  Member "spudd stochastic planning using decision diagrams":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "maximum causal entropy specification inference from demonstrations")
  Member "region based incremental pruning for pomdps":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "policy iteration for decentralized control of markov decision processes")
  Member "planning under continuous time and resource uncertainty a challenge for ai":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fmap distributed cooperative multi agent planning")
  Member "symbolic generalization for on line planning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "decision theoretic planning with non markovian rewards")

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.AI(Artificial Intelligence)