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 "discovery of latent factors in high dimensional data using tensor methods"):
  Abstract: Author(s): Huang, Furong | Advisor(s): Anandkumar, Animashree | Abstract: Unsupervised learning aims at the discovery of hidden structure that drives the observations in the real world. It is essential for success in modern machine learning and artificial intelligence. Latent variable models are versatile in unsupervised learning and have applications in almost every domain, e.g., social network analysis, natural language processing, computer vision and computational biology. Training latent variable models is challenging due to the non-convexity of the likelihood objective function. An alternative method is based on the spectral decomposition of low order moment matrices and tensors. This versatile framework is guaranteed to estimate the correct model consistently. My thesis spans both theoretical analysis of tensor decomposition framework and practical implementation of various applications. This thesis presents theoretical results on convergence to globally optimal solution of tensor decomposition using the stochastic gradient descent, despite non-convexity of the objective. This is the first work that gives global convergence guarantees for the stochastic gradient descent on non-convex functions with exponentially many local minima and saddle points. This thesis also presents large-scale deployment of spectral methods (matrix and tensor decomposition) carried out on CPU, GPU and Spark platforms. Dimensionality reduction techniques such as random projection are incorporated for a highly parallel and scalable tensor decomposition algorithm. We obtain a gain in both accuracies and in running times by several orders of magnitude compared to the state-of-art variational methods. To solve real world problems, more advanced models and learning algorithms are proposed. After introducing tensor decomposition framework under latent Dirichlet allocation (LDA) model, this thesis discusses generalization of LDA model to mixed membership stochastic block model for learning hidden user commonalities or communities in social network, convolutional dictionary model for learning phrase templates and word-sequence embeddings, hierarchical tensor decomposition and latent tree structure model for learning disease hierarchy in healthcare analytics, and spatial point process mixture model for detecting cell types in neuroscience.

Includes members:
  Member "scalable latent tree model and its application to health analytics":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "latent tree analysis")
  Member "skip thought vectors":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey on contextual embeddings")
  Member "self adaptive hierarchical sentence model":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "depth adaptive graph recurrent network for text classification")
  Member "convolutional dictionary learning through tensor factorization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "painless breakups efficient demixing of low rank matrices")
  Member "improved semantic representations from tree structured long short term memory networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "unbiased scene graph generation from biased training")
  Member "towards universal paraphrastic sentence embeddings":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "improving candidate generation for low resource cross lingual entity linking")
  Member "escaping from saddle points online stochastic gradient for tensor decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "backward feature correction how deep learning performs deep learning")
  Member "distributed representations of sentences and documents":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "chameleon a deep learning meta architecture for news recommender systems phd thesis")

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)