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 "one shot neural architecture search through a posteriori distribution guided sampling"):
  Abstract: The emergence of one-shot approaches has greatly advanced the research on neural architecture search (NAS). Recent approaches train an over-parameterized super-network (one-shot model) and then sample and evaluate a number of sub-networks, which inherit weights from the one-shot model. The overall searching cost is significantly reduced as training is avoided for sub-networks. However, the network sampling process is casually treated and the inherited weights from an independently trained super-network perform sub-optimally for sub-networks. In this paper, we propose a novel one-shot NAS scheme to address the above issues. The key innovation is to explicitly estimate the joint a posteriori distribution over network architecture and weights, and sample networks for evaluation according to it. This brings two benefits. First, network sampling under the guidance of a posteriori probability is more efficient than conventional random or uniform sampling. Second, the network architecture and its weights are sampled as a pair to alleviate the sub-optimal weights problem. Note that estimating the joint a posteriori distribution is not a trivial problem. By adopting variational methods and introducing a hybrid network representation, we convert the distribution approximation problem into an end-to-end neural network training problem which is neatly approached by variational dropout. As a result, the proposed method reduces the number of sampled sub-networks by orders of magnitude. We validate our method on the fundamental image classification task. Results on Cifar-10, Cifar-100 and ImageNet show that our method strikes the best trade-off between precision and speed among NAS methods. On Cifar-10, we speed up the searching process by 20x and achieve a higher precision than the best network found by existing NAS methods.

Includes members:
  Member "single path one shot neural architecture search with uniform sampling":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "gan compression efficient architectures for interactive conditional gans")
  Member "towards automated deep learning efficient joint neural architecture and hyperparameter search":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "automl zero evolving machine learning algorithms from scratch")
  Member "regularized evolution for image classifier architecture search":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "searching for winograd aware quantized networks")
  Member "proxylessnas direct neural architecture search on target task and hardware":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "gan compression efficient architectures for interactive conditional gans")
  Member "connectivity learning in multi branch networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "assemblenet searching for multi stream neural connectivity in video architectures")
  Member "path level network transformation for efficient architecture search":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "autoemb automated embedding dimensionality search in streaming recommendations")
  Member "darts differentiable architecture search":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "gan compression efficient architectures for interactive conditional gans")
  Member "snas stochastic neural architecture search":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "learning architectures for binary networks")

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)