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 "a unified alternating direction method of multipliers by majorization minimization"):
  Abstract: Accompanied with the rising popularity of compressed sensing, the Alternating Direction Method of Multipliers (ADMM) has become the most widely used solver for linearly constrained convex problems with separable objectives. In this work, we observe that many previous variants of ADMM update the primal variable by minimizing different majorant functions with their convergence proofs given case by case. Inspired by the principle of majorization minimization, we respectively present the unified frameworks and convergence analysis for the Gauss-Seidel ADMMs and Jacobian ADMMs, which use different historical information for the current updating. Our frameworks further generalize previous ADMMs to the ones capable of solving the problems with non-separable objectives by minimizing their separable majorant surrogates. We also show that the bound which measures the convergence speed of ADMMs depends on the tightness of the used majorant function. Then several techniques are introduced to improve the efficiency of ADMMs by tightening the majorant functions. In particular, we propose the Mixed Gauss-Seidel and Jacobian ADMM (M-ADMM) which alleviates the slow convergence issue of Jacobian ADMMs by absorbing merits of the Gauss-Seidel ADMMs. M-ADMM can be further improved by using backtracking, wise variable partition and fully exploiting the structure of the constraint. Beyond the guarantee in theory, numerical experiments on both synthesized and real-world data further demonstrate the superiority of our new ADMMs in practice. Finally, we release a toolbox at this https URL that implements efficient ADMMs for many problems in compressed sensing.

Includes members:
  Member "convex sparse spectral clustering single view to multi view":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multi view low rank sparse subspace clustering")
  Member "correlation adaptive subspace segmentation by trace lasso":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "self supervised convolutional subspace clustering network")
  Member "linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the convergence of admm with task adaption and beyond")
  Member "robust recovery of subspace structures by low rank representation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "gated fusion network for degraded image super resolution")
  Member "simultaneously structured models with application to sparse and low rank matrices":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "joint activity detection and channel estimation for mmw thz wideband massive access")
  Member "sparse subspace clustering algorithm theory and applications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "provably efficient exploration for rl with unsupervised learning")

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.NA(Numerical Analysis)