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: "characterizing the exact behaviors of temporal difference learning algorithms using markov jump linear system theory"
  Abstract: In this paper, we provide a unified analysis of temporal difference learning algorithms with linear function approximators by exploiting their connections to Markov jump linear systems (MJLS). We tailor the MJLS theory developed in the control community to characterize the exact behaviors of the first and second order moments of a large family of temporal difference learning algorithms. For both the IID and Markov noise cases, we show that the evolution of some augmented versions of the mean and covariance matrix of the TD estimation error exactly follows the trajectory of a deterministic linear time-invariant (LTI) dynamical system. Applying the well-known LTI system theory, we obtain closed-form expressions for the mean and covariance matrix of the TD estimation error at any time step. We provide a tight matrix spectral radius condition to guarantee the convergence of the covariance matrix of the TD estimation error, and perform a perturbation analysis to characterize the dependence of the TD behaviors on learning rate. For the IID case, we provide an exact formula characterizing how the mean and covariance matrix of the TD estimation error converge to the steady state values. For the Markov case, we use our formulas to explain how the behaviors of TD learning algorithms are affected by learning rate and the underlying Markov chain. For both cases, upper and lower bounds for the mean square TD error are provided. The mean square TD error is shown to converge linearly to an exact limit.

Connected through hyperedge HE-1 (induced by source paper "non asymptotic convergence of adam type reinforcement learning algorithms under markovian sampling"):
  with members:
    - "finite time error bounds for linear stochastic approximation and td learning"
    - "an improved convergence analysis of stochastic variance reduced policy gradient"
    - "two time scale off policy td learning non asymptotic analysis over markovian samples"
    - "on the convergence proof of amsgrad and a new version"
    - "smoothing policies and safe policy gradients"
    - "finite sample analysis for sarsa with linear function approximation"
    - "neural temporal difference learning converges to global optima"
    - "global optimality guarantees for policy gradient methods"

Connected through hyperedge HE-2 (induced by source paper "reanalysis of variance reduced temporal difference learning"):
  with members:
    - "finite time error bounds for linear stochastic approximation and td learning"
    - "two time scale off policy td learning non asymptotic analysis over markovian samples"
    - "finite sample analysis for sarsa with linear function approximation"
    - "svrg for policy evaluation with fewer gradient evaluations"
    - "target based temporal difference learning"
    - "neural temporal difference learning converges to global optima"
    - "a finite time analysis of temporal difference learning with linear function approximation"
    - "finite sample analysis of the gtd policy evaluation algorithms in markov setting"

Connected through hyperedge HE-3 (induced by source paper "a finite time analysis of q learning with neural network function approximation"):
  with members:
    - "a gram gauss newton method learning overparameterized deep neural networks for regression problems"
    - "finite sample analysis for sarsa and q learning with linear function approximation"
    - "finite time error bounds for linear stochastic approximation and td learning"
    - "a theoretical analysis of deep q learning"
    - "an improved analysis of training over parameterized deep neural networks"
    - "neural temporal difference learning converges to global optima"
    - "fine grained analysis of optimization and generalization for overparameterized two layer neural networks"
    - "generalization bounds of stochastic gradient descent for wide and deep neural networks"

Connected through hyperedge HE-4 (induced by source paper "finite sample analysis of decentralized temporal difference learning with linear function approximation"):
  with members:
    - "reanalysis of variance reduced temporal difference learning"
    - "two time scale off policy td learning non asymptotic analysis over markovian samples"
    - "deep reinforcement learning for adaptive caching in hierarchical content delivery networks"
    - "nonconvex optimization meets low rank matrix factorization an overview"
    - "two timescale voltage control in distribution grids using deep reinforcement learning"
    - "finite time performance bounds and adaptive learning rate selection for two time scale reinforcement learning"
    - "multi agent reinforcement learning via double averaging primal dual optimization"
    - "fully decentralized multi agent reinforcement learning with networked agents"

Connected through hyperedge HE-5 (induced by source paper "finite time analysis and restarting scheme for linear two time scale stochastic approximation"):
  with members:
    - "two time scale off policy td learning non asymptotic analysis over markovian samples"
    - "target based temporal difference learning"
    - "finite time performance bounds and adaptive learning rate selection for two time scale reinforcement learning"
    - "finite sample analysis of two timescale stochastic approximation with applications to reinforcement learning"

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.LG(Machine Learning)