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 "trajectory normalized gradients for distributed optimization"):
  Abstract: Recently, researchers proposed various low-precision gradient compression, for efficient communication in large-scale distributed optimization. Based on these work, we try to reduce the communication complexity from a new direction. We pursue an ideal bijective mapping between two spaces of gradient distribution, so that the mapped gradient carries greater information entropy after the compression. In our setting, all servers should share a reference gradient in advance, and they communicate via the normalized gradients, which are the subtraction or quotient, between current gradients and the reference. To obtain a reference vector that yields a stronger signal-to-noise ratio, dynamically in each iteration, we extract and fuse information from the past trajectory in hindsight, and search for an optimal reference for compression. We name this to be the trajectory-based normalized gradients (TNG). It bridges the research from different societies, like coding, optimization, systems, and learning. It is easy to implement and can universally combine with existing algorithms. Our experiments on benchmarking hard non-convex functions, convex problems like logistic regression demonstrate that TNG is more compression-efficient for communication of distributed optimization of general functions.

Includes members:
  Member "sparsified sgd with memory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sparse weight activation training")
  Member "signsgd compressed optimisation for non convex problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "communication optimization strategies for distributed deep learning a survey")
  Member "an alternative view when does sgd escape local minima":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fastgae fast scalable and effective graph autoencoders with stochastic subgraph decoding")
  Member "cooperative sgd a unified framework for the design and analysis of communication efficient sgd algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "trends and advancements in deep neural network communication")
  Member "error compensated quantized sgd and its applications to large scale distributed optimization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "communication optimization strategies for distributed deep learning a survey")
  Member "self normalizing neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "soft root sign activation function")
  Member "gradient sparsification for communication efficient distributed optimization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "communication optimization strategies for distributed deep learning a survey")
  Member "sparse communication for distributed gradient descent":
    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)