Cited by 60Topic ModelingLogic, Reasoning, and KnowledgeNatural Language Processing Techniques

On the Paradox of Learning to Reason from Data

Open access
Zhang, Honghua, Li, Liunian Harold, Meng, Tao, Chang, Kai-Wei, Van den Broeck, Guy·2023·Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence

Abstract

Logical reasoning is needed in a wide range of NLP tasks. Can a BERT model be trained end-to-end to solve logical reasoning problems presented in natural language? We attempt to answer this question in a confined problem space where there exists a set of parameters that perfectly simulates logical reasoning. We make observations that seem to contradict each other: BERT attains near-perfect accuracy on in-distribution test examples while failing to generalize to other data distributions over the exact same problem space. Our study provides an explanation for this paradox: instead of learning to emulate the correct reasoning function, BERT has, in fact, learned statistical features that inherently exist in logical reasoning problems. We also show that it is infeasible to jointly remove statistical features from data, illustrating the difficulty of learning to reason in general. Our result naturally extends to other neural models (e.g. T5) and unveils the fundamental difference between learning to reason and learning to achieve high performance on NLP benchmarks using statistical features.

AI snapshot

Written from the paper’s full text.

TL;DR

BERT can reach near-perfect in-distribution accuracy on a confined logical reasoning problem space, but it fails to generalize across distributions over the same problem space. The paper argues this paradox occurs because BERT learns statistical features inherent to logical reasoning problems rather than emulating the correct reasoning function.

Key findings

  • BERT trained and tested on the same sampling distribution achieves near-perfect accuracy: on RP→RP, accuracy ranges from 99.9% at reasoning depth 0 to 95.5% at depth 6; on LP→LP, from 100.0% to 99.0%.
  • Cross-distribution generalization fails sharply: RP-trained BERT tested on LP drops from 99.8% at depth 0 to 57.3% at depth 6; LP-trained BERT tested on RP drops from 97.3% to 69.2%.
  • Training on a mixture of RP and LP still fails on a slightly different LP* distribution, with accuracy falling to 55.2% at depth 6.
  • The paper identifies statistical features such as `#rule`: in RP, `Pr(label=1 | #rule=x) > 0.5` for `x > 40`. Removing `#rule` as a statistical feature improves LP generalization at depth 6 from 57.3% to 68.1%, about 10% higher. Jointly removing multiple statistical features is computationally expensive: balancing `#fact=15` requires `k=5.5`, adding branching factor `[2.65,2.75]` requires `k=20.0`, and adding `#rule=58` requires `k=55.6`.

Methods

  • The authors define SimpleLogic, a propositional-logic problem space using definite clauses. Each example is `(facts, rules, query, label)`; `#atom` ranges from 5 to 30 sampled from 150 adjectives, `#rule` from 0 to `4 × #atom`, rule bodies contain 1 to 3 atoms, `#fact` from 1 to `#atom`, and reasoning depth ranges from 0 to 6. Problems are encoded in templated English.
  • They prove by construction that BERT has enough capacity to simulate forward chaining and solve SimpleLogic instances of reasoning depth ≤ 10 with 100% accuracy.
  • They sample datasets via Rule-Priority (RP) and Label-Priority (LP), 40k examples per reasoning depth from 0 to 6, yielding 280k examples per dataset, then train BERT-base on RP, LP, and mixtures. They also construct RP_balance by down-sampling to remove `#rule` as a statistical feature, and report similar behavior for T5.

Limitations

  • The paper does not state an explicit limitations section.
  • Evident from the text: the study is confined to SimpleLogic, a simple, finite, templated problem space with no language variance, no prior knowledge, only deductive propositional definite clauses, and limited reasoning depth. The authors note that real NLP reasoning tasks involving prior knowledge and language variance could have even stronger statistical features.
  • Evident from the text: removing statistical features is only partially feasible. The paper balances `#rule` only for `0 ≤ x ≤ 80`, covering about 90% of RP examples, and shows that jointly removing multiple statistical features grows the required sampling cost roughly exponentially. Experiments focus on BERT and T5.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.24963/ijcai.2023/375

Cites

40 of 40 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Claims the paper makes

