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 "distributed learning over unreliable networks"):
  Abstract: Most of today's distributed machine learning systems assume {\em reliable networks}: whenever two machines exchange information (e.g., gradients or models), the network should guarantee the delivery of the message. At the same time, recent work exhibits the impressive tolerance of machine learning algorithms to errors or noise arising from relaxed communication or synchronization. In this paper, we connect these two trends, and consider the following question: {\em Can we design machine learning systems that are tolerant to network unreliability during training?} With this motivation, we focus on a theoretical problem of independent interest---given a standard distributed parameter server architecture, if every communication between the worker and the server has a non-zero probability $p$ of being dropped, does there exist an algorithm that still converges, and at what speed? The technical contribution of this paper is a novel theoretical analysis proving that distributed learning over unreliable network can achieve comparable convergence rate to centralized or distributed learning over reliable networks. Further, we prove that the influence of the packet drop rate diminishes with the growth of the number of \textcolor{black}{parameter servers}. We map this theoretical result onto a real-world scenario, training deep neural networks over an unreliable network layer, and conduct network simulation to validate the system improvement by allowing the networks to be unreliable.

Includes members:
  Member "byzantine stochastic gradient descent":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "federated over the air subspace learning from incomplete data")
  Member "communication compression for decentralized training":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "stochastic sign sgd for federated learning with theoretical guarantees")
  Member "sparcml high performance sparse communication for machine learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "communication optimization strategies for distributed deep learning a survey")
  Member "byzantine robust distributed learning towards optimal statistical rates":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "turbo aggregate breaking the quadratic aggregation barrier in secure federated learning")
  Member "gossipgrad scalable deep learning using gossip communication based asynchronous gradient descent":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed learning in the non convex world from batch to streaming data and beyond")
  Member "don t use large mini batches use local sgd":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "faster on device training using new federated momentum algorithm")
  Member "sparsified sgd with memory":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "sparse weight activation training")
  Member "cola decentralized linear learning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "turbo aggregate breaking the quadratic aggregation barrier in secure federated 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.DC(Distributed, Parallel, and Cluster Computing)