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 "kinn incorporating expert knowledge in neural networks"):
  Abstract: The promise of ANNs to automatically discover and extract useful features/patterns from data without dwelling on domain expertise although seems highly promising but comes at the cost of high reliance on large amount of accurately labeled data, which is often hard to acquire and formulate especially in time-series domains like anomaly detection, natural disaster management, predictive maintenance and healthcare. As these networks completely rely on data and ignore a very important modality i.e. expert, they are unable to harvest any benefit from the expert knowledge, which in many cases is very useful. In this paper, we try to bridge the gap between these data driven and expert knowledge based systems by introducing a novel framework for incorporating expert knowledge into the network (KINN). Integrating expert knowledge into the network has three key advantages: (a) Reduction in the amount of data needed to train the model, (b) provision of a lower bound on the performance of the resulting classifier by obtaining the best of both worlds, and (c) improved convergence of model parameters (model converges in smaller number of epochs). Although experts are extremely good in solving different tasks, there are some trends and patterns, which are usually hidden only in the data. Therefore, KINN employs a novel residual knowledge incorporation scheme, which can automatically determine the quality of the predictions made by the expert and rectify it accordingly by learning the trends/patterns from data. Specifically, the method tries to use information contained in one modality to complement information missed by the other. We evaluated KINN on a real world traffic flow prediction problem. KINN significantly superseded performance of both the expert and as well as the base network (LSTM in this case) when evaluated in isolation, highlighting its superiority for the task.

Includes members:
  Member "revisiting unreasonable effectiveness of data in deep learning era":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "rethinking the hyperparameters for fine tuning")
  Member "sequence to sequence models can directly translate foreign speech":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "covost a diverse multilingual speech to text translation corpus")
  Member "supervised learning of universal sentence representations from natural language inference data":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey on contextual embeddings")
  Member "state of the art speech recognition with sequence to sequence models":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards efficient model compression via learned global ranking")
  Member "a semantic loss function for deep learning with symbolic knowledge":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "analyzing differentiable fuzzy logic operators")
  Member "harnessing deep neural networks with logic rules":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "natural language qa approaches using reasoning with external knowledge")
  Member "knowledge enhanced hybrid neural network for text matching":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a deep look into neural ranking models for information retrieval")
  Member "deep residual learning for image recognition":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "discrimination aware network pruning for deep model compression")

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)