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 "scalable approximate inference and some applications"):
  Abstract: Approximate inference in probability models is a fundamental task in machine learning. Approximate inference provides powerful tools to Bayesian reasoning, decision making, and Bayesian deep learning. The main goal is to estimate the expectation of interested functions w.r.t. a target distribution. When it comes to high dimensional probability models and large datasets, efficient approximate inference becomes critically important. In this thesis, we propose a new framework for approximate inference, which combines the advantages of these three frameworks and overcomes their limitations. Our proposed four algorithms are motivated by the recent computational progress of Stein's method. Our proposed algorithms are applied to continuous and discrete distributions under the setting when the gradient information of the target distribution is available or unavailable. Theoretical analysis is provided to prove the convergence of our proposed algorithms. Our adaptive IS algorithm iteratively improves the importance proposal by functionally decreasing the KL divergence between the updated proposal and the target. When the gradient of the target is unavailable, our proposed sampling algorithm leverages the gradient of a surrogate model and corrects induced bias with importance weights, which significantly outperforms other gradient-free sampling algorithms. In addition, our theoretical results enable us to perform the goodness-of-fit test on discrete distributions. At the end of the thesis, we propose an importance-weighted method to efficiently aggregate local models in distributed learning with one-shot communication. Results on simulated and real datasets indicate the statistical efficiency and wide applicability of our algorithm.

Includes members:
  Member "stein variational inference for discrete distributions":
    also connected through other hyperedges:
      (none)
  Member "understanding straight through estimator in training activation quantized neural nets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deformation aware unpaired image translation for pose estimation on laboratory animals")
  Member "binary ensemble neural network more bits per network or more networks per bit":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "learning architectures for binary networks")
  Member "deep probabilistic video compression":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "machine learning in the air")
  Member "a bandit approach to maximum inner product search":
    also connected through other hyperedges:
      (none)
  Member "bnn improved binary network training":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "forward and backward information retention for accurate binary neural networks")
  Member "adversarial variational bayes unifying variational autoencoders and generative adversarial networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "adversarial code learning for image generation")
  Member "stein variational policy gradient":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "curriculum in gradient based meta reinforcement 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)