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 "fast amortized inference and learning in log linear models with randomly perturbed nearest neighbor search"):
  Abstract: Inference in log-linear models scales linearly in the size of output space in the worst-case. This is often a bottleneck in natural language processing and computer vision tasks when the output space is feasibly enumerable but very large. We propose a method to perform inference in log-linear models with sublinear amortized cost. Our idea hinges on using Gumbel random variable perturbations and a pre-computed Maximum Inner Product Search data structure to access the most-likely elements in sublinear amortized time. Our method yields provable runtime and accuracy guarantees. Further, we present empirical experiments on ImageNet and Word Embeddings showing significant speedups for sampling, inference, and learning in log-linear models.

Includes members:
  Member "enriching word vectors with subword information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multi simlex a large scale evaluation of multilingual and cross lingual lexical semantic similarity")
  Member "clustering is efficient for approximate maximum inner product search":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a 3 accelerating attention mechanisms in neural networks with approximation")
  Member "learning visual features from large weakly supervised data":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "weakly supervised discriminative feature learning with state information for person identification")
  Member "deep networks with large output spaces":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "large memory layers with product keys")
  Member "imagenet large scale visual recognition challenge":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "distributed representations of words and phrases and their compositionality":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multi simlex a large scale evaluation of multilingual and cross lingual lexical semantic similarity")
  Member "on sampling from the gibbs distribution with random maximum a posteriori perturbations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning with differentiable perturbed optimizers")

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)