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 "variance reduced q learning is minimax optimal"):
  Abstract: We introduce and analyze a form of variance-reduced $Q$-learning. For $\gamma$-discounted MDPs with finite state space $\mathcal{X}$ and action space $\mathcal{U}$, we prove that it yields an $\epsilon$-accurate estimate of the optimal $Q$-function in the $\ell_\infty$-norm using $\mathcal{O} \left(\left(\frac{D}{ \epsilon^2 (1-\gamma)^3} \right) \; \log \left( \frac{D}{(1-\gamma)} \right) \right)$ samples, where $D = |\mathcal{X}| \times |\mathcal{U}|$. This guarantee matches known minimax lower bounds up to a logarithmic factor in the discount complexity. In contrast, our past work shows that ordinary $Q$-learning has worst-case quartic scaling in the discount complexity.

Includes members:
  Member "stochastic approximation with cone contractive operators sharp ell_ infty bounds for q learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sqrt n regret for learning in markov decision processes with function approximation and low bellman rank")
  Member "learning linear quadratic regulators efficiently with only t regret":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "improper learning for non stochastic control")
  Member "the gap between model based and model free methods on the linear quadratic regulator an asymptotic viewpoint":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "non asymptotic convergence of adam type reinforcement learning algorithms under markovian sampling")
  Member "derivative free methods for policy optimization guarantees for linear quadratic systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "non asymptotic convergence of adam type reinforcement learning algorithms under markovian sampling")
  Member "global convergence of policy gradient methods for the linear quadratic regulator":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "accelerating reinforcement learning with a directional gaussian smoothing evolution strategy")
  Member "is q learning provably efficient":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "learning zero sum simultaneous move markov games using function approximation and correlated equilibrium")
  Member "domain randomization for transferring deep neural networks from simulation to the real world":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "variance reduced value iteration and faster algorithms for solving markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "agnostic q learning with function approximation in deterministic systems tight bounds on approximation error and sample complexity")

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)