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 "securing distributed gradient descent in high dimensional statistical learning"):
  Abstract: We consider unreliable distributed learning systems wherein the training data is kept confidential by external workers, and the learner has to interact closely with those workers to train a model. In particular, we assume that there exists a system adversary that can adaptively compromise some workers; the compromised workers deviate from their local designed specifications by sending out arbitrarily malicious messages. #R##N#We assume in each communication round, up to $q$ out of the $m$ workers suffer Byzantine faults. Each worker keeps a local sample of size $n$ and the total sample size is $N=nm$. We propose a secured variant of the gradient descent method that can tolerate up to a constant fraction of Byzantine workers, i.e., $q/m = O(1)$. Moreover, we show the statistical estimation error of the iterates converges in $O(\log N)$ rounds to $O(\sqrt{q/N} + \sqrt{d/N})$, where $d$ is the model dimension. As long as $q=O(d)$, our proposed algorithm achieves the optimal error rate $O(\sqrt{d/N})$. Our results are obtained under some technical assumptions. Specifically, we assume strongly-convex population risk. Nevertheless, the empirical risk (sample version) is allowed to be non-convex. The core of our method is to robustly aggregate the gradients computed by the workers based on the filtering procedure proposed by Steinhardt et al. On the technical front, deviating from the existing literature on robustly estimating a finite-dimensional mean vector, we establish a {\em uniform} concentration of the sample covariance matrix of gradients, and show that the aggregated gradient, as a function of model parameter, converges uniformly to the true gradient function. To get a near-optimal uniform concentration bound, we develop a new matrix concentration inequality, which might be of independent interest.

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 "federated learning strategies for improving communication efficiency":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "trends and advancements in deep neural network communication")
  Member "byzantine robust distributed learning towards optimal statistical rates":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "turbo aggregate breaking the quadratic aggregation barrier in secure federated learning")
  Member "sever a robust meta algorithm for stochastic optimization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the effectiveness of mitigating data poisoning attacks with gradient shaping")
  Member "defending against saddle point attack in byzantine robust distributed learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the sample complexity of adversarial multi source pac learning")
  Member "being robust in high dimensions can be practical":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "private mean estimation of heavy tailed distributions")
  Member "distributed statistical machine learning in adversarial settings byzantine gradient descent":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "trends and advancements in deep neural network communication")
  Member "byzantine tolerant machine learning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "communication efficient and byzantine robust distributed 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)