AINeutralarXiv – CS AI · Jun 237/10
🧠Researchers demonstrate that language models cannot reliably learn certain types of algorithmic reasoning—specifically backtracking search procedures—through chain-of-thought fine-tuning, regardless of model size or training method. While models perform individual computational steps correctly, they fail to chain those steps into valid forward derivations when the task requires combinatorial search over unstructured information.
AIBullisharXiv – CS AI · Apr 67/10
🧠Research shows that large language models significantly outperform traditional AI planning algorithms on complex block-moving problems, tracking theoretical optimality limits with near-perfect precision. The study suggests LLMs may use algorithmic simulation and geometric memory to bypass exponential combinatorial complexity in planning tasks.
AIBullisharXiv – CS AI · Mar 37/103
🧠Researchers propose that intrinsic task symmetries drive 'grokking' - the sudden transition from memorization to generalization in neural networks. The study identifies a three-stage training process and introduces diagnostic tools to predict and accelerate the onset of generalization in algorithmic reasoning tasks.
AINeutralarXiv – CS AI · Jun 25/10
🧠Researchers propose an auxiliary reconstruction module to improve encoder representations in neural algorithmic reasoning systems. By forcing encoders to reconstruct input states and capture feature dependencies, the method enhances the performance of existing neural architectures on algorithmic reasoning benchmarks.
AINeutralarXiv – CS AI · Jun 16/10
🧠Researchers introduce XLGoBench, a synthetic benchmark using algorithmic tasks to identify cross-lingual performance gaps in large language models across different languages. The benchmark is scalable, objective, and transparent, revealing persistent gaps in state-of-the-art models despite their claimed multilingual capabilities.
AIBullisharXiv – CS AI · Jun 16/10
🧠Researchers propose CYKNN, a neural network architecture that directly embeds the CYK parsing algorithm into trainable matrix operations. The approach demonstrates superior performance compared to large language models with 20B+ parameters on grammar parsing tasks, suggesting a viable path for integrating symbolic algorithms into neural architectures.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers demonstrate that standard transformer models with softmax attention can implement preconditioned Richardson iteration to solve Gaussian kernel ridge regression tasks during in-context learning. The theoretical construction and empirical validation reveal how transformers decompose nonlinear prediction into interpretable algorithmic steps, advancing mechanistic understanding of transformer capabilities.
AIBullisharXiv – CS AI · May 116/10
🧠Researchers introduce GraphDC, a divide-and-conquer multi-agent framework that enables Large Language Models to solve complex graph algorithms more effectively by decomposing large graphs into smaller subgraphs for specialized agent reasoning. The approach significantly improves LLM performance on graph algorithmic tasks, particularly on larger instances where traditional end-to-end reasoning fails.
