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 "solving inverse problems via auto encoders"):
  Abstract: Compressed sensing (CS) is about recovering a structured signal from its under-determined linear measurements. Starting from sparsity, recovery methods have steadily moved towards more complex structures. Emerging machine learning tools such as generative functions that are based on neural networks are able to learn general complex structures from training data. This makes them potentially powerful tools for designing CS algorithms. Consider a desired class of signals $\cal Q$, ${\cal Q}\subset{R}^n$, and a corresponding generative function $g:{\cal U}^k\rightarrow {R}^n$, ${\cal U}\subset {R}$, such that $\sup_{{\bf x}\in {\cal Q}}\min_{{\bf u}\in{\cal U}^k}{1\over \sqrt{n}}\|g({\bf u})-{\bf x}\|\leq \delta$. A recovery method based on $g$ seeks $g({\bf u})$ with minimum measurement error. In this paper, the performance of such a recovery method is studied, under both noisy and noiseless measurements. In the noiseless case, roughly speaking, it is proven that, as $k$ and $n$ grow without bound and $\delta$ converges to zero, if the number of measurements ($m$) is larger than the input dimension of the generative model ($k$), then asymptotically, almost lossless recovery is possible. Furthermore, the performance of an efficient iterative algorithm based on projected gradient descent is studied. In this case, an auto-encoder is used to define and enforce the source structure at the projection step. The auto-encoder is defined by encoder and decoder (generative) functions $f:{R}^n\to{\cal U}^k$ and $g:{\cal U}^k\to{R}^n$, respectively. We theoretically prove that, roughly, given $m>40k\log{1\over \delta}$ measurements, such an algorithm converges to the vicinity of the desired result, even in the presence of additive white Gaussian noise. Numerical results exploring the effectiveness of the proposed method are presented.

Includes members:
  Member "amp inspired deep networks for sparse linear inverse problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "theoretical interpretation of learned step size in deep unfolded gradient descent")
  Member "deep convolutional neural network for inverse problems in imaging":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "geometric approaches to increase the expressivity of deep neural networks for mr reconstruction")
  Member "deep fully connected networks for video compressive sensing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "adaptive image sampling using deep learning and its application on x ray fluorescence image reconstruction")
  Member "reconnet non iterative reconstruction of images from compressively sensed random measurements":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "ada lista learned solvers adaptive to varying models")
  Member "new approach to bayesian high dimensional linear regression":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "denoising of structured random processes")
  Member "u net convolutional networks for biomedical image segmentation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secure and robust machine learning for healthcare a survey")
  Member "a deep learning approach to structured signal recovery":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "inference with deep generative priors in high dimensions")
  Member "deep learning face attributes in the wild":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "deepfakes and beyond a survey of face manipulation and fake detection")

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.IT(Information Theory)