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 "lightrnn memory and computation efficient recurrent neural networks"):
  Abstract: Recurrent neural networks (RNNs) have achieved state-of-the-art performances in many natural language processing tasks, such as language modeling and machine translation. However, when the vocabulary is large, the RNN model will become very big (e.g., possibly beyond the memory capacity of a GPU device) and its training will become very inefficient. In this work, we propose a novel technique to tackle this challenge. The key idea is to use 2-Component (2C) shared embedding for word representations. We allocate every word in the vocabulary into a table, each row of which is associated with a vector, and each column associated with another vector. Depending on its position in the table, a word is jointly represented by two components: a row vector and a column vector. Since the words in the same row share the row vector and the words in the same column share the column vector, we only need $2 \sqrt{|V|}$ vectors to represent a vocabulary of $|V|$ unique words, which are far less than the $|V|$ vectors required by existing approaches. Based on the 2-Component shared embedding, we design a new RNN algorithm and evaluate it using the language modeling task on several benchmark datasets. The results show that our algorithm significantly reduces the model size and speeds up the training process, without sacrifice of accuracy (it achieves similar, if not better, perplexity as compared to state-of-the-art language models). Remarkably, on the One-Billion-Word benchmark Dataset, our algorithm achieves comparable perplexity to previous language models, whilst reducing the model size by a factor of 40-100, and speeding up the training process by a factor of 2. We name our proposed algorithm \emph{LightRNN} to reflect its very small model size and very high training speed.

Includes members:
  Member "optimizing performance of recurrent neural networks on gpus":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "all smiles variational autoencoder")
  Member "character aware neural language models":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "trends and advancements in deep neural network communication")
  Member "strategies for training large vocabulary neural language models":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "pre training tasks for embedding based large scale retrieval")
  Member "blackout speeding up recurrent neural network language models with very large vocabularies":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "hide and tell learning to bridge photo streams for visual storytelling")
  Member "compositional morphology for word representations and language modelling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "using interlinear glosses as pivot in low resource multilingual machine translation")
  Member "long short term memory based recurrent neural network architectures for large vocabulary speech recognition":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "few shot deep adversarial learning for video based person re identification")
  Member "empirical evaluation of gated recurrent neural networks on sequence modeling":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "recurrent neural network regularization":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the implicit and explicit regularization effects of dropout")

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.CL(Computation and Language)