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 "99 of distributed optimization is a waste of time the issue and how to fix it"):
  Abstract: Many popular distributed optimization methods for training machine learning models fit the following template: a local gradient estimate is computed independently by each worker, then communicated to a master, which subsequently performs averaging. The average is broadcast back to the workers, which use it to perform a gradient-type step to update the local version of the model. It is also well known that many such methods, including SGD, SAGA, and accelerated SGD for over-parameterized models, do not scale well with the number of parallel workers. In this paper we observe that the above template is fundamentally inefficient in that too much data is unnecessarily communicated by the workers, which slows down the overall system. We propose a fix based on a new update-sparsification method we develop in this work, which we suggest be used on top of existing methods. Namely, we develop a new variant of parallel block coordinate descent based on independent sparsification of the local gradient estimates before communication. We demonstrate that with only $m/n$ blocks sent by each of $n$ workers, where $m$ is the total number of parameter blocks, the theoretical iteration complexity of the underlying distributed methods is essentially unaffected. As an illustration, this means that when $n=100$ parallel workers are used, the communication of $99\%$ blocks is redundant, and hence a waste of time. Our theoretical claims are supported through extensive numerical experiments which demonstrate an almost perfect match with our theory on a number of synthetic and real datasets.

Includes members:
  Member "distributed learning with compressed gradient differences":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "scaffold stochastic controlled averaging for federated learning")
  Member "fast and faster convergence of sgd for over parameterized models and an accelerated perceptron":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "toward a theory of optimization for over parameterized systems of non linear equations the lessons of deep learning")
  Member "signsgd compressed optimisation for non convex problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "communication optimization strategies for distributed deep learning a survey")
  Member "deep gradient compression reducing the communication bandwidth for distributed training":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sparse weight activation training")
  Member "gradient sparsification for communication efficient distributed optimization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "communication optimization strategies for distributed deep learning a survey")
  Member "terngrad ternary gradients to reduce communication in distributed deep learning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "communication optimization strategies for distributed deep learning a survey")
  Member "qsgd communication efficient sgd via gradient quantization and encoding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "communication optimization strategies for distributed deep learning a survey")
  Member "importance sampling for minibatches":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "stochastic trust region inexact newton method for large scale machine 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.LG(Machine Learning)