按年被提到
20182018 · 1 次2026
数学、逻辑与理论›AI 数学与定理证明·arXiv:1802.03685 · cs.AI

Learning a SAT Solver from Single-Bit Supervision

Daniel Selsam, Matthew Lamm, Benedikt Bünz, Percy Liang, Leonardo de Moura, David L. Dill · 2018
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2018-02-13 · 最近 2019-02-14
2不同的人
2活跃月份
2讨论串
211被引(OpenAlex)
arXiv 摘要(候选层不写导读)

We present NeuroSAT, a message passing neural network that learns to solve SAT problems after only being trained as a classifier to predict satisfiability. Although it is not competitive with state-of-the-art SAT solvers, NeuroSAT can solve problems that are substantially larger and more difficult than it ever saw during training by simply running for more iterations. Moreover, NeuroSAT generalizes to novel distributions; after training only on random SAT problems, at test time it can solve SAT problems encoding graph coloring, clique detection, dominating set, and vertex cover problems, all on a range of distributions over small random graphs.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论Isinlor · 2019-02

“Neural Networks seem to be capable of both too. Although I'm just guessing what do you mean precisely by deduction. Would you agree that solving Sudoku requires deduction? "Finally, we show how recurrent relational networks can learn to solve Sudoku puzzles from supervised training data, a challenging task requiring upwards of 64 steps of relational reas…”

Neural Networks Are Essentially Polynomial Regression (2018)原评论 ↗
被提交为 story · 1 次