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 "instance cross entropy for deep metric learning"):
  Abstract: Loss functions play a crucial role in deep metric learning thus a variety of them have been proposed. Some supervise the learning process by pairwise or tripletwise similarity constraints while others take advantage of structured similarity information among multiple data points. In this work, we approach deep metric learning from a novel perspective. We propose instance cross entropy (ICE) which measures the difference between an estimated instance-level matching distribution and its ground-truth one. ICE has three main appealing properties. Firstly, similar to categorical cross entropy (CCE), ICE has clear probabilistic interpretation and exploits structured semantic similarity information for learning supervision. Secondly, ICE is scalable to infinite training data as it learns on mini-batches iteratively and is independent of the training set size. Thirdly, motivated by our relative weight analysis, seamless sample reweighting is incorporated. It rescales samples' gradients to control the differentiation degree over training examples instead of truncating them by sample mining. In addition to its simplicity and intuitiveness, extensive experiments on three real-world benchmarks demonstrate the superiority of ICE.

Includes members:
  Member "ranked list loss for deep metric learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "revisiting training strategies and generalization performance in deep metric learning")
  Member "multi similarity loss with general pair weighting for deep metric learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "revisiting training strategies and generalization performance in deep metric learning")
  Member "hardness aware deep metric learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "revisiting training strategies and generalization performance in deep metric learning")
  Member "signal to noise ratio a robust distance metric for deep metric learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "revisiting training strategies and generalization performance in deep metric learning")
  Member "divide and conquer the embedding space for metric learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "rethinking zero shot video classification end to end training for realistic applications")
  Member "deep metric learning beyond binary supervision":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "adapting grad cam for embedding networks")
  Member "decoupled networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "neural similarity learning")
  Member "deep randomized ensembles for metric learning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "revisiting training strategies and generalization performance in deep metric learning")

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)