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 "towards synthesizing complex programs from input output examples"):
  Abstract: In recent years, deep learning techniques have been developed to improve the performance of program synthesis from input-output examples. Albeit its significant progress, the programs that can be synthesized by state-of-the-art approaches are still simple in terms of their complexity. In this work, we move a significant step forward along this direction by proposing a new class of challenging tasks in the domain of program synthesis from input-output examples: learning a context-free parser from pairs of input programs and their parse trees. We show that this class of tasks are much more challenging than previously studied tasks, and the test accuracy of existing approaches is almost 0%. #R##N#We tackle the challenges by developing three novel techniques inspired by three novel observations, which reveal the key ingredients of using deep learning to synthesize a complex program. First, the use of a non-differentiable machine is the key to effectively restrict the search space. Thus our proposed approach learns a neural program operating a domain-specific non-differentiable machine. Second, recursion is the key to achieve generalizability. Thus, we bake-in the notion of recursion in the design of our non-differentiable machine. Third, reinforcement learning is the key to learn how to operate the non-differentiable machine, but it is also hard to train the model effectively with existing reinforcement learning algorithms from a cold boot. We develop a novel two-phase reinforcement learning-based search algorithm to overcome this issue. In our evaluation, we show that using our novel approach, neural parsing programs can be learned to achieve 100% test accuracy on test inputs that are 500x longer than the training samples.

Includes members:
  Member "robustfill neural program learning under noisy i o":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "intelligence physics and information the tradeoff between accuracy and simplicity in machine learning")
  Member "making neural programming architectures generalize via recursion":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "progress extrapolating algorithmic learning to arbitrary sequence lengths")
  Member "towards string to tree neural machine translation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "structural language models of code")
  Member "language to logical form with neural attention":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "unsupervised question decomposition for question answering")
  Member "adaptive neural compilation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "learning compositional neural programs with recursive tree search and planning")
  Member "overcoming catastrophic forgetting in neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey on contextual embeddings")
  Member "recurrent neural network grammars":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "hierarchical character embeddings learning phonological and semantic representations in languages of logographic origin using recursive neural networks")
  Member "globally normalized transition based neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "consistency of a recurrent language model with respect to incomplete decoding")

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)