human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "theoretical linear convergence of unfolded ista and its practical weights and thresholds"
  Abstract: In recent years, unfolding iterative algorithms as neural networks has become an empirical success in solving sparse recovery problems. However, its theoretical understanding is still immature, which prevents us from fully utilizing the power of neural networks. In this work, we study unfolded ISTA (Iterative Shrinkage Thresholding Algorithm) for sparse signal recovery. We introduce a weight structure that is necessary for asymptotic convergence to the true sparse signal. With this structure, unfolded ISTA can attain a linear convergence, which is better than the sublinear convergence of ISTA/FISTA in general cases. Furthermore, we propose to incorporate thresholding in the network to perform support selection, which is easy to implement and able to boost the convergence rate both theoretically and empirically. Extensive simulations, including sparse vector recovery and a compressive sensing experiment on real image data, corroborate our theoretical results and demonstrate their practical usefulness. We have made our codes publicly available: this https URL.

Connected through hyperedge HE-1 (induced by source paper "theoretical interpretation of learned step size in deep unfolded gradient descent"):
  with members:
    - "chebyshev inertial landweber algorithm for linear inverse problems"
    - "degrees of freedom analysis of unrolled neural networks"
    - "trainable ista for sparse signal recovery"
    - "deep learning aided trainable projected gradient decoding for ldpc codes"
    - "neural proximal gradient descent for compressive imaging"
    - "trainable projected gradient detector for massive overloaded mimo channels data driven tuning approach"
    - "a model driven deep learning network for mimo detection"
    - "amp inspired deep networks for sparse linear inverse problems"

Connected through hyperedge HE-2 (induced by source paper "a novel learnable gradient descent type algorithm for non convex non smooth inverse problems"):
  with members:
    - "differentiable linearized admm"
    - "amp inspired deep networks for sparse linear inverse problems"
    - "ista net interpretable optimization inspired deep network for image compressive sensing"
    - "learning proximal operators using denoising networks for regularizing inverse imaging problems"
    - "learning deep cnn denoiser prior for image restoration"
    - "the expressive power of neural networks a view from the width"
    - "error bounds for approximations with deep relu networks"
    - "aggregated residual transformations for deep neural networks"

Connected through hyperedge HE-3 (induced by source paper "ada lista learned solvers adaptive to varying models"):
  with members:
    - "deep network classification by scattering and homotopy dictionary learning"
    - "deep energy using energy functions for unsupervised training of dnns"
    - "deep energy unsupervised training of deep neural networks"
    - "amp inspired deep networks for sparse linear inverse problems"
    - "ista net interpretable optimization inspired deep network for image compressive sensing"
    - "learning to learn by gradient descent by gradient descent"
    - "the little engine that could regularization by denoising red"
    - "maximal sparsity with deep networks"

Connected through hyperedge HE-4 (induced by source paper "rna secondary structure prediction by learning unrolled algorithms"):
  with members:
    - "attention is all you need"
    - "optnet differentiable optimization as a layer in neural networks"
    - "deep biaffine attention for neural dependency parsing"
    - "simple and accurate dependency parsing using bidirectional lstm feature representations"
    - "deep unfolding model based inspiration of novel deep architectures"

Connected through hyperedge HE-5 (induced by source paper "plug and play methods provably converge with properly trained denoisers"):
  with members:
    - "ffdnet toward a fast and flexible solution for cnn based image denoising"
    - "denoising prior driven deep neural network for image restoration"
    - "regularization by denoising clarifications and new interpretations"
    - "regularized fourier ptychography using an online plug and play algorithm"
    - "lipschitz regularized deep neural networks generalize and are adversarially robust"
    - "plug in estimation in high dimensional linear inverse problems a rigorous analysis"
    - "lipschitz margin training scalable certification of perturbation invariance for deep neural networks"
    - "l2 nonexpansive neural networks"

Connected through hyperedge HE-6 (induced by source paper "frank wolfe network an interpretable deep structure for non sparse coding"):
  with members:
    - "learning simple thresholded features with sparse support recovery"
    - "ista net interpretable optimization inspired deep network for image compressive sensing"
    - "beyond a gaussian denoiser residual learning of deep cnn for image denoising"
    - "a unified optimization view on generalized matching pursuit and frank wolfe"
    - "maximal sparsity with deep networks"
    - "learning optimal nonlinearities for iterative thresholding algorithms"
    - "normalizing the normalizers comparing and extending network normalization schemes"
    - "deep compression compressing deep neural networks with pruning trained quantization and huffman coding"

Connected through hyperedge HE-7 (induced by source paper "tree search network for sparse regression"):
  with members:
    - "amp inspired deep networks for sparse linear inverse problems"
    - "deep sparse coding using optimized linear expansion of thresholds"
    - "sparse representation for 3d shape estimation a convex relaxation approach"
    - "deep generative adversarial networks for compressed sensing automates mri"
    - "adaptive feature selection computationally efficient online sparse linear regression under rip"
    - "admm net a deep learning approach for compressive sensing mri"
    - "distributed compressive sensing a deep learning approach"
    - "greedy subspace pursuit for joint sparse recovery"

Connected through hyperedge HE-8 (induced by source paper "model driven deep learning for joint mimo channel estimation and signal detection"):
  with members:
    - "trainable ista for sparse signal recovery"
    - "deep learning based channel estimation for beamspace mmwave massive mimo systems"
    - "deep learning in physical layer communications"
    - "deep learning methods for improved decoding of linear codes"
    - "trainable projected gradient detector for massive overloaded mimo channels data driven tuning approach"
    - "model driven deep learning for physical layer communications"
    - "a model driven deep learning network for mimo detection"
    - "amp inspired deep networks for sparse linear inverse problems"

Question: Please tell me which class the center node 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)