atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

A learnability analysis on neuro-symbolic learning

NeurIPS 2025 · Learning theory and algorithms › Combinatorial and search optimization · approach: Differentiable and symbolic reasoning · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Theoretical analysis showing a neuro-symbolic task is learnable iff its derived constraint satisfaction problem (DCSP) has a unique solution, with sample complexity and asymptotic error bounds, validated on MNIST-style addition and modular addition experiments.

Problem

When can concept-level risk be minimized via empirical risk minimization on the neuro-symbolic (NeSy) risk in hybrid learning-plus-reasoning systems (e.g., abductive learning, probabilistic NeSy), i.e., which NeSy tasks are learnable?

Approach

Formulate NeSy learning as a derived constraint satisfaction problem over concept clusters; a task is learnable iff the DCSP has a unique solution (disagreement d=0), yielding a sample complexity bound and an asymptotic error bound d/L; unlearnable tasks can become learnable via ensembles of tasks whose combined DCSP is unique.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Combine the mod-2 and mod-3 addition tasksMNIST modular addition ensemble · MNIST, k1=2 and k2=3DCSP solution disagreement: 10 -> 8Helped
Combine the mod-3 and mod-4 addition tasksMNIST modular addition ensemble · MNIST, k1=3 and k2=4DCSP solution disagreement: 10 -> 0Helped
Increase DCSP solution disagreementNeSy tasks · Addition and modular addition tasksAsymptotic concept accuracy boundHurt
Use an ensemble whose combined DCSP still has multiple solutionsUnlearnable NeSy tasks · MNIST modular addition ensemble, k1=2 and k2=3Learnability: 10 -> 8No clear effect
Use an ensemble whose combined DCSP has a unique solutionUnlearnable NeSy tasks · MNIST modular addition ensemble, k1=3 and k2=4Learnability: 10 -> 0Helped

Surprising findings

Limitations

Experimental setup

Datasets: MNIST KMNIST CIFAR-10 SVHN

Benchmarks: addition multiplication modular addition XOR

Metrics: concept accuracy reasoning accuracy NeSy risk DCSP solution disagreement d/L

Baselines: ABL PNL surrogate risk (A3BL-style)

Builds on: abductive learning DeepProbLog PAC learning

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy