Search: “inference”

Are Latent Reasoning Models Easily Interpretable?

arXiv:2604.04902v2 Announce Type: replace Abstract: Latent reasoning models (LRMs) have attracted significant research interest due to their low inference cost (relative to explicit reasoning models)

Avalon-ToM-Bench: Evaluating Fine-Grained Theory of Mind via Asymmetric Game Mechanics

Content type

All Blog X Post Paper YouTube Reddit GitHub

Clear filters

DGX agent

arXiv:2608.09638v1 Announce Type: new Abstract: Theory of Mind (ToM) is essential for agent interactions, yet existing evaluations either rely on static scenarios that oversimplify mental-state reason

model-releasesarxiv-cs-ai

11 Aug 2026

Business Arena: Benchmarking LLM Agents in a Realistic Marketplace

arXiv:2608.08621v1 Announce Type: new Abstract: Running a business is a challenging form of intelligent work. Operators must infer opportunities from partial signals, commit capital under uncertainty,

Contamination Means Overestimation? A Fine-Grained Empirical Study in Code Intelligence

arXiv:2506.02791v4 Announce Type: replace-cross Abstract: In recent years, code intelligence has gained increasing importance in the field of automated software engineering. Meanwhile, the widespread

Deployable Per-Instance Multi-Layer Activation Steering for Large Language Models

arXiv:2608.08829v1 Announce Type: cross Abstract: Activation steering edits the behaviour of a frozen language model by adding a learned vector to its residual stream, and current practice fixes the i

Describe-to-Score: A text-guided framework for image complexity assessment

model-releasesarxiv-cs-cv

arXiv:2509.16609v2 Announce Type: replace Abstract: Accurately assessing image complexity (IC) is essential for many vision tasks, yet existing approaches rely almost exclusively on visual features an

Goedel-Code-Prover: Hierarchical Proof Search for Open State-of-the-Art Code Verification

arXiv:2603.19329v3 Announce Type: replace-cross Abstract: Large language models (LLMs) can generate plausible code but offer limited guarantees of correctness. Formally verifying that implementations

Goose: Anisotropic Speculation Trees for Training-Free Speculative Decoding

arXiv:2604.02047v2 Announce Type: replace-cross Abstract: Speculative decoding accelerates large language model inference by drafting multiple candidate tokens and verifying them in a single forward p

Graph-Guided Safe Diffuser: Topological Graph Guidance for Safe Diffusion Planning

arXiv:2608.09484v1 Announce Type: new Abstract: Many diffusion-based planners enforce safety through inference-time guidance, but such interleaved trajectory deformations often degrade kinematic feasi

safetyarxiv-cs-ro

High-Layer Attention Pruning with Rescaling

model-releasesarxiv-cs-cl

arXiv:2507.01900v3 Announce Type: replace Abstract: Pruning is a highly effective approach for compressing large language models (LLMs), significantly reducing inference latency. However, conventional

LazyHMC: Hamiltonian Monte Carlo Simulation for Lazy, Infinite Dimensional Probabilistic Programs

arXiv:2608.08588v1 Announce Type: cross Abstract: Hamiltonian Monte Carlo (HMC) is a successful generic inference method in probabilistic programming, but in its ordinary formulation it needs gradient

Applications

Length-MAX Tokenizer for Language Models

arXiv:2511.20849v2 Announce Type: replace-cross Abstract: We introduce a new tokenizer for language models that minimizes the average tokens per character, thereby reducing the number of tokens needed

applicationsarxiv-cs-ai

Tutorials

Leveraging generative models to assist Monte Carlo sampling

arXiv:2608.07648v1 Announce Type: cross Abstract: Sampling high-dimensional probability distributions is a central task in scientific computing, with applications ranging from Bayesian inference to st

tutorialsarxiv-cs-lg

LibraSpec: Dynamic Diffusion-Based Speculative Decoding via Marginal-Gain-Driven Optimization

arXiv:2608.08721v1 Announce Type: cross Abstract: Speculative decoding accelerates large language model inference by drafting multiple tokens for parallel verification, with efficiency critically dete

Applications

LineGraph2Road: Structural Graph Reasoning on Line Graphs for Road Network Extraction

arXiv:2602.23290v2 Announce Type: replace Abstract: Extracting routable road networks from satellite imagery requires accurate topology recovery beyond pixel-level segmentation. Recent methods decompo

applicationsarxiv-cs-cv

Population-Scalable Multi-Agent World Modeling

arXiv:2608.08600v1 Announce Type: cross Abstract: World models have recently achieved impressive progress in visual prediction and interactive generation, but extending them to multi-agent environment

