AIBearishApple Machine Learning · Mar 37/105
🧠Research demonstrates computational challenges in AI alignment, specifically showing that efficient filtering of adversarial prompts and unsafe outputs from large language models may be fundamentally impossible. The study reveals theoretical limitations in separating intelligence from judgment in AI systems, highlighting intractable problems in content filtering approaches.
AINeutralarXiv – CS AI · Jun 106/10
🧠Researchers introduce a novel computational framework using deep learning to solve the long-standing problem of optimal multi-item, multi-bidder auction design. The approach generates certified revenue upper bounds by leveraging dual optimization theory, with a lifting technique that bridges discrete and continuous type spaces, potentially establishing near-optimality certificates for complex auction mechanisms.
AINeutralarXiv – CS AI · Jun 26/10
🧠Researchers propose 'Markov decision contests' as a new reinforcement learning framework that leverages pairwise preferences instead of scalar rewards, proving that stationary Markov policies are optimal and demonstrating superior learning efficiency in long-horizon problems compared to existing methods.
AINeutralarXiv – CS AI · Jun 16/10
🧠Researchers demonstrate that padded transformers maintain consistent computational expressivity across various architectural choices, with numeric precision and model depth emerging as the primary factors determining capability. The findings establish formal equivalences between transformer models and circuit complexity classes, suggesting practical transformer designs are more robust than previously understood.
AINeutralarXiv – CS AI · May 286/10
🧠Researchers demonstrate that Baldwinian and Lamarckian evolutionary algorithms significantly outperform traditional Darwinian evolution on complex optimization problems like Maximum Independent Set and Maximum Cut. The study provides both empirical validation across multiple datasets and theoretical runtime analysis, showing that local search-augmented evolutionary algorithms offer practical advantages for solving NP-hard graph problems.
AINeutralarXiv – CS AI · May 125/10
🧠Researchers demonstrate how functional stable model semantics enhances Answer Set Programming Modulo Theories (ASPMT), enabling integration of intensional functions that derive values from other predicates rather than pre-defined sources. The framework allows tight ASPMT programs to translate into SMT instances, extending the theoretical foundations of logic programming.
AINeutralarXiv – CS AI · May 116/10
🧠Researchers present a novel logical framework for understanding encoder-decoder transformers using temporal logic extended with counting and past modalities. The work provides theoretical foundations for how these architectures process information across attention mechanisms, with implications for LLM interpretability and design.
AINeutralarXiv – CS AI · May 96/10
🧠Researchers have developed Von Neumann Networks (VNNs), a novel neural network architecture inspired by John von Neumann's mid-20th century cellular automata model, demonstrating superior parameter efficiency and performance on basic tasks compared to traditional deep learning approaches. The framework extends neural operators through Green's functions on cellular topologies and proves computational universality, potentially opening new architectural paradigms for both software and hardware design.
AINeutralarXiv – CS AI · May 96/10
🧠Researchers have resolved a long-standing theoretical question about transformer neural networks by proving that at least two layers are required to compute the PARITY task (determining if a binary sequence contains an even or odd number of 1s). The study also presents a more practical four-layer transformer construction that works with standard softmax attention and realistic positional encoding, removing previous impractical assumptions.
AIBullishGoogle Research Blog · Nov 135/105
🧠A new quantum optimization toolkit has been developed, focusing on algorithmic and theoretical advances in quantum computing applications. The research presents novel approaches to solving complex optimization problems using quantum computational methods.
