NLI autonomously discovers a vocabulary of primitive operations and interprets variable-length programs via a neural executor, allowing end-to-end training and gradient-based test-time adaptation that outperforms prior methods on combinatorial generalization tasks.
arXiv preprint arXiv:2305.19555 , year=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LG 2verdicts
UNVERDICTED 2representative citing papers
BFS-based LLM framework reduces causal graph discovery queries from quadratic to linear while incorporating observational data and reporting state-of-the-art results on real graphs.
citing papers explorer
-
Gradient-Based Program Synthesis with Neurally Interpreted Languages
NLI autonomously discovers a vocabulary of primitive operations and interprets variable-length programs via a neural executor, allowing end-to-end training and gradient-based test-time adaptation that outperforms prior methods on combinatorial generalization tasks.
-
Efficient Causal Graph Discovery Using Large Language Models
BFS-based LLM framework reduces causal graph discovery queries from quadratic to linear while incorporating observational data and reporting state-of-the-art results on real graphs.