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 "l_dmi an information theoretic noise robust loss function"):
  Abstract: Accurately annotating large scale dataset is notoriously expensive both in time and in money. Although acquiring low-quality-annotated dataset can be much cheaper, it often badly damages the performance of trained models when using such dataset without particular treatment. Various methods have been proposed for learning with noisy labels. However, most methods only handle limited kinds of noise patterns, require auxiliary information or steps (e.g. , knowing or estimating the noise transition matrix), or lack theoretical justification. In this paper, we propose a novel information-theoretic loss function, $\mathcal{L}_{DMI}$, for training deep neural networks robust to label noise. The core of $\mathcal{L}_{DMI}$ is a generalized version of mutual information, termed Determinant based Mutual Information (DMI), which is not only information-monotone but also relatively invariant. \emph{To the best of our knowledge, $\mathcal{L}_{DMI}$ is the first loss function that is provably robust to instance-independent label noise, regardless of noise pattern, and it can be applied to any existing classification neural networks straightforwardly without any auxiliary information}. In addition to theoretical justification, we also empirically show that using $\mathcal{L}_{DMI}$ outperforms all other counterparts in the classification task on both image dataset and natural language dataset include Fashion-MNIST, CIFAR-10, Dogs vs. Cats, MR with a variety of synthesized noise patterns and noise amounts, as well as a real-world dataset Clothing1M. Codes are available at this https URL .

Includes members:
  Member "max mig an information theoretic approach for joint learning from crowds":
    also connected through other hyperedges:
      (none)
  Member "probabilistic end to end noise correction for learning with noisy labels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dividemix learning with noisy labels as semi supervised learning")
  Member "joint optimization framework for learning with noisy labels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "noise estimation using density estimation for self supervised multimodal learning")
  Member "water from two rocks maximizing the mutual information":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")
  Member "dimensionality driven learning with noisy labels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "dividemix learning with noisy labels as semi supervised learning")
  Member "learning to reweight examples for robust deep learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "noise estimation using density estimation for self supervised multimodal learning")
  Member "masking a new perspective of noisy supervision":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "derivative manipulation for general example weighting")
  Member "using trusted data to train deep networks on labels corrupted by severe noise":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "selective weak supervision for neural information retrieval")

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)