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 "iterative collaborative filtering for sparse noisy tensor estimation"):
  Abstract: We consider the task of tensor estimation, i.e. estimating a low-rank 3-order $n \times n \times n$ tensor from noisy observations of randomly chosen entries in the sparse regime. In the context of matrix (2-order tensor) estimation, a variety of algorithms have been proposed and analyzed in the literature including the popular collaborative filtering algorithm that is extremely well utilized in practice. However, in the context of tensor estimation, there is limited progress. No natural extensions of collaborative filtering are known beyond ``flattening'' the tensor into a matrix and applying standard collaborative filtering. #R##N#As the main contribution of this work, we introduce a generalization of the collaborative filtering algorithm for the setting of tensor estimation and argue that it achieves sample complexity that (nearly) matches the conjectured lower bound on the sample complexity. Interestingly, our generalization uses the matrix obtained from the ``flattened'' tensor to compute similarity as in the classical collaborative filtering but by defining a novel ``graph'' using it. The algorithm recovers the tensor with mean-squared-error (MSE) decaying to $0$ as long as each entry is observed independently with probability $p = \Omega(n^{-3/2 + \epsilon})$ for any arbitrarily small $\epsilon > 0$. It turns out that $p = \Omega(n^{-3/2})$ is the conjectured lower bound as well as ``connectivity threshold'' of graph considered to compute similarity in our algorithm.

Includes members:
  Member "exact tensor completion with sum of squares":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "nonconvex low rank symmetric tensor completion from noisy data")
  Member "matrix completion has no spurious local minimum":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "guaranteed matrix completion via non convex factorization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "spectral algorithms for tensor completion":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "nonconvex low rank symmetric tensor completion from noisy data")
  Member "noisy tensor completion via the sum of squares hierarchy":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "time space tradeoffs for distinguishing distributions and applications to security of goldreich s prg")
  Member "nuclear norm of higher order tensors":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multiresolution tensor learning for efficient and interpretable spatial analysis")
  Member "understanding alternating minimization for matrix completion":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "recommendation on a budget column space recovery from partially observed entries with random or active sampling")
  Member "the power of convex relaxation near optimal matrix completion":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "ell_0 motivated low rank sparse subspace clustering")

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)