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 "communication efficient decentralized learning with sparsification and adaptive peer selection"):
  Abstract: Distributed learning techniques such as federated learning have enabled multiple workers to train machine learning models together to reduce the overall training time. However, current distributed training algorithms (centralized or decentralized) suffer from the communication bottleneck on multiple low-bandwidth workers (also on the server under the centralized architecture). Although decentralized algorithms generally have lower communication complexity than the centralized counterpart, they still suffer from the communication bottleneck for workers with low network bandwidth. To deal with the communication problem while being able to preserve the convergence performance, we introduce a novel decentralized training algorithm with the following key features: 1) It does not require a parameter server to maintain the model during training, which avoids the communication pressure on any single peer. 2) Each worker only needs to communicate with a single peer at each communication round with a highly compressed model, which can significantly reduce the communication traffic on the worker. We theoretically prove that our sparsification algorithm still preserves convergence properties. 3) Each worker dynamically selects its peer at different communication rounds to better utilize the bandwidth resources. We conduct experiments with convolutional neural networks on 32 workers to verify the effectiveness of our proposed algorithm compared to seven existing methods. Experimental results show that our algorithm significantly reduces the communication traffic and generally select relatively high bandwidth peers.

Includes members:
  Member "a distributed synchronous sgd algorithm with global top k sparsification for low bandwidth networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adaptive gradient sparsification for efficient federated learning an online learning approach")
  Member "understanding top k sparsification in distributed deep learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "layer wise adaptive gradient sparsification for distributed deep learning with convergence guarantees")
  Member "communication compression for decentralized training":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "stochastic sign sgd for federated learning with theoretical guarantees")
  Member "federated learning with non iid data":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "trends and advancements in deep neural network communication")
  Member "highly scalable deep learning training system with mixed precision training imagenet in four minutes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "sparse weight activation training")
  Member "adacomp adaptive residual gradient compression for data parallel distributed training":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (induced by source paper "communication optimization strategies for distributed deep learning a survey")

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)