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 "sparse attentive backtracking temporal creditassignment through reminding"):
  Abstract: Learning long-term dependencies in extended temporal sequences requires credit assignment to events far back in the past. The most common method for training recurrent neural networks, back-propagation through time (BPTT), requires credit information to be propagated backwards through every single step of the forward computation, potentially over thousands or millions of time steps. This becomes computationally expensive or even infeasible when used with long sequences. Importantly, biological brains are unlikely to perform such detailed reverse replay over very long sequences of internal states (consider days, months, or years.) However, humans are often reminded of past memories or mental states which are associated with the current mental state. We consider the hypothesis that such memory associations between past and present could be used for credit assignment through arbitrarily long sequences, propagating the credit assigned to the current state to the associated past state. Based on this principle, we study a novel algorithm which only back-propagates through a few of these temporal skip connections, realized by a learned attention mechanism that associates current states with relevant past states. We demonstrate in experiments that our method matches or outperforms regular BPTT and truncated BPTT in tasks involving particularly long-term dependencies, but without requiring the biologically implausible backward replay through the whole history of states. Additionally, we demonstrate that the proposed method transfers to longer sequences significantly better than LSTMs trained with BPTT and LSTMs trained with full self-attention.

Includes members:
  Member "attention is all you need":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "towards a biologically plausible backprop":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "feedforward initialization for fast inference of deep generative networks is biologically plausible")
  Member "knowing when to look adaptive attention via a visual sentinel for image captioning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "relationship embedded representation learning for grounding referring expressions")
  Member "densely connected convolutional networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lossless compression of deep neural networks")
  Member "recurrent batch normalization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "rethinking batch normalization in transformers")
  Member "effective approaches to attention based neural machine translation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "attention over parameters for dialogue systems")
  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 "unitary evolution recurrent neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "encoding based memory modules for recurrent neural networks")

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)