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 "reconstruction of hidden representation for robust feature extraction"):
  Abstract: This article aims to develop a new and robust approach to feature representation. Motivated by the success of Auto-Encoders, we first theoretically analyze and summarize the general properties of all algorithms that are based on traditional Auto-Encoders: (1) The reconstruction error of the input cannot be lower than a lower bound, which can be viewed as a guiding principle for reconstructing the input. Additionally, when the input is corrupted with noises, the reconstruction error of the corrupted input also cannot be lower than a lower bound. (2) The reconstruction of a hidden representation achieving its ideal situation is the necessary condition for the reconstruction of the input to reach the ideal state. (3) Minimizing the Frobenius norm of the Jacobian matrix of the hidden representation has a deficiency and may result in a much worse local optimum value. We believe that minimizing the reconstruction error of the hidden representation is more robust than minimizing the Frobenius norm of the Jacobian matrix of the hidden representation. Based on the above analysis, we propose a new model termed Double Denoising Auto-Encoders (DDAEs), which uses corruption and reconstruction on both the input and the hidden representation. We demonstrate that the proposed model is highly flexible and extensible and has a potentially better capability to learn invariant and robust feature representations. We also show that our model is more robust than Denoising Auto-Encoders (DAEs) for dealing with noises or inessential features. Furthermore, we detail how to train DDAEs with two different pretraining methods by optimizing the objective function in a combined and separate manner, respectively. Comparative experiments illustrate that the proposed model is significantly better for representation learning than the state-of-the-art models.

Includes members:
  Member "a survey on deep learning in medical image analysis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "medgan medical image translation using gans")
  Member "deconstructing the ladder network architecture":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "convolutional networks with dense connectivity")
  Member "made masked autoencoder for distribution estimation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polygen an autoregressive generative model of 3d meshes")
  Member "semi supervised learning with ladder networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "ha ccn hierarchical attention based crowd counting network")
  Member "rectified factor networks":
    also connected through other hyperedges:
      (none)
  Member "how auto encoders could provide credit assignment in deep networks via target propagation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "biologically motivated deep learning method using hierarchical competitive learning")
  Member "deep generative stochastic networks trainable by backprop":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "density estimation and incremental learning of latent vector for generative autoencoders")
  Member "deep learning of representations looking forward":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning to continually learn")

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)