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 "sharp time data tradeoffs for linear inverse problems"):
  Abstract: In this paper we characterize sharp time-data tradeoffs for optimization problems used for solving linear inverse problems. We focus on the minimization of a least-squares objective subject to a constraint defined as the sub-level set of a penalty function. We present a unified convergence analysis of the gradient projection algorithm applied to such problems. We sharply characterize the convergence rate associated with a wide variety of random measurement ensembles in terms of the number of measurements and structural complexity of the signal with respect to the chosen penalty function. The results apply to both convex and nonconvex constraints, demonstrating that a linear convergence rate is attainable even though the least squares objective is not strongly convex in these settings. When specialized to Gaussian measurements our results show that such linear convergence occurs when the number of measurements is merely 4 times the minimal number required to recover the desired signal at all (a.k.a. the phase transition). We also achieve a slower but geometric rate of convergence precisely above the phase transition point. Extensive numerical results suggest that the derived rates exactly match the empirical performance.

Includes members:
  Member "isometric sketching of any set via the restricted isometry property":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "quantized compressive sensing with rip matrices the benefit of dithering")
  Member "the generalized lasso with non linear observations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "compressed sensing with 1d total variation breaking sample complexity barriers via non uniform recovery")
  Member "does ell_p minimization outperform ell_1 minimization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal data detection in large mimo")
  Member "phase retrieval via wirtinger flow theory and algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "learning without concentration":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "learning with correntropy induced losses for regression with mixture of symmetric stable noise")
  Member "dimensionality reduction with subgaussian matrices a unified theory":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sub gaussian matrices on sets optimal tail dependence and applications")
  Member "from denoising to compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a novel learnable gradient descent type algorithm for non convex non smooth inverse problems")
  Member "simple bounds for noisy linear inverse problems with exact side information":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the generalized lasso with non linear observations")

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)