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 "bolt on differential privacy for scalable stochastic gradient descent based analytics"):
  Abstract: While significant progress has been made separately on analytics systems for scalable stochastic gradient descent (SGD) and private SGD, none of the major scalable analytics frameworks have incorporated differentially private SGD. There are two inter-related issues for this disconnect between research and practice: (1) low model accuracy due to added noise to guarantee privacy, and (2) high development and runtime overhead of the private algorithms. This paper takes a first step to remedy this disconnect and proposes a private SGD algorithm to address \emph{both} issues in an integrated manner. In contrast to the white-box approach adopted by previous work, we revisit and use the classical technique of {\em output perturbation} to devise a novel "bolt-on" approach to private SGD. While our approach trivially addresses (2), it makes (1) even more challenging. We address this challenge by providing a novel analysis of the $L_2$-sensitivity of SGD, which allows, under the same privacy guarantees, better convergence of SGD when only a constant number of passes can be made over the data. We integrate our algorithm, as well as other state-of-the-art differentially private SGD, into Bismarck, a popular scalable SGD-based analytics system on top of an RDBMS. Extensive experiments show that our algorithm can be easily integrated, incurs virtually no overhead, scales well, and most importantly, yields substantially better (up to 4X) test accuracy than the state-of-the-art algorithms on many real datasets.

Includes members:
  Member "without replacement sampling for stochastic gradient methods convergence results and application to distributed optimization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "high probability generalization bounds for uniformly stable algorithms with nearly optimal rate")
  Member "principled evaluation of differentially private algorithms using dpbench":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a workload adaptive mechanism for linear queries under local differential privacy")
  Member "train faster generalize better stability of stochastic gradient descent":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "disentangling adaptive gradient methods from learning rates")
  Member "rappor randomized aggregatable privacy preserving ordinal response":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "locally private hypothesis selection")
  Member "calibrating data to sensitivity in private data analysis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "locally private hypothesis selection")
  Member "the madlib analytics library or mad skills the sql":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multi layer optimizations for end to end data analytics")
  Member "towards a unified architecture for in rdbms analytics":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multi layer optimizations for end to end data analytics")
  Member "functional mechanism regression analysis under differential privacy":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "privacy for all demystify vulnerability disparity of differential privacy against membership inference attack")

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)