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 "hardness of learning dnfs using halfspaces"):
  Abstract: The problem of learning $t$-term DNF formulas (for $t = O(1)$) has been studied extensively in the PAC model since its introduction by Valiant (STOC 1984). A $t$-term DNF can be efficiently learnt using a $t$-term DNF only if $t = 1$ i.e., when it is an AND, while even weakly learning a $2$-term DNF using a constant term DNF was shown to be NP-hard by Khot and Saket (FOCS 2008). On the other hand, Feldman et al. (FOCS 2009) showed the hardness of weakly learning a noisy AND using a halfspace -- the latter being a generalization of an AND, while Khot and Saket (STOC 2008) showed that an intersection of two halfspaces is hard to weakly learn using any function of constantly many halfspaces. The question of whether a $2$-term DNF is efficiently learnable using $2$ or constantly many halfspaces remained open. #R##N#In this work we answer this question in the negative by showing the hardness of weakly learning a $2$-term DNF as well as a noisy AND using any function of a constant number of halfspaces. In particular we prove the following. For any constants $\nu, \zeta > 0$ and $\ell \in \mathbb{N}$, given a distribution over point-value pairs $\{0,1\}^n \times \{0,1\}$, it is NP-hard to decide whether, #R##N#YES Case: There is a $2$-term DNF that classifies all the points of the distribution, and an AND that classifies at least $1-\zeta$ fraction of the points correctly. #R##N#NO Case: Any boolean function depending on at most $\ell$ halfspaces classifies at most $1/2 + \nu$ fraction of the points of the distribution correctly. #R##N#Our result generalizes and strengthens the previous best results mentioned above on the hardness of learning a $2$-term DNF, learning an intersection of two halfspaces, and learning a noisy AND.

Includes members:
  Member "learning convex polytopes with margin":
    also connected through other hyperedges:
      (none)
  Member "hardness of learning noisy halfspaces using polynomial thresholds":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "nearly tight bounds for robust proper learning of halfspaces with a margin")
  Member "analysis of boolean functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "coarse grained complexity for dynamic algorithms")
  Member "learning dnf expressions from fourier spectrum":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a scheme for continuous input to the tsetlin machine with applications to forecasting disease outbreaks")
  Member "hardness results for agnostically learning low degree polynomial threshold functions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "nearly tight bounds for robust proper learning of halfspaces with a margin")
  Member "agnostic learning of monomials by halfspaces is hard":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "solving empirical risk minimization in the current matrix multiplication time")

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.CC(Computational Complexity)