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 "low rank approximations for conditional feedforward computation in deep neural networks"):
  Abstract: Scalability properties of deep neural networks raise key research questions, particularly as the problems considered become larger and more challenging. This paper expands on the idea of conditional computation introduced by Bengio, et. al., where the nodes of a deep network are augmented by a set of gating units that determine when a node should be calculated. By factorizing the weight matrix into a low-rank approximation, an estimation of the sign of the pre-nonlinearity activation can be efficiently obtained. For networks using rectified-linear hidden units, this implies that the computation of a hidden unit with an estimated negative pre-nonlinearity can be ommitted altogether, as its value will become zero when nonlinearity is applied. For sparse neural networks, this can result in considerable speed gains. Experimental results using the MNIST and SVHN data sets with a fully-connected deep neural network demonstrate the performance robustness of the proposed scheme with respect to the error introduced by the conditional computation process.

Includes members:
  Member "deep learning of representations looking forward":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning to continually learn")
  Member "estimating or propagating gradients through stochastic neurons for conditional computation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "attention over parameters for dialogue systems")
  Member "predicting parameters in deep learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exploiting the redundancy in convolutional filters for parameter reduction")
  Member "saturating auto encoders":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "accelerating training of deep neural networks with a standardization loss")
  Member "improving neural networks by preventing co adaptation of feature detectors":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hyper parameter optimization a review of algorithms and applications")
  Member "building high level features using large scale unsupervised learning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "certified robustness to label flipping attacks via randomized smoothing")

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)