Auto-Relational Reasoning

• URL: http://arxiv.org/abs/2604.26507v1
• Date: Wed, 29 Apr 2026 10:12:58 GMT
• Title: Auto-Relational Reasoning
• Abstract summary: We propose a theoretical framework for reasoning through object-relations in an automated manner integrated with Artificial Neural Networks.<n>We present a formal analysis of the Reasoning, and we show the theory in practice through a paradigm integrating Reasoning and Machine Learning.<n>Our system achieves 98.03% solving rate corresponding to the top 1% percentile or 132-144 iq score.
• Score: 0.47248250311484113
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Background & Objectives: In the last decade, Machine learning research has grown rapidly, but large models are reaching their soft limits demonstrating diminishing returns and still lack solid reasoning abilities. These limits could be surpassed through synergistic combination of Machine Learning scalability and rigid reasoning. Methods: In this work, we propose a theoretical framework for reasoning through object-relations in an automated manner integrated with Artificial Neural Networks. We present a formal analysis of the Reasoning, and we show the theory in practice through a paradigm integrating Reasoning and Machine Learning. Results: This paradigm is a system that solves Intelligence Quotient problems without any prior knowledge of the problem. Our system achieves 98.03% solving rate corresponding to the top 1% percentile or 132-144 iq score. This result is only limited by the small size of the model and the processing capabilities of the machine it run on. Conclusions: With the integration of prior knowledge in the system and the expansion of the dataset, the system can be generalized to solve a large category of problems. The functionality of the system inherently favors the solution of such problems in few-shot or zero-shot attempts.

Related papers

• Scaling Neuro-symbolic Problem Solving: Solver-Free Learning of Constraints and Objectives [3.2198807619678074]
  We introduce a differentiable neuro-symbolic architecture and a loss function dedicated to learning how to solve NP-hard reasoning problems.<n>We empirically show that it can efficiently learn how to solve NP-hard reasoning problems from natural inputs.
  arXiv  Detail & Related papers  (2025-08-28T16:33:27Z)
• SwS: Self-aware Weakness-driven Problem Synthesis in Reinforcement Learning for LLM Reasoning [95.28059121743831]
  Reinforcement Learning with Verifiable Rewards (RLVR) has proven effective for training large language models (LLMs) on complex reasoning tasks.<n>We introduce a Self-aware Weakness-driven problem Synthesis framework (SwS) that systematically identifies model deficiencies and leverages them for problem augmentation.<n>SwS enables robust generalization byempowering the model to self-identify and address its weaknesses in RL, yielding average performance gains of 10.0% and 7.7% on 7B and 32B models.
  arXiv  Detail & Related papers  (2025-06-10T17:02:00Z)
• Advancing Solutions for the Three-Body Problem Through Physics-Informed Neural Networks [1.4680035572775536]
  The concept of the Three-Body Problem was put forth as a study of the motion of the three celestial bodies within the Earth-Sun-Moon system.<n>Current state-of-the-art solutions are based on numerical high-precision integration or machine learning-based.<n>We propose a novel method that utilizes Physics-Informed Neural Networks (PINNs)
  arXiv  Detail & Related papers  (2025-03-06T16:22:19Z)
• On the Promise for Assurance of Differentiable Neurosymbolic Reasoning Paradigms [9.071347361654931]
  We assess the assurance of end-to-end fully differentiable neurosymbolic systems that are an emerging method to create data-efficient models.<n>We find end-to-end neurosymbolic methods present unique opportunities for assurance beyond their data efficiency.
  arXiv  Detail & Related papers  (2025-02-13T03:29:42Z)
• Predicting Probabilities of Error to Combine Quantization and Early Exiting: QuEE [68.6018458996143]
  We propose a more general dynamic network that can combine both quantization and early exit dynamic network: QuEE. Our algorithm can be seen as a form of soft early exiting or input-dependent compression. The crucial factor of our approach is accurate prediction of the potential accuracy improvement achievable through further computation.
  arXiv  Detail & Related papers  (2024-06-20T15:25:13Z)
• Brain-inspired Computational Intelligence via Predictive Coding [73.42407863671565]
  Predictive coding (PC) has shown promising properties that make it potentially valuable for the machine learning community.<n>PC-like algorithms are starting to be present in multiple sub-fields of machine learning and AI at large.
  arXiv  Detail & Related papers  (2023-08-15T16:37:16Z)
• Non-equilibrium physics: from spin glasses to machine and neural learning [0.0]
  Disordered many-body systems exhibit a wide range of emergent phenomena across different scales. We aim to characterize such emergent intelligence in disordered systems through statistical physics. We uncover relationships between learning mechanisms and physical dynamics that could serve as guiding principles for designing intelligent systems.
  arXiv  Detail & Related papers  (2023-08-03T04:56:47Z)
• AttNS: Attention-Inspired Numerical Solving For Limited Data Scenarios [51.94807626839365]
  We propose the attention-inspired numerical solver (AttNS) to solve differential equations due to limited data.<n>AttNS is inspired by the effectiveness of attention modules in Residual Neural Networks (ResNet) in enhancing model generalization and robustness.
  arXiv  Detail & Related papers  (2023-02-05T01:39:21Z)
• Human-Algorithm Collaboration: Achieving Complementarity and Avoiding Unfairness [92.26039686430204]
  We show that even in carefully-designed systems, complementary performance can be elusive. First, we provide a theoretical framework for modeling simple human-algorithm systems. Next, we use this model to prove conditions where complementarity is impossible.
  arXiv  Detail & Related papers  (2022-02-17T18:44:41Z)
• End-to-end Algorithm Synthesis with Recurrent Networks: Logical Extrapolation Without Overthinking [52.05847268235338]
  We show how machine learning systems can perform logical extrapolation without overthinking problems. We propose a recall architecture that keeps an explicit copy of the problem instance in memory so that it cannot be forgotten. We also employ a progressive training routine that prevents the model from learning behaviors that are specific to number and instead pushes it to learn behaviors that can be repeated indefinitely.
  arXiv  Detail & Related papers  (2022-02-11T18:43:28Z)
• Machine Number Sense: A Dataset of Visual Arithmetic Problems for Abstract and Relational Reasoning [95.18337034090648]
  We propose a dataset, Machine Number Sense (MNS), consisting of visual arithmetic problems automatically generated using a grammar model--And-Or Graph (AOG) These visual arithmetic problems are in the form of geometric figures. We benchmark the MNS dataset using four predominant neural network models as baselines in this visual reasoning task.
  arXiv  Detail & Related papers  (2020-04-25T17:14:58Z)
• Relational Neural Machines [19.569025323453257]
  This paper presents a novel framework allowing jointly train the parameters of the learners and of a First-Order Logic based reasoner. A Neural Machine is able recover both classical learning results in case of pure sub-symbolic learning, and Markov Logic Networks. Proper algorithmic solutions are devised to make learning and inference tractable in large-scale problems.
  arXiv  Detail & Related papers  (2020-02-06T10:53:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.