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 "reparameterization gradient for non differentiable models"):
  Abstract: We present a new algorithm for stochastic variational inference that targets at models with non-differentiable densities. One of the key challenges in stochastic variational inference is to come up with a low-variance estimator of the gradient of a variational objective. We tackle the challenge by generalizing the reparameterization trick, one of the most effective techniques for addressing the variance issue for differentiable models, so that the trick works for non-differentiable models as well. Our algorithm splits the space of latent variables into regions where the density of the variables is differentiable, and their boundaries where the density may fail to be differentiable. For each differentiable region, the algorithm applies the standard reparameterization trick and estimates the gradient restricted to the region. For each potentially non-differentiable boundary, it uses a form of manifold sampling and computes the direction for variational parameters that, if followed, would increase the boundary's contribution to the variational objective. The sum of all the estimates becomes the gradient estimate of our algorithm. Our estimator enjoys the reduced variance of the reparameterization gradient while remaining unbiased even for non-differentiable models. The experiments with our preliminary implementation confirm the benefit of reduced variance and unbiasedness.

Includes members:
  Member "backpropagation through the void optimizing control variates for black box gradient estimation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "generalizable adversarial attacks with latent variable perturbation modelling")
  Member "rebar low variance unbiased gradient estimates for discrete latent variable models":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "inverse graphics gan learning to generate 3d shapes from unstructured 2d data")
  Member "filtering variational objectives":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "relational state space model for stochastic multi object systems")
  Member "multilevel monte carlo method for statistical model checking of hybrid systems":
    also connected through other hyperedges:
      (none)
  Member "the concrete distribution a continuous relaxation of discrete random variables":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "domain decluttering simplifying images to mitigate synthetic real domain shift and improve depth estimation")
  Member "variational inference for monte carlo objectives":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "estimating gradients for discrete random variables by sampling without replacement")
  Member "muprop unbiased backpropagation for stochastic neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "estimating gradients for discrete random variables by sampling without replacement")
  Member "adam a method for stochastic optimization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")

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)