AINeutralarXiv – CS AI · May 126/10
🧠WindINR is a machine learning framework that enables fast, localized wind forecasting in complex terrain by using implicit neural representations to query wind conditions at specific user-defined locations rather than generating dense grid-based forecasts. The system achieves 2.6x speedup in corrections by updating only a compact latent state instead of retraining full networks, making it practical for real-time wind estimation applications.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers introduce primal-dual guided decoding, an inference-time method for discrete diffusion models that enforces global constraints during token generation through adaptive Lagrangian multipliers and KL-regularized optimization. The approach requires no model retraining, supports multiple simultaneous constraints, and demonstrates effectiveness across text generation, molecular design, and music applications.
AINeutralarXiv – CS AI · May 126/10
🧠MAGE introduces a novel framework for self-evolving language model agents that uses co-evolutionary knowledge graphs to preserve learned knowledge across iterations without modifying the base model. The system externalizes learning into structured memory subgraphs, enabling frozen backbone models to improve through retrieved guidance while maintaining inference stability across nine diverse benchmarks.
AIBullisharXiv – CS AI · May 126/10
🧠Researchers introduce TMAS, a multi-agent framework that improves test-time compute scaling for large language models by enabling specialized agents to collaborate through hierarchical memory systems. The approach balances exploration and exploitation more effectively than existing methods, achieving stronger iterative scaling on challenging reasoning benchmarks.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers introduce DARE, a technique that reduces computational redundancy in Diffusion Language Models by reusing cached attention activations across tokens. The method achieves up to 1.20x per-layer latency improvements while maintaining generation quality, addressing efficiency gaps between diffusion-based and auto-regressive language models.
AINeutralarXiv – CS AI · May 126/10
🧠NoisyCoconut is an inference-time method that improves LLM reliability by injecting controlled noise into internal representations to generate diverse reasoning paths, enabling models to abstain when uncertain without requiring retraining. The technique reduces error rates from 40-70% to below 15% on mathematical reasoning tasks through unanimous agreement among noise-perturbed paths, offering practical reliability improvements compatible with existing models.
AIBullisharXiv – CS AI · May 126/10
🧠Researchers demonstrate that identity-preserved image generation using FLUX can be accelerated 5.9x by replacing the standard diffusion backbone with a distilled version, without retraining the identity adapter. Analysis reveals identity fidelity stabilizes within 4-8 steps while later steps primarily refine visual details, enabling efficient personalized generation at deployment.
AIBullisharXiv – CS AI · May 126/10
🧠Researchers introduce TAD, a temporal-aware self-distillation framework that improves diffusion large language models' accuracy-parallelism trade-off by using adaptive loss functions based on token decoding timelines. The method increases accuracy from 46.2% to 51.6% while enabling aggressive acceleration modes, addressing a fundamental limitation in parallel text generation.
AIBullisharXiv – CS AI · May 126/10
🧠Researchers propose Semantic Softmax, a novel inference-time method that improves zero-shot LLM classification by recovering probability mass lost during constrained decoding. The approach aggregates scores from semantic synonyms, reducing calibration errors and boosting accuracy on emotion and toxicity detection tasks.
AINeutralarXiv – CS AI · May 116/10
🧠A comprehensive eight-week study evaluated 68 HTML generations from four major LLM families (GPT, Gemini, Grok, Claude) in standardized web generation tasks, finding Claude delivered the most consistent performance while questioning assumptions about reasoning time and social media predictability. The research reveals significant evaluation bias in LLM-as-judge systems and that code verbosity correlates more with model architecture than prompt specificity.
🧠 Claude🧠 Gemini🧠 Grok
AINeutralarXiv – CS AI · May 116/10
🧠LensVLM is a new inference framework that enables Vision Language Models to process highly compressed images of text by selectively expanding relevant sections, achieving 4.3x compression while maintaining accuracy comparable to full-resolution processing. The approach combines learned tool selection with post-training techniques to overcome the fundamental limitation that compressed text becomes illegible to standard vision encoders.
AINeutralarXiv – CS AI · May 116/10
🧠Researchers introduce Amortized-Precision Quantization (APQ) and MAQEE, a framework that optimizes Vision Transformers for low-precision deployment with early-exit mechanisms. By jointly optimizing exit thresholds and bit-widths while accounting for quantization noise across layers, the approach achieves up to 95% reduction in computational operations while maintaining accuracy across vision tasks.
AIBullisharXiv – CS AI · May 116/10
🧠Researchers introduce the Byte Latent Transformer (BLT), a new approach to byte-level language models that dramatically accelerates generation speed through diffusion-based and speculative decoding techniques. The methods reduce memory-bandwidth costs by over 50% compared to standard byte-level models, potentially making byte-level LMs practical for real-world deployment.
AINeutralarXiv – CS AI · May 116/10
🧠Researchers propose a theoretical framework for identifying when layer skipping in vision-language models reduces computational costs without sacrificing performance. The work establishes experimentally verifiable redundancy conditions that unify and improve upon existing pruning heuristics, confirming that early and late vision tokens contain significant redundancies across models.
AIBullisharXiv – CS AI · May 116/10
🧠Researchers introduce AdaCorrection, a framework that improves the efficiency of Diffusion Transformers (DiTs) used in image and video generation by adaptively correcting cached features during inference. The method maintains generation quality while reducing computational costs through intelligent cache reuse without requiring retraining or additional supervision.
AINeutralarXiv – CS AI · May 116/10
🧠Researchers demonstrate that KV-cache offloading techniques, designed to reduce memory usage in large language models, significantly degrade performance on context-intensive tasks requiring extensive information extraction. The study introduces the Text2JSON benchmark and identifies low-rank projection and unreliable landmarks as key failure points, proposing improved alternatives.
🧠 Llama
AINeutralarXiv – CS AI · May 96/10
🧠Researchers propose a two-stage inference-time budget control system for LLM search agents that optimizes how language models allocate computational resources between tool calls and token generation during multi-hop question answering. The method uses Value-of-Information scoring to decide when to retrieve information, decompose questions, or commit to final answers, demonstrating consistent performance gains across multiple benchmarks and model sizes.
AINeutralarXiv – CS AI · May 96/10
🧠Researchers introduce Open-SAT, a training-free algorithm that uses Large Language Models to refine query embeddings for satellite image retrieval tasks. The method improves upon existing vision-language models by leveraging LLM-guided contextual refinement at inference time, achieving up to 16% F1 score improvement on open-vocabulary satellite imagery tasks without requiring additional training.
AINeutralarXiv – CS AI · May 96/10
🧠Researchers develop a decision-theoretic framework for optimizing LLM cascades, where cheaper models defer to expensive ones on low-confidence queries. Testing across five benchmarks reveals that cascade performance is fundamentally limited by structural costs rather than routing sophistication, with simpler router-based approaches often outperforming optimized cascade policies.
AIBullisharXiv – CS AI · May 96/10
🧠Researchers conducted the first large-scale mechanistic study of tabular foundation models, revealing significant redundancy across inference layers. They demonstrated that a single-layer looped model can match performance of state-of-the-art models while using only 20% of the parameters, challenging assumptions about depth requirements in transformer architectures.
AIBullisharXiv – CS AI · May 76/10
🧠Researchers propose Predict-then-Diffuse, a framework that optimizes diffusion-based large language models by predicting required response length before generation, reducing computational waste from padding tokens and re-computation overhead while maintaining output quality across multiple datasets.
AINeutralarXiv – CS AI · May 76/10
🧠Researchers introduce Budgeted LoRA, a distillation framework that compresses large language models by treating model compression as a structured compute allocation problem. The method achieves up to 4.05x speedup in inference through selective dense component removal and adaptive low-rank allocation, controlled by a single compute budget parameter.
🏢 Perplexity
AINeutralarXiv – CS AI · May 76/10
🧠Coral is a new multi-LLM serving system that optimizes resource allocation across heterogeneous cloud GPUs to reduce inference costs by up to 2.79x. The system uses a two-stage decomposition algorithm that maintains optimal performance while reducing optimization time from hours to seconds, enabling dynamic adaptation to changing demand and resource availability.
AINeutralarXiv – CS AI · May 16/10
🧠Researchers introduce PAD-Rec, a lightweight module that optimizes speculative decoding for LLM-based recommendation systems by incorporating position-aware embeddings. The approach achieves up to 3.1x speedup in inference while preserving recommendation quality, addressing the latency bottleneck in generative list-wise recommendations.
AINeutralarXiv – CS AI · May 16/10
🧠Researchers introduce VISE, the first benchmark for evaluating sycophancy in video large language models (Video-LLMs), where models incorrectly agree with user inputs that contradict visual evidence. The study proposes two training-free mitigation strategies: enhanced visual grounding through keyframe selection and inference-time neural representation steering, addressing a critical reliability gap in multimodal AI systems.
