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 "central server free federated learning over single sided trust social networks"):
  Abstract: Federated learning has become increasingly important for modern machine learning, especially for data privacy-sensitive scenarios. Existing federated learning mostly adopts the central server-based architecture or centralized architecture. However, in many social network scenarios, centralized federated learning is not applicable (e.g., a central agent or server connecting all users may not exist, or the communication cost to the central server is not affordable). In this paper, we consider a generic setting: 1) the central server may not exist, and 2) the social network is unidirectional or of single-sided trust (i.e., user A trusts user B but user B may not trust user A). We propose a central server free federated learning algorithm, named Online Push-Sum (OPS) method, to handle this challenging but generic scenario. A rigorous regret analysis is also provided, which shows very interesting results on how users can benefit from communication with trusted users in the federated learning scenario. This work builds upon the fundamental algorithm framework and theoretical guarantees for federated learning in the generic social network scenario.

Includes members:
  Member "decentralized online learning take benefits from others data without sharing your own to track global trend":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards federated learning robustness analytics to data heterogeneity")
  Member "introduction to online convex optimization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "beyond ucb optimal and efficient contextual bandits with regression oracles")
  Member "federated machine learning concept and applications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the future of digital health with federated learning")
  Member "asynchronous subgradient push":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "asynchronous policy evaluation in distributed reinforcement learning over networks")
  Member "pipe sgd a decentralized pipelined sgd framework for distributed deep net training":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "turbo aggregate breaking the quadratic aggregation barrier in secure federated learning")
  Member "federated learning strategies for improving communication efficiency":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "trends and advancements in deep neural network communication")
  Member "don t use large mini batches use local sgd":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "faster on device training using new federated momentum algorithm")
  Member "stochastic gradient push for distributed deep learning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "gradient tracking and variance reduction for decentralized optimization and 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)