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 "approximating real time recurrent learning with random kronecker factors"):
  Abstract: Despite all the impressive advances of recurrent neural networks, sequential data is still in need of better modelling. Truncated backpropagation through time (TBPTT), the learning algorithm most widely used in practice, suffers from the truncation bias, which drastically limits its ability to learn long-term dependencies.The Real-Time Recurrent Learning algorithm (RTRL) addresses this issue, but its high computational requirements make it infeasible in practice. The Unbiased Online Recurrent Optimization algorithm (UORO) approximates RTRL with a smaller runtime and memory cost, but with the disadvantage of obtaining noisy gradients that also limit its practical applicability. In this paper we propose the Kronecker Factored RTRL (KF-RTRL) algorithm that uses a Kronecker product decomposition to approximate the gradients for a large class of RNNs. We show that KF-RTRL is an unbiased and memory efficient online learning algorithm. Our theoretical analysis shows that, under reasonable assumptions, the noise introduced by our algorithm is not only stable over time but also asymptotically much smaller than the one of the UORO algorithm. We also confirm these theoretical results experimentally. Further, we show empirically that the KF-RTRL algorithm captures long-term dependencies and almost matches the performance of TBPTT on real world tasks by training Recurrent Highway Networks on a synthetic string memorization task and on the Penn TreeBank task, respectively. These results indicate that RTRL based approaches might be a promising future alternative to TBPTT.

Includes members:
  Member "unbiasing truncated backpropagation through time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal kronecker sum approximation of real time recurrent learning")
  Member "an analysis of neural language modeling at multiple scales":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the implicit and explicit regularization effects of dropout")
  Member "on the state of the art of evaluation in neural language models":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "unbiased online recurrent optimization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "equilibrated recurrent neural network neuronal time delayed self feedback improves accuracy and stability")
  Member "decoupled neural interfaces using synthetic gradients":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sideways depth parallel training of video models")
  Member "recurrent highway networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "pay attention to the activations a modular attention mechanism for fine grained image recognition")
  Member "training recurrent networks online without backtracking":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the power of linear recurrent neural networks")
  Member "adam a method for stochastic optimization":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")

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)