AIBullisharXiv – CS AI · Jun 97/10
🧠Researchers present a Mathematics of Arrays framework that optimizes transformer attention mechanisms to achieve near-theoretical minimum memory requirements, reducing data movement from O(n²) to O(n) complexity. The approach delivers formal mathematical proofs of memory optimality and projects 2-100x speedup improvements, addressing a critical computational bottleneck in AI systems.
AINeutralarXiv – CS AI · May 297/10
🧠Researchers extend the bounded attention prefix oracle (BAPO) model to establish theoretical lower bounds on chain-of-thought reasoning tokens required by LLMs, proving that canonical tasks require Ω(n) tokens as input size n grows. Experiments with frontier models confirm linear scaling behavior, revealing fundamental computational bottlenecks in inference-time scaling.
AIBullisharXiv – CS AI · Mar 47/102
🧠Researchers introduce Neural Paging, a new architecture that addresses the computational bottleneck of finite context windows in Large Language Models by implementing a hierarchical system that decouples reasoning from memory management. The approach reduces computational complexity from O(N²) to O(N·K²) for long-horizon reasoning tasks, potentially enabling more efficient AI agents.
AIBullisharXiv – CS AI · Mar 47/102
🧠Researchers developed a new channel-adaptive AI algorithm that maximizes inference throughput in 6G edge computing networks by dynamically adjusting computational complexity based on channel conditions. The system uses integrated communication and computation (IC²) to optimize both feature compression and model complexity for mobile edge inference.
AIBullisharXiv – CS AI · Mar 37/105
🧠Researchers provide mathematical proof that implicit models can achieve greater expressive power through increased test-time computation, explaining how these memory-efficient architectures can match larger explicit networks. The study validates this scaling property across image reconstruction, scientific computing, operations research, and LLM reasoning domains.
AINeutralarXiv – CS AI · Feb 277/106
🧠Researchers establish theoretical foundations for neural network superposition, proving lower bounds that require at least Ω(√m' log m') neurons and Ω(m' log m') parameters to compute m' features. The work demonstrates exponential complexity gaps between computing versus merely representing features and provides first subexponential bounds on network capacity.
AIBullisharXiv – CS AI · Jun 256/10
🧠Researchers present novel algorithms for computing Asymmetric Shapley Values (ASV), a machine learning explainability method that integrates causal knowledge. The work demonstrates polynomial-time computation in contexts where standard SHAP is #P-hard, with specialized algorithms for tree-structured causal graphs and approximation techniques for general directed acyclic graphs.
AINeutralarXiv – CS AI · Jun 255/10
🧠Researchers introduce position graphs, a novel graph-based reasoning framework that formalizes spatial relationships between discrete tokens using strict partial orders. The work establishes theoretical foundations for consistency conditions and proves that pattern discovery within position graphs remains computationally NP-complete, with implications for document processing and spatial reasoning systems.
AINeutralarXiv – CS AI · Jun 236/10
🧠Researchers prove that when AI assists human decision-making with correlated features, stationary recommendation policies perform arbitrarily poorly, requiring instead an explore-then-commit strategy where AI initially recommends diverse options for human learning before committing to optimal selections. The study provides computational complexity results and algorithms for finding near-optimal policies, with exploration duration dependent on feature correlation strength.
AINeutralarXiv – CS AI · Jun 116/10
🧠Researchers present a mathematical framework for genetic algorithms that employ ML-guided mutation and recombination operators instead of random transformations, modeling the approach as a query-complexity problem. The work demonstrates that certain optimization problems require all three components—generation, mutation, and recombination—to be solved efficiently, with solution diversity playing a critical role in practical performance.
AINeutralarXiv – CS AI · Jun 96/10
🧠This paper integrates defeasible logic with standpoint logic to formally model knowledge across multiple contradictory viewpoints that may hold uncertain beliefs. The work provides theoretical foundations for Defeasible Restricted Standpoint Logics (DRSL) and proves that computational complexity remains unchanged when extending propositional KLM entailment relations to multi-standpoint settings.
AINeutralarXiv – CS AI · Jun 95/10
🧠Researchers introduce CFips, a sampling algorithm for efficiently exploring interval patterns under user-defined constraints. The approach preserves exact sampling guarantees while decomposing syntactic constraints into elementary predicates, enabling pattern mining tasks that previously exceeded computational time limits.
AIBullisharXiv – CS AI · Jun 96/10
🧠Researchers have developed AutoModSAT, a framework that leverages large language models to automatically discover and optimize heuristics in SAT solvers, achieving 40% performance improvements over baseline solvers. The approach combines modular solver design with LLM-guided function generation and evolutionary algorithms, demonstrating significant practical gains across diverse datasets.
AIBullisharXiv – CS AI · Jun 26/10
🧠Researchers propose DySCo, a dynamic sparse communication mechanism for LLM-based multi-agent systems that reduces computational overhead by selectively routing messages between agents rather than using full broadcast. The approach maintains consensus quality while cutting token costs and latency that scale quadratically with agent count, addressing a key efficiency bottleneck in collaborative AI reasoning systems.
AINeutralarXiv – CS AI · May 286/10
🧠A new arXiv paper challenges the widespread claim that Transformers are Turing-complete, arguing that existing proofs conflate two distinct computational settings. The research clarifies that real-world LLM deployment operates under fixed-system constraints where context management critically determines actual computational power, rather than the idealized scaling-family setting used in most theoretical proofs.
AINeutralarXiv – CS AI · May 116/10
🧠Researchers establish that computing optimal policies for Multi-Environment POMDPs with finite-horizon objectives remains PSPACE-complete, matching the complexity of standard POMDPs. The work introduces a practical algorithm that substantially outperforms prior methods on benchmark problems.
AINeutralarXiv – CS AI · May 96/10
🧠Researchers introduce PKeX-Shapley, an algorithm that computes exact Shapley values for product-kernel machine learning models in quadratic time, eliminating the need for approximations. The method exploits the multiplicative structure of product kernels to achieve linear-time-per-feature attribution without sampling or density estimation, extending beyond predictive models to statistical discrepancy measures like MMD and HSIC.
AINeutralarXiv – CS AI · May 46/10
🧠Researchers propose a new fairness framework for machine learning classifiers that defines fairness through fair explanations—prime-implicant reasons for decisions that exclude protected features like gender. The study reveals that feature constraints can obscure discriminatory dependencies and that ignoring these constraints fundamentally changes fairness assessments, establishing computational complexity benchmarks for three distinct fairness definitions.
🏢 Meta
AINeutralarXiv – CS AI · Mar 37/109
🧠Researchers prove that clustering problems in machine learning are universally NP-hard, providing theoretical explanation for why clustering algorithms often produce unstable results. The study demonstrates that major clustering methods like k-means and spectral clustering inherit fundamental computational intractability, explaining common failure modes like local optima.
AINeutralHugging Face Blog · Feb 25/108
🧠NPHardEval Leaderboard introduces a new evaluation framework for assessing large language models' reasoning capabilities through computational complexity classes with dynamic updates. The leaderboard aims to provide more rigorous testing of LLM reasoning abilities by incorporating problems from different complexity categories.
