y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto

#inference-optimization News & Analysis

319 articles tagged with #inference-optimization. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.

319 articles
AIBullisharXiv – CS AI · Jun 26/10
🧠

InfoAtlas: A Foundation Model for Zero-Shot Statistical Dependence Estimate

Researchers introduce InfoAtlas, a foundation model that estimates statistical dependence between high-dimensional variables in a single forward pass rather than requiring iterative optimization. The breakthrough achieves 100x speedup while matching state-of-the-art accuracy, enabling real-time dependency analysis across varying data dimensions and sample sizes.

AINeutralarXiv – CS AI · Jun 26/10
🧠

Hybrid Verified Decoding: Learning to Allocate Verification in Speculative Decoding

Researchers propose Hybrid Verified Decoding, a technique that improves LLM inference speed by intelligently choosing between cache-based and model-based token drafting methods. The approach predicts draft acceptance rates before verification, achieving 2.73x average speedup on agentic workflows and outperforming existing methods like EAGLE3.

AIBullisharXiv – CS AI · Jun 26/10
🧠

MURMUR: An Efficient Inference System for Long-Form ASR

Researchers introduce Murmur, an inference system that optimizes long-form automatic speech recognition by balancing accuracy and latency through a two-level approach: intermediate chunk sizes at the inter-chunk level and attention sparsity exploitation at the intra-chunk level. The system achieves 4.2x latency reduction while maintaining single-pass accuracy on benchmark tests.

AIBullisharXiv – CS AI · Jun 26/10
🧠

Off-the-Shelf LLMs as Process Scorers: Training-Free Alternative to PRMs for Mathematical Reasoning

Researchers propose Chunk-Level Guided Generation, a training-free method using off-the-shelf large language models to score intermediate reasoning steps during small-model inference for mathematical problem-solving. The approach matches or outperforms specialized reward model-based systems on benchmarks like MATH and GSM8K without requiring expensive step-level training data.

🧠 Llama
AIBullisharXiv – CS AI · Jun 26/10
🧠

FLARE: Diffusion for Hybrid Language Model

Researchers introduce FLARE, a conversion framework that enables large language models with hybrid attention mechanisms to function as both autoregressive and diffusion models, addressing a key limitation in parallel decoding while maintaining model capability. The approach demonstrates competitive performance with existing diffusion language models while delivering throughput gains in concurrent serving scenarios.

AIBullisharXiv – CS AI · Jun 26/10
🧠

STaR-KV: Spatio-Temporal Adaptive Re-weighting for KV Cache Compression in GUI Vision-Language Models

Researchers introduce STaR-KV, a training-free compression framework that reduces key-value cache memory consumption in vision-language GUI agents by up to 40% while maintaining accuracy. The method addresses a critical bottleneck where models like UI-TARS-1.5-7B consume prohibitive GPU memory during multi-step interactions, enabling more practical deployment on standard accelerators.

AINeutralarXiv – CS AI · Jun 16/10
🧠

Lumos-Nexus: Efficient Frequency Bridging with Homogeneous Latent Space for Video Unified Models

Lumos-Nexus is a new video generation framework that separates training and inference to improve both reasoning quality and visual fidelity. The system uses a lightweight generator during training and progressively hands off to a high-capacity generator during inference through a technique called Unified Progressive Frequency Bridging, while introducing VR-Bench as a benchmark for reasoning-driven video generation.

AINeutralarXiv – CS AI · Jun 16/10
🧠

Cross-Modal Attention Calibration for LVLM Hallucination Mitigation

Researchers propose Cross-Modal Attention Calibration (CMAC), a training-free method to reduce hallucinations in large vision-language models by addressing position bias and spurious correlations between visual and textual modalities. The approach combines an Inter-Modality Decoding module with contrastive mechanisms and a position calibration component to improve consistency between visual inputs and generated outputs.

AIBullisharXiv – CS AI · Jun 16/10
🧠

Mixture of Horizons in Action Chunking

Researchers propose Mixture of Horizons (MoH), a novel technique for vision-language-action models in robotics that processes action sequences at multiple time scales simultaneously to balance long-term planning with short-term precision. The method achieves state-of-the-art performance on robotic manipulation tasks, reaching 99% success rate on LIBERO benchmarks while enabling 2.5x faster inference through adaptive horizon selection.

AINeutralarXiv – CS AI · Jun 16/10
🧠

Stop the Flip-Flop: Context-Preserving Verification for Fast Revocable Diffusion Decoding

Researchers introduce COVER, a new verification technique for diffusion language models that eliminates inefficient token oscillations during parallel decoding. By using KV cache overrides to preserve context while selectively verifying tokens in a single forward pass, COVER accelerates inference while maintaining output quality.

AINeutralarXiv – CS AI · Jun 16/10
🧠

A Kinetic Energy Perspective of Flow Matching

Researchers introduce Kinetic Path Energy (KPE), a physics-inspired metric for evaluating flow-based generative models that measures the dynamical effort of sampling trajectories. The analysis reveals a non-monotonic relationship between trajectory energy and generation quality, where excessive energy causes memorization rather than genuine generation, leading to a training-free inference method called Kinetic Trajectory Shaping that improves output fidelity.

AINeutralarXiv – CS AI · Jun 16/10
🧠

