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 "being robust in high dimensions can be practical"):
  Abstract: Robust estimation is much more challenging in high dimensions than it is in one dimension: Most techniques either lead to intractable optimization problems or estimators that can tolerate only a tiny fraction of errors. Recent work in theoretical computer science has shown that, in appropriate distributional models, it is possible to robustly estimate the mean and covariance with polynomial time algorithms that can tolerate a constant fraction of corruptions, independent of the dimension. However, the sample and time complexity of these algorithms is prohibitively large for high-dimensional applications. In this work, we address both of these issues by establishing sample complexity bounds that are optimal, up to logarithmic factors, as well as giving various refinements that allow the algorithms to tolerate a much larger fraction of corruptions. Finally, we show on both synthetic and real data that our algorithms have state-of-the-art performance and suddenly make high-dimensional robust estimation a realistic possibility.

Includes members:
  Member "robust sparse estimation tasks in high dimensions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "average case lower bounds for learning sparse mixtures robust estimation and semirandom adversaries")
  Member "resilience a criterion for learning in the presence of arbitrary outliers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "learning structured distributions from untrusted batches faster and simpler")
  Member "learning from untrusted data":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "statistical query lower bounds for robust estimation of high dimensional gaussians and gaussian mixtures":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "learning structured distributions from untrusted batches faster and simpler")
  Member "agnostic estimation of mean and covariance":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "robust estimators in high dimensions without the computational intractability":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "locally private hypothesis selection")
  Member "faster and sample near optimal algorithms for proper learning mixtures of gaussians":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "locally private hypothesis selection")
  Member "robust pca via outlier pursuit":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")

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)