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 "efficiently learning structured distributions from untrusted batches"):
  Abstract: We study the problem, introduced by Qiao and Valiant, of learning from untrusted batches. Here, we assume $m$ users, all of whom have samples from some underlying distribution $p$ over $1, \ldots, n$. Each user sends a batch of $k$ i.i.d. samples from this distribution; however an $\epsilon$-fraction of users are untrustworthy and can send adversarially chosen responses. The goal is then to learn $p$ in total variation distance. When $k = 1$ this is the standard robust univariate density estimation setting and it is well-understood that $\Omega (\epsilon)$ error is unavoidable. Suprisingly, Qiao and Valiant gave an estimator which improves upon this rate when $k$ is large. Unfortunately, their algorithms run in time exponential in either $n$ or $k$. #R##N#We first give a sequence of polynomial time algorithms whose estimation error approaches the information-theoretically optimal bound for this problem. Our approach is based on recent algorithms derived from the sum-of-squares hierarchy, in the context of high-dimensional robust estimation. We show that algorithms for learning from untrusted batches can also be cast in this framework, but by working with a more complicated set of test functions. #R##N#It turns out this abstraction is quite powerful and can be generalized to incorporate additional problem specific constraints. Our second and main result is to show that this technology can be leveraged to build in prior knowledge about the shape of the distribution. Crucially, this allows us to reduce the sample complexity of learning from untrusted batches to polylogarithmic in $n$ for most natural classes of distributions, which is important in many applications. To do so, we demonstrate that these sum-of-squares algorithms for robust mean estimation can be made to handle complex combinatorial constraints (e.g. those arising from VC theory), which may be of independent technical interest.

Includes members:
  Member "list decodable linear regression":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "list decodable subspace recovery")
  Member "list decodable learning via sum of squares":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "list decodable subspace recovery")
  Member "high dimensional estimation via sum of squares proofs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "recent advances in algorithmic high dimensional robust statistics")
  Member "federated learning strategies for improving communication efficiency":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "trends and advancements in deep neural network communication")
  Member "being robust in high dimensions can be practical":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "private mean estimation of heavy tailed distributions")
  Member "list decodable robust mean estimation and learning mixtures of spherical gaussians":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "meta learning for mixed linear regression")
  Member "learning discrete distributions from untrusted batches":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning structured distributions from untrusted batches faster and simpler")
  Member "learning populations of parameters":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "meta learning for mixed linear regression")

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.DS(Data Structures and Algorithms)