End-to-end KBQA system learns from multiple reasoning paths without labeled paths.
problem Lack of labeled reasoning paths limits KBQA system performance.
method End-to-end KBQA system using multiple reasoning paths.
result Demonstrates strong performance on various KBQA datasets.
Forward-prediction models enhance physical reasoning, but only for specific tasks.
problem Improving physical reasoning in complex tasks involving many objects.
method Incorporated forward-prediction models into simple physical-reasoning agents and evaluated their performance on the PHYRE benchmark.
result Forward-prediction models improve physical-reasoning performance, especially on complex tasks, but generalization to new task templates is challenging.
Meta-reinforcement learning enables causal reasoning in complex environments.
problem Discovering causal structure in complex environments.
method Training a recurrent network with model-free reinforcement learning to solve problems with causal structure.
result The trained agent can perform causal reasoning in novel situations, select informative interventions, draw causal inferences, and make counterfactual predictions.
Enhances relational reasoning with multi-layer architecture.
problem Limited relational reasoning with shallow architectures.
method Multi-layer relation network architecture.
result Solved all 20 tasks in bAbI 20 QA dataset.
Neural networks struggle with reasoning tasks that require specialized structures.
problem Understanding why and when neural network structures generalize better.
method Developing a framework to characterize algorithmic alignment with reasoning tasks.
result Neural networks align better with dynamic programming (DP) for certain reasoning tasks.
Enhances large language models' reasoning through simpler off-policy reinforcement learning.
problem Improving large language models' ability to reason and solve problems.
method EM Policy Gradient, optimizing expected return over reasoning trajectories using Expectation-Maximization (EM) optimization.
result Achieves comparable or slightly superior performance to state-of-the-art methods on reasoning datasets, with additional cognitive behaviors.
Graph neural networks struggle with proving unsatisfiability in complex logical formulas.
problem Proving unsatisfiability in complex logical formulas.
method Investigating the limitations of graph neural networks in logical reasoning tasks.
result Graph neural networks may fail in certifying unsatisfiability in Boolean formulae.
Paper improves robustness certification by integrating ML and logical reasoning.
problem Limited robustness certification under perturbation radius.
method Integrates statistical ML models with logical reasoning using Markov logic networks.
result First certified robustness bound for MLN derived and experimentally validated.
This work investigates how multi-round reasoning improves LLM performance.
problem Improving problem-solving abilities in complex tasks with LLMs.
method Investigates approximation, learnability, and generalization properties of multi-round auto-regressive models.
result Transformers with finite context windows are universal approximators for Turing-computable functions and can approximate any Turing-computable sequence-to-sequence function through multi-round reasoning.
TRR detects stock portfolio crashes by simulating human reasoning.
problem Detecting stock portfolio crashes with limited historical data.
method Temporal Relational Reasoning (TRR) framework.
result TRR outperforms state-of-the-art techniques in detecting stock portfolio crashes.
Enhances RL with relational reasoning, improving efficiency and interpretability.
problem Challenges in deep reinforcement learning, especially sample complexity and generalization.
method Structured perception and relational reasoning using self-attention.
result Agent finds interpretable solutions that generalize better and perform better than baselines.
Proposes a new prior for complex models to improve prediction accuracy.
problem Difficulty in specifying priors for complex models like neural networks.
method Predictive complexity priors defined by comparing model predictions to a reference model, transferred to parameters via change of variables.
result Improves model predictions by reducing unintuitive effects of traditional priors.
Paper simplifies deep RL for mobile robots on consumer hardware.
problem Training complex reasoning agents in 3D environments.
method Used ViZDoom for fast simulation and varied difficulty scenarios.
result Robust baseline agent architecture trained on consumer hardware.
LaTRO optimizes latent reasoning in LLMs without external reward.
problem Training LLMs to perform complex reasoning tasks.
method Formulates reasoning as latent distribution sampling and optimizes via variational approaches.
result LLMs improve reasoning and evaluation quality through self-improvement.
Novel memory access mechanism improves complex reasoning tasks.
problem Challenges in multi-fact question-answering and positional reasoning.
method Gated End-to-End Memory Network architecture with a novel access regulation mechanism.
result Significant improvements on challenging tasks in the 20 bAbI dataset and DSTC-2.
DRNets combine deep learning and reasoning for complex tasks.
problem Solving complex tasks, especially in scientific discovery, with limited supervision.
method DRNets integrate logic and neural network optimization to encode structured latent spaces constrained by prior knowledge.
result DRNets outperform state-of-the-art models in scientific discovery tasks, recovering more precise crystal structures.
NLM combines neural networks and logic programming for complex reasoning.
problem Complex reasoning tasks involving logic and properties.
method Neural-symbolic architecture combining neural networks and logic programming.
result NLM achieves perfect generalization on various tasks.
Adaptive computation improves machine reasoning for complex tasks.
problem Learning to perform multi-hop inference for complex tasks.
method Introduced a model with Adaptive Computation Time to learn the number of inference steps.
result Adaptive computation provides a small performance benefit and insight into reasoning.
New benchmark PVR tests neural network reasoning about indirection.
problem Understanding neural network generalization limits.
method Introducing Pointer Value Retrieval (PVR) benchmark.
result Large variations in performance across different conditions.
This paper improves learning complex functions with CoT supervision, reducing sample complexity.
problem Learning complex functions with multi-step reasoning.
method Develops a statistical theory linking CoT risk and end-to-end risk, using CoT information measure.
result CoT supervision can achieve significantly faster learning rates compared to standard E2E supervision.
Efficient neural models for complex multi-hop reasoning tasks.
problem Complex multi-hop reasoning tasks in large knowledge bases.
method Differentiable neural models using symbolic knowledge bases, with a new operation for multi-hop template construction.
result Simple neural models achieve competitive performance on multi-hop reasoning tasks.
Integrates deep learning and logic reasoning for intelligent agents.
problem Combining deep learning and logic reasoning for robust decision-making.
method Deep Logic Models integrating deep learners and logic reasoning.
result Proposed models outperform other approaches in joint learning and inference.
Hybrid framework injects TSLM insights into GRLM for robust time-series reasoning.
problem Lack of domain-specific knowledge in large language models for time-series reasoning.
method Hybrid knowledge-injection framework combining RLVR for efficient knowledge transfer.
result Consistently outperforms existing models by 7.9%-26.1% on multivariate time-series benchmarks.
Transformers learn multi-step reasoning through gradient descent.
problem Understanding how transformers solve symbolic multi-step reasoning tasks.
method Theoretical analysis of gradient descent dynamics and multi-phase training.
result Trained one-layer transformers can solve both backward and forward reasoning tasks with generalization guarantees.
Thinking LLMs struggle with stock prediction, especially as data complexity increases.
problem Evaluating the performance of 'thinking' LLMs in stock prediction, especially under varying levels of cross-sectional complexity.
method Rolling 48m/1m walk-forward evaluation, comparing direct LLMs, TLLMs, and classical learners on cross-sectional ranking loss, MSE, and backtests with transaction costs.
result TLLMs' ranking quality deteriorates as cross-sectional complexity grows, while direct LLMs remain stable.
R2-B2 optimizes game interactions with recursive reasoning.
problem Optimizing interactions between boundedly rational agents with unknown payoff functions.
method Recursive Reasoning-Based Bayesian Optimization (R2-B2) for repeated games.
result R2-B2 achieves faster asymptotic convergence to no regret than non-recursive methods.
MXGNet tackles visual reasoning tasks using graph neural networks.
problem Abstract reasoning, especially in the visual domain, is challenging for AI.
method Combines object-level representations, graph neural networks, and multiplex graphs.
result Achieves state-of-the-art accuracy on Euler Diagram Syllogisms and outperforms state-of-the-art models on RPM datasets.
System solves a significant fraction of Bongard problems using visual features and pragmatic reasoning.
problem Solving Bongard problems with intelligent vision systems.
method Image processing, symbolic visual vocabulary, Bayesian inference, pragmatic reasoning.
result Good agreement between induced concepts and Bongard's solutions.
We developed a caching method to speed up concept learning in complex knowledge bases.
problem Complex concept learning requires many instance retrieval calls, increasing runtime.
method Semantics-aware caching that links concepts to instances via crisp set operations.
result Our cache reduces concept retrieval and learning runtime by an order of magnitude.
Looped transformers outperform standard transformers in complex reasoning tasks due to a specific loss landscape geometry.
problem Understanding why looped transformers outperform standard transformers in complex reasoning tasks.
method Explained through loss landscape geometry, distinguishing between U-shaped and V-shaped valleys, and proposing SHIFT training strategy.
result Looped transformers' recursive architecture induces a River-V-Valley landscape, leading to better loss convergence and complex pattern learning.
Graph Neural Networks align with dynamic programming, improving algorithmic reasoning.
problem Demonstrate and quantify alignment between GNNs and dynamic programming.
method Category theory and abstract algebra methods to expose intricate connection.
result Showed GNNs align with dynamic programming beyond individual algorithms.
A new method learns object hierarchies from images to reason about physical interactions.
problem Learning about the interactions of complex objects and their dynamics.
method Unsupervised learning of object hierarchies from raw visual images.
result Improves over a strong baseline at modeling synthetic and real-world videos.
LLMs excel at summarizing and repairing complex models without needing full models.
problem Understanding and repairing complex models like GAMs.
method Hierarchical reasoning and extensive background knowledge.
result LLMs can detect anomalies, describe reasons, and suggest repairs.
New memory module improves relational reasoning in neural networks.
problem Standard memory architectures struggle with relational reasoning tasks.
method Introduce a new memory module called Relational Memory Core (RMC) using multi-head dot product attention.
result Achieves state-of-the-art results on various datasets, including WikiText-103, Project Gutenberg, and GigaWord.
New algorithm improves graph inference tasks.
problem Complex graph reasoning and prediction tasks.
method Policy Message Passing algorithm reformulates graph inference as stochastic sequential processes.
result Consistently outperforms state-of-the-art models.
Hydra boosts efficiency for long-context reasoning in resource-constrained settings.
problem Quadratic complexity of transformers limits long-context reasoning in resource-constrained systems.
method Hydra uses a modular architecture with adaptive routing between sparse global attention, mixture-of-experts, and dual memories.
result Hydra achieves significant throughput and accuracy improvements for long-context reasoning.
Improved Markov models learn from their mistakes and adapt to problem complexity.
problem Limitations of standard masked discrete diffusion models in reasoning tasks.
method Learning a Markov transition kernel trained on its own outputs, allowing remasking and adaptation.
result Significant improvement in solving reasoning problems, especially Sudoku-Extreme and Countdown-4.
EQD model improves domain-specific QA by 0.6% to 10.5%.
problem Challenges in domain-specific quantitative reasoning for LLMs.
method Two-step fine-tuning framework guided by a reward function.
result EQD outperforms state-of-the-art models and prompting strategies.
Improved neural networks for relational reasoning by projecting high-dimensional data to low-dimensional manifolds.
problem Out-of-distribution generalization in complex relational reasoning tasks.
method Neuroscience-inspired inductive-biased module projecting high-dimensional object representations to low-dimensional manifolds.
result Significantly better out-of-distribution generalization performance on relational reasoning tasks.
PyFi uses adversarial agents to train VLMs on financial image understanding.
problem Training VLMs to understand complex financial questions.
method PyFi-600K dataset and adversarial MCTS mechanism.
result Fine-tuned VLMs improve by 19.52% and 8.06% on financial question accuracy.
Paper proves efficiency of MARL with transformers, addressing agent complexity.
problem Theoretical understanding of MARL with many agents and limited relational reasoning.
method Set Transformer for relational reasoning, model-free and model-based MARL algorithms.
result Provable efficiency of MARL algorithms, suboptimality gaps independent of number of agents.
MIM-Reasoner learns seed users for maximizing influence in multiplex networks.
problem Maximizing influence in multiplex networks with multiple layers of social interactions.
method Combining reinforcement learning with probabilistic graphical models.
result Established a theoretical guarantee for MIM-Reasoner's performance.
Transformers solve parity problems efficiently with step-by-step reasoning.
problem Training transformers to solve complex, recursive problems like parity.
method Training a one-layer transformer to solve k-parity, incorporating intermediate parities into the loss function, and using teacher forcing or augmented data. result Transformers can learn parity in one gradient update with intermediate supervision or self-consistency checks.
A new query embedding method improves KB performance on complex queries.
problem QE systems disagree with deductive reasoning on some queries.
method A novel QE method more faithful to deductive reasoning.
result Better performance on complex queries to incomplete KBs.
End-to-end multi-object tracking learns object interactions.
problem Object tracking ignores interactions between objects.
method End-to-end relational reasoning model MOHART.
result Relational reasoning improves tracking and prediction.
EORM boosts LLM accuracy with a lightweight, energy-based verifier.
problem Efficiently verifying mathematical reasoning in large language models.
method Energy-based framework to rank Chain-of-Thought solutions using simple outcome labels.
result EORM boosts LLM accuracy to 90.7% on GSM8k and 63.7% on MATH with only 55M parameters.
Defines complex structure for families of Hilbert spaces with reasonable curvature.
problem Curvature of families of Hilbert spaces not forming a holomorphic bundle.
method Defines a new complex analytic structure and curvature for families of Hilbert spaces.
result New proof of Berndtsson's theorem on curvature of direct images of semi-positively twisted relative canonical bundles.
This work analyzes CoT prompting methods from a statistical estimation perspective.
problem Improving the effectiveness of LLMs in solving multi-step reasoning problems.
method Introducing a multi-step latent variable model to characterize CoT prompting from a statistical estimation viewpoint.
result The CoT estimator is equivalent to a Bayesian estimator when the pretraining dataset is large.