AIBullisharXiv – CS AI · Jun 257/10
🧠Researchers introduce TheoremGraph, a unified dependency graph linking 11.7M informal mathematical statements from arXiv with 388,105 formal Lean 4 declarations through semantic embeddings. The infrastructure bridges the historically fragmented landscape of mathematical knowledge representation, enabling improved discovery and reasoning across both informal academic papers and formally verified mathematics.
🏢 Hugging Face
AIBullisharXiv – CS AI · Jun 237/10
🧠A new study analyzing 3,840 AI attempts across 50 mathematical problems from Project Euler finds that frontier AI systems scale more efficiently with problem difficulty than previously predicted, with machine effort following a power-law relationship where the exponent is less than 1 for most models tested. This suggests AI systems may actually improve relative to humans as problems become harder, contrary to earlier theoretical predictions.
AIBullisharXiv – CS AI · Jun 237/10
🧠Researchers introduce EquivPruner, a method that reduces token consumption in LLM reasoning searches by identifying and pruning semantically equivalent steps. Combined with MathEquiv, a new dataset for mathematical equivalence detection, the approach achieves 48.1% token reduction on GSM8K while maintaining or improving accuracy.
AIBullisharXiv – CS AI · Jun 237/10
🧠Researchers introduce Self-Aware Scheduling (SAS), a method that learns optimal token unmasking orders in masked diffusion language models through policy optimization. The approach significantly improves generation quality on reasoning tasks, achieving 91.8% accuracy on Sudoku (up from 82%) and boosting mathematical reasoning performance by 12 percentage points on GSM8K.
AIBullisharXiv – CS AI · Jun 197/10
🧠Researchers demonstrate that the Lean proof assistant can provide fine-grained, process-level feedback during reinforcement learning training for theorem proving, beyond simple binary verification signals. By parsing proof attempts into tactic sequences and leveraging Lean's elaboration system, the approach delivers dense, verified credit signals grounded in type theory, showing improvements over outcome-only baselines on benchmarks like MiniF2F and ProofNet.
AINeutralarXiv – CS AI · Jun 117/10
🧠Researchers demonstrate that valid mathematical reasoning produces measurable spectral signatures in transformer attention patterns, enabling 85-96% classification accuracy without learned parameters. The method identifies logical coherence independent of compilation success and reveals that attention architecture design determines which spectral features encode reasoning quality.
AIBullisharXiv – CS AI · Jun 107/10
🧠Researchers introduce Entropy-Guided Power Sampling (EGPS), a novel training-free sampling method that accelerates reasoning in base language models by targeting high-entropy decision points rather than uniformly sampling across sequences. The technique achieves up to 12.6x speedup on mathematical and coding benchmarks while maintaining or improving accuracy, addressing fundamental inefficiencies in existing MCMC sampling approaches.
AINeutralarXiv – CS AI · Jun 97/10
🧠A comprehensive survey examines the evolution of AI systems for mathematical reasoning, from early rule-based solvers to contemporary language models, neuro-symbolic systems, and verified discovery workflows. The research catalogs major benchmarks, identifies critical failure modes like reward hacking and formalization brittleness, and proposes future directions centered on efficiency and usable AI-assisted formalization.
AIBullisharXiv – CS AI · Jun 97/10
🧠Researchers introduce Diverse Schemata Policy Optimization (DiScO), a framework that improves large language model reasoning by encouraging diversity in thinking approaches and solution paths. The method consistently outperforms standard optimization techniques on mathematical benchmarks and shows particular strength in helping models recover from initial errors.
AIBullisharXiv – CS AI · Jun 97/10
🧠Researchers propose MixReasoning, a framework that dynamically adjusts reasoning depth across problem-solving steps, applying intensive reasoning only to difficult pivotal steps while using efficient inference for straightforward computations. The approach reduces reasoning length and improves computational efficiency while maintaining accuracy on standardized math and reasoning benchmarks.
AIBullisharXiv – CS AI · Jun 97/10
🧠Researchers propose MMR-GRPO, a training optimization technique that accelerates Group Relative Policy Optimization (GRPO) for mathematical reasoning models by reweighting rewards based on completion diversity. The method achieves comparable performance while reducing training time by 70.2% and training steps by 47.9%, demonstrating consistent improvements across multiple model sizes and benchmarks.
AINeutralarXiv – CS AI · Jun 87/10
🧠Researchers conducted an empirical comparison of mathematical reasoning between humans and DeepSeek-R1, analyzing 10,247 reasoning steps across 30 AIME problems. The study reveals that while the AI model exhibits surface-level reasoning patterns, it engages in inefficient verification loops and lacks the structured deduction humans employ, suggesting current long-chain-of-thought models may be optimized for appearing to reason rather than reasoning effectively.
AIBullisharXiv – CS AI · Jun 57/10
🧠Researchers propose On-Policy Representation Distillation (OPRD), a novel method for training smaller AI models by aligning hidden-state representations with teacher models rather than just matching output probabilities. OPRD achieves superior performance on mathematical reasoning benchmarks while training 1.44x faster and using 54% less memory than existing approaches.
AIBullisharXiv – CS AI · Jun 57/10
🧠Researchers introduce ReLAT, a test-time training method that improves latent reasoning in large language models by reconstructing the original query from intermediate latent states, ensuring task-relevant information is preserved. The approach demonstrates significant performance gains across mathematical reasoning, QA, and code generation tasks, with Qwen3-8B achieving a 16.6-point improvement on AIME 2024.
AIBullisharXiv – CS AI · Jun 57/10
🧠Researchers at the Max Planck Institute compiled 100 research-level mathematics questions to benchmark large language models' reasoning capabilities. Through three evaluation stages, only 2 questions remained unsolved by advanced LLMs, indicating significant progress in AI mathematical reasoning.
AIBullisharXiv – CS AI · Jun 57/10
🧠Researchers introduce ReTreVal, a training-free framework that enables large language models to learn from failures across multiple problems without fine-tuning. By implementing adaptive tree exploration, typed-failure backtracking, and cross-problem memory, ReTreVal achieves significant performance improvements on mathematical and knowledge reasoning tasks, allowing a 32B model to match much larger systems.
AIBullisharXiv – CS AI · Jun 27/10
🧠Researchers introduce the Universal Quantum Transformer (UQT), a quantum computing architecture that achieves exact mathematical reasoning on discrete problems like modular arithmetic and permutation groups—tasks where classical neural networks require massive parameter scaling and remain stochastically unstable. The UQT demonstrates computational advantages by bypassing classical attention's quadratic bottleneck and has been successfully deployed on current IBM Quantum hardware.
$SU
AIBullisharXiv – CS AI · Jun 27/10
🧠AXIOM is a neuro-symbolic architecture that pairs language models with deterministic computer algebra systems to solve mathematical problems with verifiable correctness. The system achieves 94.36% accuracy on MATH benchmarks with 100% confidence (zero incorrect confident answers) and has processed ~30,000 production queries, establishing a framework for trustworthy AI systems that prioritize verifiability over raw performance.
AIBullisharXiv – CS AI · Jun 27/10
🧠Researchers propose T1, a tool-integrated verification framework that enables small language models to effectively verify outputs during test-time compute scaling by offloading memorization-heavy tasks to external tools. The approach demonstrates that a 1B parameter model can outperform an 8B model on mathematical benchmarks when equipped with tool integration, addressing a critical limitation in deploying smaller models at inference time.
🧠 Llama
AIBullisharXiv – CS AI · Jun 27/10
🧠Researchers introduce eMoT (evolving Memory-of-Thought), a framework that enhances LLM reasoning by treating reasoning processes as dynamic, evolving memories rather than static sequences. The system combines memory corrosion mechanisms, symbolic anchoring for deterministic computation, and consistency refinement to reduce hallucinations and improve multi-step reasoning accuracy, achieving 100% on Game of 24 and significant gains on mathematical benchmarks.
AIBullisharXiv – CS AI · Jun 27/10
🧠Researchers introduce stochastic backtracking, a novel test-time scaling method for language models that revisits previously generated solution paths rather than committing irreversibly to frontier candidates. The approach uses subpool selection and power backtrack sequential Monte Carlo to improve reasoning accuracy while reducing token generation, outperforming existing PRM-guided methods across mathematical benchmarks.
AIBullisharXiv – CS AI · May 297/10
🧠Researchers propose DenseSteer, a training-free framework that improves mathematical reasoning in small language models (≤3B parameters) by steering internal representations toward denser reasoning patterns. The method demonstrates that smaller models can match larger ones' performance by executing fewer, more information-rich reasoning steps rather than verbose chain-of-thought processes.
AIBullisharXiv – CS AI · May 297/10
🧠DeepTool is a new AI framework that enhances large language models' ability to reason through tool use by implementing process-supervised reinforcement learning. The system dramatically improves performance on mathematical benchmarks like AIME24 (3.2% to 40.4%) while maintaining token efficiency through interleaved thinking and action.
AINeutralarXiv – CS AI · May 297/10
🧠FormInv introduces a measurement protocol that audits mathematical reasoning benchmarks for semantic consistency, revealing that current evaluation methods mask significant ranking volatility across AI models. The study found 3.1% semantically incorrect paraphrases in MathCheck that altered model rankings and discovered that models achieving similar accuracy scores (86-96%) exhibit drastically different consistency rates (50-82%) when tested against semantically equivalent problem restatements.
🧠 GPT-4🧠 Claude🧠 Haiku
AIBullisharXiv – CS AI · May 297/10
🧠Researchers introduce Proactive Interactive Reasoning (PIR), a new paradigm that enables large language models to ask clarifying questions during problem-solving rather than operating blindly with incomplete information. The approach combines supervised fine-tuning and policy optimization to achieve significant improvements in mathematical reasoning, code generation, and document editing tasks while reducing computational overhead.
