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 fast matching models from weak annotations"):
  Abstract: This paper proposes a novel training scheme for fast matching models in Search Ads, which is motivated by the real challenges in model training. The first challenge stems from the pursuit of high throughput, which prohibits the deployment of inseparable architectures, and hence greatly limits the model accuracy. The second problem arises from the heavy dependency on human provided labels, which are expensive and time-consuming to collect, yet how to leverage unlabeled search log data is rarely studied. The proposed training framework targets on mitigating both issues, by treating the stronger but undeployable models as annotators, and learning a deployable model from both human provided relevance labels and weakly annotated search log data. Specifically, we first construct multiple auxiliary tasks from the enumerated relevance labels, and train the annotators by jointly learning from those related tasks. The annotation models are then used to assign scores to both labeled and unlabeled training samples. The deployable model is firstly learnt on the scored unlabeled data, and then fine-tuned on scored labeled data, by leveraging both labels and scores via minimizing the proposed label-aware weighted loss. According to our experiments, compared with the baseline that directly learns from relevance labels, training by the proposed framework outperforms it by a large margin, and improves data efficiency substantially by dispensing with 80% labeled samples. The proposed framework allows us to improve the fast matching model by learning from stronger annotators while keeping its architecture unchanged. Meanwhile, our training framework offers a principled manner to leverage search log data in the training phase, which could effectively alleviate our dependency on human provided labels.

Includes members:
  Member "learning matching models with weak supervision for response selection in retrieval based chatbots":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "improving multi turn response selection models with complementary last utterance selection by instance weighting")
  Member "anmm ranking short answer texts with attention based neural matching model":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "iart intent aware response ranking with transformers in information seeking conversation systems")
  Member "neural models for information retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "separate and attend in personal email search")
  Member "a deep relevance matching model for ad hoc retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "iart intent aware response ranking with transformers in information seeking conversation systems")
  Member "a decomposable attention model for natural language inference":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a 3 accelerating attention mechanisms in neural networks with approximation")
  Member "learning to match using local and distributed representations of text for web search":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "iart intent aware response ranking with transformers in information seeking conversation systems")
  Member "deep model compression distilling knowledge from noisy teachers":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "power bert accelerating bert inference for classification tasks")
  Member "abcnn attention based convolutional neural network for modeling sentence pairs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "rl duet online music accompaniment generation using deep 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.IR(Information Retrieval)