0 of 9 cited sources checked · 0 supported · 0 flagged

  • Findingown data

    As more statistical features are jointly removed, the conditional probability Pr(label=1|X) becomes more unbalanced.

    “As shown in Table 4, as we try to jointly remove more statistical features X, Pr(label = 1|X) becomes more unbalanced”
    Quote in the paperSubstantial claim
  • Findingown data

    A reasoning problem's most basic statistic can reveal substantial information about its correct label.

    “even the simplest statistic of a reasoning problem can give away significant information about the true label (Sec.4.1)”
    • Also stated in: § 4 BERT Learns Statistical Features · plain
      “even the simplest statistics of reasoning problems can provide significant information about their labels”
    Quote in the paperSubstantial claim
  • Findingown data

    BERT trained on RP balance performs even better on RP than BERT trained on RP.

    “As shown in Table 3, BERT trained on RP shows large performance drop when tested on RP balance, while BERT trained on RP balance shows even better performance on RP than RP-trained BERT.”
    Quote in the paperSubstantial claim
  • Findingown data

    A BERT model trained on combined RP and LP data performs poorly on LP*, a slightly altered version of LP.

    “we observe that the model performance again drops significantly on LP * (Table 2)”
    Quote in the paperSubstantial claim
  • Findingown data

    The rule count acts as a statistical feature in the RP dataset.

    “Hence, we call #rule a statistical feature for the dataset RP.”
    Quote in the paperSubstantial claim
  • Classified as probably not a substantial claim. 5
  • May combine two claims. 15
  • Probably not a substantial claim: may not pass S4 (based).

    Findingnone given
    § On the Paradox of Learning to Reason from Data

    The constructed BERT achieves perfect accuracy on all SimpleLogic instances with reasoning depth up to 10.

    “the”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Findingown data

    BERT achieves near-perfect accuracy on in-distribution test examples but does not generalize to other data distributions within the same problem space.

    “BERT attains near-perfect accuracy on in-distribution test examples while failing to generalize to other data distributions over the exact same problem space.”
    • Also stated in: § 1 Introduction · plain
      “the models attaining near-perfect accuracy on one data distribution do not generalize to other distributions within the same problem space (Sec.3).”
    • Also stated in: § BERT Performs Well on Training Distributions · plain
      “the BERT model trained on RP fails drastically on LP, and vice versa.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingown data

    A higher branching factor makes a positive example less likely, as verified for RP.

    “Our intuition suggests that the larger the branching factor, the less likely an example will be positive; we verify that this intuition holds for RP, as shown in Figure 5.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Findingown data

    In RP, the rule count correlates strongly with labels: above 40 rules, positive examples exceed half by wide margins, with Pr(label=1 | #rule=x) > 0.5 for x > 40.

    “the #rule for reasoning problems in RP exhibit a strong correlation with their labels: when #rule > 40, the number of positive examples exceeds 50% by large margins; formally, Pr e∼RP (label(e) = 1 | #rule(e) = x) > 0.5 for x > 40”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingcitation

    T5 attains near-perfect accuracy on the training distribution but fails catastrophically on other distributions.

    “the T5 model attaining near-perfect accuracy on the training distribution fails catastrophically on the other distributions”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites Raffel et al., 2020

      Not checked in the free run.

  • May combine two claims.

    Findingown data

    A rough estimation shows that balancing Pr(label=1|#rule=x) for x up to 110 would require ratio k > 100, over 100x running time (200 hours on a 40-core CPU) to pre-sample roughly 56 million examples.

    “A rough estimation shows that if we were to balance Pr e∼RP (label(e) = 1 | #rule(e) = x) for x up to 110, the ratio k > 100, that is, we need to spend over 100x running time (200 hours on a 40-core CPU) to pre-sample roughly 56 million examples”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based). May combine two claims.

    Study design and conductnone given

    The RP and LP sampling methods are general and span the entire problem space.

    “Both LP and RP are general, and they cover the whole problem space.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Interpretationreasoning

    Potentially innumerable statistical features exist, and removing them all from data is computationally costly.

    “we argue that there are potentially countless statistical features and it is computationally expensive to jointly remove them from data (Sec.4.3).”
    • Also stated in: § 4 BERT Learns Statistical Features · plain
      “such statistical features can be countless and extremely complicated, and thus very difficult to be removed from training data.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Interpretationown data

    The combination of multiple statistical features can give stronger signal about the label than individual features, making joint removal harder.

    “The combination of multiple statistical features can give stronger signal about the label than the individual ones; thus it is even harder to jointly remove them.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Interpretationown data

    The argument makes few assumptions about architecture and carries over to other neural models.

    “our argument assumes little about model architecture and naturally extends to other neural models.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S2 (checkable), S4 (based).

    Interpretationnone given

    Statistical features can be arbitrarily complex.

    “as we have discussed in Section 4.1, statistical features can be arbitrarily complex”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Premisecitation

    OOD generalization discussions commonly concern open problem spaces and mismatched training and testing domains.

    “discussions about OOD generalization often involve open problem spaces [Lin et al., 2019;Gontier et al., 2020;Yin et al., 2020;Wald et al., 2021] and domain mismatch between training and testing distribution [Yin et al., 2021;Koh et al., 2021].”
    Quote in the paperSubstantial claim0 of 3 sources checked
    • cites Lin et al., 2019

      Not checked in the free run.

    • cites Gontier et al., 2020

      Not checked in the free run.

    • cites Yin et al., 2020

      Not checked in the free run.

  • May combine two claims.

    Interpretationreasoning

    Learning reasoning from data is hard: models tend to pick up statistical features, and building a logical reasoning dataset free of such features is difficult.

    “Our study implies the difficulty of learning to reason from data: while a model always tends to learn statistical features, it is difficult to construct a logical reasoning dataset with no statistical features.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Interpretationreasoning

    Training BERT on data containing statistical features leads it to predict from those features instead of the correct reasoning function, so it does not generalize across the problem space.

    “When BERT is trained on data with statistical features, it tends to make predictions based on such features rather than learning to emulate the correct reasoning function; thus, BERT fails to generalize to the whole problem space.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Study design and conductnone given

    Problem-space examples test only reasoning ability, lacking language variation and requiring no prior knowledge.

    “(E1) examples in the problem space only test model's reasoning ability: they have no language variance and require no prior knowledge”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S2 (checkable).

    Interpretationreasoning

    Some statistical features may be too complex for humans to construct manually.

    “it is not hard to imagine that some statistical features can be so complex that they cannot even be manually constructed by humans.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Interpretationreasoning

    For some other settings, the conditional probability can be more unbalanced, requiring even more pre-sampling.

    “for some other settings, the conditional probability can be more unbalanced, requiring us to pre-sample even more examples.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Premisecitation

    Most prior studies focus on solving a single task, and their datasets are either designed for a specific domain or have confounding factors such as language variance, so they cannot be used to strictly or comprehensively study logical reasoning abilities of models.

    “However, most studies focus on solving a single task, and the datasets are either designed for a specific domain [Johnson et al., 2017;Sinha et al., 2019], or have confounding factors such as language variance [Yu et al., 2020]; they cannot be used to strictly or comprehensively study the logical reasoning abilities of models.”
    Quote in the paperSubstantial claim0 of 3 sources checked
    • cites Johnson et al., 2017

      Not checked in the free run.

    • cites Sinha et al., 2019

      Not checked in the free run.

    • cites Yu et al., 2020

      Not checked in the free run.

  • May combine two claims.

    Interpretationown data

    This could be a serious issue in terms of dataset coverage: examples with some particular #rule will dominate D′ and there will not be enough examples for other #rule.

    “This could be a serious issue in terms of dataset coverage: examples with some particular #rule will dominate D ′ and there will not be enough examples for other #rule.”
    Quote in the paperSubstantial claim
19 of 19
  • The paper relies on this without support.

    The correct reasoning function remains the same across data distributions.

    “Since the correct reasoning function does not change across data distributions, it follows that the model has not learned to reason.”
  • The authors state this as an assumption.

    The paper's argument does not depend much on specific model architectures or pre-training procedures.

    “as our argument assumes little about model architectures/pre-training procedures”
  • The paper relies on this without support.

    Correlations between statistical features and labels can change when the data distribution changes.

    “since the correlations between statistical features and labels can change as the data distribution changes”
3 of 3

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • LLMs may be biased toward surface-level correlations reinforced during training, which perform well on in-distribution data but hinder the development of generalizable reasoning strategies, leaving them vulnerable to the Einstellung effect.

    “Consequently, LLMs may be biased toward surface-level correlations reinforced during training, which perform well on in-distribution data but hinder the development of generalizable reasoning strategies59, leaving them vulnerable to the Einstellung effect53.”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

  • Rule-Priority cannot sample every SimpleLogic instance

    Minor

    SimpleLogic permits examples with zero rules, but Rule-Priority samples the number of rules starting at one. Thus Rule-Priority cannot cover the whole problem space as claimed.

1 of 1

Cites

Flagged first, then by citations

Research works printed but not linked: 5

  1. Nicolas Gontier, Koustuv Sinha, Siva Reddy, and Chris Pal. Measuring systematic gen- eralization in neural proof generation with transform- ers. Advances in Neural Information Processing Systems, 33:22231-22242, 2020.
  2. Christopher Hahn, Frederik Schmitt, Jens U. Kreber, Markus Norman Rabe, and Bernd Finkbeiner. Teaching temporal logics to neural networks. In ICLR. OpenReview.net, 2021.
  3. Khardon and Roth, 1997] Roni Khardon and Dan Roth. Learning to reason. Journal of the ACM (JACM), 44(5):697-725, 1997.
  4. Lample and Charton, 2020] Guillaume Lample and Franc ¸ois Charton. Deep learning for symbolic mathemat- ics. In ICLR. OpenReview.net, 2020.
  5. Alon Talmor, Oyvind Tafjord, Peter Clark, Yoav Goldberg, and Jonathan Berant. Leap-of- thought: Teaching pre-trained models to systematically reason over implicit knowledge. Advances in Neural In- formation Processing Systems, 33:20227-20237, 2020.

Cited by

Sorted by citations

Authors
Zhang, H., Li, L. H., Meng, T., Chang, K.-W., & Van den Broeck, G.
Affiliations
  • University of California, Los Angeles (US)
  • University of California, Los Angeles
Venue
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence
Published
2023-08
Pages
3365-3373
OpenAlex
W4385767671
Cited by
58
References
38
Citations by year
2026: 3 · 2025: 17 · 2024: 18 · 2023: 17 · 2022: 2 · 2013: 1
FWCI
9.74
Type
conference paper
Language
en
Open access
Locations
  • International Joint Conference on Artificial Intelligence (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Science Foundation (1956441, 1943641, 1837129)
  • Cisco Systems
  • Defense Advanced Research Projects Agency
  • Samsung
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
  • Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
Keywords
logical reasoning, BERT, statistical features, generalization, natural language reasoning, T5, benchmark performance

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Claims read by deepseek-v4.1-flash under definition version 3 (extract-v3) on 2026-10-07.

Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-10-07.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review