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: "routing networks adaptive selection of non linear functions for multi task learning"
  Abstract: Multi-task learning (MTL) with neural networks leverages commonalities in tasks to improve performance, but often suffers from task interference which reduces the benefits of transfer. To address this issue we introduce the routing network paradigm, a novel neural network and training algorithm. A routing network is a kind of self-organizing neural network consisting of two components: a router and a set of one or more function blocks. A function block may be any neural network - for example a fully-connected or a convolutional layer. Given an input the router makes a routing decision, choosing a function block to apply and passing the output back to the router recursively, terminating when a fixed recursion depth is reached. In this way the routing network dynamically composes different function blocks for each input. We employ a collaborative multi-agent reinforcement learning (MARL) approach to jointly train the router and function blocks. We evaluate our model against cross-stitch networks and shared-layer baselines on multi-task settings of the MNIST, mini-imagenet, and CIFAR-100 datasets. Our experiments demonstrate a significant improvement in accuracy, with sharper convergence. In addition, routing networks have nearly constant per-task training cost while cross-stitch networks scale linearly with the number of tasks. On CIFAR-100 (20 tasks) we obtain cross-stitch performance levels with an 85% reduction in training time.

Connected through hyperedge HE-1 (induced by source paper "attention over parameters for dialogue systems"):
  with members:
    - "the second conversational intelligence challenge convai2"
    - "transfertransfo a transfer learning approach for neural network based conversational agents"
    - "global to local memory pointer networks for task oriented dialogue"
    - "moel mixture of empathetic listeners"
    - "deepcopy grounded response generation with hierarchical pointer networks"
    - "caire an end to end empathetic chatbot"
    - "learning from dialogue after deployment feed yourself chatbot"
    - "transferable multi domain state generator for task oriented dialogue systems"

Connected through hyperedge HE-2 (induced by source paper "gradient surgery for multi task learning"):
  with members:
    - "distilling policy distillation"
    - "regularized hierarchical policies for compositional transfer in robotics"
    - "branched multi task networks deciding what layers to share"
    - "meta world a benchmark and evaluation for multi task and meta reinforcement learning"
    - "routing networks and the challenges of modular and compositional computation"
    - "ray interference a source of plateaus in deep reinforcement learning"
    - "attentive single tasking of multiple tasks"
    - "impala scalable distributed deep rl with importance weighted actor learner architectures"

Connected through hyperedge HE-3 (induced by source paper "towards modular algorithm induction"):
  with members:
    - "modular networks learning to decompose neural computation"
    - "impala scalable distributed deep rl with importance weighted actor learner architectures"
    - "leveraging grammar and reinforcement learning for neural program synthesis"
    - "automatically composing representation transformations as a means for generalization"
    - "robustfill neural program learning under noisy i o"
    - "deepcoder learning to write programs"
    - "neural random access machines"
    - "learning simple algorithms from examples"

Connected through hyperedge HE-4 (induced by source paper "recurrent independent mechanisms"):
  with members:
    - "learning powerful policies by using consistent dynamics model"
    - "routing networks and the challenges of modular and compositional computation"
    - "reinforcement learning with competitive ensembles of information constrained primitives"
    - "a meta transfer objective for learning to disentangle causal mechanisms"
    - "modular networks learning to decompose neural computation"
    - "independently recurrent neural network indrnn building a longer and deeper rnn"
    - "babyai a platform to study the sample efficiency of grounded language learning"
    - "relational neural expectation maximization unsupervised discovery of objects and their interactions"

Connected through hyperedge HE-5 (induced by source paper "condconv conditionally parameterized convolutions for efficient inference"):
  with members:
    - "pay less attention with lightweight and dynamic convolutions"
    - "mixconv mixed depthwise convolutional kernels"
    - "efficientnet rethinking model scaling for convolutional neural networks"
    - "do better imagenet models transfer better"
    - "mobilenetv2 inverted residuals and linear bottlenecks"
    - "regularized evolution for image classifier architecture search"
    - "splinenets continuous neural decision graphs"
    - "neural architecture optimization"

Connected through hyperedge HE-6 (induced by source paper "branched multi task networks deciding what layers to share"):
  with members:
    - "stochastic filter groups for multi task cnns learning specialist and generalist convolution kernels"
    - "representation similarity analysis for efficient task taxonomy transfer learning"
    - "feature partitioning for efficient multi task architectures"
    - "attentive single tasking of multiple tasks"
    - "a modulation module for multi task learning with applications in image retrieval"
    - "evolutionary architecture search for deep multitask networks"
    - "regularized evolution for image classifier architecture search"
    - "taskonomy disentangling task transfer learning"

Connected through hyperedge HE-7 (induced by source paper "adashare learning what to share for efficient deep multi task learning"):
  with members:
    - "stochastic filter groups for multi task cnns learning specialist and generalist convolution kernels"
    - "deep elastic networks with model selection for multi task learning"
    - "which tasks should be learned together in multi task learning"
    - "branched multi task networks deciding what layers to share"
    - "many task learning with task routing"
    - "evolutionary architecture search for deep multitask networks"
    - "taskonomy disentangling task transfer learning"
    - "exploring shared structures and hierarchies for multiple nlp tasks"

Connected through hyperedge HE-8 (induced by source paper "routing networks and the challenges of modular and compositional computation"):
  with members:
    - "a meta mdp approach to exploration for lifelong reinforcement learning"
    - "reinforcement learning without backpropagation or a clock"
    - "the termination critic"
    - "modular networks learning to decompose neural computation"
    - "learning abstract options"
    - "evolutionary architecture search for deep multitask networks"
    - "modular meta learning"
    - "diversity is all you need learning skills without a reward function"

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)