paper-with-me

홈 › Papers

Techniques for Symbol Grounding with SATNet

2021-06-16 · NeurIPS 2021 12 · Sever Topan, David Rolnick, Xujie Si

Many experts argue that the future of artificial intelligence is limited by the field's ability to integrate symbolic logical reasoning into deep learning architectures. The recently proposed differentiable MAXSAT solver, SATNet, was a breakthrough in its capacity to integrate with a traditional neural network and solve visual reasoning problems. For instance, it can learn the rules of Sudoku purely from image examples. Despite its success, SATNet was shown to succumb to a key challenge in neurosymbolic systems known as the Symbol Grounding Problem: the inability to map visual inputs to symbolic variables without explicit supervision ("label leakage"). In this work, we present a self-supervised pre-training pipeline that enables SATNet to overcome this limitation, thus broadening the class of problems that SATNet architectures can solve to include datasets where no intermediary labels are available at all. We demonstrate that our method allows SATNet to attain full accuracy even with a harder problem setup that prevents any label leakage. We additionally introduce a proofreading method that further improves the performance of SATNet architectures, beating the state-of-the-art on Visual Sudoku.

📄 PDF Abstract BibTeX arXiv:2106.11072

Code (1)

SeverTopan/SATNet 공식 구현 pytorch

Tasks

Logical ReasoningVisual Reasoning

Similar Papers 제목 키워드 기반

Assessing SATNet's Ability to Solve the Symbol Grounding Problem

2023-12-13 · NeurIPS 2020 12 · Oscar Chang, Lampros Flokas, Hod Lipson, Michael Spranger

SATNet is an award-winning MAXSAT solver that can be used to infer logical rules and integrated as a differentiable layer in a deep neural network. It had been shown to solve Sudoku puzzles visually from examples of puzz…

Logical Reasoning

Learning to Solve Constraint Satisfaction Problems with Recurrent Transformer

2023-07-10 · Zhun Yang, Adam Ishay, Joohyung Lee

Constraint satisfaction problems (CSPs) are about finding values of variables that satisfy the given constraints. We show that Transformer extended with recurrence is a viable approach to learning to solve CSPs in an end…

Inductive Learning

Learning Symmetric Rules with SATNet

2022-06-28 · Sangho Lim, Eun-Gyeol Oh, Hongseok Yang

SATNet is a differentiable constraint solver with a custom backpropagation algorithm, which can be used as a layer in a deep-learning system. It is a promising proposal for bridging deep learning and logical reasoning. I…

Logical ReasoningRubik's Cube

Learning Reliable Logical Rules with SATNet

2023-10-03 · NeurIPS 2023 11

Bridging logical reasoning and deep learning is crucial for advanced AI systems. In this work, we present a new framework that addresses this goal by generating interpretable and verifiable logical rules through differen…

Logical Reasoning

Building Dataset for Grounding of Formulae — Annotating Coreference Relations Among Math Identifiers

2022-06-01 · LREC 2022 6 · Takuto Asakura, Yusuke Miyao, Akiko Aizawa

Grounding the meaning of each symbol in math formulae is important for automated understanding of scientific documents. Generally speaking, the meanings of math symbols are not necessarily constant, and the same symbol i…

Math