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 "on the effectiveness of low rank matrix factorization for lstm model compression"):
  Abstract: Despite their ubiquity in NLP tasks, Long Short-Term Memory (LSTM) networks suffer from computational inefficiencies caused by inherent unparallelizable recurrences, which further aggravates as LSTMs require more parameters for larger memory capacity. In this paper, we propose to apply low-rank matrix factorization (MF) algorithms to different recurrences in LSTMs, and explore the effectiveness on different NLP tasks and model components. We discover that additive recurrence is more important than multiplicative recurrence, and explain this by identifying meaningful correlations between matrix norms and compression performance. We compare our approach across two settings: 1) compressing core LSTM recurrences in language models, 2) compressing biLSTM layers of ELMo evaluated in three downstream NLP tasks.

Includes members:
  Member "learning to prune filters in convolutional neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sasl saliency adaptive sparsity learning for neural network acceleration")
  Member "deep contextualized word representations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multi simlex a large scale evaluation of multilingual and cross lingual lexical semantic similarity")
  Member "end to end neural coreference resolution":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "domain independent extraction of scientific concepts from research articles")
  Member "on the state of the art of evaluation in neural language models":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "learned in translation contextualized word vectors":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on contextual embeddings")
  Member "learning intrinsic sparse structures within long short term memory":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fully quantized transformer for improved translation")
  Member "tensor train recurrent neural networks for video classification":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "convolutional tensor train lstm for spatio temporal learning")
  Member "regularizing and optimizing lstm language models":
    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)