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 "meta descent for online continual prediction"):
  Abstract: This paper investigates different vector step-size adaptation approaches for non-stationary online, continual prediction problems. Vanilla stochastic gradient descent can be considerably improved by scaling the update with a vector of appropriately chosen step-sizes. Many methods, including AdaGrad, RMSProp, and AMSGrad, keep statistics about the learning process to approximate a second order update---a vector approximation of the inverse Hessian. Another family of approaches use meta-gradient descent to adapt the step-size parameters to minimize prediction error. These meta-descent strategies are promising for non-stationary problems, but have not been as extensively explored as quasi-second order methods. We first derive a general, incremental meta-descent algorithm, called AdaGain, designed to be applicable to a much broader range of algorithms, including those with semi-gradient updates or even those with accelerations, such as RMSProp. We provide an empirical comparison of methods from both families. We conclude that methods from both families can perform well, but in non-stationary prediction problems the meta-descent methods exhibit advantages. Our method is particularly robust across several prediction problems, and is competitive with the state-of-the-art method on a large-scale, time-series prediction problem on real data from a mobile robot.

Includes members:
  Member "on the convergence of adam and beyond":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "disentangling adaptive gradient methods from learning rates")
  Member "understanding short horizon bias in stochastic meta optimization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "tidbd adapting temporal difference step sizes through stochastic meta descent":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "decoupling adaptation from modeling with meta optimizers for meta learning")
  Member "online learning rate adaptation with hypergradient descent":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "is the meta learning idea able to improve the generalization of deep neural networks on the standard supervised learning")
  Member "effective sketching methods for value function approximation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finite sample analysis of lstd with random projections and eligibility traces")
  Member "learning to learn by gradient descent by gradient descent":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "accelerated gradient temporal difference learning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "kalman meets bellman improving policy evaluation through value tracking")
  Member "temporal difference networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "what s a good prediction issues in evaluating general value functions through error")

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)