RippleKV: Cross-Layer KV Cache Allocation via Perturbation Propagation

arXiv:2608.08684v1 Announce Type: cross Abstract: Long-context LLM inference is bottlenecked by KV cache memory, yet distributing a limited cache budget across layers remains challenging. Existing met

SAKE: Structured Agentic Knowledge Extrapolation for Complex LLM Reasoning via Reinforcement Learning

arXiv:2505.15062v5 Announce Type: replace-cross Abstract: Knowledge extrapolation is the process of inferring novel information by combining and extending existing knowledge that is explicitly availab

SplitGaussian: Reconstructing Dynamic Scenes via Visual Geometry Decomposition

arXiv:2508.04224v2 Announce Type: replace Abstract: Reconstructing dynamic 3D scenes from monocular video remains fundamentally challenging due to the need to jointly infer motion, structure, and appe

researcharxiv-cs-cv

Task-to-Model Optimization for Enterprise LLM Coding Assistants: A Data-Driven Framework for Cost-Optimal Routing

arXiv:2608.08528v1 Announce Type: new Abstract: Enterprise AI coding assistants incur substantial inference spend, and naive token-cost minimization often fails to reduce end-to-end cost once retries,

An AI4AI Framework for Visual Token Pruning

arXiv:2608.07193v1 Announce Type: cross Abstract: Visual-token pruning can substantially reduce the inference cost of multimodal large language models (MLLMs), yet existing methods largely rely on fix

safetyarxiv-cs-cv

Applications

Autonomy-of-Heads: Data-Free Sparse Attention from Frozen Query-Key Geometry

arXiv:2608.06849v1 Announce Type: cross Abstract: Long-context LLM inference is bottlenecked by quadratic attention computation and growing KV-cache costs. Existing sparse attention and KV-compression

applicationsarxiv-cs-ai

Conformal Fusion Under Missing Modalities

arXiv:2608.07183v1 Announce Type: new Abstract: Multimodal fusion architectures typically assume all modalities are available at inference, yet sensor failures, acquisition variability, and cost const

Local Ai

ControlRef: Efficient Layout-Guided Multi-Instance Generation via Anchored 4D-RoPE

arXiv:2608.06878v1 Announce Type: new Abstract: Layout-guided multi-instance generation is essential for controllable image synthesis in Multi-Modal Diffusion Transformers (MM-DiTs). However, integrat

local-aiarxiv-cs-cv

Mathematical Principles and Experimental Discoveries of the Emergence of Symbolic Patterns in Artificial Neural Networks

arXiv:2608.06839v1 Announce Type: new Abstract: Artificial Neural networks (ANNs) are often treated as black-box models, making explainability a central challenge in deep learning. Many engineering me

Shape Your Feed: An LLM-based Agentic System for Conversational Recommendation

