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 "learning k way d dimensional discrete code for compact embedding representations"):
  Abstract: Embedding methods such as word embedding have become pillars for many applications containing discrete structures. Conventional embedding methods directly associate each symbol with a continuous embedding vector, which is equivalent to applying linear transformation based on "one-hot" encoding of the discrete symbols. Despite its simplicity, such approach yields number of parameters that grows linearly with the vocabulary size and can lead to overfitting. In this work we propose a much more compact K-way D-dimensional discrete encoding scheme to replace the "one-hot" encoding. In "KD encoding", each symbol is represented by a $D$-dimensional code, and each of its dimension has a cardinality of $K$. The final symbol embedding vector can be generated by composing the code embedding vectors. To learn the semantically meaningful code, we derive a relaxed discrete optimization technique based on stochastic gradient descent. By adopting the new coding system, the efficiency of parameterization can be significantly improved (from linear to logarithmic), and this can also mitigate the over-fitting problem. In our experiments with language modeling, the number of embedding parameters can be reduced by 97\% while achieving similar or better performance.

Includes members:
  Member "quantization and training of neural networks for efficient integer arithmetic only inference":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "searching for winograd aware quantized networks")
  Member "fasttext zip compressing text classification models":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "aibench an agile domain specific benchmarking methodology and an ai benchmark suite")
  Member "compressing word embeddings via deep compositional code learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "understanding the downstream instability of word embeddings")
  Member "entity embedding based anomaly detection for heterogeneous categorical events":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "supertml two dimensional word embedding for the precognition on structured tabular data")
  Member "semi supervised classification with graph convolutional networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "relatext exploiting visual relationships for arbitrary shaped scene text detection with graph convolutional networks")
  Member "the concrete distribution a continuous relaxation of discrete random variables":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "domain decluttering simplifying images to mitigate synthetic real domain shift and improve depth estimation")
  Member "lightrnn memory and computation efficient recurrent neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "comic toward a compact image captioning model with attention")
  Member "bag of tricks for efficient text classification":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "description based text classification with reinforcement learning")

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)