Learning Program Synthesis for Integer Sequences from Scratch
Thibault Gauthier, Josef Urban
2023年份
12被引次数
1顶会引用
摘要
We present a self-learning approach for synthesizing programs from integer sequences. Our method relies on a tree search guided by a learned policy. Our system is tested on the On-Line Encyclopedia of Integer Sequences. There, it discovers, on its own, solutions for 27987 sequences starting from basic operators and without human-written training examples.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper1
相关 Paper
- CrossBeam: Learning to Search in Bottom-Up Program SynthesisKensen Shi, Hanjun Dai, Kevin Ellis, Charles SuttonICLR 2022 · 被引用 28 次
- BUSTLE: Bottom-Up Program Synthesis Through Learning-Guided ExplorationAugustus Odena, Kensen Shi, David Bieber, Rishabh Singh 等ICLR 2021 · 被引用 60 次
- Reinforcement Learning and Data-Generation for Syntax-Guided SynthesisJulian Parsert, Elizabeth PolgreenAAAI 2024 · 被引用 7 次
- Learning Logic Programs by Discovering Where Not to SearchAndrew Cropper, Céline HocquetteAAAI 2023 · 被引用 3 次
- Progressive Self-Learning for Domain Adaptation on Symbolic Regression of Integer SequencesYaohui Zhu, Kaiming Sun, Zhengdong Luo, Lingfeng WangAAAI 2025