arXiv:2608.06632v1 Announce Type: new Abstract: Industrial recommendation systems predominantly adopt a passive ranking paradigm that infers user preferences from implicit behavioral signals (e.g., cl

Hardware

Summarize First, Download Later: Onboard VLMs for Bandwidth-Efficient Earth Observation

arXiv:2608.06959v1 Announce Type: new Abstract: Modern Earth observation (EO) satellites carry increasingly advanced sensors that produce vast volumes of high-resolution, multispectral data, yet downl

hardwarearxiv-cs-cv

The Sparsity Whisperer

arXiv:2608.06630v1 Announce Type: new Abstract: Pruning reduces the inference cost of large language models, but existing criteria primarily preserve large activations or reconstruct layer outputs. We

A Survey of Adversarial Efficiency Degradation for Vision Transformer by Exploiting Input-adaptive Optimization

arXiv:2608.05217v1 Announce Type: cross Abstract: Vision Transformers (ViTs) increasingly rely on input-adaptive inference, such as token pruning and early halting, to meet energy and latency budgets.

researcharxiv-cs-cv

Local Ai

Activity Frames: Deterministic Screen-Activity Compilation for Agent Memory and Replay

arXiv:2608.05784v1 Announce Type: new Abstract: Computer-use agents pay full frontier inference to re-derive routines their user has already performed, because an agent's memory today records what the

local-aiarxiv-cs-ai

AV-AIVAT: 74x Cheaper Agent Evaluation with Certified Anytime-Valid Stopping in Imperfect-Information Games

arXiv:2608.06362v1 Announce Type: cross Abstract: Deciding which of two agents is stronger means playing games until skill outweighs luck, and every game costs money, model inference, or expert time.

DBLAST: Dependent Block Drafting for Stochastic Speculative Decoding

arXiv:2608.05448v1 Announce Type: new Abstract: Speculative decoding accelerates large language models' inference by using a lightweight drafter to propose multiple future tokens and a target model to

researcharxiv-cs-cl

Evidence-Driven Dynamic Visual Selector for Efficient Long Video Understanding

arXiv:2608.05780v1 Announce Type: new Abstract: Recent advancements in MLLM-based long-form video understanding have mitigated inference-time computational cost and limited context lengths by selectin

safetyarxiv-cs-cv

QEvict: Recoverable Quantized KV Eviction for Attention-Drift-Robust Long-Context Decoding

arXiv:2608.05326v1 Announce Type: cross Abstract: Autoregressive large language model inference is increasingly constrained by the memory footprint of the Key-Value (KV) cache. A dominant line of work

researcharxiv-cs-cl

Refining Over Resampling: Test-Time Self-Correction for LLM Reasoning

arXiv:2608.05643v1 Announce Type: new Abstract: Test-time scaling improves LLM reasoning by using additional inference compute, but wider sampling alone can suffer from diminishing returns: new rollou

Scaffold-Mediated Post-Training: Co-Evolving Model Parameters and Procedural Scaffold Graphs

model-releasesarxiv-cs-cl

arXiv:2608.05156v1 Announce Type: new Abstract: Post-training of large language models optimizes only parameters, while inference-time procedural scaffolds are typically designed independently of para

Tutorials

STATe-of-Thoughts: Structured Action Templates for Tree-of-Thoughts

arXiv:2602.14265v3 Announce Type: replace Abstract: Inference-Time-Compute (ITC) methods like Best-of-n and Tree-of-Thoughts are meant to produce output candidates that are both high-quality and diver

tutorialsarxiv-cs-cl

Test-Time Scaling in Reasoning Models Is Not Effective for Knowledge-Intensive Tasks Yet

arXiv:2509.06861v3 Announce Type: replace Abstract: Test-time scaling increases inference-time computation through longer reasoning chains and has shown strong performance gains across many domains. H

The Illusion of Visual Tool-Use: A Causal Audit of Thinking with Images

arXiv:2608.06270v1 Announce Type: new Abstract: The 'thinking-with-images' paradigm equips multimodal LLMs with active visual operations such as crop-and-zoom. However, models using these operations o

Threshold-Based Early Stopping of Accumulations in Neural Networks with Binary Activation

arXiv:2608.06177v1 Announce Type: new Abstract: Binary neural networks are very attractive for constrained deployment, enabling small footprint and low-power inference. For binary activations, the dot

Timestep-Conditioned Transformers for Global Weather Forecasting

arXiv:2608.06241v1 Announce Type: new Abstract: Existing machine-learning weather forecasting models rely on predetermined and fixed autoregressive timesteps. The choice of model timestep involves a f

When Drafts Evolve: Speculative Decoding Meets Online Learning

arXiv:2603.12617v2 Announce Type: replace-cross Abstract: Speculative decoding has emerged as a widely adopted paradigm for accelerating large language model inference, where a lightweight draft model

When History Lies: Evaluating and Improving Tool Use under Misleading Multi-Turn Histories

arXiv:2608.06057v1 Announce Type: new Abstract: Tool-calling agents infer task state from accumulated dialogue and tool traces. In persistent interactions, however, historical traces may remain struct

Multimodal Spatiotemporal Atmospheric Data Assimilation with Latent Flow-matching

arXiv:2608.05103v1 Announce Type: new Abstract: Data assimilation (DA) uses Bayesian inference to update the state of a numerical forecast model with observed data. In this study, we propose a fundame

Not All Redundant Tokens Are Alike: Analyzing Visual Token Pruning through Token Roles

arXiv:2608.04483v1 Announce Type: new Abstract: Vision-language models (VLMs) process an image as a sequence of visual tokens, which creates a substantial computational bottleneck during inference. Re

safetyarxiv-cs-cv

RooflineBench: A Benchmarking Framework for On-Device LLMs via Roofline Analysis

arXiv:2602.11506v4 Announce Type: replace-cross Abstract: The transition toward localized intelligence through Small Language Models (SLMs) has intensified the need for rigorous performance characteri

Hardware

StaticSegFormer: An Efficient High-Performance Semantic Segmentation Based on Static Structured Pruning

arXiv:2608.04811v1 Announce Type: new Abstract: Structured pruning enhances the efficiency of deep neural networks (DNNs) by eliminating groups of parameters during inference. Previous methods mostly

hardwarearxiv-cs-cv

Statistical learning theory and Occam's razor: Regularization

arXiv:2608.04049v1 Announce Type: cross Abstract: The principle of Occam's razor, which instructs us to prefer simplicity in inductive inference, has attracted much scrutiny both in the philosophy of