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 "subsampling for ridge regression via regularized volume sampling"):
  Abstract: Given $n$ vectors $\mathbf{x}_i\in \mathbb{R}^d$, we want to fit a linear regression model for noisy labels $y_i\in\mathbb{R}$. The ridge estimator is a classical solution to this problem. However, when labels are expensive, we are forced to select only a small subset of vectors $\mathbf{x}_i$ for which we obtain the labels $y_i$. We propose a new procedure for selecting the subset of vectors, such that the ridge estimator obtained from that subset offers strong statistical guarantees in terms of the mean squared prediction error over the entire dataset of $n$ labeled vectors. The number of labels needed is proportional to the statistical dimension of the problem which is often much smaller than $d$. Our method is an extension of a joint subsampling procedure called volume sampling. A second major contribution is that we speed up volume sampling so that it is essentially as efficient as leverage scores, which is the main i.i.d. subsampling procedure for this task. Finally, we show theoretically and experimentally that volume sampling has a clear advantage over any i.i.d. sampling when labels are expensive.

Includes members:
  Member "unbiased estimates for linear regression via volume sampling":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "blinkml efficient maximum likelihood estimation with probabilistic guarantees")
  Member "sharp analysis of low rank kernel matrix approximations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "diversity sampling is an implicit regularization for kernel methods")
  Member "fast approximation of matrix coherence and statistical leverage":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sketching transformed matrices with applications to natural language processing")
  Member "optimal column based low rank matrix reconstruction":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "improved guarantees and a multiple descent curve for the column subset selection problem and the nystr om method")
  Member "randomized algorithms for matrices and data":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "solving tall dense linear programs in nearly linear time")
  Member "efficient volume sampling for row column subset selection":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "improved guarantees and a multiple descent curve for the column subset selection problem and the nystr om method")

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)