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 "scaled stochastic gradient descent for low rank matrix completion"):
  Abstract: The paper looks at a scaled variant of the stochastic gradient descent algorithm for the matrix completion problem. Specifically, we propose a novel matrix-scaling of the partial derivatives that acts as an efficient preconditioning for the standard stochastic gradient descent algorithm. This proposed matrix-scaling provides a trade-off between local and global second order information. It also resolves the issue of scale invariance that exists in matrix factorization models. The overall computational complexity is linear with the number of known entries, thereby extending to a large-scale setup. Numerical comparisons show that the proposed algorithm competes favorably with state-of-the-art algorithms on various different benchmarks.

Includes members:
  Member "low rank matrix completion for topological interference management by riemannian pursuit":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "low rank matrix completion a contemporary survey")
  Member "global convergence of stochastic gradient descent for some non convex matrix problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed stochastic algorithms for high rate streaming principal component analysis")
  Member "manopt a matlab toolbox for optimization on manifolds":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint constellation design for the two user non coherent multiple access channel")
  Member "a riemannian geometry for low rank matrix completion":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "accelerated alternating projections for robust principal component analysis")
  Member "online identification and tracking of subspaces from highly incomplete information":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "online high rank matrix completion")
  Member "low rank matrix completion with noisy observations a quantitative comparison":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "bilinear factor matrix norm minimization for robust pca algorithms and applications")
  Member "matrix completion from a few entries":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "matrix completion with prior subspace information via maximizing correlation")
  Member "exact matrix completion via convex optimization":
    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)