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 "dropout with expectation linear regularization"):
  Abstract: Dropout, a simple and effective way to train deep neural networks, has led to a number of impressive empirical successes and spawned many recent theoretical investigations. However, the gap between dropout's training and inference phases, introduced due to tractability considerations, has largely remained under-appreciated. In this work, we first formulate dropout as a tractable approximation of some latent variable model, leading to a clean view of parameter sharing and enabling further theoretical analysis. Then, we introduce (approximate) expectation-linear dropout neural networks, whose inference gap we are able to formally characterize. Algorithmically, we show that our proposed measure of the inference gap can be used to regularize the standard dropout training objective, resulting in an \emph{explicit} control of the gap. Our method is as simple and efficient as standard dropout. We further prove the upper bounds on the loss in accuracy due to expectation-linearization, describe classes of input distributions that expectation-linearize easily. Experiments on three image classification benchmark datasets demonstrate that reducing the inference gap can indeed improve the performance consistently.

Includes members:
  Member "surprising properties of dropout in deep networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the implicit and explicit regularization effects of dropout")
  Member "deep learning in neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "π nets deep polynomial neural networks")
  Member "to drop or not to drop robustness consistency and differential privacy properties of dropout":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards automatic generation of shareable synthetic clinical notes using neural language models")
  Member "striving for simplicity the all convolutional net":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "causal interpretability for machine learning problems methods and evaluation")
  Member "on the inductive bias of dropout":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the implicit and explicit regularization effects of dropout")
  Member "dropout rademacher complexity of deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a theory of usable information under computational constraints")
  Member "dropout training for support vector machines":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "shakeout a new approach to regularized deep neural network training")
  Member "improving neural networks by preventing co adaptation of feature detectors":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "hyper parameter optimization a review of algorithms and applications")

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)