AIBullisharXiv – CS AI · Jun 26/10
🧠Researchers propose SimSD, a novel speculative decoding algorithm that enables diffusion language models to achieve up to 7.46x faster inference speeds while maintaining generation quality. By introducing a plug-and-play masking strategy, SimSD addresses the fundamental incompatibility between diffusion models' bidirectional attention and token-level speculative verification, a technique proven effective for autoregressive models.
AIBullisharXiv – CS AI · Jun 26/10
🧠Researchers propose a Bayesian stopping strategy that reduces LLM inference costs by up to 50% while maintaining answer accuracy. The method samples multiple LLM responses and stops once sufficient consistency is detected, using an efficient L-aggregated policy that tracks only the top 3 answer frequencies and achieves theoretical optimality.
AINeutralarXiv – CS AI · May 296/10
🧠Researchers propose a neuro-symbolic framework for constructing knowledge graphs that combines LLM-based extraction with post-hoc ontology constraint validation, reducing token costs while improving consistency for complex question-answering tasks. The method defers corrections to after extraction rather than during it, enabling SQL-like querying capabilities for multi-hop reasoning across documents.
AINeutralarXiv – CS AI · May 296/10
🧠Researchers benchmark token-optimized data formats (TRON and TOON) against JSON in agentic AI systems, finding TRON reduces token consumption by up to 27% with acceptable accuracy trade-offs. The study reveals that while these alternatives show promise in isolated tasks, their real-world performance in multi-turn agent loops exposes limitations, particularly with TOON's parsing cascades and parallel tool-call handling.
AIBullisharXiv – CS AI · May 296/10
🧠Researchers introduce Parallax, a scalable Local Linear Attention mechanism that improves upon traditional softmax attention in large language models by learning query-like projectors to probe key-value covariance. Pretraining experiments at 0.6B and 1.7B parameters demonstrate consistent perplexity improvements and downstream benchmark gains, with performance matching or exceeding FlashAttention while revealing novel architecture-optimizer codesign benefits with the Muon optimizer.
🏢 Perplexity
AINeutralarXiv – CS AI · May 296/10
🧠Researchers propose replacing LLM-based triggers in proactive agent systems with a lightweight temporal graph learning (TGL) model that processes structured event streams directly. The approach achieves 16.7% mean F1 improvement while running 4-7x faster on GPUs and 12-83x faster on consumer hardware, with a 220 MiB footprint suitable for on-device deployment.
AINeutralarXiv – CS AI · May 286/10
🧠Researchers introduced HRBench, a unified evaluation framework for testing hybrid-reasoning LLMs that allow dynamic switching between fast and slow reasoning modes. The framework systematically compares 12+ prior methods across three switching strategy families and four training approaches, revealing that prompt-based methods offer better token-accuracy trade-offs while routing methods provide more stable cost reduction.
AIBullisharXiv – CS AI · May 286/10
🧠Researchers introduce FPMoE, a sparse Mixture-of-Experts model optimized for functional programming languages like Haskell, OCaml, and Scala, addressing a significant gap in LLM-based code generation. With only 3B active parameters, the model matches the performance of much larger models while using a novel architecture combining language-specific experts with a shared expert for cross-language functional patterns.
AIBullisharXiv – CS AI · May 286/10
🧠Researchers propose Palla, an algorithm that learns symbolic constraint functions called prefix filters to capture and correct systematic error patterns in large language models. By analyzing domain-specific failures (e.g., using Python syntax in TypeScript code), Palla enables constrained sampling to significantly improve compilation rates and output validity without retraining models.
🧠 Llama
AINeutralarXiv – CS AI · May 276/10
🧠Researchers introduce the s-Trace method to analyze how transformer-based LLMs utilize their computational capacity, revealing that model computation organizes into two distinct phases: a sparse early-layer core providing rough predictions, refined through denser later-layer computations. The findings suggest LLMs operate with modular efficiency rather than fully exploiting their parameter capacity across all inputs.
AIBullisharXiv – CS AI · May 126/10
🧠Researchers introduce LEVI, an open-source evolutionary search framework that achieves superior results on AI research benchmarks while reducing computational costs by 3.3x to 35x compared to existing methods. By optimizing search architecture rather than relying on larger language models, LEVI demonstrates that algorithmic efficiency can significantly reduce the expense of LLM-guided evolutionary discovery.
AIBearisharXiv – CS AI · May 96/10
🧠Researchers demonstrate that self-consistency—a technique where LLMs sample multiple reasoning paths to improve accuracy—delivers diminishing returns on modern models. Testing with Gemini 2.5 shows minimal accuracy gains (0.4-1.6%) while token costs scale linearly, suggesting the technique has become inefficient as model reliability improves.
🧠 Gemini
AINeutralarXiv – CS AI · May 16/10
🧠Researchers analyzing LLM-based automated scoring found that strategic model selection and reasoning configurations outperform ensemble methods for accuracy. Temperature sampling improved performance, but larger ensemble sizes showed diminishing returns, while higher reasoning effort correlated with better accuracy at varying cost-benefit ratios across model families.
🏢 OpenAI🧠 GPT-5🧠 Gemini
AINeutralarXiv – CS AI · Apr 206/10
🧠Researchers introduce DepCap, a training-free framework that optimizes diffusion language model (DLM) inference through adaptive block-wise parallel decoding. The method achieves up to 5.63× speedup by using cross-step signals to determine block boundaries and identifying conflict-free token subsets for safe parallel execution, maintaining quality while significantly accelerating inference.
AIBullisharXiv – CS AI · Apr 156/10
🧠Researchers propose RPRA (Reason-Predict-Reason-Answer/Act), a framework enabling smaller language models to predict how a larger LLM judge would evaluate their outputs before responding. By routing simple queries to smaller models and complex ones to larger models, the approach reduces computational costs while maintaining output quality, with fine-tuned smaller models achieving up to 55% accuracy improvements.
AINeutralarXiv – CS AI · Apr 136/10
🧠Researchers provide the first rigorous theoretical analysis of OPTQ (GPTQ), a widely-used post-training quantization algorithm for neural networks and LLMs, establishing quantitative error bounds and validating practical design choices. The study extends theoretical guarantees to both deterministic and stochastic variants of OPTQ and the Qronos algorithm, offering guidance for regularization parameter selection and quantization alphabet sizing.
AINeutralarXiv – CS AI · Apr 106/10
🧠Researchers introduce a declarative runtime protocol that externalizes agent state to measure how much of an LLM-based agent's competence actually derives from the language model versus explicit structural components. Testing on Collaborative Battleship, they find that explicit world-model planning drives most performance gains, while sparse LLM-based revision at 4.3% of turns yields minimal and sometimes negative returns.
