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 "dada differentiable automatic data augmentation"):
  Abstract: Data augmentation (DA) techniques aim to increase data variability, and thus train deep networks with better generalisation. The pioneering AutoAugment automated the search for optimal DA policies with reinforcement learning. However, AutoAugment is extremely computationally expensive, limiting its wide applicability. Followup work such as PBA and Fast AutoAugment improved efficiency, but optimization speed remains a bottleneck. In this paper, we propose Differentiable Automatic Data Augmentation (DADA) which dramatically reduces the cost. DADA relaxes the discrete DA policy selection to a differentiable optimization problem via Gumbel-Softmax. In addition, we introduce an unbiased gradient estimator, RELAX, leading to an efficient and effective one-pass optimization strategy to learn an efficient and accurate DA policy. We conduct extensive experiments on CIFAR-10, CIFAR-100, SVHN, and ImageNet datasets. Furthermore, we demonstrate the value of Auto DA in pre-training for downstream detection problems. Results show our DADA is at least one order of magnitude faster than the state-of-the-art while achieving very comparable accuracy.

Includes members:
  Member "searching for a robust neural architecture in four gpu hours":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning architectures for binary networks")
  Member "mmdetection open mmlab detection toolbox and benchmark":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mixpath a unified approach for one shot neural architecture search")
  Member "fast autoaugment":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on feature normalization and data augmentation")
  Member "data augmentation by pairing samples for images classification":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "affinity and diversity quantifying mechanisms of data augmentation")
  Member "darts differentiable architecture search":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "learning architectures for binary networks")
  Member "shakedrop regularization for deep residual learning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on feature normalization and data augmentation")
  Member "backpropagation through the void optimizing control variates for black box gradient estimation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "generalizable adversarial attacks with latent variable perturbation modelling")

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.CV(Computer Vision and Pattern Recognition)