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 "compressed factorization fast and accurate low rank factorization of compressively sensed data"):
  Abstract: What learning algorithms can be run directly on compressively-sensed data? In this work, we consider the question of accurately and efficiently computing low-rank matrix or tensor factorizations given data compressed via random projections. We examine the approach of first performing factorization in the compressed domain, and then reconstructing the original high-dimensional factors from the recovered (compressed) factors. In both the matrix and tensor settings, we establish conditions under which this natural approach will provably recover the original factors. While it is well-known that random projections preserve a number of geometric properties of a dataset, our work can be viewed as showing that they can also preserve certain solutions of non-convex, NP-Hard problems like non-negative matrix factorization. We support these theoretical results with experiments on synthetic data and demonstrate the practical applicability of compressed factorization on real-world gene expression and EEG time series datasets.

Includes members:
  Member "a practical randomized cp tensor decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "pasta a parallel sparse tensor algorithm benchmark suite")
  Member "orthogonalized als a theoretically principled tensor decomposition algorithm for practical use":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "convergence of end to end training in deep unsupervised contrasitive learning")
  Member "compressed nonnegative matrix factorization is fast and accurate":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient preconditioning for noisy separable nmfs by successive projection based low rank approximations")
  Member "stable robust and super fast reconstruction of tensors using multi way projections":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "tensor networks for dimensionality reduction and large scale optimization part 1 low rank tensor decompositions")
  Member "guaranteed non orthogonal tensor decomposition via alternating rank 1 updates":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multiresolution tensor learning for efficient and interpretable spatial analysis")
  Member "low rank approximation and regression in input sparsity time":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sketching transformed matrices with applications to natural language processing")
  Member "learning topic models going beyond svd":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "contrastive estimation reveals topic posterior information to linear models")
  Member "exact recovery of sparsely used dictionaries":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")

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)