Block-Based Double Decoders

Researchers propose block-based double decoders, a transformer architecture that combines the training efficiency of decoder-only models with the inference speed advantages of encoder-decoder models. The innovation uses doubly-causal block-based attention masks to enable full loss supervision and static sequence packing, achieving 2/3 reduction in KV-cache memory and per-token compute at inference time.

AINeutralarXiv – CS AI · May 296/10
🧠

ReasonOps: Operator Segmentation for LLM Reasoning Traces

Researchers introduced ReasonOps, an unsupervised method for analyzing chain-of-thought traces from large language models that identifies seven universal reasoning operators (backtracking, inferring, hypothesizing, etc.) appearing consistently across 12 different LLM families. The framework enables model identification, correctness prediction, and early quality estimation without manual annotation, revealing that each model family has a distinctive reasoning fingerprint.

AINeutralarXiv – CS AI · May 296/10
🧠

CosmicFish-HRM: Adaptive Reasoning via Hierarchical Recurrent Mechanisms in Compact Language Models

Researchers introduce CosmicFish-HRM, a compact language model that uses a Hierarchical Reasoning Module to dynamically adjust computational effort during inference based on input complexity. The approach challenges the assumption that larger models are necessary for advanced reasoning, suggesting adaptive computation depth could offer efficiency gains as model scale increases.

AIBullisharXiv – CS AI · May 296/10
🧠

BlockBatch: Multi-Scale Consensus Decoding for Efficient Diffusion Language Model Inference

BlockBatch introduces a training-free inference framework that optimizes diffusion language models by executing multiple block-size branches simultaneously, achieving 26.6% reduction in computational steps and 1.33x speedup over existing methods. The approach exploits the complementary nature of different decoding granularities to balance parallelism with accuracy while managing the inherent trade-offs in block-wise inference.

AINeutralarXiv – CS AI · May 296/10
🧠

Steering Language Models Before They Speak: Logit-Level Interventions

Researchers introduce SWAI, a training-free method for controlling language model outputs by manipulating logit scores using corpus-derived statistics. The technique enables real-time steering of model behavior—such as adjusting readability, politeness, and toxicity—without modifying model weights or accessing internal layers, outperforming existing prompt-based and logit-level baselines.

AINeutralDecrypt · May 286/10
🧠

AI Agents Are Learning to Predict What Users Want—Before They Ask for It

Chinese researchers have developed an AI model that leverages idle processing time to predict and prepare for users' next queries before they're asked. This advancement in predictive AI could reduce latency and improve user experience by pre-computing likely requests during periods when the system would otherwise be inactive.

AI Agents Are Learning to Predict What Users Want—Before They Ask for It
AINeutralarXiv – CS AI · May 286/10
🧠

The Shape of Overthinking: Backtracking Bursts in Long Reasoning Traces

Researchers analyzed backtracking patterns in reasoning traces from the Qwen3-8B model, finding that correct reasoning typically shows early, isolated self-corrections while incorrect reasoning exhibits persistent, clustered revisions occurring late in traces. The study demonstrates that burst-aware filtering of reasoning traces can improve model reliability by identifying unstable reasoning patterns before completion.

AINeutralarXiv – CS AI · May 286/10
🧠

HRBench: Benchmarking and Understanding Thinking-Mode Switch Strategies in Hybrid-Reasoning LLMs

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.

AINeutralarXiv – CS AI · May 286/10
🧠

DREAM-R: Multimodal Speculative Reasoning with RL-Based Refined Drafting, Precise Verification, and Fully Parallel Execution

Researchers introduce DREAM-R, a framework that accelerates reasoning in multimodal AI models through improved speculative execution. The system uses reinforcement learning to align draft models with target reasoning, a verification mechanism to prevent errors, and parallel processing to achieve significant speedup while maintaining accuracy.

AIBullisharXiv – CS AI · May 276/10
🧠

AGORA: Adapter-Grounded Observation-Action Retention for Inference-Free Prompt Compression in LLM Agents

Researchers introduce AGORA, a new compression method for LLM agents that addresses critical failures in existing token-level compressors. Unlike general-purpose compression techniques that destroy action semantics by removing low-entropy tokens, AGORA operates at step-granularity with structural awareness, achieving 1.0-11.5x compression while retaining 75%+ performance across most test scenarios.

AINeutralarXiv – CS AI · May 276/10
🧠

Tail-Aware HiFloat4: W4A4 Post-Training Quantization for Wan2.2

Researchers have developed Tail-Aware HiFloat4, a post-training quantization method that compresses text-to-video generation models using W4A4 (4-bit weights and activations) while maintaining output quality. The technique introduces activation-tail-aware calibration to handle statistical outliers, enabling efficient model deployment without retraining.

AINeutralarXiv – CS AI · May 276/10
🧠

Targeted Remasking: Replacing Token Editing with Token-to-Mask Refinement in Discrete Diffusion Language Models

Researchers propose Token-to-Mask (T2M) remasking as an improved alternative to Token-to-Token editing in discrete diffusion language models, addressing fundamental limitations in error detection and context corruption. The method resets suspected erroneous tokens to mask state for re-prediction, demonstrating 5.92% improvement on mathematical benchmarks and fixing 59.4% of final-answer corruption cases.

← PrevPage 10 of 13Next →