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 "differentiable lower bound for expected bleu score"):
  Abstract: In natural language processing tasks performance of the models is often measured with some non-differentiable metric, such as BLEU score. To use efficient gradient-based methods for optimization, it is a common workaround to optimize some surrogate loss function. This approach is effective if optimization of such loss also results in improving target metric. The corresponding problem is referred to as loss-evaluation mismatch. In the present work we propose a method for calculation of differentiable lower bound of expected BLEU score that does not involve computationally expensive sampling procedure such as the one required when using REINFORCE rule from reinforcement learning (RL) framework.

Includes members:
  Member "rebar low variance unbiased gradient estimates for discrete latent variable models":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "inverse graphics gan learning to generate 3d shapes from unstructured 2d data")
  Member "a deep reinforced model for abstractive summarization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "time aware large kernel convolutions")
  Member "how not to evaluate your dialogue system an empirical study of unsupervised evaluation metrics for dialogue response generation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "non autoregressive neural dialogue generation")
  Member "effective approaches to attention based neural machine translation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "attention over parameters for dialogue systems")
  Member "gradient estimation using stochastic computation graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "visual camera re localization from rgb and rgb d images using dsac")
  Member "minimum risk training for neural machine translation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "estimating gradients for discrete random variables by sampling without replacement")
  Member "adam a method for stochastic optimization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "sequence to sequence learning with neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "chameleon a deep learning meta architecture for news recommender systems phd thesis")

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)