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 "task based end to end model learning in stochastic optimization"):
  Abstract: With the increasing popularity of machine learning techniques, it has become common to see prediction algorithms operating within some larger process. However, the criteria by which we train these algorithms often differ from the ultimate criteria on which we evaluate them. This paper proposes an end-to-end approach for learning probabilistic machine learning models in a manner that directly captures the ultimate task-based objective for which they will be used, within the context of stochastic programming. We present three experimental evaluations of the proposed approach: a classical inventory stock problem, a real-world electrical grid scheduling task, and a real-world energy storage arbitrage task. We show that the proposed approach can outperform both traditional modeling and purely black-box policy optimization approaches in these applications.

Includes members:
  Member "goal driven dynamics learning via bayesian optimization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a new simulation metric to determine safe environments and controllers for systems with unknown dynamics")
  Member "optnet differentiable optimization as a layer in neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lossless compression of deep neural networks")
  Member "model agnostic meta learning for fast adaptation of deep networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "reinforcement learning with unsupervised auxiliary tasks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "perception and decision making of autonomous systems in the era of learning an overview")
  Member "input convex neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deep multi agent reinforcement learning for decentralized continuous cooperative control")
  Member "on differentiating parameterized argmin and argmax problems with application to bi level optimization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "spatio temporal ranked attention networks for video captioning")
  Member "value iteration networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "plannable approximations to mdp homomorphisms equivariance under actions")
  Member "multi objective deep reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "review analyze and design a comprehensive deep reinforcement learning framework")

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)