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 "sampled softmax with random fourier features"):
  Abstract: The computational cost of training with softmax cross entropy loss grows linearly with the number of classes. For the settings where a large number of classes are involved, a common method to speed up training is to sample a subset of classes and utilize an estimate of the loss gradient based on these classes, known as the sampled softmax method. However, the sampled softmax provides a biased estimate of the gradient unless the samples are drawn from the exact softmax distribution, which is again expensive to compute. Therefore, a widely employed practical approach involves sampling from a simpler distribution in the hope of approximating the exact softmax distribution. In this paper, we develop the first theoretical understanding of the role that different sampling distributions play in determining the quality of sampled softmax. Motivated by our analysis and the work on kernel-based sampling, we propose the Random Fourier Softmax (RF-softmax) method that utilizes the powerful Random Fourier Features to enable more efficient and accurate sampling from an approximate softmax distribution. We show that RF-softmax leads to low bias in estimation in terms of both the full softmax distribution and the full softmax gradient. Furthermore, the cost of RF-softmax scales only logarithmically with the number of classes.

Includes members:
  Member "stochastic negative mining for learning with large output spaces":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "pre training tasks for embedding based large scale retrieval")
  Member "normface l 2 hypersphere embedding for face verification":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "weakly supervised discriminative feature learning with state information for person identification")
  Member "sphereface deep hypersphere embedding for face recognition":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "l2 constrained softmax loss for discriminative face verification":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "generalizing face representation with unlabeled data")
  Member "fast amortized inference and learning in log linear models with randomly perturbed nearest neighbor search":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "doubly sparse sparse mixture of sparse experts for efficient softmax inference")
  Member "adaptive sampled softmax with kernel based sampling":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "pre training tasks for embedding based large scale retrieval")
  Member "efficient softmax approximation for gpus":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the implicit and explicit regularization effects of dropout")
  Member "ds mlr exploiting double separability for scaling up distributed multinomial logistic regression":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "stochastic negative mining for learning with large output spaces")

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)