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 "stochastic generative hashing"):
  Abstract: Learning-based binary hashing has become a powerful paradigm for fast search and retrieval in massive databases. However, due to the requirement of discrete outputs for the hash functions, learning such functions is known to be very challenging. In addition, the objective functions adopted by existing hashing techniques are mostly chosen heuristically. In this paper, we propose a novel generative approach to learn hash functions through Minimum Description Length principle such that the learned hash codes maximally compress the dataset and can also be used to regenerate the inputs. We also develop an efficient learning algorithm based on the stochastic distributional gradient, which avoids the notorious difficulty caused by binary output constraints, to jointly optimize the parameters of the hash function and the associated generative model. Extensive experiments on a variety of large-scale datasets show that the proposed method achieves better retrieval results than the existing state-of-the-art methods.

Includes members:
  Member "polysemous codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning to compress and search visual data in large scale systems")
  Member "hashing with binary autoencoders":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "auto encoding twin bottleneck hashing")
  Member "provable bayesian inference via particle mirror descent":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "implicit generative modeling for efficient exploration")
  Member "quantization based fast inner product search":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "pre training tasks for embedding based large scale retrieval")
  Member "muprop unbiased backpropagation for stochastic neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "neural variational inference and learning in belief networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "estimating gradients for discrete random variables by sampling without replacement")
  Member "hashing for similarity search a survey":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a survey on deep hashing methods")

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)