AIBullisharXiv – CS AI · May 116/10
🧠GraphReAct introduces a new reasoning-acting framework that enhances large language models for multi-step inference over graph-structured data by combining topological and semantic retrieval actions with context refinement. The framework demonstrates consistent improvements over existing methods across six benchmark datasets, advancing how AI systems can reason about interconnected, structured information.
AINeutralarXiv – CS AI · May 116/10
🧠Researchers propose PACS, a probabilistic framework for abductive reasoning that models how commonsense beliefs vary across individuals rather than assuming universal agreement. By combining LLMs with formal solvers to sample diverse proofs and aggregate conclusions, PACS outperforms existing reasoning approaches on multiple benchmarks, addressing a fundamental limitation in neurosymbolic AI systems.
AIBullisharXiv – CS AI · May 96/10
🧠Researchers introduced BALAR, a Bayesian algorithm that enables large language models to engage in structured multi-turn dialogue by actively reasoning about missing information and strategically asking clarifying questions. The system demonstrated significant performance improvements across three diverse benchmarks—14.6% to 38.5% higher accuracy—without requiring fine-tuning, suggesting a more principled approach to interactive AI reasoning.
AINeutralarXiv – CS AI · May 96/10
🧠Researchers propose a novelty-based tree-of-thought search method that improves LLM reasoning by measuring the uniqueness of generated thoughts and pruning redundant branches. The approach reduces overall token costs while maintaining performance on reasoning and planning benchmarks, addressing brittleness issues in current advanced LLM techniques.
AINeutralarXiv – CS AI · May 76/10
🧠Researchers compared moral judgment consistency in five frontier LLMs when using instant versus extended reasoning modes across 100 scenarios. While overall agreement remained statistically similar between modes, reasoning improved cross-model consensus on disputed moral cases and reduced demographic-based inconsistencies, suggesting that explicit reasoning processes may enhance fairness despite not dramatically shifting individual verdicts.
🧠 GPT-5🧠 Claude🧠 Sonnet
AINeutralarXiv – CS AI · May 46/10
🧠Researchers introduce MENTAT, a novel method for reasoning-intensive regression (RiR)—extracting subtle numerical scores from text in specialized domains. The approach combines batch-reflective prompt optimization with neural ensemble learning, achieving up to 65% improvement over standard LLM prompting and fine-tuning approaches on tasks like rubric-based scoring and domain-specific retrieval.
AINeutralarXiv – CS AI · May 16/10
🧠Researchers have developed an agentic framework that uses knowledge graphs to help large language models understand and reason about AI policy documents. The system was tested on multiple AI safety regulations, demonstrating that knowledge graph augmentation improves LLM performance across various reasoning tasks from simple entity lookup to complex cross-policy inference.
AINeutralarXiv – CS AI · May 16/10
🧠Researchers introduce FinChain, a new benchmark dataset designed to evaluate chain-of-thought reasoning in financial AI systems. The dataset addresses gaps in existing finance benchmarks by emphasizing verifiable intermediate reasoning steps rather than just final answers, and reveals that even leading LLMs struggle with multi-step symbolic financial reasoning.
AINeutralarXiv – CS AI · Apr 206/10
🧠A new position paper challenges the prevailing assumption that large language models reason through explicit chain-of-thought outputs, arguing instead that reasoning occurs primarily in latent-state trajectories hidden within model computations. The research separates three confounded factors and proposes that current reasoning benchmarks and interpretability claims need fundamental reevaluation based on this distinction.
AINeutralarXiv – CS AI · Apr 206/10
🧠Researchers propose a symbolic reasoning framework that implements Peirce's abductive-deductive-inductive reasoning model to address systematic weaknesses in large language model logical reasoning. The system enforces logical consistency through five algebraic invariants, with the Weakest Link bound preventing unreliable premises from corrupting multi-step inference chains.
AINeutralarXiv – CS AI · Apr 206/10
🧠Researchers propose DeepInsightTheorem, a framework that teaches large language models to improve informal theorem proving by explicitly extracting and learning core mathematical techniques. The hierarchical dataset combined with a multi-stage training strategy enables LLMs to perform more insightful mathematical reasoning, outperforming existing baseline approaches on challenging benchmarks.
AINeutralarXiv – CS AI · Apr 206/10
🧠Researchers introduce DPrivBench, a benchmark for evaluating how well large language models can reason about differential privacy algorithms and verify their correctness. Testing shows current LLMs handle basic DP mechanisms competently but fail significantly on advanced algorithms, exposing critical gaps in automated privacy reasoning capabilities.
AINeutralarXiv – CS AI · Apr 206/10
🧠Researchers challenge the Uniform Information Density hypothesis in LLM reasoning, finding that high-quality reasoning exhibits locally smooth but globally non-uniform information flow. This counter-intuitive pattern suggests LLMs optimize differently than human communication, with entropy-based metrics effectively predicting reasoning quality across seven benchmarks.
AIBullisharXiv – CS AI · Apr 156/10
🧠Researchers propose Heuristic Classification of Thoughts (HCoT), a novel prompting method that integrates expert system heuristics into large language models to improve structured reasoning on complex problems. The approach addresses LLMs' stochastic token generation and decoupled reasoning mechanisms by using heuristic classification to guide and optimize decision trajectories, demonstrating superior performance and token efficiency compared to existing methods like Chain-of-Thoughts and Tree-of-Thoughts prompting.
AIBullisharXiv – CS AI · Apr 156/10
🧠Researchers introduce KG-Reasoner, an end-to-end framework that uses reinforcement learning to train large language models to perform multi-hop reasoning over knowledge graphs without decomposing tasks into isolated pipeline steps. The approach demonstrates competitive or superior performance across eight reasoning benchmarks by enabling LLMs to dynamically explore reasoning paths and backtrack when necessary.
AINeutralarXiv – CS AI · Apr 156/10
🧠Researchers propose a graph-based soft prompting framework that enables LLMs to reason over incomplete knowledge graphs by processing subgraph structures rather than explicit node paths, achieving state-of-the-art results on multi-hop question-answering benchmarks while reducing computational costs through a two-stage inference approach.
AINeutralarXiv – CS AI · Apr 146/10
🧠Researchers introduce ConflictQA, a benchmark revealing that large language models struggle with conflicting information across different knowledge sources (text vs. knowledge graphs) in retrieval-augmented generation systems. The study proposes XoT, an explanation-based framework to improve faithful reasoning when LLMs encounter contradictory evidence.
AIBullisharXiv – CS AI · Apr 146/10
🧠Researchers introduce ILR, a novel multi-agent learning framework that enables Large Language Models to enhance their independent reasoning through interactive training with other LLMs, then solve problems autonomously without re-executing the multi-agent system. The approach combines dynamic interaction strategies and perception calibration, delivering up to 5% performance improvements across mathematical, coding, and reasoning benchmarks.
AIBullisharXiv – CS AI · Apr 146/10
🧠Researchers introduce PODS (Policy Optimization with Down-Sampling), a technique that accelerates reinforcement learning training for large language models by selectively training on high-variance rollouts rather than all generated data. The method achieves equivalent performance to standard approaches at 1.7x faster speeds, addressing computational bottlenecks in LLM reasoning optimization.
AINeutralarXiv – CS AI · Apr 146/10
🧠Researchers propose TokUR, a framework that enables large language models to estimate uncertainty at the token level during reasoning tasks, allowing LLMs to self-assess response quality and improve performance on mathematical problems. The approach uses low-rank random weight perturbation to generate predictive distributions, demonstrating strong correlation with answer correctness and potential for enhancing LLM reliability.
AINeutralarXiv – CS AI · Apr 146/10
🧠StyleBench is a new benchmark that evaluates how different reasoning structures (Chain-of-Thought, Tree-of-Thought, etc.) affect LLM performance across various tasks and model sizes. The research reveals that structural complexity only improves accuracy in specific scenarios, with simpler approaches often proving more efficient, and that learning adaptive reasoning strategies is itself a complex problem requiring advanced training methods.
AINeutralarXiv – CS AI · Apr 146/10
🧠Researchers introduce MERMAID, a memory-enhanced multi-agent framework for automated fact-checking that couples evidence retrieval with reasoning processes. The system achieves state-of-the-art performance on multiple benchmarks by reusing retrieved evidence across claims, reducing redundant searches and improving verification efficiency.
AINeutralarXiv – CS AI · Apr 106/10
🧠Researchers present ProofSketcher, a hybrid system combining large language models with lightweight proof verification to address mathematical reasoning errors in AI-generated proofs. The approach bridges the gap between LLM efficiency and the formal rigor of interactive theorem provers like Lean and Coq, enabling more reliable automated reasoning without requiring full formalization.
$AVAX
AINeutralarXiv – CS AI · Apr 106/10
🧠Researchers present CGD-PD, a test-time decoding method that improves large language models' performance on three-way logical question answering (True/False/Unknown) by enforcing negation consistency and resolving epistemic uncertainty through targeted entailment probes. The approach achieves up to 16% relative accuracy improvements on the FOLIO benchmark while reducing spurious Unknown predictions.
AIBullisharXiv – CS AI · Apr 106/10
🧠Researchers introduce S³ (Stratified Scaling Search), a test-time scaling method for diffusion language models that improves output quality by reallocating compute during the denoising process rather than simple best-of-K sampling. The technique uses a lightweight verifier to evaluate and selectively resample candidate trajectories at each step, demonstrating consistent performance gains across mathematical reasoning and knowledge tasks without requiring model retraining.
