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 "large scale kernel methods and applications to lifelong robot learning"):
  Abstract: As the size and richness of available datasets grow larger, the opportunities for solving increasingly challenging problems with algorithms learning directly from data grow at the same pace. Consequently, the capability of learning algorithms to work with large amounts of data has become a crucial scientific and technological challenge for their practical applicability. Hence, it is no surprise that large-scale learning is currently drawing plenty of research effort in the machine learning research community. In this thesis, we focus on kernel methods, a theoretically sound and effective class of learning algorithms yielding nonparametric estimators. Kernel methods, in their classical formulations, are accurate and efficient on datasets of limited size, but do not scale up in a cost-effective manner. Recent research has shown that approximate learning algorithms, for instance random subsampling methods like Nystrom and random features, with time-memory-accuracy trade-off mechanisms are more scalable alternatives. In this thesis, we provide analyses of the generalization properties and computational requirements of several types of such approximation schemes. In particular, we expose the tight relationship between statistics and computations, with the goal of tailoring the accuracy of the learning process to the available computational resources. Our results are supported by experimental evidence on large-scale datasets and numerical simulations. We also study how large-scale learning can be applied to enable accurate, efficient, and reactive lifelong learning for robotics. In particular, we propose algorithms allowing robots to learn continuously from experience and adapt to changes in their operational environment. The proposed methods are validated on the iCub humanoid robot in addition to other benchmarks.

Includes members:
  Member "generalization properties and implicit regularization for multiple passes sgm":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "increasing generality in machine learning through procedural content generation")
  Member "on the equivalence between quadrature rules and random features":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "nearly optimal risk bounds for kernel k means")
  Member "train faster generalize better stability of stochastic gradient descent":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "disentangling adaptive gradient methods from learning rates")
  Member "multimodal deep learning for robust rgb d object recognition":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "when deep learning meets data alignment a review on deep registration networks drns")
  Member "incremental gradient subgradient and proximal methods for convex optimization a survey":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the impact of neural network overparameterization on gradient confusion and stochastic gradient descent")
  Member "very deep convolutional networks for large scale image recognition":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "return of the devil in the details delving deep into convolutional nets":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a survey on deep hashing methods")
  Member "efficient algorithms and error analysis for the modified nystrom method":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the singular value decomposition applications and beyond")

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)