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 "sparsified sgd with memory"):
  Abstract: Huge scale machine learning problems are nowadays tackled by distributed optimization algorithms, i.e. algorithms that leverage the compute power of many devices for training. The communication overhead is a key bottleneck that hinders perfect scalability. Various recent works proposed to use quantization or sparsification techniques to reduce the amount of data that needs to be communicated, for instance by only sending the most significant entries of the stochastic gradient (top-k sparsification). Whilst such schemes showed very promising performance in practice, they have eluded theoretical analysis so far. #R##N#In this work we analyze Stochastic Gradient Descent (SGD) with k-sparsification or compression (for instance top-k or random-k) and show that this scheme converges at the same rate as vanilla SGD when equipped with error compensation (keeping track of accumulated errors in memory). That is, communication can be reduced by a factor of the dimension of the problem (sometimes even more) whilst still converging at the same rate. We present numerical experiments to illustrate the theoretical findings and the better scalability for distributed applications.

Includes members:
  Member "communication compression for decentralized training":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "stochastic sign sgd for federated learning with theoretical guarantees")
  Member "the convergence of stochastic gradient descent in asynchronous shared memory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "elastic consistency a general consistency model for distributed stochastic gradient descent")
  Member "error compensated quantized sgd and its applications to large scale distributed optimization":
    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 "scaling sgd batch size to 32k for imagenet training":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "communication optimization strategies for distributed deep learning a survey")
  Member "passcode parallel asynchronous stochastic dual co ordinate descent":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "async a cloud engine with asynchrony and history for distributed 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)