human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "a unified optimization view on generalized matching pursuit and frank wolfe"
  Abstract: Two of the most fundamental prototypes of greedy optimization are the matching pursuit and Frank-Wolfe algorithms. In this paper, we take a unified view on both classes of methods, leading to the first explicit convergence rates of matching pursuit methods in an optimization sense, for general sets of atoms. We derive sublinear ($1/t$) convergence for both classes on general smooth objectives, and linear convergence on strongly convex objectives, as well as a clear correspondence of algorithm variants. Our presented algorithms and rates are affine invariant, and do not need any incoherence or sparsity assumptions.

Connected through hyperedge HE-1 (induced by source paper "generalization guarantees for sparse kernel approximation with entropic optimal features"):
  with members:
    - "learning bounds for greedy approximation with explicit feature maps from multiple kernels"
    - "quadrature based features for kernel approximation"
    - "random fourier features for kernel ridge regression approximation bounds and statistical guarantees"
    - "orthogonal random features"
    - "fastfood approximate kernel expansions in loglinear time"
    - "explicit approximations of the gaussian kernel"

Connected through hyperedge HE-2 (induced by source paper "frank wolfe network an interpretable deep structure for non sparse coding"):
  with members:
    - "learning simple thresholded features with sparse support recovery"
    - "theoretical linear convergence of unfolded ista and its practical weights and thresholds"
    - "ista net interpretable optimization inspired deep network for image compressive sensing"
    - "beyond a gaussian denoiser residual learning of deep cnn for image denoising"
    - "maximal sparsity with deep networks"
    - "learning optimal nonlinearities for iterative thresholding algorithms"
    - "normalizing the normalizers comparing and extending network normalization schemes"
    - "deep compression compressing deep neural networks with pruning trained quantization and huffman coding"

Connected through hyperedge HE-3 (induced by source paper "training neural networks for and by interpolation"):
  with members:
    - "sgd converges to global minimum in deep learning via star convex path"
    - "painless stochastic gradient interpolation line search and convergence rates"
    - "adaptive gradient methods with dynamic bound of learning rate"
    - "deepobs a deep learning optimizer benchmark suite"
    - "on the convergence of adam and beyond"
    - "l4 practical loss based stepsize adaptation for deep learning"
    - "fast and faster convergence of sgd for over parameterized models and an accelerated perceptron"
    - "deep frank wolfe for neural network optimization"

Question: Please tell me which class the center node 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)