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 "modelling and quantifying membership information leakage in machine learning"):
  Abstract: Machine learning models have been shown to be vulnerable to membership inference attacks, i.e., inferring whether individuals' data have been used for training models. The lack of understanding about factors contributing success of these attacks motivates the need for modelling membership information leakage using information theory and for investigating properties of machine learning models and training algorithms that can reduce membership information leakage. We use conditional mutual information leakage to measure the amount of information leakage from the trained machine learning model about the presence of an individual in the training dataset. We devise an upper bound for this measure of information leakage using Kullback--Leibler divergence that is more amenable to numerical computation. We prove a direct relationship between the Kullback--Leibler membership information leakage and the probability of success for a hypothesis-testing adversary examining whether a particular data record belongs to the training dataset of a machine learning model. We show that the mutual information leakage is a decreasing function of the training dataset size and the regularization weight. We also prove that, if the sensitivity of the machine learning model (defined in terms of the derivatives of the fitness with respect to model parameters) is high, more membership information is potentially leaked. This illustrates that complex models, such as deep neural networks, are more susceptible to membership inference attacks in comparison to simpler models with fewer degrees of freedom. We show that the amount of the membership information leakage is reduced by $\mathcal{O}(\log^{1/2}(\delta^{-1})\epsilon^{-1})$ when using Gaussian $(\epsilon,\delta)$-differentially-private additive noises.

Includes members:
  Member "gan leaks a taxonomy of membership inference attacks against gans":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "data and model dependencies of membership inference attack")
  Member "on inferring training data attributes in machine learning models":
    also connected through other hyperedges:
      (none)
  Member "stolen memories leveraging model memorization for calibrated white box membership inference":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "data and model dependencies of membership inference attack")
  Member "disparate vulnerability on the unfairness of privacy attacks against machine learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "data and model dependencies of membership inference attack")
  Member "towards demystifying membership inference attacks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "data and model dependencies of membership inference attack")
  Member "ml leaks model and data independent membership inference attacks and defenses on machine learning models":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "dynamic backdoor attacks against machine learning models")
  Member "logan membership inference attacks against generative models":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "wireless federated learning with local differential privacy")
  Member "privacy risk in machine learning analyzing the connection to overfitting":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "dynamic backdoor attacks against machine learning models")

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)