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 "differentiable top k operator with optimal transport"):
  Abstract: The top-k operation, i.e., finding the k largest or smallest elements from a collection of scores, is an important model component, which is widely used in information retrieval, machine learning, and data mining. However, if the top-k operation is implemented in an algorithmic way, e.g., using bubble algorithm, the resulting model cannot be trained in an end-to-end way using prevalent gradient descent algorithms. This is because these implementations typically involve swapping indices, whose gradient cannot be computed. Moreover, the corresponding mapping from the input scores to the indicator vector of whether this element belongs to the top-k set is essentially discontinuous. To address the issue, we propose a smoothed approximation, namely the SOFT (Scalable Optimal transport-based diFferenTiable) top-k operator. Specifically, our SOFT top-k operator approximates the output of the top-k operation as the solution of an Entropic Optimal Transport (EOT) problem. The gradient of the SOFT operator can then be efficiently approximated based on the optimality conditions of EOT problem. We apply the proposed operator to the k-nearest neighbors and beam search algorithms, and demonstrate improved performance.

Includes members:
  Member "stochastic beams and where to find them the gumbel top k trick for sampling sequences without replacement":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adversarial filters of dataset biases")
  Member "reparameterizable subset sampling via continuous relaxations":
    also connected through other hyperedges:
      (none)
  Member "deep k nearest neighbors towards confident interpretable and robust deep learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robustness for non parametric classification a generic attack and defense")
  Member "fine grained video categorization with redundancy reduction attention":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "listen to look action recognition by previewing audio")
  Member "neural nearest neighbors networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "learning enriched features for real image restoration and enhancement")
  Member "attention gated networks learning to leverage salient regions in medical images":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an interpretable classifier for high resolution breast cancer screening images utilizing weakly supervised localization")
  Member "optnet differentiable optimization as a layer in neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lossless compression of deep neural networks")
  Member "a continuous relaxation of beam search for end to end training of neural sequence models":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "benchmarking approximate inference methods for neural structured prediction")

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)