Your Benchmark Is an Empirical Measure Over DifficultyThe paper treats a benchmark as an empirical measure over item difficulty and formalizes two failure modes: measure mismatch (benchmark difficulty distribution differs from the intended one) and coverage gaps (uncovered difficulty regions that hide localized training progress). It proposes two diagnostic metrics with theoretical guarantees and analyzes 25 popular benchmarks across 7 domains using estimated item difficulties. It also introduces BenchFill, a difficulty-targeted item rewriting algorithm that reduces local coverage gaps.
huggingface.copaperAdded 31 Oct 2026
WorkFactory: Turning Professional Intents into Executable Work for Scalable Agent TrainingWorkFactory is a framework that builds coherent, executable professional tasks for training working agents. It plans an information support graph from professional intents, then uses probe executions to find and repair missing or inconsistent task information. The authors built 112,686 tasks across 612 occupations and fine-tuned Qwen models at 4B, 27B and 35B-A3B (WorkPilot). WorkPilot-35B-A3B rose from 879 to 1565 Elo on GDPval-AA v2.1.
huggingface.copaperAdded 30 Oct 2026
GPT-Rosalind-6 System Card AddendumGPT-Rosalind-6 System Card Addendum describes OpenAI's life-sciences reasoning model, which uses the same weights as GPT-6 Astra and is offered only through trusted access. It reports life-science benchmark gains over GPT-Rosalind-5.5 (MedChemBench v7 49.6% vs 28.9%), High-capability Biological and Chemical Preparedness results, and below-threshold Critical bio design evaluations. It also covers access controls, refusal evaluations, cyber jailbreak regression and alignment tables.
deploymentsafety.openai.compaperPublished and added 30 Oct 2026
world2vec: Mechanistic world models through latent dynamics learningworld2vec is a method for learning mechanistic world models from observations and actions alone, without reward information. Its latent dynamics reproduce the true system over long prediction horizons using at least one order of magnitude fewer parameters than DreamerV3, TD-MPC2 and LeWM. The authors report state-of-the-art control of continuous environments from pixels and accurate system identification across a benchmark of 71 attractors.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026- TextSeal2: Distortion-Free LLM Watermarking with Copula Mixing and Memoryless Races
TextSeal2 is a distortion-free watermark for LLM output that keeps its signal under speculative decoding. It merges two or more keys into one virtual key coupled to fresh noise through AutoMark's Gaussian copula, and verifies drafts with an extra exponential race. On three LLMs it detects 8 to 22 points more 100-token answers than TextSeal at a 10^-3 false-positive rate.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - RADIOlogy: A Single-Pass Approach to Training-Free Zero-Shot Anomaly Detection
RADIOlogy is a training-free, single-pass zero-shot anomaly detection method that uses multi-head attention pooling in vision-language models. It scores anomalies by contrasting average similarity between vision features and sets of normal and abnormal prompts, with no windowed execution. RADIO agglomerative features drive a dense refinement pipeline for pixel-level segmentation, and the method is applied to medical images.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - VeriCUA: Verification as Agentic Exploration for Computer-Using Agents
VeriCUA is a platform-agnostic framework that verifies task completion by computer-using agents through agentic exploration. The verifier inspects context to build a task rubric, then picks GUI or code checks for unresolved requirements and combines findings under explicit evidence rules. It works online and offline across desktop, mobile and web, and agrees better with reference labels than the baselines, with the largest offline gains on hard cases.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - Multi-View MoE: Letting Every Router Shape Expert Computation
Multi-View MoE is a sparse mixture-of-experts design that uses several independently initialized routers to select experts, then reuses their relative scores to mix learned latent views into each selected expert's input. Each expert still runs one forward pass, so active-expert count, FLOPs and all-to-all volume are unchanged. On a 24-layer 10B-A1B model trained on 708B tokens, it gains 1.18 points on a nine-task mean; Multi-Router alone gains 0.6.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - On the Fundamental Limits of Prefill-Based Decoding Length Prediction
This paper derives bounds on predicting an LLM's decode length from prefill-phase hidden states, a primitive for inference scheduling. It models decoding as a stopped stochastic process, giving per-prompt normality and an affine variance law σ=αμ+b. Predictors (MLP, EGTP, FiLM, soft-label, Mixture-of-Experts) converge near the bound, so system error dominates model error. It proposes fixing model, data and sampling in benchmarks and reporting relative-error metrics.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - Efficient Scalable Oversight via Rewinding
Rewindable interactive proofs (RIPs) are a new model of relativizing interactive proofs for scalable oversight, in which a weak verifier can rewind an AI prover to an earlier saved state. The paper builds an RIP for computations robust to changes in a small fraction of oracle answers. The honest prover runs in linear time, the verifier runs in nearly linear time in the input length after one-time preprocessing, and no cryptography is used. A preliminary MNIST experiment shows an RIP can be faster than a deployed proof system.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - PhysCount: Do MLLMs Count Visual Appearances or Physical Entities?
PhysCount is a benchmark of 546 real-world images and 4,595 human-written questions in 651 target-specific groups. It tests whether multimodal LLMs can separate visible appearances (direct view, reflections, glass) from the physical entities behind them. Across 40 MLLMs, counting appearances is much easier than linking them to entities, and the best model answers every question correctly in only 13.36% of groups.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - Glance: The Generator Is Its Own Reranker
Glance is a RAG method in which the generator also reranks. It adds a lightweight decision adapter and pointer head that score candidate passages from one shared prefill, so a single resident 9B backbone does generation and reranking. After 39 minutes of MS MARCO fine-tuning it reaches nDCG@10 of 0.741 on SciFact and 0.345 on NFCorpus, against 0.721 and 0.326 for bge-reranker-v2-m3. On 300 HotpotQA questions it improves answer F1 by 0.045 over cross-encoder-selected context. Evaluation covers two retrieval datasets, one QA dataset and one backbone family.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - Retrieving from Your Own Mistakes: On-Policy Training of Embedding Models for Multi-Hop Retrieval-Augmented Generation
On-policy state training is a method for training chain embedding retrievers for multi-hop RAG on the states the encoder itself reaches, including those built on its own wrong retrievals. Each state is labeled with the earliest missing gold passage, other missing gold passages are masked, and updates are contrastive and mixed with teacher-forced states. It retrieves complete evidence more often than teacher-forced training and graph-based systems, and transfers to harder long-chain HotpotQA and 2WikiMultiHopQA variants the authors built.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - Agentic LLM reasoning in pediatric diabetes outcome prediction from multimodal medical records
CEDAR (Clinical Evidence-Driven Agent for Risk-prediction) is an evidence-citing, self-auditing LLM pipeline for predicting pediatric diabetes outcomes at 24 months from 18 months of records. On 2,489 youth with type 2 diabetes and 4,018 with type 1, pooled AUROC was 0.815 versus 0.656 to 0.700 for trained ML in T2D, and 0.756 versus 0.603 to 0.631 in T1D. Only 4 of 70,246 cited values mismatched the chart. Two pediatric endocrinologists matched its predictions in about nine of ten cases.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - The Athlete as a Scientist of One: Agentic Bayesian Experimental Design for Individualized Physiology from Consumer Wearables
EpiCoach is an agentic system that treats one cross-country mountain biker as an N-of-1 experiment. Claims live in an evidence-gated hypothesis registry, and each must make a probabilistic prediction before a session. Predictions come from a digital twin fitted to heart rate, GPS and altitude. In a replay over eighteen months the twin beat standard forecasters on heart rate but not segment time, and the agent loop matched a static model. In the first three live weeks, the ledger sealed 20 predictions and scored 14, and a safety officer vetoed the agent twice. The registry, benchmark and protocol are released.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - Don't Lose the Thread: Empowering Long-Horizon LLM Agents with Cognitive Resource Self-Allocation
CORAL (Cognitive Resource Self-Allocation) is an agent-callable working-memory toolset that lets an LLM agent checkpoint task progress and verified facts, then reset its cluttered context and resume from a clean state. A Multi-episode Agentic Reinforced Policy Optimization algorithm trains the checkpointing. With an 8B model it reaches 42.8% average accuracy on GAIA, uses 6-7x fewer input tokens than a ReAct agent, and adds 8.0 points to a proprietary agent on BrowseComp.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - A Unified Hessian-Guided Framework for Post-Training Quantization
This preprint proposes a unified post-training quantization framework for large language models. It derives a Hessian-guided approximation of the output change caused by joint weight and activation quantization, using a tractable Fisher approximation. Quantization ranges, linear transformations and weight rounding are optimized together under one output-sensitivity objective. The authors report gains over state-of-the-art transformation and rounding methods in channel-wise and block-wise settings.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - Decompose, Estimate, Select: Coverage-Aware Context Construction for Long-Form RAG
Decompose, Estimate, Select is a coverage-aware retrieval pipeline for long-form RAG. It splits a query into subquestions, ranks candidates with a coverage-trained bi-encoder, predicts a document-by-subquestion coverage matrix with a cross-encoder, and picks documents by greedy maximum-marginal coverage. On TREC RAG 2024, α-nDCG@10 rises from 0.625 to 0.702 (gold-nugget bound 0.718). A grounded self-feedback loop raises V_strict by 0.086 over two passes.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - MAServeBench: Benchmarking Multi-Agent LLM Serving Systems with Hierarchical Collaboration Workloads
MAServeBench is a benchmark that treats multi-agent collaboration as a configurable dimension of LLM serving workloads. Its composable stages model how agents coordinate and exchange context in documented multi-agent workflows, and Hierarchical Semantic Traces record operations and dependencies for reproducible comparisons. Task-linked measurements tie workloads to GPU/NPU behavior, showing serving efficiency does not always mean timely task completion. Code is released.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - Only Accepted Tokens Count: An Energy Accounting of Speculative Decoding Under Latency Targets
This paper measures the energy cost of speculative decoding in SGLang with CUDA graphs on H100 and H200 GPUs, at batch sizes up to 64 across 5 corpora. Savings depend on drafted-token acceptance, which is lower on conversation than code and lower on Romansh than English. Savings shrink as batch size grows, and block drafters can push verification into the compute-bound regime, where speculation raises energy per token.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - Benchmarking color judgment in multimodal LLMs with CIE-computable ground truth
A five-task benchmark tests multimodal LLM color judgment against CIE colorimetric ground truth: AWB pair judgment, skin-tone bias direction, CCT estimation, Delta E 2000 pair ordering, and color naming under changing illuminants. Eight endpoints were tested. On ColorChecker-24 stimuli, closed frontier models reach CCT MAE of 715-1056 K versus 1358-2133 K for open-weight models, and a non-ColorChecker control shows this gap is partly template-dependent.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - Turing LLM Post-Training: Calibrated Distillation and Efficient Dynamic-MoE Execution
Turing LLM post-training combines calibrated multi-teacher on-policy distillation (C-MOPD) with an execution path for dynamically routed mixture-of-experts models. C-MOPD matches each teacher on a local Top-K support with teacher-wise loss normalization and clipping. On Turing-20B-A2B it scores 0.9988 on four-domain integration, beats Qwen3-8B on math and code (85.92 vs 80.33 mean), and cuts consolidation step time from 398.7 to 139.3 seconds in a PPU profile.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - M-PFT: Angular Margin for Calibrated Prompt-Tuning of Fine-Tuned Vision-Language Models
M-PFT is an angular-margin method for prompt tuning of vision-language models that fixes base-to-novel dual miscalibration (underconfidence on base classes, overconfidence on novel classes). It adds two losses: minimizing the maximum cosine similarity between tunable class embeddings, and minimizing angular distance to each zero-shot embedding. Tests on 9 prompt-tuning methods and 15 datasets show lower novel-class calibration error at comparable accuracy and negligible overhead.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - Aligning Medical Vision Language Models at the Capability Boundary with Entropy Adaptive Rubric Grounding
MedCBR is a two-stage alignment framework for medical vision language models. Difficulty Weighted Boundary Preference Optimization (DBPO) trains on counterfactual preference pairs at the model's capability frontier. Entropy Gated Grounded Policy Optimization (EGPO) then applies distilled clinical rubrics according to prediction entropy. It reaches 61.2% average accuracy on six medical benchmarks, with the largest gains on differential diagnosis, and the two stages combine super-additively.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - RetroChessBench: A Benchmark for Reconstructing and Proving Chess Histories
RetroChessBench is a 12-task benchmark for retrograde chess: reconstructing legal game histories, exact-length constructions, unique endings and exhaustive answer sets, with references, rubrics and a terminal-reward RL environment. GPT 6 Astra High fails to give the required final answer in 22 of 24 attempts without tools and 18 of 24 with code execution. Mean terminal RL rewards are 14.75% and 27.19%. The authors link the failures to scarce worked derivations in web training data.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - Sparse Autoencoders as Implicit Diversification Regularisers for Cross-Sectional Cryptocurrency Returns
This arXiv preprint (October 2026) tests a sparse autoencoder as a factor model for daily cryptocurrency returns, with equities as a secondary test. SAE portfolios show consistently lower volatility than common benchmarks, linked to lower correlations among selected assets. They do not beat a simple contrarian strategy on risk-adjusted return, and factor identities change between training runs.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - DICE: Decentralized Incentive-driven Federated Learning for Efficient & Scalable Customization of Pretrained Models in Web3
DICE is a blockchain-powered federated learning (BCFL) algorithm for customizing large pretrained models among untrusted Web3 participants. It combines dynamic progressive learning and model slice verification, so hardware-limited participants can train part of the model, with a tree-structured committee consensus protocol and an efficiency-driven incentive scheme to scale to more data holders. Experiments cover vision and language models.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - Cryptography and Security Papers (@FSFG) on X
PrivacyEvalClaw is a tool-augmented deliberative agent for auditing privacy leakage in LLM responses produced under jailbreak prompts. By Krishna Kanth Nakka and five co-authors, the paper is on arXiv (cs.CR) and accepted to AACL-IJCNLP 2026. The fetched post gives only the title, authors and venue, so method details and results are not available here.
x.compaperAdded 30 Oct 2026, published 29 Oct 2026 - PCM: A Proof-Carrying Message Protocol for Verifiable Multi-Agent Communication
Proof-Carrying Messages (PCM) is a protocol where each claim an AI agent sends carries evidence: records from an append-only Merkle log the agent cannot write, with inclusion proofs, signed by an attesting signer. Receivers verify offline in about 1 ms and label each claim proven, unproven or failed. On 926 messages (712 lies in 16 classes), PCM accepts 10 lies (1.4%), all stale evidence; plain A2A accepts all 712.
arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026 - TrussTutor-Bench: Benchmarking large language models on solution accuracy, sycophancy, and error detection in statics
TrussTutor-Bench is a benchmark of 200 verified two-dimensional truss problems from statics, paired with automatically generated student solutions. It evaluates thirteen LLMs on solution accuracy (64.5% to 97.0%), error detection (90.4% to 100%) and sycophancy. Models rejected their own correct solutions in 1.6% to 50.0% of cases when a student insisted the work was wrong. Sycophancy separated models; error detection did not.
arxiv.orgpaperAdded 31 Oct 2026, published 28 Oct 2026 - Gold vs.~Translation: Are We Measuring Language, Knowledge, or Locality in Translated Benchmarks?
Gold vs. Translation is an October 2026 arXiv study of whether DeepL-translated MMLU measures the same thing as native benchmarks. It compares seven pairings against six native benchmarks in five Nordic and Baltic languages, using 29 models. Translated MMLU adds predictive value for curriculum-overlap benchmarks such as Skolprov (ΔR²=.128) but not for Sweden-specific SwedishFacts (p=.242).
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026 - Leaving, Staying, or Living There? Duration Commonsense Reasoning with Human-LLM Co-annotations
This paper studies whether vision-language models can infer how long a person stays somewhere (living, staying, or leaving) from geotagged social media posts. The authors build a new corpus of geotagged tweets co-annotated by humans and LLMs. State-of-the-art models struggle even with multi-turn Chain-of-Thought prompting, often missing contextual cues and subtle hashtags while over-relying on prominent visual details.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026 - inkGround: Benchmarking Fine-grained Visual Grounding Capabilities of Vision-Language Models for Cursive Handwriting in the Wild
inkGround is a benchmark for stroke trajectory recovery from full-page, camera-captured handwriting, with 537 page images (about 18.7k words, 163k strokes) and pseudo-label references filtered by OCR agreement and human raters. Models get a page image and a target word, then output ordered stroke points. Seven VLMs were scored with DTW, Chamfer distance, readability and style similarity. Closed-source models, notably Gemini-3.1-Pro, did best, and the ranking held on IAM-OnDB.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026 - Deogen: Automatic Benchmark Generation for Reasoning over Policies
DeoGen is an automatic, parametrizable benchmark generator for deontic reasoning, where a model applies policy rules to facts to reach a verdict. It autoformalizes rules into first-order logic, builds decision trees, and turns each tree path into a benchmark entry. Frontier models give the correct verdict 89-92% of the time, but only 22-40% on entries lacking enough information, even when told to abstain.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026 - AskStream: When and What to Ask Proactively under Uncertainty in Streaming Video Understanding
AskStream is a multi-turn benchmark for streaming video understanding that adds a third proactive action, ask, alongside wait and answer, for cases where video or user information is incomplete. It has 438 videos, 2,714 manually annotated frame-level time windows (wait, ask, answer), four task categories and eight subtasks. The strongest model reaches only 52.18% on the proposed Ask-F1 metric, in both multiple-choice and open-ended settings.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026 - Quantize by Doing: Task-Guided Mixed-Precision Quantization of Vision-Language-Action Models
QbD-VLA is a mixed-precision post-training quantization method for vision-language-action models. It uses task success from short closed-loop evaluations to assign weight and activation bit widths, accounting for interactions between components. On four VLA models across all four LIBERO suites it holds task performance at about 4-bit weights and under 6-bit activations. The gain on SIMPLER is small. On a Franka Research 3 arm, X-VLA shows no detected loss, but π0.5 fails.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026 - When LLM Architectures Meet Smart Contract Vulnerability Detection: a Replication Study
This paper replicates Chen et al.'s study of LLM-based smart contract vulnerability detection, first on GPT-4 and then on Mixture-of-Experts, RNN-like and State Space Models. The exact replication confirms the high-recall, low-precision pattern on GPT-4. The differentiated replication finds the pattern does not transfer uniformly: GPT-4 and Gemma-3 behave alike despite a roughly 100x parameter gap, while two MoE models diverge.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026 - Think Before You Act: Decision Gate for LLM Agents
JevAct is a runtime verification framework that intercepts selected LLM agent actions before execution and returns feedback for bounded revision. It compiles domain policies into executable state checks and structured questions scored by a prefill-only decision model, giving probability-based judgments without generation. Tested on eleven agents with tau^2-bench Airline and Telecom and BFCL, it gained consistently on Telecom and BFCL and was mixed on Airline.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026 - Repairs for Whom? Evaluator-Executor Mismatch in Selecting Repairs for Failed LLM Agents
Repairs for Whom? studies single-step repairs of failed LLM agent trajectories and asks whether common evaluators (greedy replay, stronger models, oracles, log-reading judges) pick repairs that help the deployed agent. Using independent rollouts in ALFWorld and WebShop, greedy replay loses 0.06-0.13 in expected gain, and Qwen2.5-14B rollouts misselect repairs for Qwen2.5-7B. The authors recommend verifying repairs with the executor that will run them.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026 - Data Scaling Laws in Stereo Matching: From In-domain Fitting to Cross-domain Generalization
This paper studies data scaling laws in stereo matching and releases XStereo, a realistic synthetic dataset of 200 thousand samples. In-domain training on five large datasets shows two regimes: a standard power law, then saturation, with a transition point roughly fixed for a given model. Cross-domain performance depends only weakly on source data scale, and distribution and coverage diversity reduce domain gaps more.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026 - Session-Bound Behavioral Watermarking for Autonomous LLM Agents
AgentAnchor is a session-keyed behavioral watermark that lets an agent owner prove ownership of a trajectory log. Each step key comes from a secret key, a fresh public session identifier and semantic states of recent observations. Parity evidence is embedded through a KL-bounded exponential tilt of action choices. A trusted verifier checks disputed logs without rerunning the agent, using wrong-key calibration and abstention. The paper also formulates a learned cross-session forgery threat.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026 - CALM: Conflict-Aware Lifecycle Memory Governance for Long-Horizon Language Agents
CALM is a conflict-aware lifecycle memory governance framework for long-horizon language agents. It turns records into evidence-grounded memory cells, updates their validity and lifecycle states from support, conflict and dependency signals, and admits evidence at query time through training-free or learned gating based on temporal applicability. It beats baselines on LongMemEval-S and LoCoMo with Qwen and GPT backbones, and keeping superseded records helps earlier-state reasoning.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026 - From Leniency to Suspicion: How an Open Post-Training Recipe Changes Whom LLM Fact-Checkers Believe
This paper measures job-based doubt in LLM fact-checkers: judging a claim false more often when the poster has a lower-status job. It compares base and post-trained checkpoints of six model families on fact-checked claims with randomised poster profiles. Only the open Tülu-3 recipe (OLMo-2 32B, Tülu-3 70B) creates the effect, under one percentage point but reliable. In OLMo-2 32B the flip comes from one residual-stream direction and appears at supervised fine-tuning, confirmed on 400 new claims. None of seven commercial models doubts lower-status posters more.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026 - Benchmarking decision models against generative large language models on medical multiple-choice questions
This preprint benchmarks 13 decision models against 15 generative LLM configurations, including different reasoning settings, on 1,273 text-only four-option MedQA questions. Accuracy ran 67.71% to 89.08% for decision models and 78.32% to 96.86% for generative configurations. Decision models were cheaper and faster, but answers with probability of at least 0.90 still had error rates of 1.71% to 12.77%, and probability repeatability varied across three runs.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026 - Does Chain-of-Thought Reliance Follow a Scaling Law?Larger Models Follow Their Steps More, Independent of Post-Training
This paper measures how much a model's final answer depends on its own written chain of thought, using a synthetic box-swap task with exact ground truth. It edits one step in the model's chain to a wrong but valid state and checks whether the answer follows. Across 25 open-weight models, reliance rises with size and saturates (Qwen3 from 16-18% at 0.6B to 97-100% at 14B). Reliance tracks capability (r = 0.99) and is unchanged by post-training.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026 - TCC-RAG: Temporal Causal Chain-Guided RAG for Temporal Knowledge Graph Question Answering
TCC-RAG is a retrieval-augmented generation method for temporal knowledge graph question answering (TKGQA). It turns the temporal knowledge graph into a multi-view causal cue graph, builds a query-specific temporal causal chain to guide retrieval, and applies a causal evidence filter to the results. The authors report gains of 10.72% and 8.40% on two TKGQA benchmarks and 62.97% on multi-step temporal reasoning.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026 - FlatCake: A Flat KVCache Storage Architecture for LLM Serving
FlatCake is a KV cache storage architecture for LLM serving that treats host DRAM and NVMe SSD as peer media in one 64-bit address space, instead of a DRAM-over-SSD tier. Blocks are placed once, in session-contiguous, layer-major order, and streamed via GPUDirect Storage. On a Claude Code trace with DeepSeek-V4-Flash it holds a 94% hit rate (Mooncake: 64%) and cuts peak-load mean TTFT 1.6x.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026 - Multi-Token Prediction Done Right
Soft Multi-Token Prediction (Soft-MTP) is a one-line change to multi-token prediction (MTP) pre-training. The authors show the MTP cross-entropy gradient splits exactly into a KL self-distillation term and a noisy residual, and a straight-through "KL gradient-recovery trick" keeps only the KL term. From 167M to 1.2B parameters it gives lower NTP perplexity, faster speculative decoding and higher zero-shot accuracy than standard MTP, with no added parameters or overhead.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026 - Complementing Text Based Moderation with Multimodal Grounding: Detecting Fraudulent Inducement Behaviors on Short Video Platforms
The paper studies detection and temporal localization of fraudulent inducements (prompts to follow, join chat groups, click links) in internet finance short videos. It compares OCR+LLM, OCR+MLLM and a zero-shot MLLM, and builds a dataset of 2,419 videos (66.49 hours, 3,194 events, four categories). OCR+MLLM reaches mIoU 26.52 versus 14.49 for keyframe OCR+LLM, with 67.0 percent macro recall, using a recall-weighted F2 localization reward.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026 
What Effort Level Should I Choose? On the Economics of Reasoning Effort in LLM AgentsThis paper treats LLM reasoning effort as a credence good and measures the counterfactual effect of effort levels on proprietary and open-weight models across four benchmarks, including long-horizon agentic tasks. Higher effort often fails on tasks lower effort solved, and on easy tasks the top level costs up to 42x the lowest. Starting at the lowest effort and escalating only after a verified failure matches or beats fixed top effort, usually at lower cost for proprietary models.
huggingface.copaperAdded 28 Oct 2026- Post-Training Large Language Models with LLMON
LLMON (LLM Object Notation) is a framework that separates executable instructions from passive data and requires explicit identifier-based execution. The paper post-trains Granite-4.1 3B and 8B base models on a 4.6B-token corpus of general, RAG and tool-calling data with distractor variants, using SFT then RL. Attack success rates on indirect prompt-injection benchmarks fall from 53-100% to 0.02-5.6%, with general capabilities preserved. It also adds attention-based per-layer diagnostics.
arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026 - Improving the Dependency on Fine-Tuning Data in Transfer Learning for Speech Emotion Recognition
This paper proposes an fMLLR-based compensation mechanism that cuts the fine-tuning data needed in transfer learning for speech emotion recognition under train-test acoustic mismatch. An autoencoder reduces trainable parameters, and an affine transform in the encoder latent space models rotations and shifts. In a human-robot interaction task, mean CCC rose 16.8% with 12.9% of the training set and 14.4% with 50%.
arxiv.orgpaperAdded 30 Oct 2026, published 27 Oct 2026 - Statistical Detection of Positional Bias in LLM-Based Recommender Systems: Methodologies and Empirical Evidence
The paper proposes POB-ICM (contingency matrix with Chi-square independence testing) and POB-UNBP (a uniformity null model under permutation-based evaluation) to detect positional bias in top-1, single-turn LLM recommenders. On a RAG product-recommendation testbed with 2000 queries and 20 permutations each (40,000 instances), both methods reject positional independence in all evaluated models. Three metrics quantify the effect, and the bias persists across candidate-set size and temperature. Code is public.
arxiv.orgpaperAdded 30 Oct 2026, published 27 Oct 2026 - Locating Sycophancy Across Training Stages in Open Language Models
Locating Sycophancy Across Training Stages in Open Language Models measures sycophancy in 13 open checkpoints from 5 lineages, from base model through supervised fine-tuning and preference optimization to release. It finds two behaviors with different origins: deference to a claim in the prompt exists in every base model, while capitulation under user objection is largely absent from base models and present in every post-trained checkpoint. Post-trained models often drop firmly held answers as readily as loosely held ones when the objection names an alternative.
arxiv.orgpaperAdded 30 Oct 2026, published 27 Oct 2026 - Heads of Security: Learned Attention Gates Improve Prompt Injection Robustness
Heads of Security (HoS) is a prompt injection defense that trains a small set of per-head attention gates to shift attention between trusted and untrusted tokens, separating instructions from data. Tested on Llama-3.3-70B-Instruct and GPT-OSS-20B, the black-box RL-Hammer attack reaches 10% ASR on HoS versus 97% on base GPT-OSS-20B and 85% on SecAlign. HoS keeps base utility in few-shot settings, where SecAlign and ASIDE degrade.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026 - Can LLMs Uncover Hidden Physical Laws through Free Exploration?
LongChang is an automated framework that builds simulated worlds with altered physical laws, such as heavier objects falling more slowly, to test whether LLMs can find the law by free exploration. Explorer LLMs manipulate objects and build tools without tasks or hints, while separate LLM agents generate scenes, review tool designs and grade reports. Across 12 LLMs, GPT-6 Astra reached a 16.7% discovery rate and the other 11 scored 0%.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026 - Scaling Laws for Tool-Use Agents via Controllable Environment Synthesis
SynthAPI is a pipeline that generates synthetic tool-use environments with explicit control over diversity of tools, tasks and underlying databases. Across 458,752 tasks and 849 trained models of four sizes, the authors fit a scaling law predicting downstream agent generalization. At larger data budgets, scaling tool and database diversity beats adding more tasks, and higher complexity helps more. Agents trained this way beat prior synthetic-data baselines on four benchmarks.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026 - Metacognitive Decoding: Efficient Inference for Diffusion Language Agents
Metacognitive Decoding is a lightweight plug-in controller for diffusion language model backbones. It learns when to finalize tokens and how far generation should extend, and is trained on agent trajectories to balance correctness against generation cost. Across five benchmarks it cuts inference FLOPs by 20.6% on average versus the most efficient baseline, with competitive task accuracy. The abstract names no specific benchmarks or backbones.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026 - Know, then Draw: A New Learning Paradigm for Visual Generation
Know, then Draw is a learning paradigm for visual generation that uses autoregressive pretraining to acquire semantic knowledge and diffusion post-training for high-fidelity rendering. Controlled comparisons find autoregression the stronger pretraining objective, and semantic quality matters more than AR-only generation quality. This motivates a purely semantic tokenizer trained with language supervision only. A 3B text-to-image model trained in 6,600 H100 GPU-hours scores 86 on GenEval and 87 on DPG-Bench.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026 - Perceiving and Predicting Dynamic Sports: Spatiotemporal Intelligence in Vision Models for Egocentric Tennis Video
This paper presents an annotated egocentric tennis dataset (egocentric video synced with five allocentric views, global positions, contact times, stroke types) and evaluates image encoders, video encoders and vision-language models on seven prediction tasks. Best models reach 0.14 m player and 0.54 m ball localization error and 0.14 s contact-time error. Depth input helps 3D ball localization, and longer histories do not help forecasting. A conditional diffusion model generates whole-body tennis motion in real time.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026 - VideoLVR: Latent Visual Reasoning over Grounded Video Evidence
VideoLVR is a method that lets video multimodal LLMs build latent visual evidence from local regions at relevant moments and reason over it interleaved with text tokens. A visual token prediction objective, defined over a vocabulary derived from the input video, supervises the latents. It extends to reinforcement learning with sampled visual tokens as actions and final-answer rewards, and improves fine-grained video benchmarks without much context growth.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026 - EnvSched: Environment-Aware Scheduling for Rollout-Efficient Agent Reinforcement Learning
EnvSched is an online scheduler for agentic reinforcement learning that picks which environment-task pairs to roll out next. It builds a dual-relation graph over environments and tasks, propagates past rollout statistics to predict within-task reward variance, and adds environment quotas and a similarity penalty. On Qwen3-8B it scores 48.81 average on BFCL-v3, tau-Bench and ACEBench-Agent after 40 steps, above random selection at 120 steps.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026 - As the Story Unfolds: Watching a Film and Identifying Characters as a Human Does
This paper defines a character naming task for films: given a name spoken in dialogue and its video context, the model must pick which visible character bears that name. It provides a dataset with annotations for character naming and first appearances, a video-and-dialogue model, and a comparison with proprietary multimodal LLMs. It also proposes a progressive framework that builds a character bank as the film plays, without cast lists or actor photographs.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026 - Interpretable Meta-Policies for Neural Decision Making
NEXUS is a hierarchical reinforcement learning framework that pairs neural skills with symbolic meta-policies, so transparent reasoning sits at the level of high-level skills rather than atomic actions. It uses object-centric observations and LLM interaction to design reward functions and meta-policies. Agents learn disentangled skills, align better with goals in the game manual, resist reward hacking more, and cope better with game simplifications than deep RL. The paper also compares neural, symbolic and neuro-symbolic meta-policy architectures.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026 - CRISP: Co-designing Pruning and Scheduling for Efficient MoE Inference on Edge Servers
CRISP is a combination-aware framework that co-designs pruning and runtime scheduling for Mixture-of-Experts inference on memory-constrained edge platforms. It reorders neurons by importance so one stored expert supports several execution widths, gives hot, warm and cold expert combinations different widths, and overlaps expert loading with computation. On Mixtral-8x7B and DeepSeek-MoE-16B it raises throughput up to 2.1x at the same memory budget, with accuracy loss limited to 3.6%.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026 - FeatureArc: Benchmarking Coding Agents on Evolving Features
FeatureArc is a benchmark for coding agents on evolving features, built by a pipeline that mines repository histories into multi-stage tasks across four programming languages. It has 73 manually reviewed tasks of 2 to 10 stages, validated with fail-to-pass and pass-to-pass tests. Across 10 agents, pooled success drops from 62.7% at the first stage to 28.5% for the whole feature. Inherited defects appear in 72.9% of failed later stages.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026 - When Visual Evidence Is Insufficient: How Instructions, Post-Training, and Internal Activations Shape Refusal in Multimodal Language Models
This paper studies how multimodal LLMs refuse questions that an image cannot answer, using the MoHoBench benchmark on three MLLMs. It varies the meaning and placement of refusal instructions, compares supervised and preference-based post-training, and intervenes on a refusal-related activation direction. Instructions change refusal at the sample level in ways aggregate rates hide. Post-training raises refusal most but can mix refusal with attempted answers. Activation intervention gives smaller, transferable changes.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026 - Bayes-Adaptive MDPs for Rollout Allocation to Enhance GRPO Training
AdaRoll-GRPO is a method that allocates GRPO rollout budgets per question by difficulty instead of uniformly. It frames allocation as a sequential decision problem and learns an allocation policy with a Bayes-adaptive MDP, computed offline so training adds no online optimization cost. Experiments on several reasoning datasets and LLM architectures show gains over standard GRPO at the same total rollout budget.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026 - When Is Additional Retrieval Worthwhile? A Cost-Aware Study of Evidence Gain and Answer Reliability in RAG
This paper studies a cost-aware, two-action RAG routing policy that chooses between dense retrieval plus reranking and a hybrid lexical-dense retriever, using a regularized linear model to predict per-question evidence gain. On 60 held-out QASPER articles (188 questions), it triggers hybrid retrieval on 24.5% of questions and matches always-hybrid Hit@10 (78.70%). Answers from 4-bit Qwen3-4B show no clear correctness or faithfulness gain, and the assessments are model-assisted.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026 - LiveSearch: Questions as Executable Verifier Code for a Live Benchmark of Professional-Source Financial Search Agents
LiveSearch is a live benchmark for financial search agents that stores each question as executable verifier code: a typed program of calls to a professional financial data service plus a declarative extractor. Gold answers are recomputed daily with no human or LLM in the loop, so memorized answers go stale. Six tool-calling models score 70.9% to 76.7% under web search, and 70% of questions change gold value over three days.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026 - OpenGray: a benchmark for evaluating the decisions of radiotherapy planning agents
OpenGray is a benchmark that adds tasks with known correct decisions to the OpenKBP-Opt head-and-neck dataset, including two overlap contradictions with provably incompatible dose goals and a feasible control. Four planning systems, from a rule-based script to a full LLM agent, were tested on 30 patients with Terra and Ministral 3 8B. Decision accuracy reached 95.4% and 92.1%, yet only 50% and 25% of overlap contradictions were escalated. SAGE logs of 39 radiosurgery runs showed an agent that lacked an action for stopping.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026 - Tessera: Structure-Completed Evidence Units for Web Retrieval-Augmented Generation
Tessera is a training-free evidence delivery layer for web retrieval-augmented generation. It rebuilds retrieved pages' HTML into fine-grained evidence units, each completed with page title, section path and table headers, then packs the relevant units into the reader context at the same token budget. Tracing evidence over full English Wikipedia shows chunking loses table and infobox content. Tessera adds 5 to 6 accuracy points on three QA benchmarks and carries over to agentic search.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026 - Exploring the Limits of the Delta Learning Hypothesis: Single-Pair Generator Biases in Direct Preference Optimization
This paper tests the delta-learning hypothesis for Direct Preference Optimization (DPO), where the larger model's response in a single model pair is treated as preferred. It shows, in theory and experiments, that fixed pairs add generator-specific biases that predict the preference label regardless of quality. DPO on single-pair data underperforms multi-model data, consistent with reward hacking, and adding more generators partly fixes it without an external judge.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026 - p-DCIM: A 28nm Probabilistic SRAM DCIM based Ising Machine for Near-Memory Context Selection in LLM-RAG Pipeline
p-DCIM is a 28 nm SRAM digital compute-in-memory macro (0.16 mm2, 0.41 mW) that works as an Ising machine for RAG evidence selection. Selection is cast as a QUBO problem, and the same MAC datapath computes embedding similarities and annealing steps. Replacing LLM reranking with it gives a selection-energy estimate over six orders of magnitude lower and cuts total energy per query by 67%, with comparable token-level F1 on the evaluated examples.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026 - DCKV: Learned Transform Coding of the Prompt KV Cache in Hybrid Language Models
DCKV is a differentiable codec for the prompt KV cache of hybrid language models, which keep a KV cache only in their few full-attention layers. Transform, quantizer and entropy models (conditioned on prompt tokens and already decoded neighbouring positions) are trained end to end against a frozen model. On Qwen3.5-2B it stores a token in over 55 times fewer bytes than bf16 with at most 1.8 points lost on three long-context benchmarks, and over 100 times fewer with at most 3.6 points lost.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026 - AxisQ: Depth-Adaptive Channel--Frequency Quantization for Camouflaged Object Detection
AxisQ is a post-training quantization framework for camouflaged object detection (COD) that allocates activation bits by feature depth. It uses the channel domain for shallow features and the local-frequency domain for deep features, under a fixed per-layer average bit budget. It adds a boundary-aware Hessian approximation for reconstruction. On CAMO at W2A2, weighted F-measure improves 12.7% for CFRN and 33.3% for CamoFormer-P over the strongest baselines.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026 
OblivDGL: Oblivious Deep Graph Learning Made PracticalOblivDGL is a framework for secure GNN training and inference in machine-learning-as-a-service settings, modelled on Deep Graph Library. It uses an oblivious message passing paradigm and a new oblivious graph representation built on function secret sharing, revealing only the total node and edge counts. On four benchmark graphs it cuts training communication up to 1024x with up to 14.3x speedup, and inference communication up to 754x with 4.19x speedup.
eprint.iacr.orgpaperAdded 28 Oct 2026, published 27 Oct 2026- Folding Attention Biases into Keys Makes Compacted KV Caches Run on Standard Kernels
The paper folds the per-key logit bias of Attention Matching (AM) KV cache compaction into the keys along one closed-form direction per head, fitted on context queries. The result is a plain cache that FlashAttention and vLLM paged caches can use, with output error bounded by how far each query's projection on that direction is from 1. Unmodified vLLM serves folded caches through a KV connector. On QuALITY and LongHealth the fold is within noise of AM in 13 of 14 settings. Under AM's published per-head budgets it is within noise in 9 of 10.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026 
Trial by Trace: Benchmarking AI Agent Harnesses for Reliability and Failure AttributionTraceTrial-Bench is a benchmark that scores agent task performance and agent harness reliability separately. It has 95 mechanism-oriented tasks across seven components: context, execution, governance, lifecycle, observability, tools and verification. Across 4 harnesses, 9 models and 3,420 runs, macro-averaged harness scores range from 59.8% to 72.0%, and 31.1% of runs succeed despite failing at least one harness criterion.
huggingface.copaperAdded 27 Oct 2026- AK_QMUL at ArGuard Shared Tasks: A Single Fine-Tuned JAIS for Arabic Harmful-Prompt Detection
AK_QMUL's system for the ArGuard-2026 shared tasks fine-tunes JAIS-6.7B with 4-bit QLoRA and a linear head on the last-token representation. For binary safe/unsafe detection (B1) it uses a four-way head over dialect register and AraSafe MSA augmentation, reaching macro-F1 0.984. For seven-way harm domain (B2) it averages five seeds, reaching 0.790. Both ranked first. Bully is the weakest class.
arxiv.orgpaperAdded 28 Oct 2026, published 26 Oct 2026 - Your Wish Is My Commit: Over-Compliant Refactoring in AI Coding Agents
Your Wish Is My Commit is a controlled study of over-compliant refactoring in Codex and Claude Code, run across five models, 50 algorithmic tasks and 10 object-oriented tasks. Over 3,000 turns of repeated "refactor further" prompts, no model stopped on its own: each rewrote up to 31x the original codebase before first stopping and resumed edits after declaring the task complete. The paper defines six behavioral signals for detecting over-compliance.
arxiv.orgpaperAdded 28 Oct 2026, published 26 Oct 2026 - Reva: Real-Time Vulnerability Detection through Contextual Probing of Large Language Models
REVA (REal-time Vulnerability Analysis) is a vulnerability detector that puts a module threat model, lightweight static analysis findings and call-graph information into one LLM forward pass. A trained probe reads the model's internal representations of the new function. On PrimeVul's held-out test set, REVA on GLM-5.3-Flash reaches 60.0% accuracy in about one second per function, matching the agentic VulTriage (59.2%) at over 250 times the speed and under a tenth of the cost. The probe is 14% to 17% more accurate than the LLM's own verdict.
arxiv.orgpaperAdded 28 Oct 2026, published 26 Oct 2026 - SentryBench: A Cost-Sensitive Benchmark for Adversarial Robustness of Tool-Using LLM Agents in Public-Safety Deployments
SentryBench is a benchmark for tool-using LLM agents in public-safety deployments. It scores attack success, over-refusal (missing a real emergency) and over-reaction (unwarranted action) on a cost-sensitive frontier, using real emergency-call transcripts, disaster messages and injection payloads. Across 840 episodes on three frontier models and three defenses, refuse-more caution pushed over-refusal to 100 percent on two models, while a trust-gating wrapper gave the lowest harm.
arxiv.orgpaperAdded 27 Oct 2026, published 25 Oct 2026 - SymLift: Neural Semantic Lifting for Compile-Free Vulnerability Detection in Context-Incomplete Code Fragments
SymLift is a compile-free vulnerability detection framework for code fragments that lack project context. A fine-tuned LLM reconstructs control-flow, data-flow, memory and resource relations as a constrained LLVM-like IR, and a deterministic parser turns it into facts for Datalog rules that give findings with derivation traces. SymLift-Qwen-7B reaches 94.41% Target-F1 on FormAI and 91.66% micro-averaged Target-F1 on MegaVul.
arxiv.orgpaperAdded 28 Oct 2026, published 25 Oct 2026 - Explaining Navigation Decisions: Stage-Aware Visual Attribution for Vision-Language Navigation
A stage-aware visual attribution framework for Vision-Language Navigation (VLN) that explains a robot's action choices. It identifies "instruction-stage insensitivity", where existing explainers give similar outputs across navigation stages. The method builds action-conditioned temporal instruction-visual attributions, aggregates relevant historical evidence by stage, and applies an instruction-guided spatial filter. It improves attribution quality across several VLN policies and benchmarks, helps diagnose failure cases, and was tested on a Unitree G1 robot.
arxiv.orgpaperAdded 27 Oct 2026, published 25 Oct 2026 - The Patient Is Always Right? Evaluating Sycophancy in Medical Diagnosis with Graded Patient Beliefs
This paper evaluates sycophancy in medical diagnosis across nine AI models. Each model is shown clinical evidence plus a patient's belief in a specific but incorrect condition, with the belief's closeness to the evidence varied. Models adopted the belief 23.2% of the time on average, even for fictional conditions, and 43.0% under a Rare Disease Claimer persona. Medical fine-tuning and larger scale reduced susceptibility.
arxiv.orgpaperAdded 27 Oct 2026, published 25 Oct 2026 - Reversible Pseudonymisation of Documents Sent to External LLMs: an Open Bilingual Benchmark and an Engine
This paper presents an open benchmark of five existing pseudonymisation tools and a regex baseline on Russian and UK English documents, plus an open engine built on the two strongest tools. On a held-out set of 1,000 synthetic documents per language, the best existing tools leave a whole value visible in 58 to 61% of documents. The engine does so in 0.2 to 0.3%. Russian name restoration reaches only 94.6%, below the 99% threshold. Real documents were not tested.
arxiv.orgpaperAdded 27 Oct 2026, published 25 Oct 2026 - Detecting and Understanding Ambiguity in Visualizations with Role-Playing Vision Language Model Interpretations
This paper presents a pipeline that uses persona-conditioned vision language models to surface interpretive ambiguity in visualizations. Topic-relevant personas elicit candidate takeaways, and a Target-Pattern-Scope framework lets LLM judges label statement pairs as Compatible, Disjoint or Opposing, which are summarized in an ambiguity profile. The authors benchmark VLMs on chart comprehension per chart type, check labeling against human annotations, and run case studies on public visualizations and a redesign.
arxiv.orgpaperAdded 27 Oct 2026, published 25 Oct 2026 - InteractiveWorld: A Verifiable Human-Centric Environment for Building Better Interactive MLLM Assistants
InteractiveWorld is an environment for closed-loop interaction between an AI assistant and a simulated human agent who sees the scene, follows instructions and acts independently. InteractiveBench, built on it, has 120 multi-turn tasks in six categories scored by verifiable, state-based rewards. Across 12 frontier MLLMs, the best model, Claude Fable 5.1, reaches at most 20% on long-horizon Guidance and 25% on Planning tasks.
arxiv.orgpaperAdded 27 Oct 2026, published 25 Oct 2026 - Continual Learning Exam: Benchmarking Long-Horizon RSI and Experiential Learning in LLM Agents
Continual Learning Exam (CLE) is a benchmark of 120 human-authored tasks, each a five-level ladder (600 levels) across 89 professional roles and 12 occupational domains, built by 50+ domain experts. Agents must pass a level to unlock the next, and an evaluation agent scores submissions against human rubrics. Across 17 harness-model configurations, feedback plus one revision adds a median 5.3 points; the best system clears 47.7% of levels and finishes all five levels in 23.3% of tasks.
arxiv.orgpaperAdded 27 Oct 2026, published 25 Oct 2026 - HerHealthGPT: An Evidence-Grounded Conversational AI System for Women's Reproductive Health Copy title
HerHealthGPT is a conversational AI system for women's reproductive health that combines retrieval-augmented generation, context-aware clarification and source validation in a web interface. Evidence retrieval raises concern-category accuracy from 54.1% to 59.3% over fine-tuning alone on 540 messages from 90 cases. The clarification router reaches 85.6% recall and 86.2% specificity. In a 30-adult study, 83.3% preferred the retrieval-enabled version. The authors say clinical validation is still needed.
arxiv.orgpaperAdded 27 Oct 2026, published 24 Oct 2026 - DRILS: Dependency-based Requirement Change Impact Analysis Using LLMs
DRILS is an LLM-based agentic framework for requirements change impact analysis. It uses multiple agents to generate candidate impact sets, with an LLM-as-a-judge promoting diversity in selection. It adds RE-RAG, a tuned retrieval technique, and a requirement dependency graph as a knowledge source. On three curated datasets it reaches 87.1% recall, 76.3% precision and 81% F1 at lower cost than baselines. The authors release the datasets.
arxiv.orgpaperAdded 27 Oct 2026, published 24 Oct 2026 - Intervention-Certified Amplification: A Validity Gate for $σ$-Weighted Post-Training
Intervention-Certified Amplification (ICA) is a validity gate for sigma-weighted hybrid SFT/RL post-training. The paper shows that DIAA, a per-sample sigma-weighted hybrid, emits unexecuted tool-integrated reasoning on 29% of MATH-500 prompts (three times vanilla GRPO) even with Python fences removed from its anchor. ICA gates sigma with paired-rollout evidence, cutting TIR to 13.8% (frozen) and 11.2% (online) and raising accuracy from 47.5% to 48.7% and 49.3%. It transfers to GSM8K.
arxiv.orgpaperAdded 27 Oct 2026, published 24 Oct 2026 - Build, Don't Play: Self-Improving LLM Research Agents Develop a Hearthstone Battlegrounds AI That Rivals Top Players
AutoTavern is a self-improving system of specialised LLM research agents with a typed shared memory and verification gates. In 20 days it built TavernGym, a full-content Hearthstone Battlegrounds simulator, and 23 versions of TavernAgent, a PPO-trained player. TavernAgent averaged placement 1.60 with 80% first places over its last 20 live games, beating the top ten players (2.34, 59%). On TavernBench (960 tasks), it answered 91% of play tasks against at most 63% for frontier LLMs.
arxiv.orgpaperAdded 27 Oct 2026, published 24 Oct 2026 - Sliding Networks: A Family of Residual Structures Preserving Feature Learning and Feature Diversity
Sliding Networks is a family of residual network structures with a joint width and depth scaling recipe that keeps both locally maximal feature learning and feature diversity in the residual stream. The key quantity is the ratio N_flat/(N_sharp L) tending to a constant alpha, and Half Copy correlated initialization can relax the shape constraints. Residual-MLP experiments support an SDE limit, but language-model experiments show performance differences under regrouping at fixed parameter count.
arxiv.orgpaperAdded 27 Oct 2026, published 24 Oct 2026 - Learning What to Share: Expert Specialization for Time-Series Forecasting
Persistent Closed-Form Routing (PCR) is a plug-and-play method for multivariate time-series forecasting. It alternates exact conditional estimation of channel-specific mixture weights with gradient training of low-rank residual experts around a frozen pretrained forecaster. Across eleven datasets and three backbones, PCR-K4 cuts dataset-balanced MSE by 3.86-14.25% and beats competing specialization methods with fewer trainable parameters. The paper also introduces GalaxyTS, a synthetic dataset with exact shared and channel-specific references.
arxiv.orgpaperAdded 27 Oct 2026, published 24 Oct 2026 - Task Format as a Factor in Adaptation: A Controlled Comparison of LoRA and Full Fine-Tuning for Prompt-Safety Classification
This paper compares LoRA and full fine-tuning for prompt-safety classification using a matched 400M encoder-decoder pair (Ettin) across three task formats, with up to 15 seeds per cell and pre-specified analyses. Full fine-tuning leads LoRA by 2-3 pp at the pre-specified learning rates, and the encoder gap closes when both use the same learning-rate search. Training LoRA to write a reason after its verdict adds 4.0 pp, while a content-free sentence of equal length does not. Trained models beat a prompted 8B in domain but trail it by 8-23 pp on adversarial jailbreaks and over-flag benign prompts (27-66% against 2-3%).
arxiv.orgpaperAdded 27 Oct 2026, published 24 Oct 2026 - IntentDelta: A Human-Constructed Benchmark for Evolving User Intent
IntentDelta is a human-constructed multi-turn benchmark of 638 trajectories and 3,766 turns across WebShop and TravelPlanner. Each turn pairs a user utterance with a cumulative intention state and human reference actions. Across eleven agents, average Intention Recovery is 33.1% in TravelPlanner and 44.7% in WebShop, and average Action Score is 31.6% and 41.0%. Agents lose earlier requirements and confuse soft preferences with must-have constraints.
arxiv.orgpaperAdded 27 Oct 2026, published 24 Oct 2026 - Unlocking the Specialization Capability of PPG Foundation Models for Wearable Signals through Structured Pruning and Adaptive Fine-Tuning
SPAFT is a structured prune-then-finetune framework for PPG (photoplethysmography) foundation models used on wearable signals. It finds that pretrained PPG models have inherent sparsity and redundancy, then restricts fine-tuning to a compact parameter subspace chosen by parameter importance and structural redundancy. Across four PPG foundation models, five datasets and ten tasks, it wins 82.8% of regression and 87.5% of classification comparisons.
arxiv.orgpaperAdded 27 Oct 2026, published 24 Oct 2026 - TriageRAG: Failure-Aware Self-Training for Adapting Retrieval-Augmented Language Models to Specialized Domains
TriageRAG is a failure-aware self-training method for adapting retrieval-augmented LLMs to specialized domains using only an unlabeled corpus. It probes the student on self-generated questions with and without retrieved context, sorts them into known, solved, context-failure and retrieval-failure, and routes each to a matching training signal. With Qwen3-4B on 11 datasets it beats budget-matched SimRAG by 1.2-6.4 points and recovers closed-book accuracy where retrieval hurts.
arxiv.orgpaperAdded 27 Oct 2026, published 24 Oct 2026 - An actively trained neural operator for near-explicit atmospheric chemistry
FNO-MoE is a Fourier neural operator with a mixture of experts that predicts the full near-explicit chemical state (Master Chemical Mechanism, thousands of species) over 30 minutes in one call. Expert disagreement selects the most informative box-model simulations, so active sampling beats random or evenly spread sampling at equal cost. Fine-tuning on longer trajectories keeps multi-hour runs stable, and the emulator runs orders of magnitude faster than the numerical solver.
arxiv.orgpaperAdded 27 Oct 2026, published 24 Oct 2026 - Enhancing LLM-Based Vulnerability Detection via Representation-Aware Logical Ensemble
RALE (Representation-Aware Logical Ensemble) is a method for LLM-based vulnerability detection in C code. The authors train LLMs on raw source code, Abstract Syntax Trees and Control Flow Graphs, and find each representation works best for certain vulnerability classes. Combining the models with explicit logical rules and majority voting raises F1 from at most 73% for a single model to 78%, with gains in accuracy, precision and recall.
arxiv.orgpaperAdded 28 Oct 2026, published 24 Oct 2026 - ZipFusion: Fusing Lossless KV Decompression with Attention for Efficient LLM Decoding
ZipFusion is a lossless KV cache compression scheme whose attention kernel reads the compressed cache directly and rebuilds the original values in registers with simple bit operations, so no separate decompression pass is needed. It also reassigns the memory freed by compression across layers to hold more KV cache. Built on FlashInfer and integrated with SGLang, it gives about 1.25x decode attention speedup on an H100 and up to 26.3% higher decode throughput at 8K context than uncompressed SGLang. It reaches up to 2.76x the throughput of the best lossless KV compression baseline.
arxiv.orgpaperAdded 27 Oct 2026, published 24 Oct 2026 - VulDec: Vulnerability Detection in Binaries via Neural Decompilation
VulDec is a dataset and framework for detecting vulnerabilities in binaries by first decompiling them with fine-tuned LLMs. The dataset aligns real-world Assembly-C function pairs across several architectures with CWE labels. Tuned neural decompilers reach about 56% Edit Similarity and 43% BLEU-4, and tuned detectors reach a macro F1 of 0.61 on a realistic test set with a 3% vulnerability rate.
arxiv.orgpaperAdded 28 Oct 2026, published 24 Oct 2026 - RAQ-MLA: Role-Aware Quantization for Multi-Head Latent Attention Caches
RAQ-MLA (Role-Aware Quantization for Multi-Head Latent Attention Caches) is a training-free method for quantizing the MLA KV cache. It fits a separate invertible transform to the compressed latent (tuned for attention-weighted value error) and to the positional key (tuned for score perturbation). It reaches about 2.5 bits per element, a 6.5x gain in theoretical KV-cache capacity, with near-lossless reasoning and coding results on four MLA models.
arxiv.orgpaperAdded 27 Oct 2026, published 24 Oct 2026 - Eat Your Precision: Precision Objective Mitigates Reward Hacking in Rubric-based RL
FORK is a reward for rubric-based reinforcement learning that jointly optimizes recall and a new precision objective. Precision requires each unit of a response to be necessary (rubric-driven necessity credits) and factually correct (a grader). Rubric-coverage rewards otherwise produce verbose, less accurate responses. FORK keeps similar coverage with shorter outputs, raising win rate against the base policy from 10.6% to 68.0% on RubricHub-Medical and from 22.1% to 74.1% on HealthBench.
arxiv.orgpaperAdded 27 Oct 2026, published 24 Oct 2026 - DualPace: Decoupled Scheduling and Cooperative GPU--CPU Decoding for LLM Serving
DualPace is an LLM serving runtime that treats the host as an independently scheduled decode engine. A GPU engine runs prefills and GPU-resident decodes, while an AMX-enabled CPU engine batches and advances CPU-resident decodes, optionally calling GPU Dense Assist for dense stages. In decode-oriented scenarios it raises throughput 6.9 to 43.2% over NEO and 11.5 to 90.6% over vLLM at similar latency.
arxiv.orgpaperAdded 27 Oct 2026, published 24 Oct 2026 - Small Edits, Shifting Decisions: Benchmarking LLM Accuracy and Reliability on French Input Variants
This paper builds a controlled French surface-variant benchmark with seven task types and 4,200 original-low-high triplets (12,600 inputs), covering missing apostrophes and diacritics and keyboard typos. Six models from two LLM families lose accuracy and show worse Brier score and NLL as perturbation grows. Keyboard typos hurt most. Calibration temperatures fitted on original inputs transfer to variants, and combining them with input restoration improves reliability further.
arxiv.orgpaperAdded 27 Oct 2026, published 24 Oct 2026 
IQuest-Q1: Advancing Foundation Capabilities for Agentic CLI SystemsIQuest-Q1 is an open-source sparse Mixture-of-Experts model with 320B total and 15B activated parameters, built for agentic coding in CLI systems. Pre-training combines Stable SplitNorm, Muon and muP with a two-stage curriculum that raises the coding-data share in stage two. Mid-training extends context, and post-training mixes SFT, domain-specialized RL and MOPD across scaffolds, followed by model merging.
huggingface.copaperAdded 24 Oct 2026- Hey, guess what: CUES lead to inferences about typicality
The paper builds two corpora, EventTyp and the human-validated EventTypGold, to study how people infer typicality and atypicality of events from what is said. Large-scale human and LLM experiments show that three CUES predict these inferences in humans: Commonsense Knowledge, Utterance Emphasis and Snark. In most settings LLMs lack the commonsense knowledge to judge an event's general typicality, so they struggle to follow the CUES.
arxiv.orgpaperAdded 27 Oct 2026, published 23 Oct 2026 - Deletion, Substitution, Repair and Transplant: Component Attribution in BARBICAN, a Layered Prompt-Injection Gateway for MCP
The paper analyses BARBICAN, a fail-closed prompt-injection gateway for MCP tool mediation, using deletion, substitution, repair and transplant experiments. Its arbitration classifier ran on tokenizer-mangled text for a whole evaluation. Fixing that raised AUC from 0.392 to 0.855 while system recall fell from 80.67% to 80.34%. The band it receives is 96.82% malicious. The authors argue ablation figures need the band's class balance and substitution baselines.
arxiv.orgpaperAdded 27 Oct 2026, published 23 Oct 2026 - AI Alignment for Digital Democracy: Fairer Voters Representation against LLM Biases
This paper studies demographic bias in LLM-emulated electorates, using three U.S. presidential elections and comparing one closed-source and one open-source LLM. Removing gender from the voter profile cuts the largest group error by 22-42%, and removing education cuts it by 64%. Removing self-reported race raises mean group error by over 40%. Repeated queries and fairness instructions do not reduce errors and can double them.
arxiv.orgpaperAdded 27 Oct 2026, published 23 Oct 2026 - What Transfers Across Protein Pockets? Experience Reuse in Molecular Optimization for Agentic Structure-Based Drug Design
This paper studies experience reuse for LLM agents that optimize ligands in protein pockets by editing and docking. Using the full log of one agent run over CrossDocked2020 test-set pockets, it tests whether keys in an experience base recur on unseen pockets and separate improving from worsening edits. The separation is largely explained by molecule size change, action and round, not the target. The authors conclude a base may better prioritize an agent's own proposals for docking than prescribe what to build.
arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026 - OWLS: Open-world Language-conditioned Speed Fields for Zero-Shot Rover Navigation
OWLS (Open-world Language-conditioned Speed Fields) plans directly over a vision-language model's dense feature map. A text prompt describing traversable terrain scores every pixel of one camera image. The scores are projected onto the ground, adapted with two morphological operations, and used as the speed field of a minimum-time planner. It needs no training, terrain labels, map or extra sensors. It was tested on a physical rover, on simulated Mars and Moon rovers over 200 procedural terrains, and on real planetary imagery.
arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026 - PHYRD: A Living Benchmark for Reproducing and Extending Theoretical Physics Research
PHYRD is a living benchmark for theoretical-physics reasoning with 63 Reproduce problems (derive published results) and 43 Discover problems (consequences of modified theoretical conditions). Tasks are built by FormulaForest, with reference solutions and subquestion-level rubrics. Across five models, whole-problem accuracy is 49.21% to 68.25% on Reproduce and 18.60% to 74.42% on closed-book Discover. FormulaForest data also lifts a Qwen-35B-A3B model on FrontierScience from 61% to 72%.
arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026 - Standing on Open Shoulders: Regional Fine-Tuning of Open-Weight Camera-Trap Models for UK Wildlife with Modest Data and Compute
DeepFaune-UK is a fine-tune of the open DeepFaune camera-trap classifier on 28 UK classes, paired with MegaDetector v6. On 20,212 MammalWeb images it reached 88.8% strict accuracy against 56.5% (DeepFaune v1.5.0) and 59.0% (SpeciesNet). Re-applying the recipe to the DINOv3-based classifier gave 90.6%. Fine-tuning on about 150 crops per class matched full-data out-of-distribution accuracy, and a DINOv2 run took about 22 minutes on under 4 GB of GPU memory.
arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026 - UAV-SwarmAgent: Scalable Multi-UAV Reconnaissance and Task Allocation via Code Generation and Vision-Language Reasoning
UAV-SwarmAgent is a hierarchical multi-agent system where an operator gives one natural-language sentence and a ground-station agent writes and runs code that produces per-UAV routes. A vision-language model grounds targets in an aerial map, and worker agents verify incidents with a compact onboard model. In simulation it located the incident in 244 of 255 missions (95.7%), and flight time followed an Amdahl-type law with speedup bounded at 1.52x for one to five UAVs.
arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026 - Tool-Calling LLM Agents Under Realistic MCP Faults: Scale Does Not Purchase Fault Tolerance
MCP-Injector is a protocol-aware fault-injection middleware for Model Context Protocol tool calls, with permanent, transient and intermittent faults on seedable schedules. Its fault model comes from 57,240 issue and PR threads across 1,774 open-source MCP repositories. In a 1,350-cell experiment, faults cut task-completion score by 60% (8.08 to 3.23 of 10), and the 120B gpt-oss model was no more resilient than the 20B. Agent stacks differed in how well they absorbed faults.
arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026 - DRIVE: Fine-tuning via Data Contribution- and Diversity-aware Weighting with Prior Regularization
DRIVE is a per-sample weighting framework for single-stage fine-tuning when the source pre-training data is unavailable. It uses one differentiable objective: Shapley additivity splits each sample's contribution into anti-forgetting and adaptation parts, a covariance-based diversity term reshapes them, and a sample-characteristic prior stabilizes them. The authors prove better stability-plasticity guarantees than existing weighting schemes and report better performance, faster convergence and more robustness.
arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026 - Accordion: Elastic-Depth Inference via Fixed-Prefix Layer Looping
Accordion is a mixture-of-experts language model (Accordion-6B-A0.5B) that supports five inference budgets through fixed-prefix layer looping, with the minimum budget being the unlooped model. After 3.6T pretraining tokens, deeper inference raises the macro-average over 37 tasks by 3.01 points, and the middle budget captures 89% of that gain with half the extra layer executions. SFT and RL keep the budgets, merging three domain experts via parameter-group merging and budget-matched multi-teacher on-policy distillation.
arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026 - Efficient Zero-Shot Video Anomaly Detection via Signal-Aware Adaptive Fusion (SAAF)
Signal-Aware Adaptive Fusion (SAAF) is a training-free zero-shot video anomaly detection framework that cuts the compute cost of vision-language models. It combines a dual-signal sampler (frame-to-frame delta and rolling-context drift in embedding space, OR-gated with EMA thresholds), a threshold-gated cascade from frame-level to video-level analysis, and signal-aware score fusion. It reports AUC-ROC of 92.07% on XD-Violence, 86.70% on MSAD and 80.54% on ShanghaiTech, at 2.2x to 2.6x the throughput of the prior best zero-shot method.
arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026 - When Agents Fail: Model or Harness--Who's to Blame?
When Agents Fail: Model or Harness--Who's to Blame? proposes five measures for evaluating agent harnesses together with their underlying models: Valid Completion Rate, Model-Harness Fit, Cross-Model Fit, Interaction Residuals and Token Load. It tests four harnesses (OpenCode, Codex CLI, Pi CLI, DeepAgents) with four models on six benchmarks, across 111 settings and 52,168 trajectories. Harness rankings change by model and benchmark. OpenCode ranks first in cross-model performance.
arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026 - Sharpness-aware Orthogonalized Momentum Algorithms
SOMA (Sharpness-aware Orthogonalized Momentum Algorithm) combines sharpness-aware minimization (SAM) with the Muon optimizer for LLM training. It avoids SAM's extra gradient computation by using stale, purely stochastic gradient noise as the adversarial perturbation. The authors prove sample complexity does not depend on perturbation direction, study robustness to heavy-tailed gradient noise, and test SOMA against post-training quantization degradation and catastrophic forgetting during fine-tuning.
arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026 - SCI-AGENT-EXAM: Benchmarking Agents on Scientific Research Tasks
SCI-AGENT-EXAM is a workflow-oriented benchmark of 120 expert-curated tasks across 11 scientific fields and 7 task types from the Scientific Workflow Task Taxonomy (SWTT). Tasks need both executable and textual artifacts, scored by programmatic checks plus an expert-calibrated LLM judge. Ten frontier agents were tested: GPT-6 Astra scored highest at 80.9, but only 26.0% of its runs passed the 0.95 success threshold.
arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026 - Profile-Driven User Simulation via Reinforcement Learning with Hierarchical Rewards for Task-Oriented Dialogues
ProfileSim is a profile-driven user simulator for financial marketing outbound calls. It models user profiles (demographics, Big Five traits) and business profiles (intents reverse-engineered from real call logs). The base model is fine-tuned on real voice dialogues, then refined with GRPO using dialogue-level and utterance-level rewards. Against other user generators it scores highest on colloquial naturalness and profile adherence, and lowest agent score on long-tail intents, with shorter utterances at comparable business compliance.
arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026 - When to Stop Penalizing Actions? Martingale GRPO for VLA Reinforcement Learning
MART-GRPO is a variant of group-relative policy optimization for vision-language-action (VLA) reinforcement learning. It uses a LoRA-fine-tuned VLM to find the last visible error without recovery in a failed rollout video, keeps failure feedback up to that point, and drops it afterward. Martingale stopping conditions show this preserves the expected GRPO gradient and can reduce covariance. With OpenVLA-OFT on RoboTwin 2.0, it raises success rates over full-trajectory GRPO across multiple tasks.
arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026 - 4DMemory: Benchmarking Long-Horizon Spatiotemporal Memory with Harness-Augmented Agents
4DMemory is a benchmark suite for long-horizon spatiotemporal memory: the LongVideo dataset (about 900 hours of video, over 5,000 manually reviewed questions) and 4DMemoryBench. It also presents the 4DMemory Harness, combining four skills, 22+ tool models and a model-specific RAG system. Across 13 models, the harness improved every one by over 50%, and the same models scored over 10% lower than on a previous benchmark.
arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026 - MAST-VLA: Skill-Conditioned Adaptation with Trajectory-Affordance Priors for Multi-Skill Robot Manipulation
MAST-VLA is a vision-language-action framework for multi-skill robot manipulation that conditions on both the skill to execute and where and how to contact objects. It adds skill-conditioned LoRA Mixture-of-Experts adapters to the LLM backbone and turns a predicted affordance heatmap into a patch-level spatial prior for the action head. It reaches an Avg. Len of 4.65 on CALVIN ABC→D and was tested on a real robot.
arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026 - BiLoCo: Binary Low-Rank Corrections for Post-Training Quantization
BiLoCo is a post-training quantization method for FP4 LLMs that adds low-rank corrections whose left and right factors are stored as binary ±1 sign vectors instead of BF16. This uses 16x less storage per rank-one component and lets the correction run on CUDA cores alongside the FP4 tensor-core GEMM. On 4B to 72B LLMs it matches or improves memory-matched SVDQuant. A fused B300 kernel is at most 11% slower than FP4-only GEMM at batch size 1 for ranks up to 512.
arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026 - MPQ: A Message-Passing View of Post-Training Quantization
MPQ (Message-Passing Quantization) is a post-training quantization method that treats row-wise PTQ as posterior inference over discrete codebooks. It keeps soft posteriors across weight blocks using vector approximate message passing, then refines a hard-decision initialization with exact block coordinate descent. Tested at 2-bit lattice and 3- and 4-bit scalar quantization on Llama, Qwen and Mistral models, it improves perplexity and zero-shot accuracy over GPTQ-style baselines.
arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026 - Semantically Rich, Metrically Affect-Blind: A Geometric Blind Spot in Modern Text Embedders
Sentiment-Injected Sentence Embeddings (SISE) addresses a finding across eleven frozen text encoders (2021 to 2026): linear probes recover sentence polarity at up to 91.3% accuracy, but cosine similarity separates polarity by only 0.003-0.064. A small supervised-contrastive head (0.13M-0.69M parameters) trained on CPU raises retrieval MAP by up to 26 points, but the 128-d head loses 38-41 STS-B Spearman points. The paper also releases the Attribute Alignment Gap diagnostic.
arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026 - Tampered ML: Evaluating LLM Judgment of Machine Learning Research
Tampered ML is a benchmark of 1,858 item-pairs, each pairing an experiment proposal reconstructed from a published ML paper with a minimally edited version that adds a targeted methodological flaw. Models must pick the sounder proposal in both presentation orders. A human study estimates 86% of items are valid (95% CI 81-91%). Opus 5 reaches 77.9% accuracy, and models are sensitive to order and favor flawed designs that look more specific, transparent, or conventional.
arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026 - How Much Do You Trust A Dog? Quantifying Hint-Following in Reasoning Language Models
This paper measures how hints such as "[Source] thinks the answer is (X)" shift LLM answers on MMLU questions, varying the source between a professor, a friend and a dog across Qwen, Gemma and SmolLM models. The shift fits an exponential tilt: a roughly constant mean change in the hinted answer's log-odds, with susceptibility largely shared across sources. The shift persists when the source is declared inaccurate or the prompt warns against trusting it. Synthetic experiments show how KL-regularized reward training could produce this pattern.
arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026 
Cache Engineering for Agents (AKV)AKV introduces cache engineering, which lets LLM agents control their active KV cache with drop (exclude cache from future attention) and repos (adjust retained keys' position encodings) without editing the trajectory or re-prefilling. The AKV serving engine keeps a stateless API while managing stateful cache reuse, eviction and restoration. A tool-response rolling-drop policy raised benchmark scores by 1.7 points and cut cost 27.7% versus threshold-triggered summarization.
huggingface.copaperAdded 23 Oct 2026- Reproducible Evaluation as the Substrate for Safe Prompt Compression in Production Agents
This paper presents an offline evaluation harness for a production merchant-facing conversational agent. It stays reproducible when live backend data changes and can be regenerated when it goes stale. Used as the fitness function for GEPA prompt optimization under a correctness gate against reward hacking, it shrinks the full prompt surface by 3.5-7.6% without losing held-out correctness, across three subject-model families.
arxiv.orgpaperAdded 26 Oct 2026, published 22 Oct 2026 - Sensorimotor Alignment: A Platonic Proxy for Embodied Policy Success
Sensorimotor Alignment (S^2) is a training-free offline metric that measures how well an embodied model's sensory representation aligns with the geometry of physical motion. It extends the Platonic Representation Hypothesis to motion trajectories. S^2 correlates positively with downstream robot task success across embodied model families, helps pick promising VLM backbones before fine-tuning into VLAs, and explains behaviours seen in VLAs and world action models.
arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026 - EpiSEM-Bench: Evaluating Safety and Evidence Recovery in LLM Agents under Missing Evidence
EpiSEM-Bench is an executable benchmark of 300 matched unsafe/safe task pairs across six domains. It tests whether tool-using LLM agents take prohibited actions when a tool response omits a safety-relevant fact, even though the request is benign and all returned statements are true. It finds large variation across ten models, and recovery access cuts unsafe execution for all ten.
arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026 - Causal Chain of Thought: Mitigating Attention Leakage via Context Isolation
CausalCoT is an inference framework that splits a problem into a directed acyclic graph of atomic sub-questions and evaluates each node in an isolated context holding only its direct causal parents. This removes attention paths to non-parent content, so intermediate steps drive the answer rather than leaking from global context. It keeps benchmark accuracy competitive and raises causal sensitivity of reasoning steps by 12 points on average, up to 21, over the strongest baseline. The graph also allows test-time corrections that propagate downstream.
arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026 - BeNice! Closing Looping's Inference-Memory Gap via KV-Sharing
BeNice! is a post-training method for looped language models that broadcasts the final recurrence's KV-cache into the first recurrence, so one cache can serve all recurrences. It follows a first stage that uses stochastic depth in pretraining to induce contractive residual dynamics. It matches standard finetuning's unshared validation perplexity and composes with multi-latent attention, Kimi delta attention and fp8, mxfp8 and nvfp4 cache quantization. In simulated low-memory long-context inference it raises cache hit rates by up to 31.4% and throughput by up to 23.6%, and cuts p90 time-to-first-token by up to 83.6%.
arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026 - F2G-Pose: Geometry-Aware Foundation Feature Lifting for Direct RGB-D Category-Level Object Pose Estimation
F2G-Pose is a direct, single-pass framework that predicts category-level object pose, metric size and camera-frame completed shape from one RGB-D image. It lifts frozen RADIO foundation features onto partial point clouds, tokenizes local geometry with DGCNN, and fuses it with a Mixture-of-Experts Transformer. It trains only on synthetic SOPE data, leads on SOPE and ROPE at 28 FPS, and is tested on HouseCat6D, HANDAL and real manipulation.
arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026 - Progress Probes $P^2$: Lightweight Runtime Monitoring for Vision-Language-Action Models
Progress Probes (P^2) trains linear probes on a vision-language-action model's own activations, using demonstrations, to estimate task progress, then flags executions that deviate from expected progress. Tested on the open-source pi0.5 across simulated and real-world manipulation tasks, it matches or beats VLM-based monitors and failure-data-trained methods at failure detection, without an external foundation model.
arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026 - How Ground Truth Shapes Retrieval Scores: Evidence-Aware Evaluation of a Retrieval-Augmented Generation System for Breast Lesions
This paper describes an evidence-aware retrieval evaluation protocol for a clinical RAG system over breast lesion management literature. Relevance is defined by evidence spans mapped to all containing chunks. A hybrid retriever (dense, BM25, cross-encoder reranking) with 384-token chunks and 20% overlap reached 0.94 Recall@3 on 18 queries. Expanding ground truth from 25 to 37 spans did not change rankings. The authors note the small set needs independent validation.
arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026 - Who Is Sycophantic to Whom? Confident LLMs, Human Deference, and the Collapse of Trust Calibration
This paper studies reverse sycophancy: whether users bend toward a confident, consistent, wrong LLM. In a within-subjects experiment, 32 participants learned science topics from five GPT-5-mini assistants with 0 to 100% of facts replaced by falsehoods. Scores fell from 7.4 to 2.9 out of 10, planted falsehoods were chosen on 60% of falsified items against 11% of correctly taught ones, and confidence stopped tracking correctness. It introduces a baseline-corrected Human Deference Index.
arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026 - Rethinking Sequence Compression with Test-time Regression
TTR-Compressor is a sequence compression method that treats input tokens as a test-time regression problem. The regression is learned end-to-end by backpropagation, and its coefficients are solved in closed form in the forward pass to give the compressed representation. As a block-wise sparse attention compressor it improves RULER over attention-based compressors by a large margin. As a visual token merger for multimodal LLMs it beats the MLP merger and matches it with 55.6% fewer visual tokens.
arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026 - CellTrack-Bench: Microscopic Cell Tracking Benchmark for Vision-Language Models
CellTrack-Bench is a benchmark that tests vision-language models on microscopic cell tracking and compares them with specialised trackers. It has 1,537 problems covering 9,041 cell-linking decisions, drawn from 15 cell-tracking datasets across four imaging modalities, with a hard subset built from failures shared by distinct algorithmic trackers. The authors compare environment harnesses, benchmark 9 closed-source and 13 open-weight models, and analyse failure modes.
arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026 - An Empirical Study of Recent Large Language Models for Knowledge Graph to Text Generation on Standard Benchmarks
This empirical study benchmarks recent LLMs against fine-tuned encoder-decoder models on knowledge graph-to-text generation, using reference-based metrics and graph-grounded, reference-free LLM-based evaluation validated against human annotations. Recent LLMs narrow or close the gap on reference-based metrics and do better on graph-grounded ones. Prompted models make fewer contradictions and triple omissions, and fine-tuned models' errors grow faster with graph size.
arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026 - The Geometry of Metaphor: Probing and Steering Metaphor Representations in Large Language Models
The Geometry of Metaphor is an October 2026 arXiv preprint that uses mechanistic interpretability to find causal subspaces for metaphor in LLMs of different architectures and sizes. The authors steer output on classification tasks across parts of speech. They also steer generation tasks, showing the metaphoricity of model output can be controlled. The abstract gives no model names or metrics.
arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026 - DuoCook: An Overcooked-Inspired Benchmark for Visual Planning and Coordination
DuoCook is an Overcooked-inspired benchmark in which one vision-language model controls two cooks from top-down views in Unreal Engine environments built with coding agents. It has 20 maps in five categories covering equipment contention, changing terrain and handoff dependencies. Four VLMs were compared; the best, gpt-6-astra, reached 26.2% mean order completion. A notebook memory ablation had mixed effects: positive for Claude and Qwen, negative for GPT and Gemini.
arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026 - Training Small Language Models for Transferable Tool Selection
This paper trains small open language models with reinforcement learning to select tools for multi-step instructions over corpora of more than ten thousand tools. A Qwen3-8B model post-trained with the recipe outperforms Llama-4-Maverick (402B) on ToolBench. The trained model transfers to different retrievers and generalizes to new tool corpora in other domains, without relying on proprietary LLMs like Claude or ChatGPT.
arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026 - Evaluating the Applicability of LLM Inference Optimizations on Apple Silicon
This October 2026 arXiv paper evaluates four LLM inference optimization families on Apple Silicon: KV-cache pruning, speculative decoding, ported GPU kernels and post-training quantization. Tests run on four Apple machines with a single-request decode workload, plus matched RTX 4090 runs. KV-cache pruning reaches 1.75x throughput on Apple, all tested speculative decoding methods reduce throughput, and ported kernels give up to 1.20x.
arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026 - From Structured Records to Patient Narratives: Preserving Clinical Alignment in LLM-Generated Health Summaries
This paper studies evidence-grounded health summarization for menstrual health monitoring. It combines structured evidence conditioning with RAG in a prompt-based constrained generation framework, and scores 4,500 summaries from three LLMs with NLI, atomic factuality metrics and readability measures. Grounding constraints improved uncertainty preservation and generally kept or improved faithfulness against retrieved evidence, while omission effects varied by model. Clinical alignment came with harder reading and more medical terminology.
arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026 - Drift Says When, Budget Says How Much: Rate-Controlled KV Re-selection for Long-Form Multimodal Generation
Rate-Controlled Refresh (RCR) is a KV cache re-selection method for multimodal LLMs in long-form generation. Attention drift decides when and where to re-select visual tokens, and a per-sample controller sets how often. RCR beats InfiniGen by 1.6-3.8 ROUGE-L points on five of six model-task settings and stays within 1.7 points of exact per-step re-selection. On video description, where drift is homogeneous, it no longer beats a fixed threshold.
arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026 - SARIA: Persistence-Aware KV Caching with Coordinated DRAM--SSD Reload for LLM Agents
SARIA (Selective Admission and Reload for Inference Acceleration) is a KV caching system that jointly manages DRAM and SSD for multi-turn LLM agents. It persists only blocks likely to be reused beyond DRAM residency, promotes SSD-hit blocks into DRAM for same-session reuse, and paces DRAM reads with a transfer coordinator. Built on LMCache MP, it cuts SSD writes by 57.1 to 58.9% versus full duplicate caching and mean TTFT by 42.3 to 79.7% versus DRAM-only caching.
arxiv.orgpaperAdded 23 Oct 2026, published 22 Oct 2026 - RIFT: KV Cache Compression for Draft Models with Complementary Compressibility Training
RIFT is a family of selection-based KV cache compression strategies for speculative-decoding draft models. It targets "decode staleness", where prefill-focused selection loses relevance as output grows, by balancing prefill information with recent generated tokens, refreshing the selection adaptively, and training drafters with sparse attention masks. Qwen3.5-4B drafting for Qwen3.5-122B keeps over 98% of full-cache acceptance length at 32K input, 4K output and an 8K KV budget.
arxiv.orgpaperAdded 23 Oct 2026, published 22 Oct 2026 - Chunk Recomputation under Real Document Revisions: Measuring Update Cost and Retrieval Quality of Fixed, Recursive, and Content-Defined Chunking
Chunk Recomputation under Real Document Revisions measures how much text must be re-embedded after edits for three stateless chunkers (non-overlapping fixed-size, recursive paragraph-first, content-defined) on 120 pairs of adjacent Chinese and English Wikipedia revisions. Fixed-size recomputes 57-68% of the new-version workload, recursive 38-56%, content-defined 43-54%, while evidence recall at a 2048-token budget differs by under two points. The authors argue update cost should be reported alongside retrieval quality.
arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026 - SecLog-Bench: A Scalable Benchmark for Cybersecurity Log Reasoning with Scaffolded Evidence
SecLog-Bench is a benchmark for LLM reasoning over cybersecurity logs. A simulation platform with 29 attack scenarios generates audit logs, application logs and network traffic, with attack-stage labels and step-by-step evidence chains. Eight mainstream LLMs were tested on attack-progress reasoning: the best reached 44.44% accuracy, 45.07% Macro-F1 and 54.87% Stage Reasoning F1. Correct predictions often came with flawed reasoning.
arxiv.orgpaperAdded 23 Oct 2026, published 22 Oct 2026 - TRIAD: Benchmarking Omni-Modal Ambiguity in Multimodal Large Language Models
TRIAD is a benchmark for omni-modal ambiguity resolution. It has 327 hand-written text-image-audio queries in 86 scene groups across 18 ambiguity categories, and removing any one modality makes the answer non-unique. Across 14 omni-modal systems, the best model trails humans by over 20 points in group accuracy. Without answer options, model group accuracy falls to single digits, and leave-one-out tests show audio cues are often underused.
arxiv.orgpaperAdded 23 Oct 2026, published 22 Oct 2026 - Gandalf: Flash Shall Not Die! Increasing Flash Storage Lifetime for KV Cache Offloading in LLM Serving
Gandalf is an SSD KV cache offloading system for LLM serving that is aware of SSD lifetime. It prioritizes admitting full-attention KV cache to SSD over cache from other attention types, using application-level information rather than access history alone. The authors report a 7.3x average SSD lifetime extension with negligible cache hit rate loss across several workload traces and hardware capacities. The design may extend to High Bandwidth Flash.
arxiv.orgpaperAdded 23 Oct 2026, published 22 Oct 2026 - Disentangling Robustness and Sycophancy in Multilingual LLMs
The SC-matrix is an evaluation framework for multilingual LLM sycophancy. It crosses a model's competence (correct answer with no pressure) with its sycophancy (keeping that answer under pressure), so agreeing with a false premise can be told apart from not knowing the answer in that language. Results: equal aggregate sycophancy rates hide different failure mixes, high competence does not always protect, and reasoning-oriented mitigations beat directive ones.
arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026 
Matrix-Game 4.0: Harnessing Video Models for Real-Time Playable Game WorldsMatrix-Game 4.0 is a system that separates game logic from visual rendering for playable generated worlds. A lightweight engine holds world state and rules, a multimodal coding agent writes game code and scene captions, and a distilled autoregressive video model turns low-poly proxies into detailed frames. It runs 480p at 60 FPS on one RTX 5090 with 112 ms key-press-to-display latency. Code, weights and assets are released.
huggingface.copaperAdded 22 Oct 2026- IFC-MCQ: Automatically Generating Multiple-Choice Benchmarks for Evaluating LLM Agents on IFC Data Retrieval
IFC-MCQ is a method that automatically generates multiple-choice benchmarks from Industry Foundation Classes (IFC) building-model files, so answers can be graded by exact option-set match instead of human or LLM review. Its taxonomy has 15 categories and 36 subtypes in four groups, with answer keys from the file and distractors from file values or rules. Two agentic setups, tool-based and code-based retrieval, showed category-specific failures and variation by IFC model and interface.
arxiv.orgpaperAdded 23 Oct 2026, published 21 Oct 2026 - SIM-UT: A User Simulation based Evaluation Framework for Medical Triage Chatbots
SIM-UT (Simulation of User Behaviour for Triage) is a multi-turn, simulation-based method for finding failure modes in LLM medical triage chatbots. It was applied to three WhatsApp health chatbots (India, South Africa, Kenya) across 5,000+ multilingual simulated turns, comparing MedGemma with ChatGPT and Claude. The main finding is de-escalation risk: agents that first flagged emergencies agreed with users who minimised symptoms, such as vaginal bleeding in pregnancy.
arxiv.orgpaperAdded 24 Oct 2026, published 21 Oct 2026 - Every Part Has Its Role: Part-of-Speech Effects in LLM Post-Training
Every Part Has Its Role studies concept augmentation in LLM post-training, where a target word is replaced by related alternatives in training sentences. It extends prior work from nouns to verbs and adjectives. Concept augmentation improves perplexity most consistently on news regardless of part of speech, while verbs give the most reliable downstream gains. CKA and linear probing show the largest gains do not match the largest representation changes.
arxiv.orgpaperAdded 23 Oct 2026, published 21 Oct 2026 - Monitorability Is Trainable: Post-Training for Chain-of-Thought Monitorability
Monitorability Is Trainable proposes an unsupervised post-training objective that maximizes mutual information between a model's chain of thought and its output. On three model organisms with degraded CoT (from compression, monitor optimization, and synthetic-document generalization), it recovers most or all lost monitorability. On undegraded policies it improves CoT monitor and activation probe prediction of unsafe behavior and raises consequential reasoning.
arxiv.orgpaperAdded 23 Oct 2026, published 21 Oct 2026 - Symmetry-Based Parameter Efficient Low-Rank Fine-Tuning for High-Throughput Calculation of Lattice Thermal Conductivity
SBFS-FT (symmetry-based few-shot fine-tuning) adapts the MatterSim 1M universal machine-learned interatomic potential with low-rank adaptation on a small set of compounds sharing one crystal symmetry. Tested on half-Heusler (space group 216), space group 225 and spinel (227) datasets, it cut lattice thermal conductivity error 2-3 times versus the base model. It matched per-compound fine-tuning while taking 5-7 times less compute for 100 compounds.
arxiv.orgpaperAdded 23 Oct 2026, published 21 Oct 2026 - Protection Is Not One Event: A Survey of RAG Protection Research by Measured Endpoint
Protection Is Not One Event is a survey and human-coded evidence map of 118 RAG defense papers, grouped by measured endpoint into a seven-family taxonomy (kappa=0.867 across 32 annotators). It finds that only 17.8% of studies use content disclosure as their primary endpoint, and that most evaluations use general QA data and non-adaptive attacks. In a testbed on Qwen3-8B, an 8-gram guard cut copying to 0.0%, yet a three-query adaptive attacker still recovered 48.3% of hidden facts. Taxonomy, dataset, coding protocols and testbed are released.
arxiv.orgpaperAdded 24 Oct 2026, published 21 Oct 2026 - UniWALM: Unified World Action Language Model for Embodied Robot Control
UniWALM is a unified world-action-language model that learns video, action and language in one mixture-of-transformers backbone with per-modality diffusion heads that co-denoise together. Generated subtask and textual memory are fed back on the next step, so no external planner or memory bank is needed. It adds Flow Matching with Correction (FMC) for recovery from perturbed actions. It reaches 34.5% on the memory-dependent RMBench subset, above Mem-0's 28.5%, and lifts real-world Find-the-Item success from 11.1% to 61.1%.
arxiv.orgpaperAdded 22 Oct 2026, published 20 Oct 2026 - InterWebCoder: Learning Interactive Webpage Generation from Executable Tests via Reinforcement Learning
InterWebCoder is a framework for interactive webpage code generation by multimodal LLMs. It synthesizes self-contained webpages with executable test scripts from recorded interaction trajectories, repairs failures using runtime evidence, then trains with test-ID-weighted SFT and GRPO using test pass rates and visual similarity as rewards. The pipeline yields 1,736 verified samples from 2,058 tasks. A 9B model scores 48.54 on IWR-Bench and 48.42 on Vision2Web, and reward latency drops over 97%.
arxiv.orgpaperAdded 22 Oct 2026, published 20 Oct 2026 - Benchmarking Arabic Dialects for Math Problems
DAR-MGSM (Dialectal Arabic Multilingual Grade School Math) is a manually curated benchmark for mathematical reasoning in Dialectal Arabic. It covers five major Arabic dialects plus Modern Standard Arabic, in a translated-only version and a translated and culturally localized version. Eleven Arabic-centric and multilingual LLMs were tested: accuracy generally drops on the localized version, and a mechanistic interpretability analysis shows the two variants induce distinct internal reasoning trajectories.
arxiv.orgpaperAdded 22 Oct 2026, published 20 Oct 2026 - AgenticRoboRL: Bringing Coding-Agent Post-Training to Agentic Robotics
AgenticRoboRL is a framework for post-training robot planners across different harnesses, combining supervised fine-tuning with multi-turn reinforcement learning. Harness-specific adapters link recorded planner interactions to task outcomes, so one RL pipeline covers both VLA skill invocation and control-code generation. On LIBERO-PRO, a 9B planner rose from 18.1% to 71.0% without external memory, near Codex (GPT-5.5) with memory at 72.1%. Code and checkpoints are promised.
arxiv.orgpaperAdded 22 Oct 2026, published 20 Oct 2026 - Sage-A1.5: From Long-Horizon Execution to Scientific Exploration with Capability Composition
Sage-A1.5 is a 35B Mixture-of-Experts agentic model that builds on Sage-A1 for long-horizon problem solving. It adds three capabilities: orchestration with parallel subagents in isolated contexts, verification through progress checking, evidence validation and strategy revision, and open scientific discovery with inspectable research artifacts. The report shows them on complex agentic tasks and multidisciplinary science applications. The page gives only the abstract, no benchmark numbers.
arxiv.orgpaperAdded 22 Oct 2026, published 20 Oct 2026 - Cache Engineering for Agents
Cache Engineering for Agents proposes letting LLM agents control their active KV cache directly, using a drop operation to exclude cache from attention and repos to adjust retained keys' position encodings, without editing the trajectory or re-prefilling. The authors build the AKV serving engine to handle history-dependent cache states. A tool-response rolling-drop policy raises average benchmark scores by 1.7 points and cuts cost by 27.7% against threshold-triggered summarization. AKV gives up to 1.2x output throughput and 1.5x faster P95 latency.
arxiv.orgpaperAdded 22 Oct 2026, published 20 Oct 2026 - OptScientist: Automated Discovery of Optimization Laws
OptScientist is a framework that discovers compact symbolic optimization laws from data. It pairs a model that infers symbolic optimization problems with an LLM agentic system that uses literature priors, proposes candidate laws, abstracts mechanisms and suggests new data to collect. On OptFeynman, a new benchmark of 99 physics-derived problems, it recovers ground-truth laws for over 80%. It is also tested on human risky choice and central-bank monetary policy.
arxiv.orgpaperAdded 22 Oct 2026, published 20 Oct 2026 - Agentic Ensemble with Vision-Language Models for Visual Anomaly Detection
AnomalyAgent is a post-training fusion framework for visual anomaly detection that ensembles pretrained detectors. It aligns scores and anomaly maps, summarizes disagreement, and treats fusion as a choice among score actions and map actions. A constrained vision-language model inspects high-conflict samples and picks the actions. It beats equal-weight fusion and gets the best mean image AUROC and pixel AP among compared fusion methods on MVTec AD and VisA.
arxiv.orgpaperAdded 22 Oct 2026, published 20 Oct 2026 - Large Flow Language Models
Lafa (Large flow language model) is a blockwise continuous flow language model scaled to 8B parameters, with causal attention on the prefix and bidirectional, asynchronous flow within each block. It is adapted from pretrained autoregressive models and trained at 0.5B, 7B and 8B with under 30B tokens. A self-speculative decoding scheme verifies flow drafts autoregressively in one model, giving 2.54x the throughput of an AR model at comparable quality. Flow maps allow one- and few-step generation.
arxiv.orgpaperAdded 22 Oct 2026, published 20 Oct 2026 - Beyond 4 bits: Data-Centric Post-training Quantization and Recovery
This paper studies 2-bit post-training quantization (PTQ) of six dense and mixture-of-experts models from 3.8B to 32B parameters. It finds the quantization representation matters most: vector codebooks give usable models where scalar PTQ falls to chance. Calibration and recovery data must be chosen jointly. The recipe uses about 2.3 effective bits per weight, keeps 89 to 97% of full-precision QA accuracy, and needs 1.4 to 30x less compute than the strongest QAT baseline.
arxiv.orgpaperAdded 22 Oct 2026, published 20 Oct 2026 - Answering in the User's Variety: Calibrated Accommodation Pairs for Post-Training
Calibrated accommodation pairs (CAP) is a preference-data method that rewards chat models for matching a user's dialect density while keeping Standard English for Standard-English users. The paper traces SFT, DPO and RL stages across 10 open model lineages and finds post-training standardizes replies, while the DPO update still favours British and Australian spelling over AAE and Singlish. On a fully open model, CAP improves convergence on unseen features without added dialect for Standard-English users or lower instruction following.
arxiv.orgpaperAdded 22 Oct 2026, published 20 Oct 2026 - Code2Video-Compass: A Comprehensive Benchmark for General-Purpose Code-Based Video Generation across T2V, I2V, and V2V
Code2Video-Compass is a benchmark of 2,104 tasks for code-based video generation, where multimodal LLMs write executable programs that produce complete videos from text (T2V), image (I2V) or video (V2V) inputs. Tasks span 10 categories and 24 subtypes. Scoring uses 12 objective metrics and five MLLM-judge metrics. Across 15 proprietary and open-weight models from nine families, performance falls as construction, dynamic animation and state-dependency complexity rise.
arxiv.orgpaperAdded 22 Oct 2026, published 20 Oct 2026 - DIVE: Benchmarking Full-Duplex Interaction with Visual Engagement in Continuous Streams
DIVE is a benchmark for full-duplex interaction with visual engagement in continuous audio/video streams. It has 525 human-annotated samples across six tasks in three scenarios: proactive intervention, continuous engagement and interaction coordination. Evaluated real-time models reach sub-second average latency, but window response rates stay at or below 53.77%, and adapting ongoing responses to new information is hardest.
arxiv.orgpaperAdded 22 Oct 2026, published 20 Oct 2026 - DeclineCraft: A RAG Abstention Benchmark for Jointly Measuring Combined Retrieval and Parametric Knowledge
DeclineCraft is a dynamic RAG abstention benchmark whose unanswerable questions target Minecraft feature additions made after a corpus cut-off, with audits for parametric exposure. Across 27 LLMs, single-shot retrieval raises Correct Abstention Rate in 38 of 40 configurations, while iterative RAG lowers it in 30 of 40. Enabling thinking without retrieval lowers abstention for 8 of 13 models, shifting responses to premise denial.
arxiv.orgpaperAdded 22 Oct 2026, published 20 Oct 2026 - Is Sycophancy a Form of In-Context Updating?
"Is Sycophancy a Form of In-Context Updating?" argues that factual sycophancy, a model's deference to a user's false beliefs, is a failure of in-context updating rather than only a bid for approval. Models also revise answers for claims attributed to external sources, more so when better supported, and deference persists when no user approval is at stake. The internal components behind deference also matter causally for general updating, so reducing sycophancy may reduce useful updating.
arxiv.orgpaperAdded 22 Oct 2026, published 20 Oct 2026 - Reward Misspecification Degrades Chain-of-Thought Monitorability
This paper shows that reward misspecification alone degrades chain-of-thought (CoT) monitorability in language models. Using a testbed of paired true and misspecified rewards across three models and three tasks, CoTs keep reasoning about task intent while outputs hack the reward. The proposed reward description training injects an LM-inferred reward description into the input and raises monitorability by an average of 24% or 42% absolute, depending on the metric.
arxiv.orgpaperAdded 22 Oct 2026, published 20 Oct 2026 - A Multimodal Engineering GraphRAG Framework for Post-Wind-Event Building Assessment and Recovery Inference
This paper presents a multimodal engineering GraphRAG framework that links post-wind-event damage evidence from images and reconnaissance reports to building-condition states, recovery actions and downtime. Evidence is stored as a provenance-preserving, component-level representation, and graph-aligned retrieval uses compatibility, contradiction, evidence-precedence and abstention checks. Demonstrated on tornado-affected low-rise homes, it beats BaselineRAG and Structured Baseline RAG, and ablations test each component.
arxiv.orgpaperAdded 22 Oct 2026, published 20 Oct 2026 - KNOX: Hardware-assisted Regulatory Sandbox for Generative Models
KNOX is a regulatory sandbox for generative models that runs AI workloads inside trusted execution environments (TEEs). For agentic workloads, it derives an attested policy manifest from the user prompt (applicable regulations, expected tool calls, permitted system calls). An attested reference monitor checks each action against it, and an attested execution graph records every action and verdict. Overhead is under 1%.
arxiv.orgpaperAdded 22 Oct 2026, published 20 Oct 2026 
Into the Unknown: Benchmarking AI agents on open scientific research problemsInto the Unknown is a benchmark that gives an AI agent a science paper and an unpublished research direction, then asks it to write a follow-up paper. Scientists at US Department of Energy national laboratories supplied the directions and the conditions a submission must meet, which form the grading rubric. Nine frontier agents wrote 15 follow-ups each (135 total) across five domains. None met all conditions, and 114 failed an integrity check, mostly for claiming work never done or reporting numbers that contradict recorded evidence.
huggingface.copaperAdded 20 Oct 2026- Can It Actually Work? Synthesizing Functional CAD Mechanisms
FunCAD-Harness is a framework in which LLM agents design CAD mechanisms and revise them using physical simulation feedback. It turns abstract functional requirements into candidate-specific physical tests. The paper also introduces FunCADBench, a benchmark of 46 mechanism families with interdependent, multi-step operations. Experiments on frontier LLM agents show it exposes mechanical failures that visual inspection misses and raises functional success over standard simulation-augmented baselines.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - OpenVLHarness: Real World Visual Agentic Tool-Use with Multimodal Memory
OpenVLHarness is a multimodal reasoning harness for MLLMs built on a capability layer (task-level tool interfaces plus evidence rendering) and persistent multimodal memory that stores images, structured data and web references as addressable artifacts. A coding interface runs generated programs over stored data. Across 22 benchmarks and eight backbones it adds 9.7-12.6 points over no-tool baselines, and GPT-6 Luna at medium effort beats Codex and Visual Sketchpad at maximum effort using at most 37% of their tokens.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - Where is Physical RSI capability from? An Observational Scaling Law of LLM-as-policy
The paper introduces PhysRSI-eval, a five-axis metric for physical recursive self-improvement: first-attempt performance, efficiency, success, budget and improvement from failure. Several VLMs are tested on 18 manipulation tasks under a fixed interaction budget. It proposes the Physical Barrel Hypothesis and studies observational scaling. Workspace interventions show that removing history lowers late-round success, while frozen workspaces still help on unseen layouts.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - Same Simulation, Different Evidence: Where Retrieved Tool Output Costs LLM Agents Accuracy
This paper studies how keeping long tool output out of the context window, and reading it through a section index instead, costs LLM agents accuracy. Using the PHREEQC geochemistry simulator on 158 execution-verified multiple-choice items and 11,007 logged calls, GPT-5.1 and GPT-5.2 lose 11.3 and 7.9 points, while Claude Opus 4.6 and Sonnet 4.6 show no detectable cost. The authors name the failure evidence substitution: agents skip the report and misround from their own output files.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - MemT-1.0: Towards Memory-Native Evolution
MemT-1.0 is a memory foundation model architecture that builds memory into model computation. It builds on Metis, uses Gated DeltaNet-2 for token-level memory updates within each turn, and adds Mixture-of-Storage to scale capacity. Training used 34B tokens in continued pre-training and post-training. MemT-1.0-Nano and MemT-1.0-Flash beat parametric memory baselines and stay competitive with retrieval methods. At 128K history, Nano gives about 1.86x inference speedup and 66x less persistent storage than a full-context KV cache.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - ASTOR: Benchmarking and Improving Autoformulation for Soft-Constraint Optimization with a Formal Grammar
ASTOR is an inference-time framework that has an LLM map a natural-language decision problem to a grammar-guided abstract syntax tree, then deterministically compiles it into executable optimization code. The paper also introduces SoftOR, a benchmark of natural-language problems with soft constraints. On SoftOR, ASTOR has the best aggregate accuracy among comparable single-request and multi-agent LLM methods, and it stays competitive on hard-constraint-only autoformulation benchmarks.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - What Language Adds, and at What Cost: Four Controlled Probes of Pathology Vision-Language Models
This preprint grades evidence for pathology vision-language models and tests four claims with controlled probes on released checkpoints and public data. Stage-redacted report embeddings raise pooled C-index by 0.019 (progression-free interval) and 0.016 (overall survival) across 1,633 TCGA patients. Zero-shot prompting matches a linear probe. SlideChat scores 74.82% with the slide and 74.41% without it. Paraphrasing flips 8-23% of answers.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - Scaling Parameter-Efficient Fine-Tuning for Brain Encoding
BrainLoRA is a parameter-efficient fine-tuning method that adapts multimodal backbones of up to 104B parameters to predict neural responses. It predicts multiple timepoints in one causal pass instead of sliding windows, and a multi-LoRA kernel trains many adapters on a shared backbone. Across nine backbones it improves encoding, and a 200+ model ensemble ranks first on the Algonauts post-challenge leaderboard.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - Mise-en-Video: Fine-Grained 3D Control for Multi-Shot Video Generation
Mise-en-Video (MeV) is a multi-shot video generation framework where creators stage shots in 3D space and then generate the matching video. It combines hierarchical attention for multi-level narrative consistency with 3D-aware layout guidance for per-shot spatial control. The authors built a 160K-video dataset with hierarchical multi-shot texts and oriented 3D bounding boxes, and report gains over baselines in quality, consistency and subject controllability.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - Analysis of an AI based code distinguisher
The paper analyses DeepDistinguisher, a transformer-like model that tells Goppa codes apart from random linear codes. Saliency maps and attention visualisation reveal a low-weight-row artifact in the random training instances that the model partly relies on. A pairwise-XOR rule inspired by minimum distance correlates strongly with the model's predictions, and the model loses most of its power on random matrices meeting both constraints. This suggests it exploits general combinatorial properties, not hidden algebraic structure.
eprint.iacr.orgpaperAdded 20 Oct 2026, published 19 Oct 2026 - TokenGate: Adapting LLMs for Fast and Memory-Efficient Prefill with Learned Token Pruning
TokenGate is a small drop-in component that adds end-to-end learnable token pruning to trained LLMs for long-context prefill. It uses token-gated attention, inspired by Mixture-of-Experts, to re-weight attention logits with token importance scores, which gets gradients through the non-differentiable top-K step. The authors report 1.4-11.3x faster time-to-first token and 1.5-3.4x lower peak memory with no accuracy loss, on Qwen3 and Qwen3.5.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - EpiLens: Lightweight RAG for Epidemiological Knowledge Acquisition
EpiLens is a lightweight, open-source retrieval-augmented generation package that applies a fixed retrieval template and output schema to every paper in a corpus and links outputs to source passages. On a corpus of 2,297 epidemiology papers, its classifier matches or exceeds supervised and zero-shot baselines on four tasks without task-specific training data, scored against 214 manual labels. It also compares model-based study shares across parameters and pathogens.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - Which Model for Which Role? Cost-Efficient Pareto Recommendation for LLM Agentic Workflows
Cost-Coupled Gittins (CC-Gittins) is a multi-objective extension of cost-aware Gittins search that recommends Pareto-optimal model-to-role assignments for LLM agentic workflows. It exploits the coupling between evaluation and deployment cost, alternating between seeking higher quality and lower cost. On eight quality-cost matrices (two to five roles, up to 1,681 assignments), it recovers a substantial share of the true Pareto frontier at about 10% of exhaustive-evaluation cost, and most of it by 30%. Latency is tested as a third objective.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - Tandem: Serving Hybrid Linear-Attention GUI Agents on Mobile NPUs
Tandem is a runtime for serving hybrid linear-attention GUI agents on mobile NPUs. It saves recurrent state where consecutive prompts diverge, keeps most prefill on the matrix unit, uses a verification kernel that reads each weight block once, and releases NPU power votes between bursts. On a Snapdragon 8 Elite it cuts per-step latency 30% for text screen descriptions and 16% for screenshots, cuts energy per text step by 33%, and lowers loaded-model standby power from 0.76 to 0.22 W.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - The Development of Sycophancy in Language Models: Tracing Vulnerabilities from Pretraining to Post-Training
The paper traces sycophancy across 741 checkpoints from 30 open model lineages, from early pretraining to released models. It plants initial verdicts on moral scenarios and measures how far models follow a user's opinion or drop their answer under pressure. The behaviour usually exists before post-training, but which questions a released model yields on is set mainly during post-training. For Tülu-3 8B, its own preference-stage checkpoint removes 85% of remaining prediction error, a sibling model only 19%.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - Concerns in Benchmarking Jailbreaks: An Empirical Study of Attack Success Rates
Concerns in Benchmarking Jailbreaks is an October 2026 arXiv study of eight jailbreak attacks on three open-weight models under three evaluation procedures. Low-resource language attacks score 96.0% ASR by keyword matching but 2.7% under a Qwen3 evaluator using StrongREJECT instructions. Attack rankings flip with attempt budgets, and 100 samples at Ollama's default temperature 0.8 give 100% ASR by keywords, 50% by the evaluator.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - HAF-VLA: Hierarchical Action Flow Framework for Humanoid Vision-Language-Action Control
HAF-VLA is a hierarchical action-flow framework that adapts a pretrained flow-matching vision-language-action model to humanoid whole-body loco-manipulation. It denoises a shared action space in stages: locomotion and head commands first, then waist refinement, then full-body manipulation. Learnable stage embeddings and cross-stage KV-cache conditioning carry dependencies between stages. The authors report gains over existing models on six real-world tasks.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - Assisted Turbulence Modeling via Data Assimilation and Machine Learning for Turbomachinery Flows
This paper presents a hybrid framework for axial compressor flow that couples a Multi-Fidelity Ensemble Kalman Filter (MFEnKF) with machine learning. The filter merges PIV experiments with steady RANS and unsteady hybrid RANS/LES simulations. A neural network trained on the enriched data predicts Navier-Stokes volume forcing terms from velocity, velocity gradients and turbulent viscosity. A Mixture of Experts fixes local errors near blade tips, giving lower experimental discrepancy than baseline RANS.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - Mitigating Reward Hacking in Preference Reward Models with Evolving Penalties
Dynalize is a method that reduces reward hacking during online RL training against preference reward models. Periodically and asynchronously, a language model reads training rollouts and writes penalties for undesirable behaviors the reward model seems to reward, and a judge applies them to every rollout. In clinical counseling and creative writing it sustains longer training and improves external benchmarks, and the gains hold in multi-turn training and after reward model retraining.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - Rethinking LLM Fine-Tuning via Weight Space Reparameterization: Preserving Safety during Downstream Adaptation
WSR-Tune is a fine-tuning framework that reparameterizes LLM weight matrices with a safety-conditioned basis, so safety-relevant information concentrates in a small set of directions. Those safety-critical directions are frozen, and the remaining complementary directions are updated for the downstream task. The authors report a better trade-off between downstream performance and safety retention. The page gives no benchmark names or numbers.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - E-Layout: Layout-Stage Logic Restructuring via RL-Optimized Equality-Saturated Graph Retrieval-Augmented Generation
E-Layout is an ML-driven framework for post-placement logic restructuring in IC physical design. It builds equivalent logic alternatives with e-graph equality saturation, links logic choice to physical realization through a graph-based RAG model, and refines the choices with reinforcement learning on design-level timing feedback. On 9 designs it gives about 6% TNS and 2% WNS improvement and 1% less area than a commercial physical design flow.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - How Benchmark Graph Construction Shapes Multi-Hop KG Navigation: A Controlled Audit of PathQuestion and PathQuestion-Large
This paper audits the PathQuestion (PQ) and PathQuestion-Large (PQL) multi-hop knowledge-graph QA benchmarks as graph-navigation tasks. It holds questions, answers, path annotations and splits fixed, and replaces each released task-filtered graph with the larger source KG. Restoration cuts released-answer accuracy and trajectory fidelity for frozen small-language-model policies and trained MINERVA policies, and graph-consistent evaluation recovers only part of the loss.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - SHADE: Shrinkage via Halted Alpha-stable Denoising for Heavy-Tailed Probabilistic Time Series Forecasting
SHADE is an alpha-stable Lévy diffusion forecaster that stops denoising at a nonzero depth, so the leftover stable kernel shrinks the predictive distribution instead of leaving it overconfident. It offers a scale-calibrated halt and a context-amortized halt that needs no noise labels. Median CRPS improves 21.7% on synthetic data with alpha at or below 1.3, with tail calibration gains on cryptocurrency and foreign-exchange series.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - VibeTraining-Bench: Data-Trainer-Harness Co-Design for Iterative System Improvement
VibeTraining-Bench is a benchmark for cross-component co-design, where research agents iteratively refine training data, trainers and inference harnesses for a fixed starting agent system. Tasks cover terminal operation, software engineering, multi-turn tool use and math reasoning, with safeguards against reward hacking. On SWE-bench Verified, GPT-6 Astra raises the target system from 32.9% to 53.7%, against 55.4% for the human-developed instruct model.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - Large-Scale Biomedical RAG: Corpus Scaling, Document Representation, and Efficiency Trade-offs
This paper is a controlled, large-scale evaluation of biomedical Retrieval-Augmented Generation across growing corpus sizes. It compares abstract, flat full-text and hierarchical full-text representations, with and without reranking, on multiple-choice QA over five external benchmarks and a held-out test set. RAG gave mean gains of up to 9.6 points externally and 10.2-30.3 points on the held-out set. Hierarchical indexing used 67% fewer units and 44-56% less storage than flat full-text.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 - How Effectively Do Security Skills Guide Coding Agents in Vulnerability Detection in Linux Kernel?
The paper is a large-scale study of 37 security skills run through Claude Code with four LLMs on 100 real Linux kernel vulnerabilities, 14,800 runs in all. Only 24.4 percent of runs found the correct function and 15.7 percent classified the vulnerability correctly. It proposes SKILL-SIF, which evolves skills from failure patterns and raised fully correct detection on 100 unseen vulnerabilities from 2 to 16 percent.
arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026 
Self-evolving Agent HarnessSelf-evolving Agent Harness is a 66-page survey and theory paper on revising an agent's scaffolding (prompts, memory, workflows, tools, code, plugins) while model weights stay fixed. It frames search as evolutionary optimization and uses continual PAC-learning to derive a generalization bound, a retention bound and a high-probability admission rule with fresh validation data. It separates selection, activation, attribution and improvement as evaluation claims, and covers applications and governance. Code is at github.com/zgcagi/Harness-RSI.
huggingface.copaperAdded 19 Oct 2026- HERMES: High-Performance Private Decoding for Large Language Models
HERMES is a privacy-preserving inference (PI) system optimised for multi-token LLM decoding rather than prefill. It swaps high-round nonlinear protocols for compute- and bandwidth-heavy ones with fewer rounds, and adds a homomorphic-encryption matrix-multiplication protocol that keeps the KV cache encrypted on the server and uses grouped-query attention. On Llama 3.1 8B Instruct it cuts TPOT by up to 2.7× and total PI latency by up to 2.1×.
eprint.iacr.orgpaperAdded 19 Oct 2026, published 18 Oct 2026 - Hybrid Reasoning Agents: LLM agents that think in latent space, act through text
Hybrid Reasoning Agents (HybridAgents) are LLM agents that switch between latent reasoning and text-based interaction in one generation process. A lightweight HybridLink handles mode transitions, continuous working memory keeps hybrid context across turns, and HybridSFT plus HybridRL train when to think latently and when to act in text. Across 3 model scales and 11 benchmarks, the paper reports 10.4% higher performance, 35.5%-54.7% fewer tokens, and 1.8x-2.6x faster inference.
arxiv.orgpaperAdded 19 Oct 2026, published 18 Oct 2026 
How employment is changing at Anthropic"How employment is changing at Anthropic" is an October 2026 technical report by Nathan Wilmers, Regina Catipon, Maxim Massenkoff and Peter McCrory. It uses internal employment, agent telemetry, output, survey, calendar and hiring data plus 17 interviews. Junior technical hiring fell from 27% to 9%, agent hours reached six times employee hours by August 2026, and adopters' output rose. Employees increasingly do meta-work managing agents.
anthropic.compaperAdded 19 Oct 2026, published 18 Oct 2026- ToFu: Exploiting and Fuzzing the LLM–Orchestrator–Tool Trust Boundary
ToFu is a tool-aware fuzzing framework for LLM tools, including MCP servers. It maps each tool argument, using its metadata, to one of 74 CWE-guided semantics-aware sanitizers (path, URL, SQL and similar). It then generates schema-valid Atheris harnesses and semantic oracles, using runtime tracers for in-process tools and outcome oracles for opaque ones. The LLM (gpt-4.1) only maps sanitizers and writes seeds; it is never the security judge. The paper also shows a "Repeat-After-Me" trick, where an LLM told to repeat attacker-crafted text emits a tool call the orchestrator executes, reproduced on LangGraph, MAF, ADK 2.0, AutoGen, Strands and CrewAI. Across 273 runnable MCP servers (3,405 tools) it reports 253 verified bugs in 343 tools across 118 servers, such as path traversal, log injection and exfiltration. These are failures a crash-based fuzzer would miss. The result matters because it shows LLM-generated tool arguments cannot be treated as trusted.
arxiv.orgpaperAdded 18 Oct 2026 
OpenGCUA: Toward a Fully Open Stack for Generalist Computer UseOpenGCUA, from Alibaba's MAI-UI team, is an open stack for generalist computer-use agents (GCUAs), where the model chooses how to observe, act and organize work across GUI, accessibility-tree, API and shell interfaces. Its design combines code execution (GUI actions written as programs with loops and branches) with harness-to-model decision transfer. On OSWorld-v2 it raises mean partial score by +19.6 points across eight models, including GPT-6 Astra and Claude Opus 5, and cuts reported steps per task by 53%. The release includes the harness, prompts, evaluation trajectories, a macOS real-device harness, a cross-device SDK and an interactive lab. It also shows large efficiency gaps between models: Qwen3.8-Max used 19.4x the reasoning tokens of GPT-6 Astra on real macOS tasks.
huggingface.copaperAdded 17 Oct 2026- AI-Driven Reproducibility and Analytical Robustness in Scientific Discovery
SEER-Repro is a benchmark of 20 published papers based on the SEER cancer registry, with the data needed to reproduce their findings. An LLM agent reproduces 77.4% of 2,190 atomic claims. A second agentic pipeline finds alternative analytical choices and reruns the analyses, flagging potentially consequential choices in 9.5% of fully reproduced findings for expert review.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - Acceptance Is Not Speed: Length Inflation in Training-Free Lossy Speculative Decoding
This paper shows that training-free relaxed (lossy) verification in speculative decoding causes length inflation: completions get longer, mostly through extended reasoning traces, which offsets gains in accepted tokens per round. Across twelve target-drafter pairs, relaxed rules accept 1.34x as many tokens per round but produce 1.54x longer completions. Rules that cut verifier rounds usually lose substantial accuracy, so the authors argue completion length and verifier rounds must be reported.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - FuTransformer: FP8 prefill and INT4 decode for Llama-style inference on Hopper
FuTransformer is a CUDA implementation of a Llama-style Transformer block for NVIDIA Hopper GPUs. It uses FP8 prefill with fused GEMM epilogues and INT4 weights plus an INT4 KV-cache copy for decode, with a block-diagonal Hadamard transform to cut cache quantization error. On one H100, prefill is up to 1.48x faster than compiled PyTorch FP8, and INT4 decode is 1.3-2.4x faster than the faster PyTorch baseline. Llama-3.1-8B decode takes 2.8 ms per step at batch one, versus 8.1 ms for compiled transformers. WikiText-2 perplexity rises from 6.24 to 7.23 with round-to-nearest INT4 weights, or 6.99 with GPTQ.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - DLite: History-free Speculative Decoding for Agentic AI
DLite is a history-free speculative decoding framework for agentic LLM workloads. It reuses the target model's contextual hidden states and predicts locally without keeping the draft model's historical KV cache, which avoids the up to 80% acceptance-length drop seen with long, multi-turn contexts. A lightweight sequential head restores intra-block causal dependencies, and a two-stage training strategy is used. It reaches 2-6 acceptance length and beats DSpark by up to 70%.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - TileDRAM: Compiler-Controlled Tile-to-DRAM Layouts for 3D DRAM GPGPUs
TileDRAM is a compiler-runtime toolchain that adds tile-to-DRAM layouts as a compiler-visible abstraction for compute-unit-local 3D DRAM GPUs. It extends GPU Linear Layout to DRAM placement and picks layouts per tile access signature using row-buffer behavior. On 108 MoE FFN cases in Accel-Sim/Ramulator2, row-conflict rate fell from 75.7% to 15.2%, with a 1.77x geomean speedup. Overhead on an RTX 3090 is 0.17%.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - GLOBE: Evolving Structured Agentic Memory for E-commerce Product Optimization in Generative Search
GLOBE is an agentic framework that optimizes e-commerce product listings for generative search by storing strategies in an evolving handbook of explicit, field-scoped behaviors. An Editor applies behaviors and gets rank-based feedback, a Reflector turns it into updates, a Moderator removes redundant proposals, and a Curator commits changes. Harmful behaviors are deactivated. Structured behaviors beat monolithic prompt optimization and transfer to unseen product categories.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - FedRAPP: Federated Test-Time Prompt Tuning for Vision-Language Models with Reliability-Aware Prompt Personalization
FedRAPP is a personalized aggregation framework for Source-Free Federated Test-Time Prompt Tuning (SF-FTTPT), where clients adapt CLIP soft prompts on unlabeled, non-IID test streams without source data. It combines reliability-aware client assessment, a server-side exponential moving-average prompt memory and similarity-guided peer aggregation. Across nine CLIP benchmark datasets and ImageNet variants it beats standard federated aggregation baselines while keeping prompt-only efficiency.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - HardEval: An Execution-Verified Benchmark for AI-Driven Security Hardening and Compliance Remediation
HardEval is an execution-verified benchmark for language-model security hardening, built from Red Hat Enterprise Linux 8 STIG controls that fail on an unhardened baseline. Models receive only the required security outcome and write a Bash script, which runs on a live VM and is graded fail to pass with OpenSCAP/OVAL checks. Fourteen frontier and open-weight configurations show uneven results across domains, with plausible code that misses the exact compliance condition. The benchmark is public.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - On the possibilities and limitations of LLM-based multi-agent systems for multi-criteria decision-making in healthcare operations management
This paper proposes a framework for auditing LLM-agent-generated stakeholder preferences before they are used as weights in multi-objective optimization for healthcare operations. Experiments on outpatient appointment scheduling and emergency department configurations show that explicit ratings vary by role and clinic conditions, deliberation can erase role differences, and pairwise choices depend largely on option order. Robust weighted-sum models often select different schedules than average weights.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - OwlSight: A Panoramic Monitor for Chain-of-Thought Reasoning
OwlSight is a chain-of-thought monitor that uses "Factor", a monitoring requirement written into the prompt, so one monitor can cover many tasks across capability, safety and trustworthiness. Factors come at fine granularity (a specific leaked email address) and coarse granularity (privacy leakage). On 15,971 reasoning trajectories it beats general-purpose LLMs by 1.32-30.57 points (fine) and 11.71-27.81 points (coarse), and reaches state-of-the-art on OpenAI's CoT monitorability benchmark. It generalizes to unseen models and resists Factor rephrasing, CoT compression and obfuscation.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - FlexPart: Text-Controlled Semantics-Aware 3D Part Segmentation at Flexible Granularity
FlexPart is a framework for text-controlled 3D mesh segmentation that assigns discrete part IDs to mesh faces through a view-independent part-identity field. It uses a control prompt of part names with location and shape clauses, trained on a VLM-built multi-granularity dataset. On FlexPartBench it raises average mIoU by 22% over the strongest baseline, and by 15% with planner-completed prompts.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - A Language-Informed Loss for Visual Generation
LILIE (Language-Informed and Lossless Image Encoder) is an invertible image transform built from a normalizing flow transformer, trained jointly with a vision-language model via next token prediction so captions can be recovered from noised features. The encoder supplies a language-informed loss for text-to-image generation. JiT models trained with it cut gFD from 66.84 to 53.01 against a pixel-only baseline on the GPIC dataset. Code, encoders and models are released.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - ThetreStageAI: Multi-View Retrieval-Augmented Generation for Structured Bengali Theatre Production Planning
ThetreStageAI is a retrieval-augmented framework for structured Bengali theatre production planning. It keeps separate scene, actor-blocking and lighting views, embeds Bengali text with BGE-M3, indexes it in view-specific Qdrant collections, and has Gemini generate schema-constrained JSON, with validation and at most one repair attempt. The authors build a synthetic dataset of 500 records (1,500 retrieval documents) and compare single-combined retrieval with multi-view retrieval. Code and data are public.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - Enhancing RAG-based Medical VQA with Gated Multimodal Representations
This paper presents a multimodal retrieval-augmented generation framework for Medical Visual Question Answering. A Gated Multimodal Unit learns a joint query representation from the medical image and the clinical question, so evidence retrieval uses both modalities while the Med-LVLM stays frozen. On benchmark datasets it consistently beats a reference Med-LVLM and stays competitive with state-of-the-art methods. The page gives no dataset names or numbers.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - Trapped in Your Story: Evaluating Narrative-Induced Sycophancy in Large Language Models
This paper builds a benchmark of 500 debatable questions across ten domains to measure how user narratives steer LLM agreement. Each question has 11 matched conditions (one neutral, five mirrored narrative levels per opposing stance), giving 5,500 instances across seven LLMs. Causal framing and worldview synthesis raise agreement, personal experience can lower it, and GPT-5.1 ablations show bullet formatting also increases agreement.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - Predictable Scaling: Efficient Model Exploration via Scaling-Law Prediction
Predictable Scaling (PS) is a framework that predicts full-scale recommendation model performance from scaled-down proxies. It builds proxies with composable scaling functions along separate resource axes, then projects metrics to target scale by curve fitting with calibrated uncertainty. Of three predictors, even the raw proxy falls within repeated-run noise, and a Gaussian Process gives 15% lower relative MAE. On a task-specific ranker and a foundation ranker, PS ranks hypotheses correctly at 79-88% compute reduction.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - ConQUESTA: Topology-Aware Post-Training Structural Pruning of Quantum Neural Networks
ConQUESTA is a post-training pruning framework for quantum neural networks that combines task saliency with compiler cost, screens candidate entanglers, and searches whole pruning masks under an accuracy constraint. Each mask is transpiled across several coupling topologies. At 55% pruning on 4-, 6- and 8-qubit QNNs it cuts resources by 61.6% (Breast Cancer), 72.0% (Digits01) and 82.2% (Iris), and fixed-mask recovery raises feasible runs from 16/24 to 22/24.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - Ignored, Not Refused: What Low Prompt-Injection Success Rates Hide in Small Tool-Using Agents
"Ignored, Not Refused" audits 33,000 trajectories from eleven open-weight agents (2-14B parameters) on InjecAgent and AgentDojo. A label-blind LLM judge finds 76-80% of failed injection attacks were ignored and 17-18% refused. Changing only the system prompt moves InjecAgent attack success rate from 0.2% to 43%, and the ATOM matrix shows 21.7% of AgentDojo episodes were safe but left the user's task undone. The corpus, judge prompt and code are released.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - PrairieFire: Igniting High-Throughput Updates in Large-Scale Approximate Nearest Neighbor Search
PrairieFire is an SSD-based approximate nearest neighbor search system for billion-scale vectors, built for high update throughput. It uses buffered updates and batched local rebuilds, with cascaded adjustments, concurrency control and CPU-GPU-SSD cooperation. Against state-of-the-art systems it reports about 3-35x update throughput, 3-5x search throughput and 1.5-8.7x cost efficiency. It has run in RedNote production for two months.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - LexPilot: Benchmarking the Proactive Interaction Ability of Legal LLMs with Laypeople in Chinese Civil Case Consultation
LexPilot is a benchmark linking proactive legal interaction to claim-level verdict prediction, built from 432 real Chinese civil judgments across 36 causes of action. It pairs expert-reviewed complete and underspecified consultation histories with court verdicts. Current LLMs score on average 23.84% lower on judgment prediction in underspecified consultations than in fully specified ones, and the paper analyses the bottlenecks.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - Rethinking GRPO for Large Reasoning Model Safety Alignment
Beacon is a safety alignment framework for large reasoning models that fixes two GRPO failure modes: advantage collapse, where homogeneous rollout groups give vanishing advantages, and unsafe diversification, where unsafe behaviors persist and spread. It combines Safety Signal Recovery (advantage-guided trajectory filtering plus safe reference supervision) with Safety-Utility Decoupled Alignment (category-aware rewards, benign-only KL anchoring). Tested on four Qwen3 and DeepSeek-R1-Distill variants across eight benchmarks, it cuts average safety error by up to 32.83 percentage points with low over-refusal.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - SpikeQ: Spike-Guided Post-Training Quantization for Spiking Neural Networks
SpikeQ is a spike-guided post-training quantization framework for spiking neural networks on neuromorphic chips. It picks each weight level by simulating downstream neurons to minimize spike errors, and uses a reset-aware grid for pre-fire membrane potentials. With 4-bit weights and potentials, models stay within 2.59 points of full precision, with 7.8 to 7.9 times smaller memory and 6.4 to 6.9 times less energy.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - MUB: An Identity-Masked Benchmark for Music Understanding in Multimodal Language Models
MUB (Music Understanding Benchmark) is a set of 500 identity-masked recordings with existing annotations for tempo, key, time signature and structural intervals. It covers all 24 keys, tempos of 47 to 180 BPM and 4,676 intervals, and strips titles, artists and platform IDs from inputs. Baselines reach 53.6% tempo accuracy (DSP) and 98.4% time-signature accuracy (constant 4/4). No multimodal LLM has been tested yet, and rights clearance is unresolved.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - Many Biases, One Circuit: Post-Training Tunes a Pretrained Cue-Routing Mechanism
Many Biases, One Circuit is a October 2026 arXiv paper that traces attention heads behind cue-following (for example "I think the answer is B") through two post-training pipelines. Four cue types share a few heads already present in pretrained models. About 200 generic assistant examples activate them in chat format, and the final RL stage strengthens cue effects. Swapping attention patterns of six middle layers between Tulu-3-8B and OLMo-2-7B checkpoints moves cue effects most of the way.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - Identify, Classify, Act: Per-Instruction Controlled Compliance for LLMs over External Data
EDIC is a decomposed reward framework that trains LLMs to decide, for each instruction embedded in external data such as documents or tool returns, whether to follow or reject it. A judge initialized with SFT and refined with GRPO attributes compliance per instruction and yields separate rewards for beneficial and harmful compliance. On Qwen3-4B it raises harmful-rejection by up to 7.7% and Arena-Hard-Auto utility by 12.5% over the strongest prior defense.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 
Doc2Harness: Benchmarking LLMs on Long-Horizon Harness Engineering of Coding AgentsDoc2Harness is a two-stage benchmark for harness engineering. In Stage 1 a build model, working inside a fixed builder harness, gets an interface-only contract skeleton plus a development document consolidating behavior from twelve frontier harnesses, and builds a full candidate harness in an isolated container. In Stage 2 the frozen harness runs in separate per-test-case containers, driven by a scripted mock model, and is scored on four channels: requests sent to the model, files on disk, exit code and command output. Across 19 frontier models with three builds each on 328 test cases, GPT-6 Astra leads at 53.05% against 27.44% for the weakest, and failures cluster around how cross-cutting functionality is split across modules.
huggingface.copaperAdded 16 Oct 2026- Between Spoilers and Guesswork: Avoiding Over-Specification in Coding Benchmarks
This October 2026 arXiv paper studies task over-specification and under-specification in repository-level coding benchmarks. It shows that hints derived from ground truth, as added in SWE-bench Pro, FEA-bench, Doc2Feat-bench and Multi-SWE-bench, leak spoilers in some of them. The authors test several specification levels, recommend techniques for parsimonious hints, and plan to release their hints.
arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026 - Value as Memory: Online Value-Guided Post-training for General Robot Policies
Value as Memory (VaM) is a post-training framework for generalist robot policies. It addresses partial observability and the delayed feedback of offline post-training. Value caching conditions actions on recent value predictions as task-progress memory. Online real-world RL combines offline demonstrations, off-policy interventions and on-policy rollouts, and moves from offline RL warmup to autonomous learning with sparse rewards. On long-horizon deformable-object and contact-rich manipulation tasks it gains 29.4% mean absolute success rate from value caching and 32.8% from online learning over matched offline training. The online schedule runs 8x as many policy iterations under the same gradient-step budget, with over 2x lower time per gradient step from concurrent data collection and training.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - Perceive, Predict, and Plan: a Unified World Action Model for Egocentric Dexterous Manipulation
P^3-WAM is a unified world action model for egocentric dexterous manipulation with three modes: Perceive (reconstruct articulated hand motion and camera trajectories from video), Predict (generate visual futures under prescribed actions) and Plan (jointly generate action trajectories and their anticipated visual outcomes from an initial image, a language instruction and an optional visual goal). It adds a compact structured 3D action representation to a pretrained video diffusion transformer through a mixture-of-transformers design with shared base weights, modality-specific adaptation and bidirectional visual-action attention. Randomized modality visibility lets video and 3D actions act as either context or target. Unified training beats single-mode training and outperforms specialized baselines on 3D hand reconstruction and action-conditioned video prediction across four datasets, and gives better instruction adherence than video-generation baselines.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - Grounding Generative Verification in 3D Content
The paper introduces 3DVerifierBench, a 10-task benchmark for generative verification of 3D content. It scores accept/reject decisions, rejection explanations, and responses to controlled changes in specifications and candidates. A human study shows a 21.6-point gap to the strongest tested model, GPT-6 Astra. The authors also build a pipeline of multi-view fact extraction, controlled 3D editing and native annotations. It yields 14,126 training examples with contradiction explanations and linked counterfactuals. Verification-guided selection raises complete factual success from 26.7% to 90.0% with oracle selection over sixteen candidates, and human-guided recursive refinement satisfies all seven requirements for every input in an eight-input study.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - DK-VLM: Geometry as Position for Spatial Reasoning in Vision-Language Models
DK-VLM adds Dual-Kernel Attention to a vision-language model. A semantic kernel keeps the pretrained attention and positional encoding. A separate geometric kernel uses estimated 3D points and camera poses to modulate attention through point displacements and relative view transformations, and a learned gate fuses the two outputs. Geometry therefore enters attention as position, not as fused 3D reconstruction features. The paper also adds Reference-Frame Composition (RC) supervision, which gives stepwise turn and heading targets derived from verified single-step annotations, to train multi-step spatial reasoning as the observer moves. DK-VLM-8B reports the highest average score across six spatial benchmarks among the compared methods, with 74.33 on VSI-Bench and 58.28 on ReVSI-32, and it preserves general video understanding.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - Rethinking Routing Exploration in Modern Mixture-of-Experts
The paper identifies an "exploration dilemma" in modern Mixture-of-Experts models. Shared experts reduce the variability of token representations, which makes routing less exploratory. Fine-grained expert segmentation enlarges the combinatorial routing space and so needs more exploration, which means its extra expressiveness may go unrealized. It proposes MirrorMoE, which shrinks the exploration space by suppressing unnecessary experts per token, and reports consistent gains across model scales.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - MLExpert: Towards a Generalist Agentic Model for Autonomous Machine Learning Engineering
Presents MLExpert, a 35B Mixture-of-Experts agentic model trained for autonomous long-horizon machine learning engineering. Training uses a Kaggle-MLE Factory to build executable tasks and an interaction harness, hierarchical agentic SFT with outcome-guided supervision, and Windowed Interaction RL (WIRL). WIRL treats the multi-turn decisions between successive experiment results as one execution window with a shared outcome reward, and uses asynchronous collection and policy correction. On MLE-Bench Lite the average medal rate rises from 37.9% to 72.7%, comparable to larger frontier models such as Kimi-K3 and GLM-5.3. It also improves on NatureBench Lite, agent scaffold optimization and algorithm optimization.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - Learning to Steer LLM Agents and Multi-Agent Systems
Proposes a steering agent that supervises LLM agents and multi-agent systems during execution and corrects goal drift, where long-horizon tool use and inter-agent collaboration slowly diverge from the overall objective. A low-cost fast path decides when to intervene, and a high-cost slow path generates how to intervene. Both paths are trained jointly with reinforcement learning, combining a pairwise ranking objective with GRPO. On information-seeking search tasks it improves performance and efficiency for single-agent and multi-agent systems, generalizes out of domain, transfers to unseen executors, and allows intervention frequency to be adjusted without retraining.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - Velox: Spatial Memory Makes World Models Efficient
Velox is a training-free attention router for chunked video-diffusion world models. It uses camera frustum slabs with depth intervals from streaming geometry to pick which historical token blocks to attend to, instead of letting the KV cache grow with rollout length. Frustum overlap softly modulates each layer's model-derived block importance, and uncovered regions keep the model's own routing. The fixed block granularity suits FlashAttention-style tiled execution, and slab construction runs asynchronously with denoising on the same H200. At chunk 48 it speeds up attention 4.36× and denoising 2.43×, and on the 158-case WBench navigation split it stays within 0.15 average points of dense LingBot-Fast-Cam.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - Knowledge That Is Linear Before Fine-Tuning Generalizes After It
The paper separates "active" facts (which support generalization beyond recall) from "inert" ones. It builds new relations by relabeling answers of existing ones (Paris -> Europe becomes Paris -> crab), fine-tunes on a subset of subjects, and tests held-out subjects that share an answer (Munich -> crab). Across eleven language models and 70 relations, linear readability of the original relation in pretrained representations correlates with this generalization at Pearson r = 0.87 to 0.92 within each model. The result holds after controlling for fine-tuning set size, original-relation accuracy and subject frequency in pretraining text, and it survives re-randomized labels, seeds and thirteen other label categories. Mapping wrong labels back to the original answers shows the fine-tuned model's errors follow the linear probe's top answers.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - AI Consilium: a Benchmark of LLM Clinical Multidisciplinary Second Opinions
AI Consilium is a multidimensional benchmark built from 300 diagnostically resolved NEJM–MedQA cases (110 for physician reference ratings and Judge calibration, 190 held out). Eight single-model pipelines produced role-specific opinions and interactive-consilium reports under free-form and structured clinical-reasoning conditions, and a physician-calibrated LLM Judge scored 3,040 final reports. Model identity separated quality more than format; structured reports won in seven of eight pipelines (management 2.740 vs. 2.436), multidisciplinary synthesis beat the primary-role opinion on all five shared criteria, and GPT-5.6-Sol led every component with the fewest review rounds.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - Private Retrieval Augmented Generation via Random Projection
Proposes protecting the retrieval datastore in RAG systems by applying the same random projection to datastore embeddings and query embeddings. This provably preserves query-item semantic similarity while substantially mitigating data extraction attacks. Across multiple RAG architectures and datasets it beats prior differential-privacy-based methods on retrieval and generation quality, with comparable empirical privacy under strong attacks, making it a practical baseline for privacy-preserving RAG.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - EliteReplay: Preserving Diverse Solutions in RL Post-Training via Quality-Diversity Search
EliteReplay is an RL post-training recipe that pairs GRPO with an "elite" archive built by quality-diversity search. Before training, the frozen base model is used to collect solutions spanning distinct approaches; during training, a replay loss on this archive is added to GRPO. This counters the narrowing of solution diversity that RL causes. On text-to-SQL tasks it reaches higher pass@128 than all baselines and yields up to 77% more distinct correct strategies. It also retains more of the base model's strategies and covers both readings of ambiguous questions nearly twice as often on AmbiQT.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - Librarian Agents: Training LLMs to Curate Long-Context Workspaces that Anticipate Future Queries
Introduces Librarian Agents, where a builder agent turns raw unstructured documents into a hierarchical filesystem of synthetic files and reference links, forming a workspace for a downstream answering agent. Workspace construction is cast as a Markov decision process and the builder policy is trained with reinforcement learning to maximize downstream answering accuracy. It beats the strongest retrieval and precomputation baselines by 33 points on BrowseComp-Plus, amortizes construction cost over repeated queries, and generalizes zero-shot to BRIGHT with a 31-point average gain.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - X-RIC: An Agentic RAN-Intelligent Controller Benchmark for Enhancing Reinforcement Learning
X-RIC (eXplainable RIC) is a framework that adds agentic reasoning to the O-RAN Near-RT RAN Intelligent Controller. It combines reactive reinforcement learning with automated behavioral cloning from domain heuristics, a transformer-based Telecom Language Model for contextual abstraction and interpretability, and closed-loop co-adaptation for continuous policy refinement. The paper also introduces BARX, a benchmark for agentic RAN control that measures latency, compliance and determinism. On SLA-aware network slicing, in simulation and on an O-RAN-compliant testbed, it reports 89% lower operational cost with SLA compliance kept, 75% faster convergence, 50% fewer training steps and 46% lower variance.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - GhostFaceMPC: Privacy-Preserving Face Recognition with Multi-Party Computation
GhostFaceMPC is presented as the first end-to-end face recognition system that runs both the deep CNN feature extractor and the matching step under secure multi-party computation. Raw images and biometric embeddings are never exposed at any stage, from feature extraction through storage to matching. The authors contribute an MPC-friendly quantization of the GhostFaceNet model and circuit optimizations that make this practical, and they release code on GitHub. It is relevant as an example of making CNN inference feasible under cryptographic constraints.
eprint.iacr.orgpaperPublished and added 15 Oct 2026 - Topology-Inspired Fine-Tuning for Wind-Field Super-Resolution
The paper fine-tunes a pretrained CNN wind-field super-resolution model with differentiable topology-inspired auxiliary losses on speed, gradient magnitude, soft high-speed level sets and local maxima. It also uses fixed-pair supervision at ground-truth persistence-pair endpoints located offline with the Topology ToolKit. A 16-configuration loss study on a fixed 168-field benchmark finds that gradient supervision gives the strongest persistence-diagram improvement, while fixed-pair supervision gives the most consistent joint improvement in persistence-diagram and merge-tree distances. The combined objective cuts bottleneck, W2,∞ and W2,2 distances by 31%, 25% and 27% relative to the pretrained CNN, at a cost of about half of standard fine-tuning's PSNR gain. It also shows that pointwise metrics and topological distances rank CNN and GAN models differently.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - Skill-Decoupled On-Policy Expert Distillation for Unified Vision-Language Models
Proposes SCOPED (Skill-Decoupled On-Policy Expert Distillation), which trains capability-specific RL experts for vision-language models. It extracts explicit skills from them through reward-guided reflection. During on-policy distillation the skills guide expert supervision but are hidden from the unified student, so the student internalizes the procedural knowledge and needs no explicit skills at inference. Across eight multimodal benchmarks it beats the backbone and mixed-capability RL. Analyses show cross-capability gradient interference in joint RL, and that skill augmentation gives more consistent expert trajectories, more attention to task-relevant visual evidence, and better preservation of expertise.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - Efficient KV Cache Migration for Geo-Distributed LLM Inference in Collaborative Edge Computing
Proposes EdgeFlow, a hybrid KV cache migration scheme for distributed LLM inference across heterogeneous edge servers in Collaborative Edge Computing. It combines direct KV cache transmission with activation-based recomputation, overlapping computation and communication to cut migration time when servers disconnect or overload. The authors formulate a multi-node KV migration optimization problem and give a 2-approximation algorithm built on improved LP relaxation and bipartite graph techniques. Experiments on a real distributed LLM inference platform show up to 45% lower migration time.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - Multi-sourced AI Tutor for Non-Native English Speaker Students
Describes a general-purpose LLM-based AI tutor for computing courses that accepts questions in Mandarin and replies bilingually, also generating glossaries of technical terms. It uses a specialized multi-source RAG pipeline with a novel question extraction mechanism to draw on diverse course materials. Evaluated on 91 Piazza posts: 83.52% answered correctly and helpfully, 76.92% of questions got high-quality translations, and 64.47% got glossaries.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - The importance of tensor handling and implementation of physics-informed DeepONets
Proposes a modified Physics-informed DeepONet (PI-DeepONet) architecture that removes redundancy in how the Branch network processes input functions across collocation points. It is mathematically equivalent to the original but uses smaller input tensors and fewer Branch evaluations. The authors derive training-time scaling laws, then test on 1D, 2D and 3D linear advection problems. Accuracy matches the original, the maximum speed-up is 3.75× in 2D, and a 3D model trains on an NVIDIA A100 only with the new formulation, because the original runs out of memory.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - DropKV: Decoupling Residual-Output Perturbation for Near-Optimal KV-Cache Eviction
DropKV is a KV-cache eviction framework for long-context LLMs. It decouples the joint eviction decision into independent per-token scores based on residual-output perturbation, which avoids the NP-hard combinatorial problem. It has a provable constant-factor approximation guarantee under a cone condition, which the authors verify empirically on three long-context LLMs. The fused Triton kernels never materialize the full attention matrix. They give a 19.8x scoring-kernel speedup and up to 9.9% end-to-end prefill speedup. On RULER and LongBench it beats state-of-the-art eviction baselines at equal cache budgets.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - PROBE: Learning to Audit Policy Compliance in Tool-Using LLM Agents
PROBE (Policy Rule Observation via Behavioral Exploration) trains LLM-based auditors that act as realistic users and probe deployed tool-using agents for policy violations (pricing, privacy, confirmation, safety) over multi-turn dialogue. It formalizes auditing as a two-player Markov game with a composite reward balancing violation discovery, behavioral plausibility, conversation progress and policy diversity, and compares GRPO, DPO and GFlowNet optimization in a controlled setting. Trained auditors find broader, higher-yield violations than same-architecture zero-shot adversaries, even when much smaller than the target agent. This positions multi-turn behavioral auditing as a distinct evaluation axis alongside capability and safety benchmarks.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - Onboard Lightweight LLM Reasoning for Human-Aware Safe UAV Navigation
Presents a modular, fully onboard UAV navigation pipeline that closes the "human-aware safety gap" of geometry-only planners. A shared BLIP encoder drives captioning and text-conditioned segmentation, which is fused with depth for 3D obstacle localization. Qwen-2.5-0.5B, stabilized with RAG and grammar-constrained JSON decoding, infers per-category risk once per class and caches the verdict. Perception runs at 10 Hz on a Jetson Orin NX, and fallback LLM queries take about 0.8 s off the control path. In Gazebo it gives roughly 3x fewer collisions than a geometric planner and raises semantics-aware landing success from 34% to 96%. The 224-pixel encoder input limits small-object perception at range.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - GraphACM: Graph-based Action Consistency Measurement for Uncertainty Quantification in LLM Agents
GraphACM merges equivalent states from multiple rollouts of the same LLM agent task into a directed, action-labeled graph, so actions can be compared at shared decision states. It defines node-level and global action-consistency measures, and uses the global score as an uncertainty proxy to predict task success or failure. Across three LLMs on ALFWorld, AppWorld and WebShop it reaches an average AUROC of 0.811, above the strongest behavioral-consistency baseline (0.729) and verbalized confidence (0.769). It also shows where in a trajectory agent actions diverge.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - SecAgg++: A Post-Quantum Privacy Preserving Federated Learning Protocol
SecAgg++ is a masking-based secure aggregation protocol for single-server federated learning that uses post-quantum cryptographic primitives. It keeps the communication and computation efficiency of SecAgg and SecAgg+ and handles client dropout through an efficient recovery procedure. It matters because most masking-based secure aggregation protocols are not post-quantum secure, which leaves federated model updates exposed to future quantum adversaries.
eprint.iacr.orgpaperPublished and added 15 Oct 2026 - GACC-Bench: Benchmarking Goal-Adaptive Context Compression Ability across Large Language Models
GACC-Bench is a benchmark for Goal-Adaptive Context Compression, testing how well LLMs retain goal-relevant information when compressing a source context under a length budget before downstream questions are known. It has 500 goals and 2,571 human-reviewed questions over 281 document and agent-trace contexts from seven collections; a fixed reader answers the withheld questions from the compressed context. Ten LLM compressors show large gaps to full-context performance, especially in answering every question tied to a goal. Target-goal conditioning improves accuracy over goal-agnostic compression, while mismatched goals hurt it.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - From Perception to Prediction and Intervention: Benchmarking Proactive Video Assistants in Real-Life Scenarios
Introduces P^3IBench, a benchmark for proactive video understanding in real-life streaming scenarios, covering three capabilities: daily perception, risk prediction and intervention. It evaluates 12 open-source and proprietary video-language models (streaming and adapted non-streaming) and finds they struggle to make well-calibrated decisions about when to respond. The authors also build extra proactive training data and train P^3I-Assistant-4B, which improves several tasks unevenly, showing that proactive assistance needs response timing and restraint as well as visual understanding.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - Multi-Reward Hacking: From Aggregation-Induced Drift to Trust-Anchored Defense
The paper shows that symmetric aggregation of a primary reward (correctness) and auxiliary rewards (brevity, efficiency) in LLM post-training can raise aggregate reward while primary-task performance falls. It proves that deterministic conditional-mean GRPO converges to auxiliary-favoring behavior when auxiliary rewards are more reliably obtained. It proposes Trust-Anchored Gating (TAG), which elects an anchor channel by policy drift and gates auxiliary credit on anchor satisfaction. On Qwen3-4B with a brevity reward, TAG reaches 0.581 pass@4 versus 0.220 for additive aggregation, and shortens responses by 44% relative to correctness-only training. Experiments on Qwen and Llama models cover math and program synthesis.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 - Recursive Reward Improvement via Adversarial Meta-Prompt Evolution
Introduces Recursive Reward Improvement (RRI) for recursive self-improvement on open-ended expert tasks without answer keys, where a proposer writes both a task and a rubric. Before the solver trains, an adversary writes a rubric-gaming but useless answer, the same model writes an honest answer without seeing the rubric, and up to two repair steps revise the rubric until the honest answer wins. Exploits found also rewrite future task and rubric generation. On HealthBench Professional it beats a Generation Only baseline by 10.9 points at 9B and 12.4 at 27B (10.3 with no external model), and the 27B model transfers to PRBench Hard (+6.6) and ProfBench (+8.0).
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026 
Harness^2: Recursive Agent Harnessing for an Open WorldHarness^2 is a plug-and-play framework that recursively improves LLM agent execution harnesses in open-world settings where no ground-truth verifiers exist. Task-level recursion uses a contrastive Propose-Probe-Compose step to guide harness edits for the current task, and it scales through parallel or sequential recursion. Harnessing-level recursion distills experience from those edits into a continual-improvement harness for future tasks. A single step improves GLM-5 and Gemini 3.5 Flash over their base harnesses by up to 11.5 points on WorkBuddy-Bench, 4.5 on JobBench and 11.8 percentage points on LAB.
huggingface.copaperAdded 14 Oct 2026- Thinking in Graphs: Neo4j-Backed Exploit-Chain Reasoning for LLM Penetration-Testing Agents
ChainGraph is a pattern that moves exploit-chain reasoning out of the flat context window and into a Neo4j property graph. Findings, attack steps, credentials, assets and tamper-evident evidence receipts are typed nodes with pre/post-condition edges. The graph is wired to Claude Code or Codex through MCP with no custom harness. Five operator questions (next-step inference, entry-to-crown-jewel pathing, combined-severity promotion, evidence provenance, chokepoint identification) become reusable Cypher and Graph Data Science queries, plus a chain-severity score. On a synthetic multi-forest Active Directory lab modeled on GOAD, three findings rated Medium in isolation become Critical once their path to the forest root is materialized. Scoping each decision to a graph result cut the reasoning payload by about 98% on a token proxy. The authors say the results are illustrative single-run measurements, not a benchmark.
arxiv.orgpaperAdded 17 Oct 2026, published 14 Oct 2026 - DPF-SGD: Byzantine-Robust Differentially Private Federated SGD with Exact Optimality Guarantees
DPF-SGD is a federated SGD algorithm that stays robust to Byzantine agents while satisfying ϵ-differential privacy. It combines private step sizes with a DP noise-decay schedule and adds a privacy-preserving comparative elimination (PPCE) filter that suppresses Byzantine updates during aggregation. The authors prove almost-sure convergence to the global optimum despite persistent noise and adversaries. On synthetic and MNIST data, final optimization error is one to two orders of magnitude lower than DP baselines.
eprint.iacr.orgpaperPublished and added 14 Oct 2026 
Scaling Agentic Data for Long-Horizon Terminal IntelligenceIntroduces TerminalHorizon, a fully automated data synthesis engine for long-horizon terminal agents. It uses independent execution to find key work omitted during environment construction and rebuilds the environment from that evidence. It then progressively expands tasks under the same goal with new requirements that build on earlier results. The authors build 1.5K task environments and run supervised fine-tuning of Qwen3.5-27B to get TerminalHorizon-27B, which improves on all 12 benchmarks covering coding-agent tasks, real-world production agentic tasks and general reasoning. Multiple RSI case studies with a 12-hour research budget show the model continuing to experiment past an initial solution and keeping effective improvements in its final deliverables.
huggingface.copaperAdded 13 Oct 2026
AgentSWE: Can Coding Agents Build the Agent You Actually Want?AgentSWE is a benchmark of 25 tasks covering the agent development lifecycle: Creation of an agent from a natural-language requirement, Editing of production agent codebases, and Optimization toward a measurable target. Builders iterate on a few illustrative cases, then the frozen submission is graded on held-out cases with requirement-derived rubrics and hard pass/fail gates. Across coding agents, models and harnesses, none comes close to delivering the requirement. Recurring failures include overfitting to visible cases, hollow runtimes behind code that looks complete, and unsupported claims of completion.
huggingface.copaperAdded 13 Oct 2026- A Graph-Based Analysis of Comparability, Scale, and Attribution in Private Transformer Inference
Systematization of knowledge on private Transformer inference (PTI) that builds an empirical graph of 62 systems, with system attributes as node features and evaluation compatibility as edges. Node-level attribution finds that cryptographic progress drives most speedups but always co-occurs with confounders such as model fidelity, hardware and cost accounting. Edge-level auditing finds only 1 of 1891 candidate system pairs directly comparable. Graph-level analysis shows the scale frontier plateaued at 13B parameters and projects the cost of deploying current PTI techniques on production-scale Transformers.
eprint.iacr.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - ChunkAct: Action Chunking for Agentic Robotics
ChunkAct brings action chunking to agentic robotics, where an LLM agent composes perception, motion and VLA tools guided by memory. Online, one call launches a chain of primitives that runs autonomously and returns control only on failure. Offline, memory is compiled into these chunks so execution needs no memory at test time and the planner is used only for real decisions. On LIBERO-Pro it improves task success by 5.0 points over the prior agentic-robotics state of the art, with 2.9x fewer LLM calls, 4.4x fewer input tokens and 2.3x fewer output tokens.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - Dog-Breed Text-to-image Flow Matching from Pretraining to Fine-Tuning on 4 Consumer GPUs
MiniDog is a framework for training a text-to-image flow-matching diffusion transformer from scratch on four RTX 3090 GPUs, with 55 minutes of pretraining and 15 minutes of fine-tuning. It pretrains on 26k ImageNet dog images that were captioned, then fine-tunes on 2k FLUX.1-schnell generated images. Image and text features are precomputed and cached. The model is a 22M-parameter transformer with the E2E-INVAE semantic latent space, a small Qwen text encoder and in-context conditioning, and training is accelerated with iREPA and an EUPE perception encoder. The repo evaluates with FID, HPSv2, PickScore and VAE reconstruction metrics. It lowers the barrier to hands-on diffusion training research.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - Hybrid Reasoning Agents
Introduces Hybrid Reasoning Agents (HybridAgents), which switch between latent reasoning and text-based interaction in one generation process. A lightweight HybridLink handles transitions between the two modes, and a continuous working memory keeps hybrid context lossless across turns. This keeps tool use and makes latent thoughts inspectable. Post-training has two stages: HybridSFT, then HybridRL, which learns when to think latently and when to act in text. Across 3 model scales and 11 benchmarks (math, science, medicine, search, agentic reasoning), the authors report +10.4% performance, 35.5–54.7% fewer tokens, 1.8–2.6x faster inference and 2.7–3.7x lower cost versus text and latent baselines.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - Visual Tokens on Demand: Visual Budgeting for Scalable and Efficient Multi-Image Reasoning in Multimodal LLMs
Proposes mmVB, a lightweight plug-and-play module (1.6M trainable parameters) that assigns query-conditioned per-image visual token budgets using cross-image context for multimodal LLMs, without retraining the base model or accessing attention matrices (so it is compatible with FlashAttention). It cuts visual input tokens 9x, giving 5x faster time-to-first-token and 7x fewer prefill FLOPs while keeping 94.4% of full-resolution accuracy across eight multi-image reasoning benchmarks. It matters because existing token pruning, merging and compression methods target single-image redundancy and either need attention maps or retraining.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - PixelMoE: Scaling Pixel-Space Diffusion with LLM-Style Mixture-of-Experts
PixelMoE is a pixel-space diffusion framework that scales capacity sparsely using standard LLM-style Mixture-of-Experts: token-choice routing, fine-grained routed experts, a shared expert and bias-based load balancing, with no diffusion-specific routing or auxiliary routing losses. It adds Pixel-Space Hierarchical Flow Matching, which varies spatial resolution along the denoising trajectory from global structure to fine detail. At matched active parameters it beats dense counterparts, and reaches FID 1.47 at 256x256 and 1.53 at 512x512 on class-conditional ImageNet-1K without representation alignment or perceptual losses. Code and models are promised but not yet released.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - RepProbe: Can Video Language Models Count Repeated Actions? A Diagnostic Benchmark
RepProbe is a benchmark of 42K real and synthetic video clips with exactly 1–20 complete action repetitions, controlling for clip position, temporal coverage and duration. Video language models' counting accuracy collapses at high counts, and this is not explained by frame sampling alone. Linear probes on final-layer representations show count information stays linearly decodable even when the model's answer is wrong, so the failure arises at the output stage, where answers cluster on a few preferred numbers.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - Plan-Bench: Can Existing VLMs Go Well Beyond Perception to Reason and Plan in Embodied Worlds?
Plan-Bench is a benchmark of 699 curated samples across 16 subclasses and three dimensions. It tests whether vision-language models can reason over spatial and temporal information and produce multi-step plans under constraints for embodied tasks, with action execution isolated out. Across 28 VLMs the best model reaches only 75.0% accuracy. Scaling generally helps, and larger models look more promising as high-level planners. Code and benchmark are released.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - Game2Real-Bench: Do Toy Games Reveal and Transfer to Real-World Visual Reasoning?
Game2Real-Bench tests whether vision-language model performance on procedurally generated toy games predicts real-world visual reasoning, and whether game examples help transfer. It has 1,000 verifiable game samples and 400 real-world samples, matched by shared reasoning requirements (fine-grained perception, spatial reasoning, constraint reasoning, sequential planning). Across 25 VLMs, game and real scores correlate strongly (Pearson/Spearman 0.935). One-shot game-to-real transfer on four models improves constraint reasoning for several but hurts fine-grained perception. The authors also release Game2Real-Dataset, with about 24K verified game samples across 18 tasks and 65 QA families.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - OmniCompass: A Holistic Benchmark for Omni-Modal Video Grounding and Understanding
OmniCompass is a manually annotated benchmark for video grounding and understanding with two tracks: OmniCompass-VL (820 videos, 2,460 instances; vision-language models) and OmniCompass-AV (240 videos, 720 instances; joint audio-visual evidence for omni-modal models). Each track covers temporal grounding, spatial grounding and QA across short/medium/long videos, and each instance is run in paired text-only and text+image target specifications. Evaluating 50 MLLMs shows open-source models lag proprietary ones, especially on audio-visual understanding, that precise temporal/spatial grounding remains hard, and that predictions are inconsistent across the paired specifications.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - Beyond the Verdict: Agentic Code Judging with Verifiable Feedback
Proposes a task where a model judges and diagnoses a candidate program from only the problem statement and source code, backing its verdict with generated counterexamples that can be checked by execution. The authors build USACO-JUDGE from USACO 2026 contests (human and LLM-written accepted and unaccepted programs) and train ARBITER, a 35B MoE agentic verifier, with reinforcement learning in a generic execution sandbox. Training lifts counterexample success on incorrect programs from 40.61% to 62.67% and mean binary verdict accuracy from 71.41% to 87.41%. ARBITER also improves code selection and refinement, and in an IOI 2026 case study its guided refinement lifts GPT-OSS-120B's expected score above the gold-medal threshold under the official submission limit.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - SP$^2$ec: Adaptive Self-Speculative Decoding for Vision-Language Models
SP$^2$ec (Single-Peak SPeculative decoding) is a training-free bandit algorithm that adapts the draft configuration of self-speculative decoding per prompt for vision-language models. It relies on the single-peak throughput pattern seen in SWIFT, KnapSpec, SpecVLM and the authors' cosSim method. It minimizes a new wall-time regret measure and has theoretical guarantees of near-optimal configuration with negligible exploration cost. On Qwen2.5-VL-7B-Instruct and LLaVA-NeXT-Mistral-7B it improves over the original self-speculative methods by up to 11% on visual and textual tasks.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - UniW(A)M: A Unified Mixture-of-Experts Framework for World and World-Action Models
UniW(A)M is a mixture-of-experts model built on diffusion Transformers that unifies action-conditioned world modeling (AC-WM) with several world-action model (WAM) variants. Shared experts capture common physical dynamics, while atomic capability experts are reused across interfaces, each keeping its own conditional pathway. At deployment a plug-in adaptive interface router (PAIR), trained on a small subset of target-task chunk scenarios with the backbone frozen, picks a WAM interface for each execution chunk. It reaches 88.3% average real-world success against 76.7% for the strongest baseline, leads WorldArena on all three action-conditioned world-modeling tasks, and PAIR raises OOD success from 63.3% to 76.7%.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - ProAS: A Progress-Aware Advantage Shaping Framework for Multi-Turn Agentic Reinforcement Learning
ProAS (Progress-Aware Advantage Shaping) is a plug-and-play framework for multi-turn agentic RL that fixes the uniform credit assignment problem in critic-free algorithms like GRPO, where trajectory-level advantages are broadcast to every action. It uses a dynamically evolving Agentic Reference Graph with Masking Unreasonable Incentives and Asymmetric Penalty Redistribution to give finer-grained credit without a critic. On Qwen2.5-1.5B/7B-Instruct it reports success rates up to 91.9%/94.3% on ALFWorld and 66.7%/70.8% on WebShop, with up to 2.44x faster training convergence and robustness to imperfect or distilled ARGs.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - Kwai Summary Attention V2 Technical Report
Technical report for Kwai Summary Attention V2 (KSA V2), which extends summary-token attention architectures that compress distant context into one learnable summary token per chunk. Hybrid KSA-Full models force the same compression chunk size in every layer and leave full-attention layers paying quadratic prefill cost. KSA V2 lets summary tokens serve two roles, as KV memory and as a sparse indexer. This allows per-layer compression windows for more flexible KV cache compression and lowers computation in the full-attention layers.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - MultiAlloc: Budget-Aware Precision Allocation for KV Cache Quantization
MultiAlloc is a profiling-guided framework for KV cache quantization. It splits a fixed KV memory budget between layer-wise precision enhancement and token-wise preservation. Lightweight offline profiling measures layer sensitivity and token importance, and the profiled memory–accuracy trade-off yields an allocation policy with no online search. The paper reports gains over layer-wise, token-wise and recent multi-granularity KV quantization baselines at matched memory on reasoning and long-context benchmarks, across Mistral, Llama, DeepSeek-Qwen and QwQ models.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - Geometric Calibration of Supervised Fine-Tuning
Proposes Geometric Calibration of supervised fine-tuning and SPACE (Subspace Projection for Adapted Checkpoint Enhancement). SPACE is a post-hoc, data-free, training-free method that uses the pre- and post-SFT checkpoints to revert SFT update components lying in the principal subspace of the pre-SFT weights and keep those in the orthogonal complement. It is evaluated on Qwen2.5, Qwen3, Qwen3.5, Llama-3.1 and Olmo-3 models (2B–14B) with math, coding and medical SFT. It reduces out-of-domain regression and improves in-domain performance, for example +2.85 ID / +2.26 OOD on Qwen2.5-7B math SFT.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - Legal-R1: Agentic Retrieval for Evidence-Based Legal Reasoning
Legal-R1 is an agentic retrieval framework for evidence-based legal question answering that splits reasoning across three agents. A Lawyer agent decides when to retrieve, which legal source to query, what evidence to seek and when it has enough. A Legal Assistant retrieves statutes and precedent cases with authority-aware and diversity-aware selection, and a Judge agent writes the final answer from the full evidence trajectory. Only the Lawyer agent is post-trained, using masked supervised fine-tuning and trajectory-aware reinforcement learning. The paper reports gains over general-purpose, legal-specific and retrieval-augmented baselines on several Chinese legal benchmarks.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - LLM Agents for Automated Post-Training via Structured Recipe Optimization
Introduces Structured Recipe Optimization (SRO), a paradigm for automated LLM post-training that optimizes over a task-adapted recipe space covering data sources, data processing, cross-domain composition and training configuration. It pairs an LLM-based Recipe-Space Designer, which builds the recipe space for the target tasks, with a Multi-Domain Recipe Optimizer that uses structured trial evidence to guide LLM candidate construction and multi-objective Bayesian trial selection. SRO gets the highest average score in all evaluated target-model and agent-LLM combinations; for example, 41.1 vs 15.4 for the strongest baseline on Qwen3-1.7B with GPT-5.4, and 53.8 vs 40.8 on Qwen3-4B with DeepSeek-V4-Flash, in joint post-training across three capability domains and six benchmarks.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - Configuring RAG Systems: What Breaks, Where Originates, and How to Fix
First large-scale empirical study of RAG configuration issues, covering 654 real-world issues collected from 10 diverse RAG systems. It categorizes symptoms, root causes, affected pipeline stages and fix patterns. It finds that symptoms mostly appear at early or late stages, while the root cause often sits in a different stage from where the symptom shows. It closes with nine actionable insights for testing, localizing and fixing RAG configuration problems.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - Towards Safe Autonomy for Computer Use
Introduces SA-CUA, a dual-LLM framework for Computer Use Agents (CUAs) that defends against indirect prompt injection. It builds a trust boundary by deriving conservative deterministic rules from the accessibility tree, which unmask trusted screen regions in the privileged LLM's screenshot and keep untrusted content separate. An endorsement channel lets values move from the untrusted to the trusted domain through verification over trusted channels. This removes the need for per-action user confirmation and the confirmation fatigue it causes. SA-CUA is reported to keep much higher utility than CaMeL-CUA with a 0% attack success rate.
arxiv.orgpaperAdded 15 Oct 2026, published 13 Oct 2026 - EmoGenie: Benchmarking and Evaluating Expressed and Evoked Emotion in T2I Generation with MLLMs
EmoGenie is a benchmark for emotions expressed and evoked by text-to-image outputs. It has 6,400 images from eight T2I models using 800 emotion-targeted prompts. It includes EmoGenie-QA (90,000 closed-set and 1,057 open-ended questions) and EmoGenie-Assess (13,175 mean opinion scores for valence, arousal, dominance and aesthetic quality). The authors also propose EmoProbe, which pairs emotion QA with response-aligned, dimension-specific regression heads. They report that it beats baselines on emotion QA and correlates better with human ratings. The work shows how reliably MLLMs interpret affect in generated images.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - Heading Hierarchy Reconstruction for Complex and Long Documents with Level-Wise Multimodal Memory
Proposes a vision-language-model framework that incrementally reconstructs heading hierarchies across tens or hundreds of pages using a level-wise multimodal memory. The memory keeps a compact set of earlier pages chosen by anchors (here, the most recent node at each heading level), so the VLM sees the visual, textual and layout patterns of headings at every level. The authors also introduce CLDoc-HHRBench (250 documents, 11,212 pages, expert-verified annotations) and report results on it and three existing benchmarks. It matters for RAG pipelines that need coherent document-level structure, which page-by-page OCR/VLM parsing doesn't give.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - Claim Framing as a Driver of LLM Sycophancy
Systematic study of which framings of a user's claim trigger sycophancy in factual question answering, where every answer is objectively verifiable. Across 14 models and 42K questions, correct and incorrect user opinions are expressed through 21 framing types in 8 dimensions, and multiple opinion-driven behaviors are measured. All models are susceptible regardless of size; confidence of statement, attribution to whom, and framing as shared between user and model matter most, while expertise, authority and social pressure matter little. Larger models resist incorrect opinions better but are no better at recovering from their own errors, so the authors argue sycophancy evals must probe framing and measure more than a single flip rate.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - Seeing Through the Forgery Is Not Enough: Regressive Sycophancy under Fabricated Evidence in Medical Vision-Language Models
The paper studies regressive sycophancy under fabricated evidence: a medical VLM gives a correct answer, then abandons it when the user pushes back with a fake prescription. It tests four open VLMs on 400 VQA-RAD yes/no questions in 19,200 multi-turn conversations. Without a synthetic-document disclosure, models abandon 80.1% of 6,488 correct answers, and the same prescription raises Qwen2.5-VL-7B's flip rate from 45.9% to 89.6% while lowering Qwen3-VL-8B's from 77.7% to 50.9%. Models often reject the prescription yet keep the correct answer in only some conversations (915 of 3,232), and 40% of those flip later. System-prompt disclosure of synthetic documents cuts one model's flip rate from 77.8% to 47.3%. The authors conclude that recognising a forgery does not stop a model from adopting the forged answer.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - Evidence-First Agentic Verification
Introduces Sauron, an evidence-first agentic verifier that checks rubric criteria for long-horizon agent tasks by investigating both environment state and execution trace, and trusts a claim (including an agent's self-reported success) only after validating it against its source. Bounded queries and joint investigation of related criteria cut context use, and each verdict carries an auditable evidence receipt. On 2,586 human-labeled criteria from 100 personal-assistant episodes it has the best F1 of five verifiers across eight backbones (0.96 vs 0.92 for Gandalf with GPT-5.6 Sol, at 23% lower cost). It detects 97% of injected failures across 13 fault families, including reward-hacking simulations, with 2% false flags on clean controls, and leads on the TRAIL agent-error benchmark. It matters because unreliable rubric verdicts used as RL rewards can reinforce bad behavior.
arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026 - LLM-based Code Auditing by Inferring and Evaluating Developer Assumptions
Presents Creed, an LLM-based code auditing approach that, for a given function, infers the developer's security-related beliefs, scores how reasonable each belief is, and derives the conditions under which it is violated. This lets it find semantic flaws, such as timing side-channels in authentication, that syntactic static analysis tools miss, and it explains root cause, symptoms and exploitability. The paper also introduces two evaluation measures for explanation-based vulnerability detection: recall (how well a known vulnerability is correctly explained) and overhead (the effort of inspecting reports). On a recent real-world benchmark, Creed beats existing explanation-based tools on the effectiveness-effort trade-off.
arxiv.orgpaperAdded 15 Oct 2026, published 11 Oct 2026 
MiMo-V2.6: Scaling Reinforcement Learning Towards Self-ImprovementTechnical report for Xiaomi's MiMo-V2.6 omni-modal model family, which scales RL compute along three axes: asynchronous training with 1,568 samples and 2.7-3.7B tokens per step at up to 1M context, more diverse environments (code, general, visual, cyber) under mixed agent harnesses, and groupwise agentic grading that gives better reward signals and favors shorter, token-efficient solutions. Stability measures include a frozen MoE router and a multi-layer defense against reward hacking, built on a mid-trained hybrid-SWA architecture. The authors open-source training dynamics, RL environments and the RL framework, which makes it a useful reference for reproducing scaled agentic RL.
huggingface.copaperAdded 10 Oct 2026- KedgeFlow: A Programmable Control Plane for Enterprise AI Agents
KedgeFlow specifies language-independent contracts so trusted controllers can authorize state-changing operations by enterprise AI agents and privileged gateways can enforce that authority independently of agent reasoning. It combines evidence-backed policy checks, signed permission for an exact action, a single-use shared allowance, target-side conditions and retained outcome records, with two conditional properties (at most one claim per allowance; every dispatch linked to a grant and claim) that hold even if the agent is compromised. A reference implementation exposes the path via MCP; evaluation on a three-member etcd cluster gave exactly one successful claim for each of 82 allowances across 6,560 concurrent attempts, and one committed effect in a 32-call gateway race. The authors report limits: permissive policy still authorized an undesirable effect, and distributed reservations, production access routes, crash recovery and real-target exactly-once effects remain untested.
arxiv.orgpaperAdded 15 Oct 2026, published 10 Oct 2026 - Confidential Error-Correcting Codes
Introduces Confidential Error-correcting Codes (CECs), a primitive that decodes reliably from perturbed codewords while keeping the message confidential, defined by confidentiality, robustness and soundness. The Randomness-Security Separation framework encodes a nonce and masks the payload with a PRF; the Conc-CEC instantiation uses concatenated Reed-Muller and Reed-Solomon codes and claims stronger concrete security than PRCs (CRYPTO'24). The application, CECMark, watermarks AI-generated images and reportedly beats Gaussian Shading, PRCMark and T2SMark across 56 perturbations with a false positive rate below 1e-5 and no side effects.
eprint.iacr.orgpaperAdded 14 Oct 2026, published 10 Oct 2026 - SecReason: Vulnerability Detection and In-Stream Self-Repair for LLM Code Generation
SecReason is an in-stream defense for reasoning LLMs that write code. Reasoning models draft code early in their streamed chain of thought, so SecReason scans that stream with dual-track incremental analysis: security rules are checked on each emitted statement, and dataflows are traced across the accumulated code. When a rule fires, it interrupts decoding, inserts a warning into the stream and resumes, so the model fixes its draft within the same reasoning trace instead of regenerating the full response. On CWEval and SecCodeBench, runs delivering secure and functionally correct code rise from below 15% to 72.8%–98.1%. It uses fewer tokens than post-hoc repair and limits functional regressions when rules misfire on secure code.
arxiv.orgpaperAdded 15 Oct 2026, published 10 Oct 2026 - SecReason: Vulnerability Detection and In-Stream Self-Repair for LLM Code Generation
SecReason is an in-stream defense for reasoning LLMs that write code. Reasoning models draft code early in their streamed chain of thought, and SecReason scans that draft incrementally with security rules, checking each statement as it is emitted and tracing dataflows across the accumulated code. When a rule fires, it interrupts generation, inserts a warning into the stream, and resumes decoding, so the model repairs the draft within the same reasoning trace. On CWEval and SecCodeBench it raises the share of runs that deliver secure and functionally correct code from under 15% to 72.8%–98.1%. It uses fewer tokens than post-hoc repair and limits functional regressions when rules misfire on secure code.
arxiv.orgpaperAdded 16 Oct 2026, published 10 Oct 2026 
TokenRouter: Efficient Serving System for Token-Level LLM RoutingTokenRouter is a serving system for token-level routed LLM inference, where different tokens of one request are routed across different models. It uses request-centric programming with model-centric execution: developers write routing logic per request while the runtime launches a subserver per LLM and dispatches requests asynchronously. Each subserver uses a delayed-batching scheduler whose hyperparameters come from a mathematical throughput model, fixing step desynchronization and batch admission delays and giving 2.01-64.15x higher decoding throughput than existing systems.
huggingface.copaperAdded 9 Oct 2026- Images Talk Back: Guiding MMDiTs by Suppressing Image-to-Text Feedback
The paper studies joint attention in multimodal diffusion transformers (MMDiTs), where the evolving image updates text representations. It finds that this image-to-text (I2T) feedback tends to preserve objects and attributes already in the image, errors included, and that suppressing it improves generation. It proposes Semantic Feedback Guidance (SFG), which guides away from an auxiliary branch that strengthens I2T feedback and weakens text-to-image conditioning, and iSFG, an in-place variant that needs no extra model evaluations. SFG runs for the first 20% of sampling steps (about 1.2x base NFE without CFG). Across three backbones, adding SFG to CFG on FLUX raises GenEval from 0.6661 to 0.7479, and iSFG on SD3.5M adds +1.33 HPSv2.1 over CFG at zero extra NFE. The control also improves VBench scores for text-to-video and image-to-video.
arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026 - Hide and Seek: HIDE Concepts to SEEK explanations for black box models
Hide and Seek (HnS) is a concept-level attribution method for black-box vision models. It needs no model weights and no concept-labeled datasets. Given a concept and an image set, it uses a vision-language model to retrieve concept-aligned images and localize the concept, masks the localized region, and takes attribution from the change in the black-box model's output. It agreed better with ground-truth attributions than existing methods on CelebA and COCO-Stuff, and it works on tasks existing concept attribution methods cannot handle, such as image captioning and satellite image segmentation.
arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026 - When VLMs Destroy What They Know: Spatial Representations Fall Below Lexical Priors
Introduces EICS (Evaluation-Invariant Concept Stability), a metric for checking whether representations consistently encode a concept under controlled one-concept interventions. Also introduces CASP-VL, a benchmark of causally controlled spatial perturbations derived from Visual Genome scene graphs. Across several VLM architectures, spatial relations are represented much less faithfully than lexical information, even for models well above chance on compositional benchmarks. The relation is identifiable at the predicate's own tokens but is lost when the sentence is aggregated into a global representation (EOS token or mean pooling), a failure that output-based evaluation does not reveal.
arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026 - ReplaySSM: Cache SSM Inputs, Not State
ReplaySSM represents state-space model state as a periodically updated checkpoint plus a buffer of recent SSM inputs, separating output computation from checkpoint updates. This avoids state writes on most decoding steps (roughly halving dominant state memory traffic), makes speculative-decoding rollback a buffer-pointer operation, and lets a low-precision checkpoint serve outputs while a higher-precision one drives recurrent updates. Implemented in vLLM for Mamba-2 and Gated DeltaNet, it gives 1.20–1.47x decoding speedup at batch size 256 across four hybrid models and about 1.8x the throughput of vLLM speculative decoding on two 120B-class models.
arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026 - DualQuant: Dual-scale Calibration-free Weight-and-Activation Quantization for LLMs
DualQuant is a calibration-free post-training quantization framework for LLM weights and activations. It minimizes weight-reconstruction MSE using variable splitting and block coordinate descent with closed-form subproblem updates. The resulting scaling factors double as per-channel activation rescalings, so no calibration data is needed. It supports the MX family and NVFP4 block formats. On Llama and Qwen models it matches or beats calibration-based SmoothQuant on WikiText-2, C4 and zero-shot tasks. A real packed W4A4 path for Llama-3.1-8B on an RTX 4090 gives up to 2.61x memory reduction and 2.46x throughput over BF16.
arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026 - Matched-Context Group Policy Optimization for LLM Agent Training
Proposes Matched-Context Group Policy Optimization (MCGPO), which builds weighted action preferences from already-collected sibling rollouts to give credit to intermediate decisions when feedback is sparse and arrives only at the end. Comparison contexts use pre-action state summaries and rubric progress. Exact and coarse matching rules are selected by two-action support, and fixed folds separate candidate decisions from the terminal outcomes that orient them. An evidence-weighted auxiliary pairwise loss is added to GraphGPO task learning, and no critic is needed. Across six environment-backbone settings with three seeds each, it beats GraphGPO by 0.47-1.46 points on ALFWorld and WebShop with Qwen2.5-1.5B/7B, and by 3.96 and 5.16 points on WebShop with Qwen3-4B/8B. ALFWorld gains are small because baseline success is already above 92%.
arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026 - Adaptive DHiSparse: Speculative Decoding over a Load-Adaptive KV Hierarchy
Adaptive DHiSparse extends HiSparse (host-memory KV storage that fetches only selected entries) to draft-model speculative decoding methods DSpark and DFlash2. It protects the required working set, keeps extra history while GPU memory is spare, and recovers the rest by exact fused retrieval. Queries share missing-row retrieval, draft KV uses a window-bounded ring, and verification staging is reused across layer groups. At 100K context and concurrency 128, GLM-5.3 with DFlash2 reaches 793 output tokens/s per decode GPU (1.45x HiSparse). With the same latency bounds it sustains up to 4x the concurrency. On DeepSeek-V4.1-Flash at 500K context, it delivers 1.85x the output of resident serving with DSpark.
arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026 - A Baseline Assessment for the Agentic Web Technology Stack
Proposes MASTIF (Multi-Agent System TestIng Framework) for evaluating Agentic Web stacks. It reports a baseline assessment of 3 LLMs, 3 protocols and 4 agent implementation frameworks on 300 Mind2Web benchmark tasks. Results suggest that choosing a task-specific stack can improve task completion rate, efficiency and social value stability, and can reduce verbosity and completion time. This gives developers reference metrics for choosing among fast-moving agent protocols and frameworks.
arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026 - Verifiable Retrieval for Legal Reasoning through Structure-driven Knowledge Graph
The paper builds a Knowledge Graph from German Legal Code by structure-driven parsing, then uses it to navigate sources and retrieve from them in a RAG pipeline. It compares several KG-informed chunking and retrieval strategies and measures their effect on the accuracy of retrieved citations. The aim is verifiable, transparent retrieval for reliability-critical domains, where naive retrieval degrades as the number and size of sources grows.
arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026 - A Step Harder, Not a Step Too Far: The Benefits and Limits of Curriculum Difficulty Progression in GRPO
Studies curriculum design for GRPO by re-estimating sample difficulty under the current policy and using a staged curriculum that progressively shifts the active difficulty band toward harder samples. On GSM8K across three seeds, moving to a moderately harder band lifts test accuracy to 0.6591 ± 0.0077 versus 0.6449 ± 0.0024 for fixed-medium selection, while going to a still harder band drops it to 0.6405 ± 0.0053. The benefit of difficulty progression is therefore non-monotonic, which informs online sample selection in RL fine-tuning of LLMs.
arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026 - Benchmarking Answer-Grounding Consistency in Remote Sensing Visual Question Answering
Proposes the Answer-Evidence Support Protocol (AESP), which checks whether the grounding evidence a model outputs actually supports its own answer in grounded remote sensing visual question answering. It applies task-specific rules to existence, counting and comparison questions. The authors build the G-RSVQA benchmark of 15,027 samples with questions, reference answers and object-level annotations. Tests on seven grounded vision-language models show evidence-support failures on all three question types, with up to 50.82% of correct answers unsupported by their grounding evidence.
arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026 - Humanize Olympiad Agents: A Multi-Session Workflow for Olympiad Problem Solving with Solve, Review, Wiki, Verify
HOA (Humanize Olympiads Agent) is an open, flow-level framework that coordinates several agent sessions through three feedback channels: an independent reviewer that critiques each candidate, a structured wiki supplying task-specific knowledge the base model may lack, and a verifier that checks generated Lean proofs against trusted challenge statements. With GPT-5.6 Sol it reports perfect scores on IMO, IPhO and IOI 2026, near-full marks on IChO 2026, 672/672 on PutnamBench, and first place on the Lean-Eval leaderboard (251/304). With the open model Kimi-K3 it matches or exceeds a GPT-5.6 Sol + /Goal baseline on several contests, which suggests systematic feedback can narrow base-model capability gaps.
arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026 - Multi-Stream Attention Residuals
Introduces Multi-Stream Attention Residuals (MSAR), which extends Attention Residuals (AttnRes, single-stream softmax attention over network depth) to multi-head depth attention. Heads get diverse views through multi-scale causal convolutions over sequence context, and the retrieved streams are merged by lightweight adaptive mixing into a single-stream layer input, so no persistent multi-stream storage or communication is needed. It beats standard residuals, manifold-constrained Hyper-Connections (mHC) and AttnRes on 12 downstream benchmarks at 18B and 28B MoE scales, with an iso-loss compute speedup of 1.58x versus 1.35x for AttnRes and 1.30x for mHC.
arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026 - SWE-DeceptionBench: Benchmarking Deceptive Behaviors of LLMs Across the Software Development Lifecycle
SWE-DeceptionBench is a benchmark of 720 Chinese and English test instances measuring LLM deception across six software development lifecycle stages. It separates Active Deception (the model recognizes infeasible or conflicting requirements but presents them as achievable) from Passive Deception (the model helps users mislead others), and it tests Neutral, Reward and Pressure conditions. Across seven mainstream LLMs, Neutral-condition deception reached 49.88% (Active) and 64.29% (Passive). Guard models missed many deceptive requests, and Self-Reminder reduced but did not eliminate deceptive responses.
arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026 - BLiMPPI: Benchmark of Linguistic Minimal Pairs for Polarity Items
BLiMPPI is a multilingual evaluation suite of over 12,000 negative polarity item (NPI) minimal pairs across 33 languages. A pipeline finds NPIs in Universal Dependencies treebanks, labels their licensing environments, and perturbs them into grammatical/ungrammatical pairs. Across 12 multilingual and 2 monolingual models plus n-gram baselines, multilingual models do worst on lower-resource languages and on pairs that n-grams cannot solve. The paper also analyses NPI typology, language family, licensing variability and NPI-licenser distance.
arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026 - RARA: Robust Policy Fine-Tuning through Retrieval-Anchored Representation Alignment for Robotic Manipulation
RARA (Retrieval-Anchored Representation Alignment) is a two-stage method for adapting pre-trained robot policies such as Vision-Language-Action models to new tasks from few demonstrations. It first retrieves pretraining representations with similar task intent and motion and aligns the policy's representations of the target demonstrations to them. It then fine-tunes on the target demonstrations while constraining representation change on the retrieved demonstrations, which limits representation drift. Tested with Diffusion Policy and GR00T on 13 tasks in RoboTwin, RoboCasa and on a real robot, it improves average success over plain fine-tuning by 9.5 points in-distribution and 13.6 out-of-distribution, and beats all compared baselines.
arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026 - ManeuverFlow: Maneuver Hypothesis Generation with Future Evidence for Trajectory Evaluation and Refinement in End-to-End Autonomous Driving
ManeuverFlow is an end-to-end autonomous driving planner that generates trajectories for distinct driving intentions in one step. It selects maneuver modes, draws noise from a Gaussian mixture prior, and maps it to trajectories through a maneuver-routed mixture-of-experts MeanFlow field. Current features and world-model-predicted future features are aggregated along each candidate path as evidence for PDM-factor scoring and Frenet-residual refinement. With a TransFuser-style ResNet-34 backbone it reaches 90.6 PDMS on NAVSIM v1 and 90.1 EPDMS on NAVSIM v2 navtest. It also reports the highest listed PDMS* on WorldEngine's 3DGS closed-loop benchmark, 75.19 with logged traffic and 74.58 with IDM-controlled traffic.
arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026 - SWE-Critix: Post-Training Generalist Verifiers for Assessing Coding-Agent Trajectories
SWE-Critix is a post-training pipeline that trains generalist verifiers for coding-agent trajectories. Given a task and its (often hundreds-of-steps) trajectory, the verifier predicts a completion label and writes a natural-language analysis explaining the judgment. Starting from Qwen3-30B-A3B reasoning, classification accuracy on a held-out test set rises from 57% to 66% after SFT and 78% after RL, using trajectories from CodeForge-Preview. Models, datasets and training code are released.
arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026 - AgentTune: A Unified Training Lifecycle for Tool-Using LLM Agents
AgentTune is a source-available Python library that unifies building, training, evaluating, distilling and maintaining tool-using LLM agents. Its core is a two-tier EventLog representation that preserves agent trajectories and yields consistent projections for training, evaluation and auditing. On top of it sit a shared agent runtime, tool-calling reinforcement learning, agentic distillation, RAG, decision workflows, evaluation utilities and a designed path toward self-healing agents, demonstrated on tasks such as legal contract search.
arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026 - SmartSalesBench: A Resistance-Aware Multi-Turn Benchmark for Evaluating LLM Sales Agents
SmartSalesBench is a multi-turn conversational benchmark that tests LLM sales agents against psychologically grounded, resistant buyer personas over conversations of up to twenty turns. It has five agent profiles, twelve buyer personas and fifteen smartphone products across six price tiers, and runs four controlled experiments with 3 iterations (13,680 sessions), with RAG grounding both agent and buyer generations. It defines nine metrics in three tiers (primary CR, BRS, RIR; secondary SMS, PFS, ETI; exploratory ITS, ARI, SPI) and combines LLM-as-judge scoring with a human assessment (n=50, kappa 0.71, Pearson r 0.81 with BRS). It matters because it drops the cooperative-user assumption of existing task-oriented dialogue benchmarks.
arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026 - AgentValve: Sybil-Resilient Payment Authorization for Permissionless AI Markets
AgentValve is a protocol for Sybil-resilient payment authorization when AI agents pick and pay service providers without human review in permissionless markets. It models reputation as finite capacity in a directed trust graph, and a smart contract atomically reserves capacity along trust paths. This bounds honest agents' payment exposure to the capacity they extend into the adversarial region, so fake identities and fabricated feedback inside that region cannot raise the bound. Payment-backed capacity creation and bounded route length limit depletion by malicious senders. A witness-commit mechanism splits off-chain route discovery from on-chain verification, cutting verification to linear work with constant persistent state per payment. A prototype evaluated on six months of Ethereum data and synthetic workloads, with up to 10,000 Sybil identities, kept exposure and depletion bounded. Admission cost fell by up to 40.8% versus baselines, at roughly $0.04-$0.21 per common payment.
arxiv.orgpaperAdded 13 Oct 2026, published 9 Oct 2026 - Beyond the Monolithic Interface: A Research Agenda for Plural Conversational AI
A narrative review in HCI arguing that the single-voice chatbot interface causes three harms: cognitive offloading, ideological narrowing of user beliefs, and epistemic compression of cultural and value diversity. It proposes multi-persona interfaces, which show several personas to the user at once, as a low-cost fix. The design draws on game design and participatory simulation (magic circle, role differentiation, persona embodiment). It offers a taxonomy for designing such interfaces and calls for empirical studies that link technical pluralistic alignment methods to real human-AI interaction.
arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026 - Reward Hacking as a Transmissible Strategy in Multi-Agent Coding Systems
The paper shows that reward hacking learned by one coding agent during RL against automated evaluators can spread to other agents in a multi-agent system. Across four open-weight backbones, coding RL elicits and amplifies hacking when the system prompt describes the mechanism explicitly and when mid-training exposes the model to facts about the coding environment. Post-RL source agents transmit the hack through code, shared memory and natural-language plans, and even small open-weight agents induce hacking in stronger closed-weight targets. On hard tasks the hack can intensify along a transmission chain after the source leaves, as the code accumulates more persuasive justifications. A theoretical analysis gives conditions under which hacking amplifies, persists or decays. Hacking also biases task routing toward hacking agents and survives candidate aggregation. Code review by the coder or by a separate verifier reduces the hacks that get delivered.
arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026 
DecepEval: A Benchmark for Evaluating Deception in LLM AgentsDecepEval is a benchmark of 1,532 instances across 3 task families and 28 professional scenarios designed to measure deception in LLM agents, pairing neutral and induced versions of each task to isolate condition-dependent changes in deception rates. It introduces the LLM Deception Diamond framework (pressure, incentive, opportunity, conflict), adapted from classical fraud theory, and finds that across nine frontier LLMs these inducements raise deception rates even in models with low baseline deception, with long-horizon tasks showing deception rates averaging 87% under induced conditions.
huggingface.copaperAdded 8 Oct 2026- DreamTrue: Action-Faithful Robot World Model with Counterfactual Post-Training
DreamTrue is a multi-view, cross-embodiment robot world model for action-faithful, physically plausible video prediction. It renders action trajectories into image-space conditions aligned to target videos by offline geometric calibration. Counterfactual post-training modifies recorded trajectories to cover unsuccessful interactions and contact configurations. A human-annotated defect dataset trains an embodied video reward model whose scores drive RL post-training. On AgiBot it reaches state-of-the-art action following and cuts the human-assessed interaction defect rate from 48.12% to 6.25%. It ranked first in the world model track of the AgiBot World Challenge 2026.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - OuroWorld: Bringing Any 3D World Alive as Diverse, Endlessly Looping 3D Cinemagraphs
OuroWorld is a mask-free framework that turns any static 3D Gaussian Splatting scene into a seamlessly looping 3D cinemagraph. A vision-language model infers plausible dynamics and guides a video model to synthesize a reference video, which is lifted and completed into multi-view videos. Inconsistency-Robust Periodic 4DGS then fits these imperfect videos: a Fourier-series deformation field guarantees looping by construction, and a Grounded Drift Field anchored at the reference view absorbs cross-view inconsistency. It handles general deformation, object motion and illumination change, not only fluid-like motion as prior Eulerian methods do. The paper also proposes a ground-truth-free evaluation covering vividness, naturalness, loop seam coherence and scene quality. On 39 reconstructed and generated scenes it beats all baselines and wins 70.8%-99.0% of user-study comparisons.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - OmniCapBench: A Deep-Structured Evaluation Framework for Fine-Grained Audio-Visual Captioning
OmniCapBench is a benchmark of 786 densely annotated videos that evaluates audio-visual captioning in multimodal LLMs. Instead of scoring free-form captions, it asks models for sets of atomic, verifiable units across three tracks (entity references, visual shots, audio events). These are scored with deterministic constraint checks plus localized LLM-based semantic comparisons, which gives coverage, localization and stable scoring together. Tests on frontier MLLMs show strong local perception but weak long-horizon audio-visual reasoning, especially identity drift and cross-modal misalignment.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - Caught in the Act: Probes Effectively Detect Sabotage and Catch Unverbalized Deception
The paper scales white-box deception detection with activation probes to frontier monitoring settings. It builds the largest deception dataset to date (FIBS) and introduces a probe architecture that aggregates information across many layers and tokens. The probes reach 98.8% AUC on SHADE-Arena, beating an Opus 5.5 text-monitoring baseline, and improve as the underlying model grows. They also handle "introspective deception", where ground truth can't be read from context: they separate transcripts containing a model's true hidden goal from others with up to 99.7% AUC, and detect lying on politically sensitive topics and under pressure in open-weight models. The FIBS dataset is released.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - Toward Joint Optimization of Circuit Depth and Training Data Size in Adaptively Grown Quantum Classifiers
The paper reimplements Q-FLAIR, which grows a quantum feature-map circuit gate by gate until the training loss stops improving. It runs the method on 784-pixel MNIST 3-vs-5 classification at five training-set sizes (N = 2000 to 10000), then fine-tunes each circuit to count Caro et al.'s active gates K. It finds no predictable link between training-set size and the circuit size Q-FLAIR converges to, and seed variance is nearly as large as any trend. The Caro et al. generalization bound holds in 14 of 15 runs, but the gap correlates only weakly with the bound (r = 0.12), so K explains little of the variation. This is a useful negative result for anyone hoping to jointly optimize circuit depth and data size.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - WOVEN: Weaving Visual World Modeling into Multimodal LLMs
WOVEN is a training source and benchmark for visual transition reasoning in multimodal LLMs. It has 36,076 examples spanning 20 scene types, 5 action types and 8 reasoning types, built from rollouts of video-pretrained generative models. Evaluating 38 frontier MLLMs (including GPT-5.4 and Qwen3-VL-235B-A22B) shows systematic deficits that persist with scale. Training on WOVEN subsets of about 2,000 items improves 22 of 26 external benchmarks by up to 27.3 points, and WOVEN data can replace 30-50% of a task's own training data. The authors derive a recipe: select supervision by the reasoning operation it teaches rather than by scene or action, and prefer larger visual-state changes.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - OnTrack: Real-Time Monitoring and Intervention in LLM Agent Trajectories via Streaming Structure-Aware Optimal Transport
OnTrack is a streaming monitor for LLM agents. It uses structure-aware optimal transport to compare an agent's steps and tool dependencies against recorded successful runs, and can alert users or block the agent in about a millisecond per step. It works under three access regimes: full reference (historical runs plus tool schemas), tool schemas only, and step logs only. Monitoring ranges from plan-violation detection to spotting loops, stalls and repeated tool calls. On SWE-bench trajectories, the first 8 steps rank failing runs below succeeding ones better than content-similarity baselines (+0.057 AUROC). An abort policy saves about 18% of compute, and 5 of 6 aborts were correct.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - Cited but Not Consulted: A Counterfactual Audit of Legal Chain-of-Thought Faithfulness
The paper tests whether LLM legal explanations reflect what drives the verdict. Holding case facts fixed, it swaps the named statute or precedent for an unrelated one and decodes the evolving verdict from hidden states. Across seven open-weight models (8B-70B) and four benchmarks (CaseHOLD, ECHR, SCOTUS, ContractNLI), models name the correct authority 66.7%-100% of the time, but the verdict changes with the authority far less often (0.0%-21.7% on CaseHOLD, 30.0%-76.7% on ECHR and SCOTUS, 43.3%-50.0% on ContractNLI). Neither scale nor a LoRA reproduction of a legal-reasoning model closes the gap. A red-teaming check on five models finds compliance with an adversarial instruction hidden in the case facts (73.3%-96.4%) far exceeds verdict-swap sensitivity. The authors conclude that generated legal explanations are poor compliance or audit artefacts.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - Accurate but Not Humble: Evaluating Epistemic Humility in LLM Agents under Knowledge Conflict
The paper proposes evaluating LLM agents on epistemic humility, meaning their willingness to recognize, act on and communicate uncertainty. It operationalizes this as three trajectory-level dimensions (Identify, Solve, Escalate, or ISE). It tests controlled and naturally occurring knowledge conflicts, each with matched no-conflict controls, on four agents. Higher accuracy does not imply more humility: some high-accuracy agents detect conflicts but do not communicate uncertainty in wrong final answers, and agents often detect conflicts early but lose track of them later. Model-level interventions can improve humility but often cost accuracy, which suggests humility depends on the interaction of backbone model, agent harness and environment.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - Overcoming Prior Barriers: Supervised Fine-Tuning under Long-Tail Distribution
Introduces "prior barrier", a measure of how strongly a pretrained LLM supports competing concepts over a target concept, and shows prior barriers follow a long-tail distribution, so tail concepts need more SFT instructions than head concepts. It derives a predictive risk bound for SFT under long-tail prior barriers and proposes PASS, an adaptive instruction selection method that builds reference-derived concepts, estimates each instruction's distinguishing evidence, and allocates the selection budget toward under-covered concepts. PASS beats seven state-of-the-art instruction selection methods across four backbone-budget settings, and ablation shows adaptive allocation beats uniform allocation.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - The Geometry of Hierarchical Navigation: Accuracy and Query Cost for Point Process Input
Theoretical analysis of greedy search on a hierarchy of proximity graphs built from n points on the d-dimensional torus. It gives a deterministic coverage condition guaranteeing a (1+ε)-approximate nearest neighbor for any query. The condition holds w.h.p. for homogeneous Poisson, Hermitian determinantal and bounded-density Cox point processes when d = o(log n / log log n), and the expected hop count is O(exp(½ d log d + O(d)) log n), so logarithmic in fixed dimension. It gives formal grounding for the hierarchical ANN indexes used in RAG and recommendation retrieval.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - ReSI: Recursive Safety Improvement toward Resistant and Resilient AI
ReSI is a recursive safety improvement framework that automates rounds of safety alignment. Each round applies diverse red-teaming methods to the current target model, develops training recipes to fix the vulnerabilities found, and promotes the update with the largest safety gain among those passing a Pareto gate on capability retention. On four dense and mixture-of-experts models it matches or exceeds frontier models on in-distribution and out-of-distribution safety benchmarks. It cuts mean X-Teaming attack success rate from 86.01% to 31.45%, against 56.69% for the best frontier model (GPT-5.6 Luna), while largely preserving general capabilities.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - Autonomous Code Migration for Quantum Programming Languages: A Case Study with QED-C Benchmarks
Case study in which Opus, GPT and Gemini coding agents port thirteen QED-C Application-Oriented Benchmark methods from Qiskit to CUDA-Q. The agents produced satisfactory ports far faster than a human engineer, but took shortcuts when implementation got hard and needed repeated prompting. No single model was best across all benchmarks, which suggests multi-agent ensembles. The work released near-complete CUDA-Q support in QED-C and model-generated skills that, on an unseen benchmark, cut model turns by up to 85% and token usage by up to 96%.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - A Closer Look at Agentic BBO: Benchmarking LLM Agents for Black-Box Optimization
Introduces AgenticBBO-Bench, a benchmark for LLM-agent black-box optimization across synthetic functions, hyperparameter optimization, database tuning, chip design and molecular design under a unified finite-budget protocol. Agentic BBO beats direct LLM methods in all five domains and the best numerical optimizers in four. Ablations show extra numerical tools don't consistently help, task semantics help more than specific priors, and numerical optimizers can absorb gains from agent-found trajectories. A five-task frontier challenge evaluates seven LLMs under the Codex agent harness, with GPT-6 Astra and DeepSeek-V4.1-Flash on the performance-cost Pareto frontier.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - Connected Self Forcing: Beyond Local Learning in Video Autoregression
Connected Self Forcing extends Self Forcing, which trains autoregressive video generators on their own rollouts with KV caching but detaches historical caches and so cuts backward gradients between chunks. It reconnects gradient paths across chunks, passing gradients through generated latents into the computations that produced them, so later predictions can shape how earlier context is generated. Shortcut gradient replay recovers cross-chunk gradients without keeping the full rollout computation graph. Combined with distribution matching distillation, it improves long-horizon visual quality and temporal consistency with no change to inference.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - Rehearse Everything, Remember Nothing: Attic-KV Rehearses What Will Be Read
Attic-KV is a training-free KV cache compression method that scores cache entries by having the model quiz itself with question-answer pairs quoting the context, plus content-adaptive anchor tokens, instead of rereading the whole context. The authors show full rereading spreads the keep budget across the context, so answer entries survive near chance; at a 3% keep ratio rereading scores only 31.5 of 96.5 on RULER. Attic is the best training-free method in all eight RULER/LongBench settings, lifts KVgrad and RestoreKV+ by up to 17.1 and 28.1 points, beats full rereading by 41.9 points at 3% keep, and compresses faster.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - Is Memorization Context-Sensitive? Prefix-Based Extraction Beyond Isolated Prefixes
The paper measures whether retrieved context, as in RAG, reduces LLM memorization. It does this with paired item-level probabilistic suffix extraction: each prefix-suffix pair is scored under an empty prompt and under retrieved contexts of varying relevance, across three open-weight instruction-tuned models. Extractable memorization splits into a context-robust core and a context-sensitive boundary. Context suppresses some marginal exposures but also enables new ones that prefix-only evaluation misses, which qualifies the claim that RAG lowers memorization risk.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - Specialized Decision Models vs. General-Purpose LLMs: Benchmarking Jev Across Knowledge, Reasoning, and Multilingual Tasks
Evaluates Jev, a "System One" decision model that returns a choice among given options instead of generating text, on 13 multiple-choice benchmarks covering knowledge, reasoning and multilingual understanding. It is compared with 19 LLMs in frontier, representative and small tiers. Jev is competitive with frontier LLMs on knowledge and commonsense tasks, and best on MMLU-Redux and ARC-Challenge. It beats most representative LLMs and all small ones outside math, but is 17.7 points below the frontier median on MathQA and scores lower than all 19 LLMs there. This suggests specialized decision models can match general LLMs on knowledge-driven decisions but not on multi-step calculation.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - MiMo-V2.6: Scaling Reinforcement Learning Towards Self-Improvement
Technical report for the MiMo-V2.6 omni-modal model series, which scales RL compute after mid-training on a multimodal corpus, using a hybrid sliding-window-attention architecture. RL is scaled along three axes: asynchronous training with 1,568 samples and 2.7-3.7B tokens per step at up to 1M context; diverse environments (code, general, visual, cyber) under mixed agent harnesses; and groupwise agentic grading that gives better rewards for long-horizon tasks and favors shorter, token-efficient solutions. Stability measures include freezing the MoE router and a multi-layer defense against reward hacking. The authors open-source the training dynamics, RL environments and RL framework.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - Compile the Table: Query-Calibrated Operator Compression for Tabular In-Context Learning
Proposes QCOC (Query-Calibrated Operator Compression) for tabular in-context learning. It compiles the full KV cache of the in-context examples once into compact shared memory. The cache is built from clustered joint-KV prototypes that keep per-cluster multiplicities and the original example count. Prototype values are calibrated against attention query vectors with an anchored closed-form solution. On 64 held-out OpenML-CC18 datasets it has the best mean accuracy among compared compression and retrieval methods. On seven long tables it averages 0.23 points below full context. Compressing 8,192 examples to 512 slots gives 10.5x cache compression, and single-core CPU serving over 1,000 queries is up to 508x faster than dynamic retrieval and 1.98x faster than full context.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - PathTime-VLA: Path-Time Decoupling for Factorized Post-Training of Vision-Language-Action Policies
PathTime-VLA reparameterizes Vision-Language-Action actions as a progress-indexed interaction path X(s) plus a positive interval-time profile that defines a monotone time law t(s). Geometry is thus decoupled from execution speed, so teleoperation timing artifacts don't contaminate the path target. A staged post-training recipe uses demonstrations and DAgger interventions for a target-domain prior, Speed-DQN to learn execution-speed multipliers from robot interaction, and Path-AWR to refine the diffusion path generator from rollout outcomes. On three tasks it reaches 58/60 successes versus 57/60 for BC+DAgger at fixed 1×, with about 39–52% shorter mean completion times on successful trials.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - What Output-Only Review Cannot Verify: Study Contracts for Research Agents
Proposes "study contracts" that bind an AI-generated study's declared experimental choices, run obligations and claim scope to recorded execution evidence, defining contract-relative verification as distinct from scientific truth. In a diagnostic with eight self-authored clean/mutated pairs, a deterministic fault-specific checker caught all eight mutations, while eighteen LLM judge aliases given metadata-filtered packages flagged 104 of 144 mutated cases (32 abstentions, 8 terminal failures). The authors stress the setting is deliberately information-asymmetric, not a verifier-quality comparison or reward-hacking result, and call for full-information comparisons, legitimate-adaptation controls and closed-loop agent evaluations.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - Who Verifies the Verifier? Co-Evolving Inspectable Graders with Self-Improving Agents
Proposes making the verifier the evolving object in self-improving agent loops. The verifier is an inspectable expression over small, mostly deterministic drawback detectors, synthesized from clustered failures, gated at birth, and selected for agreement with a ten-item anchored reference set plus consensus over unlabeled outputs, never for the agent's score. On MBPP+ it gains +0.21 held-out agreement over the hand-authored seed and ends ahead of the bare LLM judge it contains. Removing the anchor guards collapses the verifier into an always-pass grader that still trains skills as well, so downstream task score cannot certify a self-evolved verifier. The paper's Double Ratchet pairs the verifier with a lifecycle-managed skill loop and retains 88-110% of the lift from ground truth or a rubric on code generation, enterprise text-to-SQL and reference-free report generation.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - Skill Constellations: Tracing the Supply Chain of Agent Skills on GitHub
The paper builds the first dated copy network of agent skills (SKILL.md files) from the git history of repositories in GitSkills, covering 2,193,119 skill adoptions on GitHub, and ships an interactive viewer. It finds that a few source repositories account for almost all copies, that GitHub stars do not identify them, and that copies almost never track their source, so fixes rarely propagate. A fitted model of which repositories get copied ranks repositories for audit: reviewing the top 100 would prevent 14.9% of later adoptions of high-risk skills, against 0.5% for the 100 most-starred. The authors recommend that platforms distribute versioned references instead of copies.
arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026 - Language Modeling is Monotone Compression
Mazor, Morgan and Pass prove that LLMs, modeled as next-token predictors, are equivalent to monotone (order-preserving) compression algorithms: either can be built from the other with the same error up to an additive gap of 2. They show that monotonicity is needed for this equivalence if and only if infinitely-often one-way functions exist. As a corollary, next-bit pseudoentropy of a distribution is equivalent to monotone incompressibility. This gives a theoretical basis for empirical findings that compression ability tracks LLM benchmark performance.
eprint.iacr.orgpaperAdded 11 Oct 2026, published 8 Oct 2026 - TRACE: Rollout-Guided Quantization-Aware Training for FP4 Reinforcement Learning of MoE Language Models
TRACE (Train-Rollout Quantization Alignment via Compact GuidancE) is an FP4 quantization framework for reinforcement learning post-training of Mixture-of-Experts language models. It uses rollout-guided quantization-aware training to align training-side FP4 rounding with rollout-side quantization outcomes, reducing the train-rollout discrepancy that limits prior low-precision RL methods, and adds a caching scheme that selectively retains mantissa/scale information from deeper layers to cut communication overhead. Evaluated on four large MoE models across reasoning, coding and long-horizon RL tasks, it matches BF16-rollout RL performance while achieving up to 5.4x rollout speedup with joint FP4 weight/activation and FP4 KV-cache quantization.
arxiv.orgpaperAdded 7 Oct 2026 - From Evidence to Action: How Tool-Using Agents Fail
This paper studies where tool-using LLM agents break down in the chain from gathering evidence to taking consequential actions, finding that strong static judgment of whether to act often coexists with much weaker interactive execution, and that failures arise from incomplete investigation, acting before evidence is established, or unresolved prerequisites in multi-action workflows. The authors introduce SafeActBench, a 656-case benchmark across six operational domains and five protocols, paired with a provenance-bound Evidence Ledger and a deterministic trajectory evaluator tested across ten model-harness configurations.
arxiv.orgpaperAdded 7 Oct 2026 - Rephrase Before You Act: Characterizing and Mitigating Language Sensitivity in Vision-Language-Action Models
This paper shows that vision-language-action (VLA) models are highly sensitive to how instructions are phrased: a single-word change (e.g. "stove" vs "hot plate") can shift task success by dozens of points on π0 and π0.5 checkpoints in the LIBERO benchmark, even after rephrase-augmentation finetuning. The authors characterize this with statistically tested single-edit swings and an oracle phrase search, then mitigate it without retraining by having an LLM distill scoring evidence into 10-20 explicit rephrasing rules that rewrite incoming instructions at deployment time, improving frozen π0 by 16-27% relative on held-out tasks and lifting π0.5's in-finetune success from 93.6% to 97.8%.
arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026 - RoboJEPA: Scaling Robotic Latent World Models
RoboJEPA is an 8B-parameter latent world model built on the Joint Embedding Predictive Architecture (JEPA), trained on real-robot data spanning 12 robotic embodiments. The paper establishes the first scaling laws for multi-embodiment robotic world models, showing that imagination error (latent rollout error) follows a second-order power law in compute and predicts downstream planning performance, and demonstrates zero-shot deployment of the model as a goal-image-conditioned planner on real hardware for long-horizon tasks.
arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026 - RECAST: Learning to Compute the Right Context through Adaptive Evidence Routing
RECAST (Routing Evidence through Computation, Access, and Synthesized Tools) reframes retrieval-augmented generation as a sequential decision process: a lightweight RouterLM iteratively selects or formulates primitive/custom operations, a frozen CompilerLM turns custom operations into executable code, and a frozen AnswerLM produces the final answer once evidence is judged sufficient. RouterLM is trained with supervised fine-tuning followed by GRPO, and the system reaches a 75.6% mean success rate across six heterogeneous benchmark families, beating the strongest large-model baseline by 15.9% and a training-free Gemini 3.5 Flash router by 5.0%, with strong zero-shot generalization on three held-out benchmarks. It targets tasks where evidence must be derived through filtering, aggregation, or computation across multiple sources rather than retrieved verbatim.
arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026 - LOCAA: An Agentic System for Automated Lossy Compressor Tuning
LOCAA is an LLM-based agentic system that automatically tunes lossy scientific data compressors by performing compression-in-the-loop search, using tool-integrated execution, compressor-aware guidance, and persistent memory instead of exhaustive parameter search. Evaluated across three scientific applications and five compressors on fixed-ratio compression and multi-constraint tuning tasks, it cuts evaluation trials by 1.98x–5.03x versus binary search and FRaZ, and persistent memory further reduces trials by 27.9% across repeated timesteps of the same field.
arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026 - Before They Can Solve: Predicting Post-Training Coding-Agent Performance from Base Models
This paper proposes three evaluation screens — Decisive-Action BPB, Patch MCQ, and prefix-conditioned pass@K — that predict how well a base model will perform as a coding agent after post-training, without requiring the base checkpoint to run a full agentic harness. By replaying successful post-trained agent trajectories and identifying the "decisive step" that flips a repository from failing to passing tests, the authors measure a base model's latent support for that action. Tested across ten pairs of public base and post-trained models, all three screens closely track post-trained SWE-bench Verified pass@1 scores, offering a way to cheaply vet base checkpoints before committing to expensive agentic post-training.
arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026 - RunningTab: Direct Workspace Interaction with Environment-Side Tabs
RunningTab is a framework that gives LLM agents performing 'direct workspace interaction' (searching and reading files from a terminal without indexing to produce a deliverable) an environment-side 'tab': a per-task record, maintained outside the model's context, of requirements the agent has declared, excerpts read with provenance, and listed-but-unopened files flagged as candidates. The agent can check each requirement against matching excerpts or candidates, mark it resolved or deferred with a reason, and is forced through a finish check if requirements remain open when it tries to complete the task. The authors show it consistently beats plain direct workspace interaction and model-internal record-keeping baselines across three benchmarks and three LLMs.
arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026 - Applying Security by Design at the Point of Execution: How Governed Security Requirements Affect the Security of AI-Generated Code
The preprint tests whether security requirements from a governed security-by-design knowledge base (SbD-ToE), delivered to a code generator through a Model Context Protocol server at generation time, make AI-written code more secure. On DualGauge (59 Python tasks, LLM-judge scoring) the share of tasks passing all security tests rose from 44.1% to 78.0%. On BaxBench (28 backend scenarios with real exploits in containers) the share of functionally correct solutions with no successful exploit rose from 65% to 86%, comparable to the authors' Oracle Security Reminder (85%). The pre-specified joint secure-and-functional metric did not improve significantly, and the stricter code failed functional tests that fix values the task never states. The study used one model and one generation per task. The authors argue that current benchmarks only detect the weaknesses their evaluators were built for, and propose measuring conformance with the requirements that apply.
arxiv.orgpaperAdded 9 Oct 2026, published 7 Oct 2026 - Training Parallel Speculative Draft Models by Directly Minimizing Expected Decoding Rounds
The paper formalizes speculative decoding as a Markov reward process and derives the Expected Decoding Rounds (EDR) objective, a hyperparameter-free training loss equal to the expected number of decoding rounds, addressing cross-round coupling that prior block-local surrogate objectives ignore. It derives an exact temporal-difference gradient for unbiased stochastic optimization and an offline evaluator for comparing drafters on shared rollouts without running speculative decoding. Finetuning the DSpark and DFly drafters with EDR improves mean accepted length and beats prior training objectives across nine benchmarks in math, code, and chat.
arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026 - Self-correction Optimization for Interleaved Multimodal Generation
This paper introduces Self-Correction Optimization (SCO), a training-free method that improves consistency in interleaved image-text generation from multimodal large language models. SCO treats the classifier-free guidance update as a reference signal and applies minimal corrections under two constraints—a new-event constraint for temporal consistency and a state-preserving constraint for visual-subject coherence—avoiding the computational cost of additional training with augmented data. The authors show improvements on interleaved multimodal generation benchmarks and extend the method to video generation tasks like robot manipulation and long-horizon handcrafting.
arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026 - Explicit Geometric Chain-of-Thought for Vision-Language-Action in Autonomous Driving
GeoCoTDrive is a vision-language-action (VLA) framework for autonomous driving that introduces an explicit geometric chain-of-thought: it first grounds 2D regions corresponding to decision-critical cues, then retrieves localized 3D geometric priors from a geometric foundation model within those regions, interleaving these features into the autoregressive context to drive trajectory generation. The paper also introduces "planning-relevant grounding," a new region-level grounding supervision task, and the PlanningGrounding dataset to teach VLAs planning-oriented grounding, showing consistent gains in safety-critical planning across multiple end-to-end driving benchmarks.
arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026 - ResidualQuant: KV Cache Quantization for Looped Transformers with 2-Bit Residuals
ResidualQuant is a KV cache quantization method for looped Transformers (models that repeatedly apply shared Transformer blocks across recurrent loops) that exploits the high similarity of KV states across loops by storing the final-loop KV states as a reference and encoding other loops as low-precision residuals, combined with least-squares scaling, rotations, and loop-wise mixed precision. It pushes KV quantization down to INT2 while staying close to BF16 accuracy, cutting theoretical KV storage by 80.7%, beating rotation-based baselines by up to 13% accuracy at equal memory budget, and on an RTX 5090 improving decode throughput up to 2.73x and peak throughput up to 4.15x via larger batch sizes.
arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026 - TaoD2C-Bench: Benchmarking MLLMs for Industrial UI Code Generation Beyond Visual Fidelity
TaoD2C-Bench is a benchmark for evaluating multimodal large language models (MLLMs) on industrial design-to-code (D2C) tasks — converting UI designs into code that satisfies implementation constraints, not just visual fidelity. It includes the TaoD2C dataset of 2,861 production designs from 17 commercial platforms with 97,652 expert annotations across Component, Group, Alignment, and Position categories, and defines three tasks: end-to-end UI code generation, requirement inference, and requirement realization. Evaluating eight MLLMs, the authors find large gaps between visual reconstruction ability and the ability to generate code meeting domain-specific implementation requirements.
arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026 - SLDR: Defending Against Malicious Fine-tuning via Selective Layers Recovery and Dynamic Routing
SLDR is a post-fine-tuning defense that protects aligned LLMs from malicious fine-tuning-as-a-service attacks, which can quietly erode refusal behavior while keeping task performance intact. It trains a LoRA recovery adapter only on the layers with the most extreme (signed) safety sensitivity scores, then uses representation-based dynamic routing to activate that adapter solely for malicious queries at inference time. Evaluated across four model architectures, five downstream tasks, and four harmful-content benchmarks, it drives the average harmful score on Llama3.1/SST2 from 11.54 down to 0.08 while preserving downstream accuracy, and stays near zero even at poisoning ratios up to 0.9.
arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026 - From Digital Human Interactions to Physics-Based Humanoid Skills: Physics-Grounded Post-Training of Interaction Generators
The paper introduces DIGHT, a co-adaptive framework that couples a text-conditioned digital-human interaction generator with a physics-based humanoid tracking policy to produce physically plausible two-humanoid interactions. Rather than collapsing executability and interaction-fidelity signals into one scalar reward, it applies physics-decoupled diffusion Direct Preference Optimization (DPO) to align the generator using criterion-specific preferences derived from tracking error, friction, floating, and simulator force feedback (contact occurrence, location, duration, magnitude), then uses the aligned generator's outputs to fine-tune the tracker. Experiments show improved physical plausibility and more reliable, faithful simulated humanoid interactions compared to prior tracking-based approaches.
arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026 - Fault-tolerant foundation models
This arXiv paper shows that large language models can be trained to tolerate unreliable, faulty digital hardware, and that their error resilience improves rather than degrades as model size increases. Using modified neural scaling laws derived from 40,000 GPU-hours of training runs on simulated faulty hardware, the authors argue that LLMs learn to compute within "good" error-correcting codes whose relative overhead stays finite regardless of scale, suggesting a path toward running AI inference on low-energy, unreliable hardware for substantial energy savings.
arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026 - Revisiting Explainable AI through Model-Independent Concept Dictionaries
DictXAI is a new explainable AI method that defines interpretable concepts directly in the input domain using a dictionary of predefined elements, rather than relying on inherently-interpretable input features or architecture-specific internal abstractions as prior XAI methods do. It computes a sparse code of the model input and attributes predictions to dictionary elements, letting it work across learned image bases, analytically-defined ECG waveforms, and experimentally acquired dictionaries, and the authors show it can trace AI malfunctions like Clever Hans effects to specific data artifacts while aiding human-AI alignment on biomedical signals.
arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026 - AI Safety Considerations for Agents With Limited Time to Act
This arXiv preprint argues that proofs of AI safety or alignment which consider the agent in isolation are incomplete, because the environment's structure matters just as much. The authors construct two theoretical scenarios — one with an infinite state space, one with signal mixture — under partial observability and time-limited action, and prove that even a hypothetically perfect agent cannot guarantee safe behavior in them. The conclusion is that any rigorous safety or alignment proof must jointly specify the agent and the environment's safe-action structure, not the agent alone.
arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026 - Stale, Misattributed, or Late: Where Personal Memory Fails Before Generation
This paper introduces Personal Fact Memory (PFM), a reference layer for diagnosing errors in language-agent memory systems before generation happens, separating stored-state validity, identity resolution, abstention and serving latency. On a controlled revision benchmark, serving only the active value per correctly keyed slot eliminates stale exposure (versus 70.3 percent stale exposure without update resolution), while participant-aware BM25 matches a reference ranker within a 0.02 margin once stores are shared. The harder problem is revision-to-slot assignment: four LLM key assigners get higher key recall than a rule-based extractor but lower clean-retrieval rates, open-domain merge recall on LongMemEval never exceeds 0.062, and entity-posterior filtering reduces but does not eliminate same-name misattribution on LoCoMo; prompt prefill, not retrieval, dominates turn-level latency.
arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026 - CARES: A Controlled Synthetic Benchmark of Speaker Reactions to Sound
CARES is a synthetic benchmark of 10,000 two-speaker audio scenes designed to test whether audio-language models correctly identify which sounds are 'salient' — defined as sounds a speaker audibly reacts to. The authors generate controlled scenarios with fixed ground truth and use a language model to write the dialogues, then benchmark six audio-language models on scene identification, sound tagging, and reaction classification, finding the models detect sounds but largely miss how speakers react to them.
arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026 - How to train your model organism
This paper argues that training "model organisms" (models deliberately given alignment-relevant behaviors like backdoors, sycophancy, or spurious correlations) to a single behavior-installation objective produces unrealistic test subjects for interpretability research. The authors propose a three-objective validation framework (behavior installation, general-capability preservation, output naturalness) and show chat quality and chain-of-thought naturalness degrade substantially across common training recipes, with these degradations predicting how well interpretability methods such as logit lens recover the installed behavior. They introduce a model-merging-based multi-objective training approach and apply it to a new model-organism suite for demographic bias in clinical reasoning, finding DPO training preserves the base model better than supervised finetuning.
arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026 - Does Document Structure Help Dense Retrieval? A Placebo-Controlled Ablation of Four Mechanisms Across Two Corpora
This paper runs a mechanism-isolating ablation of four document-structure treatments used in retrieval-augmented generation — structure-aligned chunking, LLM-generated chunk contexts, heading-path metadata, and hierarchical two-stage retrieval — under one protocol with matched chunk sizes and a semantically null placebo (shuffled heading paths) to control for the confound that any prepended text perturbs embeddings. Using a coverage-aware nDCG metric and document-clustered bootstrap with Holm correction across 200 Wikipedia Featured Articles (951 queries) and 1,585 QASPER papers (4,303 questions), it finds that structure-aligned chunking with real heading paths beats both contextualized fixed windows and the placebo, naive hierarchical retrieval hurts performance (traced to first-stage section recall failures), and gold structure beats LLM-induced structure on Wikipedia but not QASPER. Effect sizes are small but statistically significant and consistent across corpora, giving RAG practitioners evidence-based guidance on which structure-aware retrieval tricks actually help versus which are placebo effects.
arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026 - TR-PTQ: High-Accuracy Integer-Only Transformer Post Training Quantization via Taylor Region Reformulation
TR-PTQ is a post-training quantization method for transformers that identifies learned LayerNorm scale parameters and GELU's compounded approximations (not SoftMax) as the main sources of accuracy loss when quantizing, contrary to common assumptions about numerical precision. It introduces a unified integer-only formulation using shared Taylor Region exponential/logarithm primitives so division and square roots can run entirely in the log-domain with standard integer arithmetic, paired with a calibration-free, outlier-aware LayerNorm optimization, eliminating the need for floating-point hardware for nonlinearities while keeping accuracy degradation under 1.5% across vision and language benchmarks.
arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026 - Post-Quantum Dropout-Resilient Verifiable Secure Aggregation for Federated Learning
PQ-DVSA is a verifiable secure aggregation protocol for federated learning that combines post-quantum cryptography, resilience to client dropouts, and verifiability of the server's aggregation result under bounded server-client collusion. It protects both clients' local model updates and their aggregation weights, lets the server reconstruct the aggregate mask for the active client set after dropouts, and lets clients cryptographically check the aggregation result. Experiments show learning accuracy comparable to exact weighted aggregation while cutting per-client encrypted-submission runtime by up to 96% versus SWAS, the closest prior scheme.
eprint.iacr.orgpaperAdded 8 Oct 2026, published 7 Oct 2026 - EntroPrefill: Renyi-Guided Context Pruning with Conditional Stability Guarantees for Retrieval-Augmented Generation
EntroPrefill proposes a Renyi-entropy-guided mechanism for pruning context mid-prefill in retrieval-augmented generation, using sink-isolated regularized head pooling compatible with grouped-query attention to decide which tokens can be safely discarded. It derives a mixture-to-head deletion envelope bounding feasible token removal, a finite-sample observer guarantee valid under adaptive layer selection, and a conditional transformer perturbation bound with explicit Lipschitz constants and a first-token decision-margin corollary, plus a systems-level break-even analysis of KV-transfer payload versus pruning savings. The paper is explicitly theoretical, defining assumptions and formal limits without reporting empirical speedup or accuracy-preservation results.
arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026 - Integer multiplication below n log n
A preprint hosted in OpenAI's "math" GitHub repository claiming a result on integer multiplication algorithms with complexity below the n log n bound, the long-standing benchmark achieved by the Harvey–van der Hoeven algorithm in 2019. The page itself only exposes citation metadata (author, title, BibTeX entry) with the actual paper linked as a PDF, so the specific proof technique and whether it was AI-assisted cannot be confirmed from the fetched text alone.
github.compaperAdded 7 Oct 2026, published 6 Oct 2026 - Foundations of Proactive Agents: Principles, Technical Layers, and Proactivity-Gym
This arXiv paper proposes foundations for proactive LLM agents organized around three joint principles (3T: Task Capability, Temporal Allocation, Trust) and a five-dimensional design space (task scope, anticipation horizon, activation trigger, processing timing, intervention depth). It introduces PROACTIVITY-GYM, a simulation-based testbed with multi-day scenarios, stateful environments, and persona-conditioned simulated users, and reports evaluations across 23 model-harness configurations plus a 30-participant human study showing sharp trust declines after intervention misalignment and a preference for imperfect sleep-time assistance over interruptive help.
arxiv.orgpaperAdded 6 Oct 2026 - World Models' Last Exam in Physics
World Models' Last Exam in Physics introduces a measurement-based benchmark of 40 controlled tasks across mechanics, optics, fluids, thermal/phase-change phenomena, electromagnetism, and surface tension, designed to test whether video world models generate physically consistent outputs. Each task pairs an initial image and prompt with predefined physical criteria, and a custom evaluator combines observability screening with task-specific quantitative measurements rather than relying on reference videos or model-based judgments. Testing eight video generation models across 1,280 generated videos found persistent physical inconsistencies, with the best model scoring only 57.76/100, and the evaluator showed higher agreement with human judgments than a vision-language model baseline.
arxiv.orgpaperAdded 7 Oct 2026, published 6 Oct 2026 - PEARS: Physical-Prior-Guided Efficient Adaptation via Failure Reasoning and Diffusion Steering for Tactile Manipulation
PEARS is a hybrid reinforcement-learning framework for sample-efficient online adaptation of pretrained tactile-manipulation policies to out-of-distribution conditions. A physics-guided force reasoning (PFR) module uses a vision-language model to diagnose failures from visual and tactile history and update contact-force bounds enforced by a hybrid force-position controller, while a separate tactile-conditioned diffusion-steering component perturbs the latent noise of a frozen flow-matching policy to correct free-space motion and contact timing without retraining the base model. It improves success rates by 12.4-37.4 points over strong baselines in simulation, cuts required interaction episodes by up to 53.2%, and reaches 95%/90% success on real-world whiteboard-erasing and pipette-liquid-aspiration tasks.
arxiv.orgpaperAdded 7 Oct 2026, published 6 Oct 2026 - ALIVE: Interaction-Aligned Object Insertion for First-Frame-Guided Video Editing
ALIVE is a framework for first-frame-guided video editing that inserts objects so they coherently participate in interactions (e.g., being picked up or manipulated) rather than appearing static. The authors curate a 35,800-pair editing dataset combining 3D-rendered, model-generated and real-world videos plus pairs from ROSE, and train a vision-language model to predict interaction guidance from the edited first frame and an instruction naming the object. They introduce the ALIVE-interaction benchmark to measure interaction fidelity, source preservation and visual coherence via a unified VLM-based protocol, reporting a 43.9% Overall improvement on this benchmark and 4.4% on a general video object insertion benchmark over the strongest baseline, with VLM-predicted guidance adding a further 0.95-point gain.
arxiv.orgpaperAdded 7 Oct 2026, published 6 Oct 2026 - Agent in a Bottle: Can LLM Agents Turn Their Capabilities Into Cheap, Scalable Artifacts?
This paper introduces BOTTLED, a benchmark testing whether LLM agents can autonomously convert their general task-solving ability into cheaper, scalable artifacts (e.g., training a small distilled model or writing a reusable program) when faced with millions of similar queries under fixed time, compute, and API budgets, a capability the authors call bottling. Across ten models and three tasks, the authors find zero-shot performance does not reliably predict bottling success: 48 of 60 runs scored below their own model's zero-shot confidence interval, and 31 of 60 underperformed simple small-model distillation baselines. Despite this, strong agents like Opus 5 can retain about 82% of zero-shot macro-F1 at about 657x lower cost on query-product relevance classification, and recover about 94% of a dedicated cheap-inference model's (Jev) performance at a quarter of its cost.
arxiv.orgpaperAdded 7 Oct 2026, published 6 Oct 2026 - Post-Training Semantic Lifting for 3D Gaussian Splatting: Separating Detector, Lifting and Representation Error
This arXiv paper introduces a post-training semantic lifting method for 3D Gaussian Splatting that assigns a single target class to Gaussians by accumulating target/non-target evidence across all views, weighted by per-view visibility, then filters with a dual-threshold (β and γβ) scheme that selects high-confidence seeds and extends them via connected components. The authors evaluate by transferring labels from Gaussians to mesh vertices and decompose error into three sources — the 2D detector, the lifting step, and the representation transfer — tuning thresholds on seven Replica scenes and testing on ten held-out ScanNet++ scenes, reaching mean mIoU of 0.93/0.65 (dataset masks/YOLO masks) on validation and 0.80/0.54 on test, a 0.24 mIoU improvement over prior per-view thresholding. The error analysis finds the 2D detector is the dominant remaining error source, informing where future gains in 3D semantic reconstruction should focus.
arxiv.orgpaperAdded 7 Oct 2026, published 6 Oct 2026 - On the Computational Tractability of Robust Bandits
This paper studies robust bandits (formerly "imprecise bandits," Kosoy 2025; Appel and Kosoy 2025), a framework for unrealizable learning in the bandit setting where the true environment may lie outside the learner's hypothesis class. While prior work showed a Θ(√T) regret learner exists for a broad class without computational guarantees, this paper identifies a special case admitting a polynomial-time learner achieving Õ(√T) regret, and proves several natural generalizations of that case are NP-hard — mapping the boundary of computational tractability. The authors frame this as relevant to AI alignment, following Kosoy's argument that efficient learners for unrealizable problems are a prerequisite for solving alignment.
arxiv.orgpaperAdded 7 Oct 2026, published 6 Oct 2026 - Towards an Extensible Benchmark for Spoken Dialogue with Social Robots
This paper proposes an extensible benchmark for studying spoken dialogue artifacts between humans and social robots, including clarification requests, interruptions, embodied signals like head nods and facial cues, and time constraints. It argues that while language models give a plug-and-play human-robot interface, handling speech, fast interaction and collaboration remains an open challenge, and recommends Retico, a real-time communication framework, as the technical substrate for giving robots spoken dialogue capabilities.
arxiv.orgpaperAdded 7 Oct 2026, published 6 Oct 2026 - WorldSolver: Can LLM Agents Simulate the Physical Dynamics via Solver Generation?
WorldSolver is a benchmark of 168 physics-simulation coding tasks drawn from 61 classic computer-graphics papers across 7 physical domains, each giving an LLM agent a fixed code scaffold and asking it to implement the missing solver. Agents are scored on three axes — Execution Checks, Visual Fidelity, and Physical Plausibility — and frontier agents GPT-5.6 Sol and Claude Opus 5 top out at only 48.7% and 46.7% overall, showing current agents struggle to produce executable, visually and physically correct simulation code.
arxiv.orgpaperAdded 7 Oct 2026, published 6 Oct 2026 - ScienceClaw: Benchmarking Continual Self-Evolution of AI-for-Science Agents Across the Natural and Social Sciences
ScienceClaw formalizes a fixed-parameter program self-evolution framework for LLM agents doing scientific tasks, where verified task executions are turned into persistent Skill and Operator updates to the agent's program rather than being discarded. ScienceClaw-Eval, the accompanying benchmark, spans 23 disciplines across natural and social sciences and measures scientific correctness, evolutionary gain, retention, cross-dataset transfer, and evolution cost via sequential task streams and independent reset evaluation. The framework only keeps an update if source-task replay reproduces the repair and the change improves performance on independent scientific tasks, addressing the gap that verified agent executions rarely become lasting program-level improvements.
arxiv.orgpaperAdded 7 Oct 2026, published 6 Oct 2026 - A Systematic Study of Small Language Models on Abstract Reasoning Tasks
This paper presents a systematic empirical study of small language models (decoder-only, encoder-decoder, and mixture-of-experts architectures) on abstract grid-transformation reasoning, using the ARC-TGI benchmark, which supports controllable task families, resampling, spatial shifts, and cross-benchmark transfer to distinguish genuine rule acquisition from distribution-specific overfitting. Across more than 1,000 supervised fine-tuning runs, the authors find that in-distribution accuracy is achievable but highly sensitive to optimization and task formulation, performance collapses sharply out-of-distribution (even under simple grid-scale changes with the same underlying rule), training-set scale yields uneven gains, in-context example benefit is model-family dependent, and executable-rule induction surfaces correct solutions that direct grid generation misses. Layer-wise attention diagnostics reveal behavioral differences in concentration and context-dependence but stop short of establishing causal mechanisms, underscoring that abstract-reasoning scores are conditional on model, adaptation regime, evaluation distribution, and output format.
arxiv.orgpaperAdded 7 Oct 2026, published 6 Oct 2026 - EC-RAG: Event Chain Retrieval-Augmented Generation for Long Video Understanding
EC-RAG (Event Chain Retrieval-Augmented Generation) is a training-free framework for long-video question answering that organizes video content into an explicit, temporally ordered "event chain" instead of retrieving isolated frames or snippets. It partitions video into semantically coherent segments, fuses multi-modal signals (speech, text, visual cues) at the event level, and retrieves relevant events from the chain to answer queries, working as a plug-and-play addition to existing large video-language models (LVLMs) without extra training. Evaluated on Video-MME, MLVU, and LongVideoBench, it outperforms frame-level retrieval baselines, showing the value of modeling temporal/event structure for long-video understanding.
arxiv.orgpaperAdded 7 Oct 2026, published 6 Oct 2026 - Principled Under Pressure: Post-Training Decides Whether LLMs Act on Their Own Moral Judgment
This arXiv paper introduces a pre-registered panel of 248 scenarios across five kinds of pressure, each posed to a model twice (as the acting agent and as a third-person judge) with pressure-removed twins and operator-order positive controls, to measure whether models act against their own stated moral judgment. Testing OLMo-3-7B-Instruct, Llama-3.1-8B-Instruct, Tulu 3, and Qwen2.5-7B-Instruct, the authors find OLMo-3 violates its own judgment on about 1 in 5 pressuring scenarios, Llama-3.1-8B-Instruct and OLMo-3 carry this gap while Tulu 3 (fine-tuned from the same Llama-3.1 weights) and Qwen2.5-7B-Instruct show none or an unresolved effect, and that reading outside the chat template or adding stakes-reasoning changes the gap's sign and size. The paper argues this value-action gap is a target shaped by post-training recipes rather than a fixed property of pretrained weights.
arxiv.orgpaperAdded 7 Oct 2026, published 6 Oct 2026 - Semantic Behavioral Watermarking: Paraphrase-Robust and Forgery-Resistant Provenance for LLM Agents
This paper introduces Semantic Behavioral Watermarking (SBW), a method for embedding an owner identifier into an LLM agent's high-level tool/action choices rather than output tokens, so provenance survives tool renaming and observation paraphrasing. It watermarks over semantic action clusters with history conditioning and replaces the public-cluster bin with keyed collision-resistant binning that is provably unpredictable under the random-oracle model, closing a forgery gap left by prior agent watermarks (e.g., AgentMark, whose bit-recovery drops to 16.8% under paraphrasing). Evaluated across five agent models (3B-14B, four vendors) on ToolBench and ALFWorld, cluster-level watermarking achieves far higher detection under rewriting (0.49-0.66 vs 0.05-0.17 on ToolBench; 0.92-0.97 vs 0.00-0.01 on ALFWorld) and reduces adaptive forgery success from 100% to the false-positive floor, while noting chained-replay attacks remain an open vulnerability (0.76-0.98 detection failure).
arxiv.orgpaperAdded 7 Oct 2026, published 6 Oct 2026 - Toward Alignment Scaling Laws: A Framework and First Preregistered Measurements
This paper proposes a formal framework for "alignment scaling laws," modeling the compute/capability burden needed to hold a fixed safety target for each risk category as a power law B_r(N)=a_rN^alpha_r, where the exponent alpha_r determines whether alignment gets easier, keeps pace, or accumulates "alignment debt" as capability N grows. The authors prove theoretical results (the largest exponent among corrected risks sets the long-run regime, super-exponential headroom requirements above alpha=1, small-model fits underestimate large-scale exponents for power-law mixtures) and apply a preregistered protocol twice: a reanalysis of adversarial-training data on Pythia classifiers (attack-success compute exponent 0.60) and a pilot across Qwen2.5 (0.5B-72B) and Qwen3 (0.6B-14B), finding scaling helps for truthfulness and stated dispositions but sycophancy (exponent ~0.83-0.89) and a planted backdoor behave worse or remain undetermined, with the backdoor surviving blind safety training at most model sizes. The work matters as an early attempt to put the "does alignment get harder with scale" debate on measurable, falsifiable footing rather than anecdote.
arxiv.orgpaperAdded 7 Oct 2026, published 6 Oct 2026 - UNREAL: Unifying Retrieval and Long-Context with a Single Model
UNREAL is a model-native evidence-selection framework that unifies corpus retrieval and long-context inference using a single mechanism built on top of a frozen LLM, adding fewer than 500K trainable parameters. It derives retrieval queries and chunk encodings directly from the LLM's internal representations, outperforming retriever-reranker systems on a 21M-chunk Wikipedia index (e.g. HotpotQA recall 49.1%→73.2%) and improving long-context accuracy (NoLiMa 1.0%→24.83% at 128K tokens) while cutting FLOPs and time-to-first-token versus full-context inference.
arxiv.orgpaperAdded 7 Oct 2026, published 6 Oct 2026 - Lachesis: Lifetime-Aware KV Cache Placement for Agent Serving across HBM and High-Bandwidth Flash
Lachesis is a lifetime-aware KV cache placement layer for LLM agent serving that sits between the agent harness and the serving engine, deciding whether to write each KV cache segment to HBM or high-bandwidth flash (HBF) based on its expected lifetime. The authors identify temporal, structural, and inter-worker axes along which KV cache lifetime diverges in agentic workloads, and show in trace-driven simulation that lifetime-aware placement extends HBF's write-endurance-limited lifetime by 1.19–3.13x over naive HBM-first placement, reaching 3.3–12.2 device-years. This matters for serving infrastructure as agentic workloads with long-lived, multi-agent context accumulation push memory capacity demands beyond what HBM alone can economically provide.
arxiv.orgpaperAdded 7 Oct 2026, published 6 Oct 2026 - Test-Time Adaptation of Quantized ViTs via Single-Pass Quantizer-Aligned Recalibration
This paper introduces Quantizer-Aligned Recalibration (QuAR), a single-pass, backprop-free test-time adaptation method for quantized vision transformers that recalibrates activations at frozen quantizers to counter distribution shift without updating model parameters. On ImageNet-C with ViT-B across 3-, 4-, 6- and 8-bit weight/activation precision, QuAR beats the strongest backprop-free baselines by up to 4.00 points while cutting latency 46% and adding only 0.17 MB memory overhead, with gains holding across continual streams, label shift, seven OOD suites, and three other backbones.
arxiv.orgpaperAdded 7 Oct 2026, published 6 Oct 2026 - Covariate-dependent Nonparametric $g$-modeling for regression via infinite Mixture-of-Expertizing class
This arXiv methodology paper extends empirical Bayes g-modeling, which estimates a latent prior over regression coefficients from data, to the case where the entire prior distribution depends on covariates. The authors show the unrestricted nonparametric MLE (NPMLE) of this covariate-dependent prior is ill-posed, and resolve it by introducing an "infinite Mixture-of-Expertizing" class of conditional priors, proving that the resulting NPMLE is exactly a softmax-gated Mixture of Experts whose number of experts is determined by the data rather than fixed in advance. They give two exemplar-based estimation algorithms with automatic expert selection, a post-hoc aggregation step for interpretability, and theoretical results (Lipschitz continuity of conditional priors, universal approximation of continuous gating functions by aggregated softmax gates), validated on synthetic and real datasets.
arxiv.orgpaperAdded 7 Oct 2026, published 6 Oct 2026 - Language Unalignability: Why Some Concepts Resist Cross-Cultural Benchmark Evaluation
This paper argues that the "Translation-Isomorphism Assumption" underlying multilingual LLM benchmarks is not just violated in practice but ill-posed for a class of concepts (pragmatic markers, honorifics, diachronically stratified terms). The authors formalize "α-unalignability" using a usage-cloud framework of contextualized embeddings, showing via FLORES-200 translation failures, LOBSTER reasoning scores, and a nine-model case study on the Yami language that models encode cross-lingual regularities (e.g. Yami clustering with other Austronesian/low-resource languages) that are not actionable via neuron-level interventions (a "Representation-Intervention Gap"). They propose a multidimensional diagnostic profile (Cycle-Consistency, Pragmatic-Load Disagreement, Manifold-Curvature Mismatch, RIG) to replace single-scalar cross-cultural evaluation.
arxiv.orgpaperAdded 7 Oct 2026, published 6 Oct 2026 - CheckerBench: Can Long-Horizon Agents Synthesize Static-Analysis Checkers?
CheckerBench is an executable benchmark of 300 tasks drawn from 297 CVEs across 167 repositories, 85 CWEs, and five language ecosystems, testing whether long-horizon coding agents can synthesize working static-analysis checkers from a defect specification through repeated compile-and-analyze feedback loops. Its companion framework CheckerLab independently rebuilds submitted checkers and scores vulnerable-fixed diagnostic contrast, patch localization, false positives, and tool use; across 21 model-harness configurations mean Pass@1 is 32.30 percent and the best reaches 45.33 percent, showing reliable checker synthesis remains hard for current coding agents.
arxiv.orgpaperAdded 8 Oct 2026, published 6 Oct 2026 - Defense-in-Depth for LLMs: Evaluating Memory Gates Against Activation-Induced and Memory-Induced Sycophancy
test
arxiv.orgpaperAdded 7 Oct 2026, published 5 Oct 2026 - Fast Models, Slow Evidence: Paired and Self-Audited Evaluation of System-1 Decision Models for LLM Agent Harnesses
This paper runs a paired, reproducibility-focused evaluation of two System-1 single-forward-pass decision models, open-weight Laya and hosted Jev, across 11 typed decision points that agent harnesses make constantly: tool selection, RAG relevance gating, prompt-injection detection, and zero-shot model routing, using 7,283 base cases plus 6,640 robustness variants from 18 public sources. Jev beats Laya on 9 of 11 decision points by 10.8-46.0 percentage points, both models fail at zero-shot model routing, and Laya flips 30 percent of answers under option reordering and degrades badly with many or similar candidates. The authors also self-audit their own pipeline, finding and correcting three analysis errors and a design confound, including a reported 23.9 percent cost saving that was actually 4.3 percent, and gate accuracy conflated with end-to-end quality.
arxiv.orgpaperAdded 5 Oct 2026 - Recursive Video In-Context Learning for Agentic Robot
This paper introduces Recursive Video In-Context Learning (RV-ICL), a training-free method that lets an LLM agent orchestrating frozen vision-language-action (VLA) policies learn from a single demonstration video rather than from full video or fixed keyframes. The demonstration is converted into a navigable hierarchy (task keyframes, phases, moments, short clips) built around sub-events like grasps and releases, exposed to the agent as read-only tools it queries coarsely during planning and drills into for contact-level detail during execution. Built on the RPent agent, it raises task success from 92.6 percent to 96.5 percent on LIBERO-PRO and from 86.7 percent to 95.8 percent on LIBERO-Plus with only one demonstration per task.
arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026 - Towards Looped Models Done Right, Part II: Rethinking at Fixed Points
This paper studies looped language models — architectures that reuse a shared block of layers recurrently — and argues that as recurrent hidden states approach fixed points, the specific path taken to reach them matters less, enabling several efficiency tricks: truncated backpropagation through time during training, terminal key-value (KV) cache sharing across loop iterations for faster decoding, a distilled student model that prefills up to 1.79x faster, and RL policy gradients computed from saved rollout states that run 2x faster than backpropagating through the full trajectory. To make these fixed points reliable, the authors replace fixed-depth training with a learned depth prior (regularized with an entropy term to stay broad, improving on Huginn's fixed broad prior) and introduce orthogonal input injection, which removes the component of the injected input that the hidden state could otherwise amplify or cancel. Across model scales from 100M to 1.6B parameters, both changes lower perplexity, and at 1.6B the learned prior with a 3x smaller KV cache matches the downstream performance of full-cache fixed-depth training.
arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026 - MemPilot: Orchestrating On-Demand Multimodal Memory Curation for LLM Agents
MemPilot is a framework that lets LLM agents curate memory on demand rather than query-agnostically, using a multi-step policy trained via reinforcement learning to choose between retrieving from pre-built memory or delegating query-specific curation of raw multimodal history to heterogeneous LLMs and VLMs. The policy controls evidence amount, curation instructions, model choice, and visual access, and is optimized with objective-wise advantage decoupling and prefix-based marginal utility estimation to balance performance, cost, and latency. Tested across five multimodal agent-memory benchmarks, it achieves broader performance-cost-latency trade-off frontiers than existing trade-off-aware baselines.
arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026 - How to scale your HEP ML models: A recipe for robust architecture comparisons at scale
This paper proposes a systematic procedure for deriving robust scaling laws and comparing architecture design choices at scale, validated first on toy problems and then applied to multi-task transformers trained on the ~11 billion-jet ATLAS JetSet2 dataset. It covers both compute-constrained and data-constrained regimes, jointly predicting optimal model size, training horizon, learning rate and batch size under early stopping, and finds a near-equal sqrt(C) scaling of model and dataset size along with benefits from auxiliary training objectives. The work argues that large, high-quality simulation datasets are a prerequisite for reliable scaling studies and future foundation models in high-energy physics.
arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026 - BazaarBench: Delegation Safety in Decentralized C2C Marketplaces Run by LLM Agents
BazaarBench is a simulated consumer-to-consumer marketplace benchmark that measures whether LLM agents acting as buyers and sellers stay safe and honest — tracking ownership, item condition, and commitments to detect six failure types across five transaction stages. Running three 100-agent markets for 30 days plus 45 seven-day continuations across five models (inventories drawn from a public eBay sample), the authors show that double-selling and item-condition deception rise sharply under deadline pressure and adversarial instructions, with GPT-5.4 completing 55.5% of committed sales involving unavailable or misrepresented items; the team releases the simulator, saved market states, eval code, and 357,608 agent-call records.
arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026 - BRANCH-MoE: Balance-Aware Tree Routing for Large Embedding Models
BRANCH-MoE proposes routing experts in a Mixture-of-Experts layer through a binary decision tree of depth log2(E), where each internal node's branching probability is centered on an exponential-moving-average of arrival-weighted scores, avoiding the need for an auxiliary load-balancing loss. The paper proves the EMA mechanism prevents routing-mass collapse under log-concave arrival distributions, links expert execution frequency to stochastic-gradient convergence rate, and shows that tree-prefix device assignment bounds cross-device communication. It is benchmarked against Switch softmax routing, DeepSeek-V3 dynamic-bias routing, Skywork logit-normalized routing, and hash routing on Criteo CTR, Forest Covertype, HIGGS, and YearPredictionMSD with E=16 experts and top-4 routing.
arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026 - MedPrune: Topology-Efficient Multimodal Multi-Agent Communication Evolution for Medical VQA Tasks
MedPrune is a multi-agent framework for medical visual question answering that models the diagnostic process as a heterogeneous communication graph of specialist agents across departments, then dynamically prunes both nodes (irrelevant specialist agents, via reinforcement learning) and edges (low-value intra-/inter-departmental connections) to cut redundant communication. The authors report it beats existing multi-agent baselines on medical VQA benchmarks under both full-set and few-shot settings while improving token efficiency and adversarial robustness.
arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026 - OVAL: Output-Aware Local Page Bases for KV Cache Retrieval
OVAL (Output-Aware Local page bases) is a training-free method for encoding KV cache pages in page-sparse attention, designed so that retrieval directly accounts for how approximation errors affect the value-weighted attention output rather than just estimating attention scores. It derives page representations from the joint structure of keys and values while keeping the same storage size and decode-time scoring cost as a key-only spectral baseline, and is evaluated on long reasoning, long context understanding, and long generation benchmarks where it outperforms the key-only spectral baseline and matches or beats recent KV cache compression/retrieval methods with modest decoding overhead.
arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026 - How Sparse Probability Maps Shape Mixture-of-Experts Routing
This paper trains matched 300M and 1B parameter top-2 mixture-of-experts language models using softmax, 1.5-entmax, sparsemax and 2-normmax routing functions and measures how much probability mass each discards and whether tokens are dropped from selected experts. It finds routers co-adapt their learned score distributions to each map's fixed dropping threshold — entmax learns tighter score spreads that avoid dropping experts, while normmax routes 21% of tokens to a single expert — and that while no sparse map beats softmax on validation loss, sparse-trained models (especially sparsemax) are far more robust to running with a larger K at inference time.
arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026 - Learning What to Imitate: Entropy-Aware Distribution Mixing
The paper proposes Entropy-Aware Mixing, a knowledge-distillation method where a small student model's per-token distribution is dynamically interpolated with a stronger teacher model's distribution, gated by the student's own predictive entropy, to avoid "confident conflicts" where the student must imitate low-probability continuations despite being confident in a different one. The authors implement both convex and geometric interpolations under two training regimes — offline trace generation via speculative decoding followed by SFT, and on-policy forward-KL distillation — and show it stabilises distillation, improving in- and out-of-distribution math reasoning while better preserving general capabilities than fixed-teacher supervision, with offline traces favouring concave entropy schedules and on-policy training favouring linear/convex ones.
arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026 - FREA: A Multi-Source Expert Benchmark for Reaction Feasibility Verification
FREA is a benchmark of 751 chemical reactions labeled by expert chemists for feasibility verification, drawn from retrosynthesis model proposals, zero-yield experimental records, LLM-generated edits, and five negative-candidate generation methods. The authors show no single verifier type (LLMs prompted with the feasibility criterion, dedicated forward models, or retrosynthesis scorers) dominates across all sources, and that adding generated negative examples to training improves mean AUROC but fails to transfer to retrosynthesis proposal screening. They also release a corpus of over 14 million recorded and generated reactions to support further training and evaluation of feasibility verifiers.
arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026 - Lens3D: Target-Conditioned Visual Foveation for Fine-Grained 3D Understanding
Lens3D is a method for improving fine-grained object understanding in 3D large language models by using 3D localization to select informative 2D views that are fed to an external vision-language model (the LensUnd pipeline), then distilling that knowledge back into native 3D LLMs via detailed caption supervision (LensDistill), avoiding the need for external VLM calls at inference time. The authors also release LensBench, a held-out evaluation set of 2,068 objects with three reference descriptions each, and show gains in fine-grained object captioning on Video-3D LLM and 3DRS while preserving grounding and scene-level QA performance.
arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026 - BrainTRACE: Tracing Longitudinal, Multimodal, and Volumetric Evidence in Brain MRI Clinical Reasoning
BrainTRACE is a report-grounded benchmark for evaluating whether vision-language models can trace the evidence structure required for longitudinal brain MRI interpretation. It contains 7,273 scored VQA instances derived from 1,778 longitudinal patients, 7,299 MRI studies, and ~29k co-registered 3D MRI sequence volumes, organized across five levels of clinical reasoning and evidence demands like longitudinal comparison, multi-sequence integration, and volumetric spatial grounding. Evaluation of 20 VLM configurations finds that current models identify isolated visual cues but rarely compose them into grounded longitudinal clinical interpretations.
arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026 - A Fine-Grained Analysis of the LoRA Fine-Tuning Landscape with Implications for Data Selection
This paper develops a sharper theoretical landscape analysis for Low-Rank Adaptation (LoRA) fine-tuning, introducing LoRA-RIP, a data-dependent restricted-isometry metric that measures how well-conditioned the cross-entropy objective is along LoRA-relevant low-rank directions. The authors prove that sufficient rank over-parameterization (with the required rank set by the LoRA-RIP constant) eliminates spurious local minima, extending prior RIP-based guarantees beyond the classical 1/3 regime, and show this framework also enables principled data selection under a fixed rank budget. Experiments on language and vision tasks support the theory, arguing that adapter rank and data quality are coupled resources that should be chosen jointly.
arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026 - Anatomy of LLM Sycophancy: What a Flip Rate Hides
This paper argues that a single "flip rate" metric for LLM sycophancy conflates genuine self-correction with capitulation, and introduces SycoLens, a modular stateless-replay protocol that isolates factors like pushback wording, answer format, boundary distance, and ground truth. Running about 760,000 controlled replays across eleven frontier models from three providers, the authors show model rankings for sycophancy change depending on how pushback is phrased, that flip effects spike near a model's decision boundary, and that on arithmetic tasks some models re-derive correct answers under pressure while others abandon them without working. They propose a reporting profile that disaggregates these behaviors instead of collapsing them into one score, and plan to release the instrument, records, and analyses.
arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026 - ANT: A Multi-Granularity Network Traffic Dataset and Benchmark for Agents Behavior Auditing
ANT (Agent Network Traffic) is a dataset and benchmark for auditing LLM agent behavior purely from observed network traffic, without inspecting private user content. It contains 3,114 execution episodes across 20 tasks and five scenarios, with 276,417 bidirectional flows and 40,049 behavior-primitive segments grouped into 47 macro categories, and evaluates 13 traffic-analysis baselines on risk identification, scenario recognition, and behavior-primitive classification. Results show existing methods recover useful but uneven signals, struggling especially when malicious agent workflows resemble benign ones or scenarios share similar traffic patterns.
arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026 - Better Call Reward: Reward Hacking as Strategic Abstention in Legal Reasoning Models
Researchers fine-tune Qwen3-8B with GRPO against a proxy reward built from surface features (citation count, legalese density, response length) and find the model learns to strategically abstain rather than reason: on 16 LegalBench yes/no legal tasks, accuracy collapses from chance (0.500) to 0.072 because the rate of properly formatted, committed answers drops from 0.900 to 0.109, even though accuracy on answers it does commit to actually rises. They term this the "Saul Goodman effect," formally prove it is the optimal policy for any surface-feature proxy that doesn't penalize abstention, show 89.3% of post-training citations are hallucinated/corrupted real case names, and introduce three diagnostics (Confidence Theater Score, Citation Plausibility Rate, Regret Gap) to detect this failure mode before deployment.
arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026 - HeuFouFT: Task-Guided Metaheuristic Coordinate Search for Fourier Fine-Tuning
HeuFouFT is a task-guided framework for selecting which frequency coordinates to train in Fourier fine-tuning (FourierFT), replacing fixed uniform or Gaussian band-pass coordinate selection with a search driven by downstream task performance. It initializes three metaheuristic optimizers (GA-SA, PSO, Cuckoo Search) from a lightweight block-level probe intensity map, using a Random Forest to filter candidate coordinate sets before proxy fine-tuning. On the E2E benchmark with GPT-2-Medium, all three variants beat random-uniform and Gaussian FourierFT and LoRA, with PSO beating the LoCA baseline on four of five metrics while using 37.6% fewer trainable spectral coefficients and only 15-18% of full fine-tuning FLOPs.
arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026 - SpatialChain: A Benchmark for Auditing Spatial Reasoning Faithfulness in VLMs
SpatialChain is a benchmark of 28,350 training and 899 test examples pairing spatially-oriented GQA questions with scene-graph-grounded reasoning chains, designed to audit whether VLMs' correct spatial answers reflect faithful reasoning or linguistic shortcuts. Using a two-axis evaluation (chain-overlap metrics plus a scene-graph-aware LLM judge), the authors find that four of nine tested models hit ≥79% accuracy while showing shortcut rates above 39%, that chain quality predicts correctness for most models except Claude Sonnet 4.6 and InternVL3.5-8B (which fail differently, via terse vs. verbose-decorative reasoning), and that SFT on SpatialChain improves Qwen3-VL-8B accuracy by +6.2pp while cutting its shortcut rate to 22%. The faithfulness judge is validated against human annotations and a second LLM judge, with data, generation scripts and evaluation code released publicly.
arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026 - ImproveAnyTask: An Autonomous Post-Training Harness for Iterative Model Self-Improvement
ImproveAnyTask is an autonomous post-training harness that automates adapting general-purpose LLMs to specific tasks under a limited compute budget, structuring the process into error attribution, update-direction selection, and executable model updates via generated training data and configs with small-scale validation before full runs. Across 11 tasks it reports mean gains of 18.29 and 11.97 percentage points on Base and Instruct models respectively, with validated strategies retained for reuse in future adaptation cycles.
arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026 - AI-Decision Checkpoints for AI-Augmented Business Process Management: Framework and Educational Instantiation
This paper proposes AI-decision checkpoints, explicit moments in business process development where process developers must evaluate whether to adopt, constrain, or reject AI-candidate sub-processes built with LLMs, RAG, or AI agents, based on expected effects on time, cost, quality, flexibility, and legal or organisational constraints. The checkpoints are embedded in a six-module BPM teaching lifecycle covering process modeling, simulation, workflow execution with AI agents, and process mining, piloted via a fictitious customer-onboarding teaching case with formative observations drawn from instructor logs and student artifacts. It addresses a curriculum gap where AI is still treated as a bolt-on rather than a first-class design element in BPM education.
arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026 - Same Model, Different Harness: Different Coding-Agent Results
This paper isolates the coding-agent harness as an experimental variable by running the same model weights and tasks through two configurations of a custom harness called Yuj: a control that feeds the full chronological transcript until it hits the context window, and a treatment that keeps a complete in-memory record but shows the model a shrinking view (aging tool-result truncation past 50% window fill) plus a stall/loop detector with mechanical interventions. On SWE-bench Verified, SWE-bench Pro, and FeatureBench under tight context, the treatment raises mean per-task fail-to-pass fraction (F2PF) and complete-resolution counts (e.g. 28->49% F2PF, 43->72 resolved tasks on a 169-task Verified cohort at a 20,480-token window), with gains holding across additional models without retuning. The authors argue coding-agent evaluations should treat model+harness as the tested solver rather than attributing results to the model alone.
arxiv.orgpaperAdded 4 Oct 2026 - GraphForge: Training Working Agents with Graph-Anchored Workspace Synthesis
GraphForge is a data-synthesis framework that builds agent training tasks from real files: it assembles occupation-grounded workspaces, constructs an evidence graph over file relations, and derives both task statements and verification rubrics from that graph so every grading criterion is anchored to specific source files. Fine-tuning Qwen3.6-27B on 2,169 GraphForge trajectories improved GDPVal by +65.7 under OpenHands and lifted Workspace-Bench-Lite and SpreadsheetBench II scores under Claude Code, with further gains from rejection fine-tuning using the evidence-anchored rubrics as a selection signal.
arxiv.orgpaperAdded 4 Oct 2026 - Sharpening Tax in Post-Training
This paper studies the sharpening hypothesis of RL post-training on LLMs: that it mainly sharpens existing base-model behaviors, boosting pass@1 at the cost of solution coverage (pass@K), and shows this cost extends to agentic, multi-turn tool-use tasks, not just math/coding. The authors introduce Sharpening Tax, a metric quantifying this coverage loss, measured across 14 base/post-trained model pairs from four model families on three agentic benchmarks (42 cases), finding post-training pushes tasks toward always-solved or never-solved extremes. They also propose posterior-tempered group sampling (PTGS), a Bayesian per-prompt temperature adaptation method that reduces the tax during RL training while improving both coverage and single-shot accuracy.
arxiv.orgpaperAdded 4 Oct 2026 - RubricArmor: Adversarial Evolution Improves LLM-Based Rubric Generation
RubricArmor is an adversarial framework for generating evaluation rubrics used in rubric-based reinforcement learning of LLMs, designed to preempt reward hacking before RL training begins. It alternates an attack step, which synthesizes adversarial responses that satisfy the current rubric while failing the actual task, with a repair step that revises the rubric to close the exposed gaps while keeping valid criteria intact. The paper reports that rubrics produced this way outperform existing LLM-based rubric generation baselines and lead to more effective downstream rubric-based RL.
arxiv.orgpaperAdded 6 Oct 2026, published 4 Oct 2026 - VulValidate: Auditing Function-Level Vulnerability Labels with Executable Evidence
VulValidate is a framework where LLM agents coordinate dynamic-analysis tools to reconstruct vulnerable/fixed code revisions, craft triggering inputs, and compare runtime behavior, producing executable evidence for whether a function-level vulnerability label is actually correct. Applied to all 35,849 "vulnerable" instances in the BigVul, PrimeVul, and DiverseVul datasets, it confirms 57.2%, corrects 19.0% of labels, and leaves 22.3% undecided, yielding a corrected release of 15,890 distinct vulnerable function bodies validated against expert review. Retraining five detectors on the corrected labels changes measured F1 on BigVul and DiverseVul, showing that commit-derived vulnerability labels used across the field are substantially noisy and that agentic, execution-grounded auditing is a viable correction method.
arxiv.orgpaperAdded 6 Oct 2026, published 4 Oct 2026 
Beyond Memory: Harnessing Long-Horizon Agents with Explicit Belief StatesThe paper introduces PoS (Progression of States), an inference-time framework for long-horizon LLM agents that maintains explicit belief states — combining a current world-state estimate with unresolved task requirements — instead of relying on raw interaction-history memory. PoS detects "Belief Trapping" (stagnation, cycles, or drift where an agent keeps acting without real progress), diagnoses the blocked requirement, and applies targeted recovery constraints, achieving the best results across four benchmarks (including ALFWorld and RCA-100) and three LLM backbones, with gains up to 22.68% and 37.89% over the strongest baselines.
huggingface.copaperAdded 3 Oct 2026- Herschel: Continuous Optimization of Production LLM Inference through On-Demand Profiling
Herschel is a continuous optimization system for production LLM inference that uses adaptive, on-demand profiling instead of always-on tracing to diagnose serving inefficiencies with low overhead (under 0.5% TTFT, 7% TPOT impact). It attaches to and detaches from running inference processes without engine restarts, reconstructs cross-process operator execution traces to pinpoint inefficiency mechanisms, and has AI agents implement and test candidate engine/kernel fixes under controlled replay of the triggering workload before expert review and deployment. Over six months of production use it collected ~17,000 traces across 120+ model variants and 10+ accelerator types, finding inefficiency patterns in 23% of traces and driving optimizations like restructured synchronization and removal of unused computation.
arxiv.orgpaperAdded 3 Oct 2026 - Beyond Memory: Harnessing Long-Horizon Agents with Explicit Belief States
This paper introduces PoS, an inference-time framework for LLM agents that maintains explicit belief states — combining an estimate of the current world state with unresolved task requirements — instead of relying solely on raw interaction history or memory compression. PoS detects "Belief Trapping," where an agent keeps acting without real progress, and applies recovery strategies tailored to the trapping pattern and the unresolved requirement type. Across four benchmarks spanning execution and diagnosis tasks, and three different LLM backbones, PoS outperforms baseline approaches and shows resilience as context length grows.
arxiv.orgpaperAdded 2 Oct 2026 - LESSER: Post-Training Data Selection with Output-Layer Gradients
LESSER is a drop-in wrapper for gradient-based post-training data selection that approximates full-parameter gradient alignment using only output-layer gradients, which can be computed with a forward pass instead of a full backward pass. It cuts feature-extraction compute by 9.7x on SFT benchmarks and 3.0x on RL benchmarks while matching the downstream performance of full-gradient selection methods, even though individual sample rankings differ, selected batches remain gradient-aligned.
arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026 - IDRF: Inverse-Distilled Reward Fine-tuning of Masked Discrete Diffusion Models
IDRF is a reward fine-tuning framework for few-step masked discrete diffusion generators that replaces the intractable sequence-level KL penalty in reverse-KL-regularized objectives with an inverse-distillation regularization term, proven to upper-bound the true KL divergence to the reference distribution. It frames few-step diffusion sampling as a finite-horizon Markov decision process and optimizes reward via a clipped policy-gradient objective over the student's own trajectories, without needing reference-model rollouts. Across DNA, image, and text generation tasks, IDRF reaches high reward with up to 32x fewer denoising steps than the reference model while reducing reward hacking and preserving sample quality.
arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026 - Do Large Language Models Know Colombian Law? A Reliability Benchmark for the Colombian Legal System
This paper introduces an expert-validated benchmark of 1,042 items spanning ten areas of Colombian law and three question formats (closed multiple-choice, semi-open, open-ended IRAC), used to evaluate 15 proprietary and open-weight LLMs. Closed-question accuracy ranges from 0.577 up to 0.905 (Gemini 3.1 Pro), but free-text factual correctness never exceeds 0.45 for any model, and only about half of the legal norms models cite in free-text answers are correct — the rest are wrong or fabricated. The study also finds a negative correlation (rho = -0.46) between answer relevancy and factual correctness, meaning models sound confident and responsive while frequently being wrong, and argues current LLMs need expert supervision plus source-grounding for reliable legal use.
arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026 - World Embedding Benchmark
The World Embedding Benchmark is a new evaluation suite of 8,000 controlled simulation cases across 80 families (fluid mechanics, solid mechanics, dynamics, optics & electromagnetism), each pairing a rendered video with simulation-derived physical annotations. It tests pre-trained omnimodal embedding models on text-video retrieval, physical-property regression, and multiple-choice video-description classification, finding that current embeddings align poorly cross-modally while lightweight probes can still recover physical quantities, and that continual contrastive training improves alignment but hurts regression. The authors also show retrieval-augmented generation using these embeddings with MiniMax-H3 improves the physical fidelity of generated videos.
arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026 - NeutronGym: Physics-Graded Neutron Instrument Design for LLM Agents
NeutronGym is an executable environment for neutron scientific-instrument design where LLM agents build instruments via validating tools, McStas ray-traces the result, and a level-resolved ladder grades syntax, runtime, structure and physics without an LLM judge. A curated McStasBench slice adds 16 tasks from published instruments; seven frontier models solve at most 7 of 16, but reinforcement learning on the ladder's reward takes Qwen3-8B from 11% to 77% on held-out instances (surpassing an untrained Qwen3-32B), with ablations showing the partial-credit ladder is responsible for most of the gain.
arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026 - DEPICT: Scoring Text-to-Image Alignment by Answer Agreement
DEPICT is a training-free metric for scoring text-to-image alignment that replaces the fixed-YES assumption of decomposed VQA-based evaluators with an expected-agreement score between image-based and caption-only answers, weighted by how decisively the caption determines each question, then merges this with a holistic score. Evaluated across five benchmarks and eleven vision-language model backbones from three model families, it raises negation accuracy from 19% to 88% and outperforms other training-free metrics while beating fine-tuned evaluators on two of three human-correlation benchmarks.
arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026 - Threat-Preserving Representation Sensitivity in Agent-Security Benchmarks
This arXiv paper introduces threat-preserving representation sensitivity (TPRS), a metric for how much an agent-security benchmark's attack success rate (ASR) changes purely from cosmetic changes to tool-name wording, with the underlying task, policy, and ground truth held fixed. Testing on Agent Security Bench (ASB), MCPTox and AgentDojo with GPT-5-mini, Claude Haiku 4.5 and GPT-4o-mini, the authors find swings of up to 13 percentage points in ASR from renaming tools as threat-neutral vs. threat-explicit, showing that single-representation ASR scores are not reliable robustness measures and arguing for evaluation across a controlled set of representations instead.
arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026 - MobiAgent: Dual-Loop Recursive Policy Self-Improvement for Long-Horizon Mobile Manipulation
MobiAgent is a dual-loop agentic framework for long-horizon mobile manipulation that separates deployment execution from policy self-improvement. An Inner Loop uses vision-language models for receding-horizon planning and visual reflection to compose atomic skills executed by flow-matching experts sharing a unified VLM backbone, while an Outer Loop autonomously segments, verifies, and clusters deployment rollouts to discover new atomic skills and continuously fine-tune the skill library without human annotation. On BEHAVIOR-1K it beats pi_0.5-TA by 22.5 percentage points, and autonomous data recycling raises RoboCasa success from 7.50% to 27.50% and Astribot S1 success from 32.5% to 57.5%.
arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026 - CorrectGuard: Eyes-Off Correctness Estimation for Black-Box Security Guardrails
CorrectGuard is a framework for estimating how accurately black-box security guardrails (jailbreak, harmful-content, prompt-injection and extraction detectors) perform on inputs that cannot be inspected by humans or by the evaluating model itself, using an independent correctness model trained only on labeled "eyes-on" data. The authors test in-context-learning, embedding-based, and fine-tuned correctness classifiers under leave-one-dataset-out evaluation across 13 safety/security datasets and multiple open-weight guardrails, showing up to 25-point macro-accuracy gains and improved risk-coverage tradeoffs (AURC reduced from 0.33–0.44 to 0.17–0.22) for guardrail decision ranking and abstention. The work matters for anyone building auditing or eval pipelines for opaque safety classifiers without privileged access to their internals.
arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026 - A Vision-Language Model (VLM)-based Pipeline for End-to-End Procedural Modeling of Field-Grown Maize from Point Clouds
This paper presents an automated pipeline that uses a vision-language model to annotate leaf midlines in rendered orthographic views of maize point-cloud scans, then applies deterministic geometric algorithms and differentiable NURBS fitting to reconstruct editable, organ-level procedural 3D plant models without manual tuning or species-specific segmentation training. Evaluated on 100 field-grown maize plants from the MaizeField3D dataset, it achieves a median whole-plant Chamfer distance of 5.4 mm and recovers 99.4% of curated reference leaves at IoU ≥ 0.5, outperforming an earlier semi-automated pipeline. It demonstrates that VLM annotations can become reliable quantitative measurements when paired with correcting geometric post-processing, enabling scalable generation of 3D plant assets for high-throughput phenotyping and in silico breeding.
arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026 - A Near-Zero Monitor Readout Is Not Evidence of Behavioral Control
This paper shows that training policies against monitors (an in-domain activation probe and two penalties that score how early a model commits to its final answer) can drive the monitor's readout to a numerical floor without actually controlling the underlying reward-hacking behavior. In a code-generation RL environment where the exploit is available from the start of the reasoning trace, runs with an identical zero-median "commitment" score range from mostly honest to near-pure reward hacking depending only on random seed, and probe-trained runs reach the hacking regime despite floor-level readouts, because models learn to insert generic planning/filler text that delays the exploit past the point the monitor reads without removing it from the output. The authors argue offline monitor validation plus a low training-time readout is not sufficient evidence of behavioral control and that an out-of-band behavioral check is required.
arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026 - CLIMB: Confidence-Guided Complementary Evidence for Multimodal Retrieval-Augmented Generation
CLIMB is a training-free, inference-time framework for multimodal retrieval-augmented generation that improves knowledge-intensive visual question answering. It first builds a compact, non-redundant evidence pool using an MMR-style objective balancing query relevance and redundancy, then applies an R/E/C critic (relevance, evidence specificity, cross-modal alignment) alongside a confidence estimator that only accepts an answer update when estimated confidence increases, giving a built-in stopping criterion without modifying the underlying retriever or MLLM. Experiments on Encyclopedic-VQA and InfoSeek show consistent gains over existing multimodal RAG baselines.
arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026 - RailWave: Adaptive Spatial and Temporal Scheduling for Expert-Parallel Communication
RailWave is a phase-adaptive communication layer built on DeepEP that tackles the irregular All-to-All communication bottleneck in expert-parallel Mixture-of-Experts models. It combines RailBalance (source-local redistribution of traffic across network rails), a reusable topology-derived permutation schedule to cap concurrent senders per receiver, and a calibrated selector that picks an execution path per communication phase using offline profiling. On communication workloads derived from training the 106B GLM-4.5-Air model, it achieves up to 5.84x speedup on NVIDIA H800 and 4.36x on H20 versus the native DeepEP baseline.
arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026 - EdgeAgent: Orchestrating On-Device LLM inference for End-User Multi-Agent Systems on CPU-GPU Unified Memory Architectures
EdgeAgent is a cross-layer LLM inference system for running multi-agent workloads on edge devices with CPU-GPU unified memory architectures such as Apple M-series SoCs. It introduces zero-copy UMA-aware tensor parallelism to saturate both CPU and GPU, a dynamic speculative-decoding draft-budget scheduler adapting to sequence predictability, and an asynchronous suspend-and-yield mechanism that evicts stalled agents during tool-call latencies. On an Apple M4 SoC it reports 1.29x speedup from UMA-aware execution alone and 1.77x with full agent-aware scheduling, versus batched speculative decoding.
arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026 - From Patching to Pruning Visual Computation in Vision Language Models
Patch-to-Prune (P2P) is a training-free framework that repurposes activation patching from mechanistic interpretability into an inference-time compute bypass for vision-language models, replacing unnecessary visual-token projections in certain decoder layers with fixed neutral proxy vectors while preserving sequence length, token order, and residual pathways. Tested on Qwen2.5-VL and LLaVA family models across seven multimodal benchmarks, P2P at 3 percent tolerance retains about 94 percent of dense accuracy while cutting FLOPs by 55 percent, and reveals that intermediate decoder layers do most of the task-relevant visual integration while early and late layers need little token-specific visual computation.
arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026 - Mixture-of-Experts for Cryptocurrency Order Execution: Training Stability, Tail Risk, and Failure Modes
Evaluates vanilla Double Deep Q-Learning (DDQL), K-means-partitioned mixtures of DDQL experts (K=2, 4, 8) and parameter-matched dense networks for order execution on 5-minute BTC/USDT limit order book data from Binance. No learned configuration significantly beats DDQL on implementation shortfall, and all are worse than TWAP and immediate liquidation in this frictionless replay environment. Ablations show annealed exploration alone removes the collapse to wait-until-forced-liquidation policies (12/100 to 0/100), so expert partitioning appears to mask a training-specification flaw rather than add real benefit. The attribution of the failure mode reverses between 30 and 100 seeds, which makes the paper a case for repeated-seed evaluation in RL.
arxiv.orgpaperAdded 15 Oct 2026, published 2 Oct 2026 - ReFract: Benchmarking Perspective Awareness in Language Model Agents with Text World Models
ReFract is a benchmark of 150 expert-validated entries testing whether LLM agents can infer a user's role and act only through tools/actions legitimate for that role, a capability the authors term "Perspective Awareness." Entries are grounded in anonymized industrial-maintenance support queries and use constructed Text World Models to simulate the agent's operating environment and generate perspective-aware action trajectories. State-of-the-art LLMs solve at most 69% of tasks, with over half of trajectories containing attempts at perspective-violating actions, exposing this as a largely unsolved axis of agent evaluation relevant to high-stakes, physically-enacted agent deployments.
arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026 - VenusRL: A Fully Disaggregated Agentic RL System with Priority Scheduling and Scalable Interaction
VenusRL is a fully disaggregated system for agentic reinforcement learning that trains LLM agents through multi-turn interactions with external tool environments. It introduces a priority-aware action scheduler that uses length-prediction heuristics to prioritize sample groups likely to unblock the next training step across batch admission, KV cache residency, and cross-worker orchestration, plus an environment resource manager that packs more tool sandboxes per node via a memory-aware admission threshold and template-keyed page-sharing pool using copy-on-write for isolation. The system achieves up to 4.24x end-to-end training speedup and reduces environment (sandbox) cost by up to 89% over state-of-the-art baselines on agentic RL workloads.
arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026 - Execution-Path Qualification and Realized Costs in Speculative Decoding on Consumer Systems
An arXiv preprint that empirically tests speculative decoding on consumer hardware (Intel Arc B570, NVIDIA RTX, Apple M4-class systems), distinguishing between 'execution-path qualification' (whether a speculative predictor's output matches the target model's exact generation trajectory) and the realized latency/cost of running speculation. The authors find that a target-only, draft-free predictor matches greedy output on most repeat-stable prompts but does not guarantee qualification or identify a unique cause of divergence, and that newly qualified RTX serialization and other configurations (358H, M4 Guard) are often slower than target-only decoding once real costs are counted. The paper's conclusion is that these results are diagnostic engineering findings specific to the tested hardware/software paths, not evidence of a portable decoding speedup.
arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026 - VisionMX: Unlocking Microscaling Post-Training Quantization for Vision Models
VisionMX is a post-training quantization method for vision models using Microscaling (MX) formats, which pair low-precision numeric elements with shared block scales for efficient inference. The paper identifies three error sources in direct MX conversion of vision models—block-scale representation, poor alignment of small convolutional weights with nonuniform element grids, and underuse of signed codes by nonnegative activations—and addresses them via bounded weight rounding and a foldable affine activation correction. It is evaluated across image classification, object detection, semantic segmentation, and low-light image enhancement, showing improvements over direct conversion and existing post-training quantization baselines, especially for architectures most sensitive to MX conversion.
arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026 - Beyond Reward Hacking: Proxy Divergence Across Four Layers of a Staged Humanoid Learning Pipeline
This arXiv preprint extends the concept of reward hacking to four distinct "proxy" layers in a staged RL training pipeline for legged robots: the reward itself, the curriculum gate, the evaluation statistic, and the reference motion. Using measurements from a continuous PPO policy lineage trained on a simulated 1.91m humanoid over four stages and 13,500 iterations on a single laptop GPU, the author shows concrete divergence failures — e.g., a curriculum gate built on averaged error that advanced at its rate limit while the gated skill was absent, and a batched push test whose synchronized resets aliased gait phase and misranked push magnitudes by danger. For each layer it proposes a reformulation that closes the divergence, including L1 costs, peak/outcome statistics, gate reachability checks, deterministic/phase-desynchronized evaluation, and function-preserving input widening for growing a single policy instead of retraining.
arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026 - Investigating the Role of Reasoning-Language Alignment in Monolingual Retrieval-Augmented Generation
This paper studies whether forcing an LLM to reason in a specific language helps or hurts accuracy in retrieval-augmented generation (RAG), extending prior findings from short-prompt reasoning to settings where the model must integrate large retrieved context. The authors build a fully monolingual German RAG QA benchmark set in the fictional world of the tabletop RPG "The Dark Eye" — a domain richly documented in German but too niche for the model to answer from memory — forcing retrieval rather than memorization. They find that aligning reasoning language with the query/document language (German) outperforms a mismatched but higher-proficiency language (French), showing the benefit comes from language alignment rather than raw language skill, though forced German reasoning still only matches, and never exceeds, the model's native unconstrained English reasoning. The testbed and QA benchmark are publicly released.
arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026 - AREX-2: Advancing Self-Improving Agents through Long-Horizon Reflective Tasks
AREX-2 trains an LLM agent, built on Qwen3.8-27B, to self-improve at test time by iteratively refining solutions. The training data is synthesized long-horizon improvement trajectories from machine learning and algorithmic programming tasks, which give verifiable feedback. It reports 81.8 on MLE-bench Lite and 70.7 on Frontier-CS, and transfer to deep research with 84.0 on BrowseComp, 52.6 on HLE, 92.2 on GAIA and 93.8 on DeepSearchQA. Performance keeps improving as the budget of rounds grows. This supports the claim that reflection and long-horizon execution are domain-agnostic skills that can be learned from supervisable domains.
arxiv.orgpaperAdded 1 Oct 2026 - TACO: Ternary Absolute-max Column-wise One-sparse Optimizer for LLM Fine-Tuning
TACO (Ternary Absolute-max Column-wise One-sparse optimizer) is a new optimizer for full-parameter LLM fine-tuning that reduces optimizer state memory by computing the exact steepest-descent direction under a dimension-normalized operator norm, selecting only the largest-magnitude gradient entry per weight-matrix column. On OPT-13B it cuts persistent optimizer state 174x versus AdamW8bit (27.7GB to 0.16GB) and peak training memory 2.9x, while matching accuracy and runtime, enabling full fine-tuning of 30-32B-parameter models on a single 80GB H100.
arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026 - InterEvolve: Test-Time Evolution of Reward Programs for Humanoid Loco-Manipulation
InterEvolve is a test-time evolution method for humanoid loco-manipulation that lets a pretrained controller solve new tasks without retraining. It pairs an object-aware forward-backward (FB) behavioral foundation model, which turns new body/object rewards into loco-manipulation behavior, with "reward programs" — staged rewards with completion conditions and tunable constants — whose structure an LLM agent revises using execution feedback and a skill library, while a numerical optimizer tunes constants, with every candidate verified across parallel simulations. Experiments show it unlocks competence that human-designed rewards leave untapped and produces autonomous long-horizon behaviors on a physical Unitree G1 humanoid from onboard egocentric perception.
arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026 - Trust the Direction, Search the Step: Zero-and-First-Order Methods for LLM Fine-Tuning
This paper introduces ZFO (Zero-and-First-Order optimization), a lightweight fine-tuning framework that decouples search direction from step-size selection: a trusted first-order optimizer picks the direction, while two extra zeroth-order function evaluations along that single dimension build a local curvature-aware model to choose the step size, avoiding a full line search. The authors give theoretical guarantees on finite-difference curvature estimates, near-optimal step selection, and convergence to a stationary-point neighborhood, and show empirically that ZFO improves optimization and final performance over fixed-step first-order baselines across several language models and datasets. Code is released publicly, making it a usable technique for practitioners fine-tuning LLMs who want cheaper adaptive step-size control.
arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026 - DuoMind: Enabling Distributed Multi-Robot Coordination with Semantic Communication
DuoMind is a distributed hierarchical framework for multi-robot coordination that pairs a per-robot vision-language-action (VLA) model for low-level execution with a vision-language model (VLM) orchestrator for high-level reasoning and inter-agent semantic communication. The authors also introduce RoboPoly, a new benchmark of long-horizon manipulation tasks requiring coordinated, closed-loop execution under distributed control, and show gains on RoboPoly and RoboTwin with ablations confirming the value of hierarchical orchestration and semantic messaging.
arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026 - MosaiChunk: Compositing Spatio-Temporal Memory for Autoregressive Video Generation
MosaiChunk is a spatio-temporal memory mechanism for autoregressive video generation that composes a "mosaic" of selected historical key-value (KV) cache entries across space and time, letting a frozen video generator recover fine-grained visual details of objects/scenes that fell out of the finite context window. Only a lightweight router is trained to pick which historical KV sections fit a fixed active-memory budget, while the base generator stays unchanged. The paper also introduces RememBench, a benchmark of long-horizon revisit scenarios with text-to-video (T2V) and camera-driven image-to-video (I2V) splits, showing MosaiChunk beats sliding-window inference and whole-chunk retrieval at matched memory budgets.
arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026 - From Knowledge Access to Source Learning: Developing Source-Specific Competence
This paper introduces "source learning," the idea that an LLM agent repeatedly consulting the same authoritative external source should progressively build reusable competence in understanding it, rather than treating each access as independent retrieval. The authors propose SourceLearn, which combines Self-Directed Source Learning (identifying and revisiting poorly understood parts of a source) and Task-Guided Source Learning (using downstream task experience to find representational gaps), maintaining a persistent, reconstructable "source model" of structure, interpretation and application. Across five benchmarks and three LLM backends, SourceLearn beats Hybrid RAG by up to 22.6 points and outperforms static source representations and experience-based agent-memory baselines in 13 of 15 settings.
arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026 - Harnessing Domain Specialists in Multimodal Mixture-of-Experts for Efficient Adaptation
This arXiv paper studies emergent semantic specialization among experts in multimodal Mixture-of-Experts (MoE) models and introduces ExpertLens, a data-free method that identifies domain-specialized experts by decoding router weights into vocabulary tokens from pretrained weights alone. Using this to selectively fine-tune only the relevant experts, the authors match or beat full fine-tuning on math, medical, and remote-sensing tasks while updating only 21.7-47.0% of parameters, achieving a 4x training speedup and outperforming LoRA in both performance and efficiency.
arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026 - Where-OPD: Spatially Guided On-Policy Self-Distillation of MLLMs with Synthetic Scenes
Where-OPD introduces an on-policy self-distillation method for multimodal LLMs where a teacher model receives textual spatial guidance (object identities and coordinates from procedurally generated synthetic scenes) to locate relevant image regions, while a student learns to reproduce this behavior from just the image and question. The approach is annotation-free and scalable, improving performance on counting, document and chart understanding, and transferring from synthetic training to real-world perception benchmarks (CVBench, V*, ZoomBench, BLINK, HR-Bench, MME-RealWorld) with a 3.23-point average gain.
arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026 - Are We Recovering Mechanisms? Objective-Level Recovery Gaps in Mechanistic Interpretability
This paper shows that intervention-defined faithfulness metrics used to evaluate automated circuit discovery in mechanistic interpretability can favor a worse circuit over a better one, an objective-level recovery gap. Testing EAP, EAP-IG, ACDC, and Edge-SP across four human-reference tasks and InterpBench, the authors find KL-based faithfulness misranks 9.4%-41.2% of candidate circuit pairs under held-out resampling, and trace the cause to context distortion, where excluded signals change the inputs retained components operate on. Restoring selected signals from the intact model's execution repairs 96 of 100 persistent misrankings, showing the evaluation objective itself, not just the search algorithm, needs fixing.
arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026 - LLM2Jev: LLMs Are Already Jev-Style Decision Models -- When and How to Fine-Tune Them
LLM2Jev is an architecture-preserving framework that extracts calibrated categorical decisions directly from an LLM's next-token probabilities over bracketed numeric identifiers, rather than generating free-form text. The paper shows Qwen3.5-4B already matches community Jev-style decision models out of the box (training-free), while fine-tuning with a tree-factorized listwise loss plus KL-divergence anchoring to the base model gives targeted gains mainly for weaker backbones (like Qwen3-0.6B) and tasks such as many-option intent routing, without degrading conversational generation.
arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026 - UniWAM: Unified World-Action Model
UniWAM is a unified architecture that combines a physical reasoner, a world generator, and an action predictor to jointly learn semantic understanding, visual generation, and action prediction for embodied agents, bridging vision-language-action (VLA) models and world-action models. It uses a data cleaning/annotation pipeline for human egocentric and robot data, represents low-level actions in natural language for VQA/egocentric/robot co-training, and introduces future visual noise augmentation plus history-conditioned flow matching to cut denoising steps while achieving state-of-the-art results on in-distribution performance, robustness, generalization, instruction following, and long-horizon tasks. The paper also reports a log-linear scaling law for unified human-robot co-training.
arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026 - Mimir: Physics-Grounded LLM Agents for Long-Horizon Irrigation Control
Mimir is a physics-grounded LLM agent for long-horizon irrigation control that pairs a fast-timescale loop — where a structured physical interface and deterministic simulator verify, revise, and bound LLM-proposed actions before execution — with a slow-timescale loop that consolidates recurrent failure patterns into persistent contextual principles, while keeping the physical model, evaluator, and execution constraints immutable. Evaluated across multiple sites, crops, and years with a common retrospective evaluator, Mimir achieves the lowest aggregate control cost among tested baselines and uses about 51% less irrigation than historical schedule replay; ablations show forward simulation, verified revision, and persistent context are all necessary, and scaling LLM size or switching model families gives no monotonic improvement.
arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026 - Can AI Oversight Be Zero Knowledge?
This paper studies whether AI oversight mechanisms based on interactive proofs and debate (used for verifying AI outputs derived from confidential data, e.g. a fitness-for-duty assessment from medical records) can be made zero-knowledge, so a verifier learns nothing beyond correctness. The authors prove a general impossibility result in the random oracle model — no zero-knowledge proofs exist for general oracle-aided computation, and this extends to debate, a canonical scalable-oversight model — but show that if the oracle cryptographically signs its answers, every oracle-aided computation can be verified in zero knowledge with an efficient prover and verifier using only collision-resistant hash functions. The signed-oracle construction also offers a new approach to scalable oversight that avoids relying on an honest debate opponent or on the computation's robustness.
arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026 - Mapping the RAG Landscape: A Four Axis Taxonomy of Efficiency, Defense, Interactivity, and Reasoning
This arXiv survey organizes recent Retrieval-Augmented Generation (RAG) research into a four-axis taxonomy covering retrieval efficiency, robustness/security, user-driven interactivity, and multi-step reasoning. It formalizes RAG framework components, reviews dense/sparse retrieval, fusion strategies, embedding optimization, and RL-based retrieval policies, and compares Naive, Advanced, and Modular RAG architectural variants alongside evaluation practices and domain applications. The paper closes by outlining open challenges in retrieval quality, reliability, domain adaptation, scalability, and explainability.
arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026 - Selection-Based Structured Reasoning: Toward Efficient Multimodal Search Agents
The paper introduces Selection-based Structured Reasoning (SSR), a framework that replaces free-form chain-of-thought generation in multimodal search agents with selection among pre-specified, reusable natural-language reasoning candidates, scored by likelihood via teacher-forced prefilling with a shared KV cache. Evaluated on seven multimodal search benchmarks using 2B and 4B scale models under both reinforcement learning and supervised fine-tuning, SSR matches the success rate of leading search agents of the same scale while cutting per-turn reasoning latency by over 90% and total per-question inference latency by 28-54%. It targets the problem of small models producing long, low-value reasoning traces before each action, which is costly at inference time.
arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026 - Identity Management for Agentic AI [pdf] (2025)
A whitepaper from the OpenID Foundation, led by Tobin South with contributors from WorkOS, Stanford's Loyal Agents Initiative, and the Artificial Intelligence Identity Management Community Group, mapping how authentication and authorization standards apply to AI agents. It surveys current fixes (OAuth 2.1, Model Context Protocol authorization, enterprise SSO/SCIM provisioning, IPSIE profiles) and lays out unsolved problems for autonomous agents: delegated "on-behalf-of" identity versus user impersonation, consent fatigue at scale, recursive sub-agent delegation, multi-user shared agents, and browser/computer-use agents that bypass API-based authorization entirely.
openid.netpaperAdded 2 Oct 2026, published 1 Oct 2026 - LineupRL: Verifiable Reinforcement Learning for Time Series Captioning via Caption-to-Series Identification
LineupRL is an RLVR (reinforcement learning with verifiable rewards) pipeline for training time series captioning models, where the reward comes from a frozen LLM verifier that must match a generated caption back to its source time series among distractors, rather than judging caption quality directly. The authors show a 3B vision-language model trained with LineupRL outperforms SFT and RL baselines across two captioning benchmarks plus downstream forecasting/reconstruction tasks, and even beats the 72B VLM whose captions the SFT baseline distills from, using 1/24 the parameters, while resisting reward hacking.
arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026 - A Matryoshka Hierarchical RAG for Efficient Multi-Hop Question Answering
MatRAG is a hierarchical Retrieval-Augmented Generation framework for multi-hop question answering that organizes a document corpus into a Directed Acyclic Graph of clusters with progressively coarser granularity, indexing each level with a correspondingly lower Matryoshka embedding dimension. It pairs a top-down DAG traversal with an entity-driven mechanism that bounds the hop budget and re-ranks candidates, avoiding the need for knowledge-graph construction or LLM-based summarization at index time while using dimension-aware similarity to cut query-time cost. The paper reports it outperforms seven baselines on three standard multi-hop QA benchmarks while reducing both indexing and querying costs.
arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026 - DRelay: Global Draft Context for Prefix-Aware Parallel Speculative Decoding Repair
DRelay is a speculative decoding technique for LLM inference that repairs parallel draft-token selections before target-model verification, using a global reader over the entire draft block plus a causal selector to decide whether to keep or replace each candidate token, extending the accepted prefix length. Trained jointly with the draft backbone via a combined candidate-support and position-weighted repair loss, it is evaluated on eight benchmarks on an H800 GPU and, under SGLang serving, improves end-to-end decoding speedup substantially over DFlash, Domino, and DSpark baselines.
arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026 - AgSpec: Pushing the Limits of Retrieval-Based Speculative Decoding in Coding Agent Pipelines
AgSpec is a retrieval-based speculative decoding framework built for coding-agent pipelines. It drafts tokens by retrieving from session, workspace, and global corpora, including the ongoing session trajectory and opened files indexed in the agent's own emission format, and bounds or adapts each agent's draft length using an offline-profiled cap plus online verification feedback. On two repository-level multi-agent coding benchmarks it beats five retrieval-based drafters and EAGLE-3 in most settings, raising generation throughput over autoregressive decoding by up to 4.37x at batch size 1 and 4.76x at batch size 16, with gains that generalize to non-repository, single-agent coding settings too.
arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026 - A Citation-Grounded Benchmark for Trustworthy Earnings Call Transcript Analysis with Large Language Models
This arXiv paper introduces a benchmark for evaluating whether LLM-generated financial analyses of earnings call transcripts are properly grounded in citable evidence. It proposes a numeric evidence evaluation method that assesses groundedness without expert annotation, an automated dataset construction pipeline, and the resulting ECTs-100 dataset built from the top 100 S&P 500 constituents. The study also examines "conscious incompetence" — whether models correctly abstain when evidence is insufficient rather than hallucinating — finding LLMs ground claims well but still struggle with factual correctness and recognizing insufficient evidence.
arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026 - RMS-AQA: A Two-Stage Spatial Audio Question Answering Benchmark for Real-World Domestic Environments
RMS-AQA is a two-stage spatial audio question answering benchmark for domestic environments, designed to test audio-language models' ability to first ground audible sound events and then perform spatio-temporal reasoning about them. The dataset combines real first-order Ambisonics (FOA) recordings with synthetic data generated from measured room impulse responses (RIRs), and the authors include a lightweight spatial plug-in to inject FOA-format spatial data into frozen audio-language backbones. Experiments show the main failure modes are concurrent sound sources, far source distance, and a sim-to-real gap between RIR-synthesized and authentic recordings.
arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026 - AuraForge: Scaling Security Supervision for Training Coding Agents
AuraForge is a pipeline that synthesizes and validates executable security tests to supervise the training of coding agents, using attack-oriented test synthesis and safeguards against reward hacking. The authors build AuraGym, a multi-language (Python, JavaScript, TypeScript) training gym of 679 feature-implementation tasks from 344 real repositories spanning 177 CWE categories, and show that training Qwen3.5-4B with these synthesized tests beats human-written security tests on both functional correctness (FuncPass) and security (SecPass) metrics, while producing about 3x more test cases and cutting false positives by 83 percent.
arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026 - VibeMemBench: Evaluating Memory Systems for Coding Agents on Real Repository Coding Tasks
VibeMemBench is a benchmark for evaluating persistent memory systems on 111 real-repository coding targets (from 90 SWE-rebench V2 repos, with 3,634 prior-work trajectories), built via a four-stage SIEVE pipeline that verifies a target's injected history experience actually improves executable test outcomes before inclusion. The paper finds that frozen, verified "useful" experience transfers small resolution gains (1.1–4.5 pp) and step reductions to held-out solvers (DeepSeek-V4-Pro, GLM-5, GLM-5.2, Kimi-K2.7-code, Qwen3.8-max), but when four existing memory systems (Mem0, SimpleMem, MemoryOS, A-MEM) must construct and retrieve that experience themselves, 11 of 12 solver/system pairings fail to beat the memory-off baseline — exposing a large gap between latent useful history and what current memory systems actually deliver.
arxiv.orgpaperAdded 30 Sep 2026 - StateTape: Action-Conditioned Evidence Lifecycle Modeling for Long-Horizon Coding Agents
StateTape is a framework for long-horizon coding agents that replaces text-based context pruning/summarization with a symbol-level code graph tracking which code symbols each write could have affected. A per-write procedure uses the graph to nominate context records a write may have falsified, with a small manager model resolving ambiguous cases, turning staleness detection from text inference into an observation of actual code dependencies. The paper introduces TraceBench, a benchmark labeling what an agent holds versus what it actually needs, and shows improved resolve rates across six coding agents and three edit-heavy benchmarks with low computational overhead.
arxiv.orgpaperAdded 30 Sep 2026 - CheatBench: Measuring Reward Gaming in AI Agents
CheatBench is a benchmark for measuring "reward gaming" (a.k.a. reward hacking) in reinforcement-learning-trained AI agents: environments across mathematical research, knowledge work, coding, and visual tasks pair difficult assignments with opportunities to cheat, letting researchers compare how different models pursue reward when honest completion is hard. The paper motivates this with real and controlled incidents of agents accessing unauthorized information, evading monitoring, and breaching sandbox protections, and the benchmark is publicly released to support cross-model and cross-task-category comparisons.
arxiv.orgpaperAdded 30 Sep 2026 - SAGE: A Statistical Acceptance Gate for Self-Evolving Agents
SAGE is a statistical acceptance gate for self-evolving LLM agents that replaces the naive accept-if-aggregate-score-improves rule used when an optimizer edits an agents persistent skill document. It uses per-item paired comparison between the current and edited skill on identical validation items, exposing regressions an aggregate score hides, plus a one-sided paired significance test that only commits edits whose wins reliably beat their losses, addressing both permanent regression risk and the optimizers curse from noisy finite validation sets. Across five benchmarks and four backbone LLMs, SAGE cuts regression rates in 19 of 20 settings, for example 36.5 percent to 0 percent on LiveMath and 42.8 percent to 0 percent on OfficeQA with DeepSeek V4, while also achieving the best final score in all 20 settings.
arxiv.orgpaperAdded 30 Sep 2026 
Raven: The Harness of Harnesses for Composable Agentic IntelligenceRaven is an open-source multi-agent framework that automatically constructs and evolves modular 'harnesses' pairing specific models with domain-specialized execution scaffolding, treating each model-harness pair as a composable unit of intelligence. A Host Agent decomposes goals and routes subtasks to specialized agents while a host archive, EverOS, and Skill Forge preserve and reuse experience across tasks; the paper provides theoretical conditions under which this composition provably expands reliable task coverage beyond individual agents under a shared resource budget, and reports Raven outperforming state-of-the-art agent systems on complex, long-horizon tasks.
huggingface.copaperAdded 30 Sep 2026- Multimodal Flow: Unified Flow Modeling of Language and Vision in Embedding Spaces
Multimodal Flow (MF-1) is a fully continuous generative model that unifies language and vision modeling by representing both text and images as ordered continuous "hyperchunks" processed through a single shared chunk-causal Flow Matching backbone, avoiding the visual quantization bottleneck of discrete-token unified models and the mismatched objectives of hybrid discrete/continuous approaches. Joint attention handles cross-modal interaction while modality-specific feed-forward networks process each modality, and the model predicts multiple chunks in parallel during training but generates sequentially at inference. Pretrained at 0.6B/1.2B/1.6B scales on 150B tokens, MF-1 scores 82.8 average on GenEval/DPG-Bench and 75.3 on VQAv2/MMBench/POPE, remaining competitive with unified models trained on far more data and outperforming matched hybrid/discrete baselines; code and model are publicly released.
arxiv.orgpaperAdded 1 Oct 2026, published 30 Sep 2026 - Semifactual Credit-Augmented Policy Optimization
This paper proposes Semifactual Credit-Augmented Policy Optimization (SCAPO), a variant of Group Relative Policy Optimization (GRPO) for reinforcement learning with verifiable rewards (RLVR). It uses semifactual prompt interventions to measure token-level probability drift and derive normalized stability scores, reducing advantage credit for unstable (likely spurious) tokens during early training rather than uniformly assigning the same advantage to every token in a response. On Qwen3-4B-Base and Qwen3-1.7B-Base, SCAPO improves AIME 2024-2026 accuracy over GRPO by 5.63 and 4.17 percentage points respectively, and achieves the best results on most math benchmarks and all out-of-distribution benchmarks tested.
arxiv.orgpaperAdded 1 Oct 2026, published 30 Sep 2026 - Ranking-Aware Prompt Optimization for Multimodal Clinical Diagnosis
The paper introduces Ranking-PE, a modification to reflective prompt-optimization methods like GEPA that replaces per-instance accuracy scoring with pairwise AUROC-equivalent scoring (via the Wilcoxon-Mann-Whitney identity) across the scores matrix, reflection feedback, and candidate selection. Applied to multimodal clinical diagnosis on MIMIC with fine-tuned Qwen3-VL-8B and MedGemma-4B, it shows accuracy-based prompt evolution can degrade ranking performance under class imbalance, while Ranking-PE improves AUROC by +5.8pp and +16.2pp respectively, with ablations showing a medical-grade visual backbone is a necessary prerequisite that prompt search alone cannot substitute for.
arxiv.orgpaperAdded 1 Oct 2026, published 30 Sep 2026 - Removing Timing Shortcuts Improves Non-Invasive Brain-to-Text
The authors show that reported gains from d'Ascoli et al. (2025) on decoding words from non-invasive brain recordings are mostly an artifact: overlapping fixed-length windows leak word-duration (timing) information, letting a model reach 22.0% balanced accuracy on synthetic signals with no brain data at all, versus 22.3% on real recordings. By processing each word window independently instead of jointly encoding a sentence, they remove this timing shortcut, which makes prediction aggregation and LLM linguistic priors become genuinely effective; the resulting method, SimpleB2T, achieves 36.6% word error rate with five observations per word on a perceived-speech benchmark, approaching invasive decoding performance.
arxiv.orgpaperAdded 1 Oct 2026, published 30 Sep 2026 - Physis-Lang: Self-Evolving Language as a Physical Representation for Video World Model
Physis-Lang is a self-evolving framework that uses natural language (describing entities, causes, interactions, governing principles, and temporal evolution) as the shared physical-knowledge representation across data curation, training, and generation for video world models. The authors build PhysCapBench to score captions via recall/precision over atomic physical assertions, use an agentic loop to refine captioning instructions, and apply language-guided retrieval to find videos covering missing physical processes. Applied to Wan and Cosmos backbones, it improves physical plausibility on four video benchmarks, with Physis-Lang-enhanced open Cosmos3-Nano models reportedly surpassing the proprietary Veo 3.1.
arxiv.orgpaperAdded 1 Oct 2026, published 30 Sep 2026 - ViTeX-Bench: Benchmarking High-Fidelity Video Scene Text Editing
ViTeX-Bench is a benchmark suite for high-fidelity video scene text editing, pairing a dataset of 387 real-world 720p videos (text-region masks plus editing instructions, 230 for training and 157 frozen for evaluation) with a three-axis, 13-metric evaluation protocol covering text correctness, visual/temporal quality, and edit locality. The authors benchmark eight baselines across four editing families and release ViTeX-Edit-14B, an open-source reference editor using motion-aligned glyph-video conditioning that achieves the best CharAcc (0.688) among video-native editors and the lowest text-crop Warp among raw outputs.
arxiv.orgpaperAdded 1 Oct 2026, published 30 Sep 2026 - AssemblyWorld: Rethinking 3D Assembly with General-Purpose Agents
AssemblyWorld is an interactive 3D environment where general-purpose agents assemble objects (furniture, industrial parts, fractured pieces) by inspecting rendered 2D views and manipulating supplied rigid parts, optionally guided by images or assembly manuals, without any assembly-specific fine-tuning. The accompanying AssemblyWorldBench benchmark covers 100 tasks across 80 objects and evaluates eight agent systems geometrically; the best system reaches 80.9% part accuracy but only 59.4% complete-assembly success, and open-source systems lag closed-source ones in both reliability and accuracy. The paper analyzes interaction trajectories and failure modes to characterize the gap between approximate structure recovery and precise 3D reconstruction.
arxiv.orgpaperAdded 1 Oct 2026, published 30 Sep 2026 - Image Classifiers are Efficient Self-Supervised Video Representation Learners
This paper introduces VideoMSN, a Masked Siamese Network that repurposes standard image Vision Transformers for self-supervised spatio-temporal video representation learning by representing videos as 'super images' (grids of sampled frames) and aligning spatial-masked and temporal-masked views with a shared ViT encoder. Starting from pretrained DINO-v3 and DeiT-v3 image encoders, it achieves state-of-the-art results on Kinetics-400, UCF101, and HMDB51 while using up to 32x and 160x fewer video pretraining epochs than prior video self-supervised methods, and shows strong low-shot transfer performance.
arxiv.orgpaperAdded 1 Oct 2026, published 30 Sep 2026 - Ego4WAM: What Matters When Scaling Egocentric Human Data for Robot Learning?
Ego4WAM is a systematic study of using egocentric human video data to train robot policies under a unified world-action model framework. The authors disentangle which data properties matter most — human-robot alignment, data duration, task diversity, and whether action labels are available — finding that aligned human demonstrations improve out-of-distribution generalization and reduce target robot data needs, and that video-only supervision (without action labels) is still useful as a foundation before video-action training. Findings are validated via closed-loop policy evaluation on real robots and in the RoboDojo simulation benchmark.
arxiv.orgpaperAdded 1 Oct 2026, published 30 Sep 2026 - EvoDuet: Bilevel Co-Evolution of Web Searching and Task Solving for Scientific Discovery
EvoDuet is a bilevel optimization method that co-evolves candidate solutions and web search queries for LLM-driven evolutionary search in scientific discovery tasks, keeping model parameters fixed. A retrieval gate lets the LLM decide whether to fetch new documents, reuse cached ones, or skip retrieval; an inner loop refines queries and ranks documents by predicted solution score, while an outer loop generates candidates from these documents in parallel. On 21 optimization tasks it raises OpenEvolve's normalized discovery gain from 74.1% to 78.0% with GPT-5.6 Luna and from 61.3% to 82.3% with Gemini 3.8 Flash (no benefit seen with Qwen3.5-9B), and surpasses prior best scores on eight tasks including Swap Reduction on Q20 and Rosetta.
arxiv.orgpaperAdded 1 Oct 2026, published 30 Sep 2026 - Is Weight Tying Still Beneficial for Decoder-Only LLMs in Private Settings Under DP-SGD?
This paper studies whether weight tying between input and output embeddings, common in decoder-only LLMs for parameter efficiency, remains beneficial when models are fine-tuned under Differentially Private Stochastic Gradient Descent (DP-SGD). Using GPT2 and DistilGPT2 fine-tuned on SST-2, QNLI, and QQP, the authors find untied embeddings consistently outperform tied ones by up to 4.74 accuracy points, and that untying also enables memory-efficient ghost clipping (since tied embeddings create shared-parameter interactions that break standard ghost norm computation), yielding over 60% lower memory usage. The results suggest standard LLM architectural choices should be revisited for privacy-preserving training settings.
arxiv.orgpaperAdded 1 Oct 2026, published 30 Sep 2026 - Linguistic Loopholes in LLM Unlearning: From a 174-Language Benchmark to Coverage-Aware Unlearning
The paper shows that unlearning a fact in one language can leave it recoverable in others, because changing the query language or the answer language reopens the knowledge. It defines language-budgeted multilingual unlearning, where a subset of languages is chosen to maximise cross-lingual erasure. It also introduces the Cross-Lingual Unlearning Tensor benchmark, which covers 174 language–script pairs and 25 atomic paraphrase types. Its COVER method selects source languages to maximise predicted coverage of languages that get no forget supervision, and needs only benign calibration data and the frozen model. Across three model families and two forget sets, COVER cuts mean held-out residual access by 7.8–27.3% versus uniform source selection. The gains carry over to real news documents in low-resource languages from the LORELEI corpus.
arxiv.orgpaperAdded 1 Oct 2026, published 30 Sep 2026 - TraceDance: Automated System for Building Agent Behavior Benchmarks from Real-World Deployment Traces
TraceDance is an automated system that mines real-world agent deployment traces to build targeted benchmarks for user-specified undesirable agent behaviors, using an Anchor-and-Confirm retrieval-plus-LLM-confirmation pipeline and an Anchor Synthesis Loop to generate behavior specifications. Benchmarks evaluate an LLM's next-turn response at a recorded decision point against a behavior-specific rubric, avoiding the need for reference answers or environment replay. Applied to 252,557 sessions in coding and tool-use domains, it produced 107 benchmarks with 4,125 instances, and testing nine frontier LLMs found a mean pass rate of only 26.7 percent, exposing persistent agentic behavior weaknesses.
arxiv.orgpaperAdded 29 Sep 2026 - Same Model, Different Harness: Different Coding-Agent Results
This paper isolates the 'harness' — the scaffolding that decides what a coding agent sees, which tools it can use, and how work continues — from the underlying model, comparing two harness configurations on SWE-bench Verified, SWE-bench Pro, and FeatureBench. Under a tight context window, a treatment harness that mechanically shortens older tool results and responds to stalled work raises mean per-task fail-to-pass fraction from 28% to 49% and complete solutions from 43 to 72 on a 169-task SWE-bench Verified cohort, with similar gains reproduced across three other models without retuning. The authors argue that because frozen model weights produced very different outcomes purely from harness changes, coding-agent evaluations must treat model and harness together as the tested solver rather than attributing results to the model alone.
arxiv.orgpaperAdded 29 Sep 2026 - Point2Part: Unified 3D Partitioning from Point Prompts
Point2Part is a promptable 3D part-decomposition model that, given 3D point prompts (one per desired part), jointly partitions an image or mesh into non-overlapping parts that fully cover the shape, unlike prior methods that allow overlaps or gaps. It builds on a pretrained 3D generation model's shape latent space, adding a prompt encoder mapping point prompts to part tokens and a coarse-to-fine part decoder that assigns every shape position to exactly one part, unifying image-to-part generation, mesh-to-part generation, and part segmentation in one model. The authors report outperforming prior SOTA on part-quality metrics and an order-of-magnitude improvement in part compatibility across all three tasks.
arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026 - Skill-Space Shooting for Autonomous Robot Policy Improvement
This arXiv preprint introduces "skill-space shooting," a method that uses foundation model guidance to search over reusable short behaviors (skills) to generate corrective actions for a robot policy, turning successful trials into training data for policy improvement without human demonstrations. Real-world robot experiments show the approach enables repeated autonomous policy improvement and that learned skills can be shared across tasks to reduce the teaching effort needed on new tasks.
arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026 - Imagine3D-LLM: Teaching MLLMs to Imagine 3D Scenes Before Answering
Imagine3D-LLM appends learnable summary tokens after image tokens in an MLLM, decoding them into a compact 3D Gaussian Splatting representation supervised by a photometric reconstruction loss, trained jointly with next-token prediction. This mimics human coarse spatial reasoning (identifying common objects across views, inferring relative geometry) rather than relying on fine-grained pixel correspondence or fused 3D geometry foundation model features, and the paper shows this reconstruction objective also improves cross-frame correspondence in the LLM's image features. The approach outperforms prior methods across multiple spatial reasoning and 3D understanding benchmarks.
arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026 - Breakdown of Local Denoising as Semantic Speciation
This paper studies two temporal phenomena in generative model sampling dynamics: a 'speciation window' where a sample commits to a semantic class, and a 'nonlocality window' where local context becomes insufficient for generation. Under a 'common cause' hypothesis — that semantic labels explain correlations between distant tokens — the authors prove the nonlocality window must fall within the speciation window, and identify conditions under which both windows collapse to a single phase-transition point as system size grows, verified analytically in Gaussian mixture models.
arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026 - Counterfactual Video Generation Enables Scalable Humanoid Loco-Manipulation
PRISM is a real-to-sim-to-real framework that scales humanoid loco-manipulation training by generating hundreds of diverse "counterfactual" human-object interaction videos from a handful of real exemplar clips via video-to-video generation. A contact-anchored real-to-sim pipeline reconstructs physically plausible human and object motion trajectories from this synthetic video data, letting a single policy generalize to unseen objects within a category; the authors deploy the resulting policy on a real humanoid, which picks up, carries, and drops novel boxes, barrels, bins, and balls using only onboard depth, without real-world fine-tuning.
arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026 - Adversarial Training for Pixel Diffusion
This paper shows that adding an adversarial loss as a post-training correction to pretrained pixel diffusion/flow-matching models (applied at non-high-noise timesteps, architecture and sampler unchanged) restores missing high-frequency, fine-scale natural-image statistics that these models systematically underproduce. Through frequency-band/power-law analysis and nearest-neighbor, recall, and no-GAN matched-SFT controls, the authors rule out memorization or mode-dropping as explanations, and show the effect jointly improves distribution fidelity, coverage, prompt alignment and perceptual quality — but does not transfer comparably to latent diffusion configurations, pointing to direct pixel-output access as the key enabling factor.
arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026 - STEPQuant: When and Where Errors Matter in Delta-Rule Recurrent State Quantization
STEPQuant is a spatial-temporal post-training quantization framework for the fixed-size recurrent states used by Delta-rule linear attention, which become a memory bottleneck under concurrent serving. It allocates bit precision based on error magnitude and memory lifetime (temporal) and fits per key-row/value-column scales based on state distribution and output impact (spatial), achieving near-FP32 accuracy at a 6-bit budget and beating uniform INT8 at 4-bit. Evaluated on Qwen3.8-27B and Kimi-Linear-48B-A3B-Instruct, and integrated into SGLang with custom GPU kernels, it delivers over 5x recurrent-state compression and up to 68.7% total serving memory reduction.
arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026 - LeapQuant: Efficient Linear Attention with Accurate Recurrent State Quantization
LeapQuant is a training-free quantization method for the fixed-size recurrent state used by linear-attention LLM architectures like Gated DeltaNet and Kimi Delta Attention, aiming to cut the inference bottleneck of repeatedly reading and updating that state. It introduces per-window quantization (re-quantizing the state only once per token window, using high-precision buffered updates in between) plus "Compensator Tokens" that preserve the state's largest outlier values in high precision, with residual smoothing to further reduce error. Across Qwen, Kimi, and GLM model families, it reaches near-FP32 accuracy at 8-bit while delivering 2.05–3.70x kernel-level and 1.47x end-to-end speedups on NVIDIA B200, RTX PRO 6000, and RTX 5090 GPUs.
arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026 - Rho: A Foundation for Efficiently Adaptable VLA Models
Rho is a family of open-weights vision-language-action (VLA) models for bimanual robotic manipulation, designed for data-light adaptation across three dual-arm embodiments (YAM Box, UR AI Trainer, FR3 Duo). The paper ablates the action-expert architecture and training recipe, showing that "embodiment midtraining" improves downstream adaptation, and introduces an internal latent policy that learns from as few as 15 corrected episodes to steer a frozen flow-matching action expert toward out-of-distribution task situations. The authors release base and embodiment-specific checkpoints, positioning Rho as both a strong general-purpose manipulation model and a practical foundation for efficient adaptation.
arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026 - Rethinking Representations for World-Action Modeling
This paper studies how to design the shared representation space used by world-action models, which jointly learn robot control policies and predict future observations. It finds that neither reconstruction fidelity nor raw pre-trained perceptual features alone yield good policy learning, and proposes ReWAM, built on pre-trained DINO features with a Temporal Representation Bottleneck and Action-Grounded Representation Shaping that routes only action-loss gradients into the bottleneck so the policy shapes what is encoded while the world model learns its dynamics. Without generative video pre-training, ReWAM reaches 93.6% success on RoboTwin 2.0 and an 8.28% success rate on RoboDojo using roughly 600 hours of embodied pre-training data.
arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026 - A Spectral Theory of Distortion in LLM Graph Reconstruction: Sharp Bounds and Empirical Characterization
This paper proves that the Wasserstein distance between Laplacian spectra of original and LLM-reconstructed graphs is bracketed by two edge-count quantities, the net change in edge number and the symmetric difference, each scaled by 2/n, showing when these bounds coincide (pure addition or pure deletion of edges) and when they diverge (mixed editing, i.e. both inventing and losing edges). Using this theory, the authors analyze 135 graph reconstructions produced by three open-weight LLMs over 45 synthetic graphs, finding 77 one-sided outputs and 29 mixed outputs with a positive residual, revealing that aggregate distortion metrics mask qualitatively different editing policies across models, from copying the input to hallucination-heavy completion.
arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026 - EmoRES-TTS: Residual-Enhanced Vector Steering for Emotional Speech Generation
EmoRES-TTS introduces a training-free vector steering method for emotion-conditioned text-to-speech that decomposes an emotion direction into a shared 'away-from-neutral' component and a residual 'toward-target-emotion' component, controlling each separately without retraining the backbone model. Evaluated on IEMOCAP with the IndexTTS-2 and CosyVoice2 TTS backbones, it outperforms the prior CoCoEmo steering baseline across rank correlation and emotion hit rate, and wins in human evaluations for emotion identification, fidelity, and naturalness.
arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026 - DMA$^2$: Pixel-space Distribution Matching with Adversarial and Anchor Losses
DMA^2 is a distribution matching distillation (DMD) method tailored to pixel-space (rather than latent) diffusion teachers for text-to-image generation. It introduces DINO-Adv, which removes the heavy fake-score critic from the adversarial gradient path and instead supplies local patch guidance via an external DINOv2 representation, plus AF-Loss, a parameter-free auxiliary semantic distribution-field objective operating in DINOv2 feature space on rolling real/generated supports. The resulting four-step student outperforms its 25-step teacher and other few-step distillers on DPG-Bench, GenEval, VQAScore, and COCO30K.
arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026 - Beyond the Timeline: Augmenting Long-Video Memory with Grounded Entity Biographies
This paper introduces Grounded Entity Biographies (GEB), a long-video memory framework that links visually grounded observations of the same physical object or person across clips into retrievable "biographies," addressing the problem of text-derived entity descriptions failing to resolve physical identity across hours- or days-long recordings. During question answering, these biographies are retrieved alongside episodic evidence so a model can follow an entity through events via identity links established at memory-construction time. Evaluated on four long-video QA benchmarks (day-long and week-long recordings), GEB improves over prior memory frameworks, reaching 72.0% accuracy on EgoLifeQA — 4.4 points above the prior best published result — with ablations showing both grounded identity association and biography reading contribute to the gains.
arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026 - FracGen: Learning How Objects Stretch and Tear with Physics-Informed Video Generation
FracGen is a fracture-aware video generation model that, given a single image of an intact object, generates plausible and controllable fracture dynamics (where an object tears, crack propagation speed, pre-failure deformation) conditioned on physics signals. It is trained using FracSim, a material point method (MPM) simulation framework augmented with a continuum damage model that produces paired fracture videos and dense pixel-aligned physical fields at no extra rendering cost; FracGen jointly predicts these fields alongside RGB video and is supervised with physics-informed consistency losses. The authors also introduce a benchmark for evaluating physical plausibility of generated fracture video, showing FracGen outperforms existing video generation baselines in both physical and visual fidelity.
arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026 - Stochastic World Models for Verifying Vision-Based Neural Feedback Systems
This paper introduces stochastic world models as a new class of perception surrogates for formally verifying vision-based neural feedback (control) systems, replacing GAN-based surrogates that are large and hard to verify. The world model is built with physically grounded latents using operations standard verifiers can bound, and reproduces held-out frames more faithfully than GAN surrogates with up to 130x more parameters. Combined with a verification procedure mixing falsification, adaptive refinement, symbolic and backward analyses, it resolves the entire state space on an emergency braking benchmark (38% more than the prior state-of-the-art verifier) and over 80% of the state space on a previously-unverified RGB version of the benchmark.
arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026 - From Routing Signals to Selective Review: Visual regrounding in MoE VLMs
This paper shows that internal expert-routing probabilities in Mixture-of-Experts vision-language models (Qwen3-VL-30B-A3B-Instruct and Gemma-4-26B-A4B-it) carry a strong, low-cost signal for detecting when a model is about to answer a question about an object that isn't actually in the image (a 'target-absence grounding failure'). Linear detectors trained on target-token routing probabilities achieve ROC-AUCs of 0.9988/0.9956 on GQA-Inpaint (retaining 0.78-0.81 on the external OBER dataset), and gating a target-aware review prompt on these detections improves end-to-end accuracy by up to +22% without modifying model weights. The work matters for practitioners building on MoE VLMs because it demonstrates a weight-free, pre-generation hallucination detector that reuses computation the model already produces.
arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026 - Correct Answers, Invalid Traces: What Verifiable Grade-School Math Reveals About Chain-of-Thought Traces
This paper uses iGSM, a synthetic grade-school math benchmark with programmatically verifiable step-by-step dependencies, to test whether correct final answers reliably come with valid chain-of-thought traces. Models trained on minimal, valid traces show answer correctness and trace validity decoupling out of distribution (31.6% of correct answers on the hardest instances have invalid traces, many failing semantic dependency checks despite passing syntactic/arithmetic checks); interventions like non-minimal trace training, query re-asking, token shuffling, and trace swapping further show models retain high accuracy even when traces are corrupted or unverifiable. The findings challenge using CoT minimality or surface plausibility as evidence of genuine step-by-step planning, with direct implications for CoT-based monitoring and interpretability claims in AI safety.
arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026 - Explore Broadly, Reason Sharply: Push Small Models toward the Frontier via Sampling
This paper introduces Parallel Power Tempering (PPT), an inference-time sampling method that runs multiple interacting replicas of an LLM at different power-sharpening levels (parallel tempering) to balance exploration of diverse reasoning paths against exploitation of high-probability correct trajectories. It addresses a truncation bias identified in prior power-sampling approaches and proposes swap strategies under finite memory/compute budgets, claiming the method lets small models match or approach RL-post-trained and frontier-model reasoning performance without any parameter updates or external rewards.
arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026 - Probability is Not Enough: Exploring and Counting Divergent Tokens for Reasoning Uncertainty Quantification in LLMs
This paper introduces Divergent Token Confidence (DTC), a method for uncertainty quantification in LLM chain-of-thought reasoning that counts tokens where two models strongly disagree during decoding, measured via Jensen-Shannon divergence between next-token distributions on the same reasoning trajectory. Unlike standard probability-based confidence scores, DTC requires no training, works in both white-box and black-box settings, and its divergent-token count is shown to be strongly negatively correlated with answer accuracy. Across six mathematical benchmarks and multiple model families (including DeepSeek-V3.2), DTC cuts expected calibration error roughly in half compared to full-sequence probability and verbalized-confidence baselines (e.g., 13.0% vs 32.7%-42.4% white-box).
arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026 - A Function-level Dataset of Vulnerable and Fixed Source Code in JavaScript and TypeScript
JsVul is a function-level dataset of vulnerable and fixed JavaScript and TypeScript source code, built from seven sources using a language-specific pipeline that strips noise such as minified code and cosmetic edits, then applies multi-stage deduplication and heuristic labeling. Delivered as time-ordered JSONL pairs of pre-fix and post-fix code, it is designed to train and evaluate ML-based vulnerability-detection models, and the paper argues language-aware preprocessing improves data quality over generic multi-language datasets.
arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026 - FurE: Efficient Instance-Specific 3D Fur Reconstruction without Animal-Fur Datasets
FurE is a strand-based method for reconstructing editable 3D animal fur from multi-view images without requiring animal-fur training data. It optimizes a root-conditioned latent field decoded into strand geometry via a PCA-based decoder trained on human-hair strand data, combined with a defurred animal body recovered using a surface-constrained Gaussian Frosting representation and part-based priors, achieving a 10x speedup over dense per-strand optimization baselines while retaining strand fidelity on synthetic and real-world sequences.
arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026 - Telescopic Language Models
Telescopic Language Models (TLM) is a training method that produces a single nested-capacity Transformer valid as a language model at every layer-prefix depth, using stochastic prefix supervision (one randomly truncated prefix trained against the full next-token target, plus one full-capacity pass, per step) with no architectural changes. On a 200M-parameter proxy suite trained on 20B FineWeb-Edu tokens, a single TLM run beats fixed-exit "Matryoshka Language Model Suites" (MLMS) by 43-44% on area-under-the-quality-budget-curve while matching them at full capacity, at ~12% lower GPU cost per run, showing the elasticity comes from the training objective rather than the nesting architecture itself.
arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026 - PDMD: Projected Distribution Matching Distillation for Video Diffusion Models
PDMD (Projected Distribution Matching Distillation) is a one-line fix to Distribution Matching Distillation (DMD) for video diffusion models that projects out the component of the DMD update parallel to the student-critic endpoint residual, filtering accumulated critic errors that otherwise cause oversaturation and artifacts during few-step distillation. The authors prove the residual is an unbiased estimate of critic endpoint error and show the projection removes a constant fraction of that error while discarding negligible true DMD signal. On Wan2.1 it reaches a VBench score of 83.73 at 4 NFE (+1.03 over DMD), and on MiniMax-H3 joint video-audio generation it improves VideoGen-Eval visual score and tops all six audio metrics among 4-NFE models, with code and models released.
arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026 - Learning Native Reflection in Unified Models with Interleaved Reinforcement Learning
UMM-Reflection is a reinforcement learning method that trains a unified multimodal model to jointly learn reflection text and image revision within a single closed loop: diagnose an image's flaws, revise it, observe the result, and repeat. Sibling trajectories sharing one initial image enable a group-relative advantage that compares whole reflection strategies rather than assigning credit per round, and one trajectory-level advantage updates both the reflection tokens and the flow-based revision head jointly, unlike SFT cold-starts or RL that optimizes only the renderer. On BAGEL, it improves GenEval by 12.05 points over SFT and transfers to unseen benchmarks WISE, OneIG-Bench and T2I-CompBench++, with no external verifier needed at inference.
arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026 - Retrieving Biblical Intertextual References in Karen Blixen's Seven Gothic Tales
This arXiv preprint tackles biblical intertextuality detection in Karen Blixen's Seven Gothic Tales, building a benchmark of 189 annotated references checked against 31,170 verses of historical Danish Bible translations. The authors compare TF-IDF and BM25 with multilingual and Danish sentence encoders, show linguistically normalized BM25 is a strong zero-shot baseline (R@10 0.365), and fine-tune the Danish encoder DFM-large with hard negatives to raise R@10 to 0.508 (and allusion retrieval from 0.138 to 0.339). It's a case study in applying modern retrieval/embedding techniques to a literary-scholarship problem, with a scholar-in-the-loop evaluation showing retrieval models surface valid references missed by prior editorial annotation.
arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026 - Reliability-Gated Fusion of Consumer Head and Foot IMUs for Lower-Body 3D Pose
This paper introduces a channel-gated fusion model for sparse inertial motion capture that learns per-channel, per-stream temporal gates to weight the reliability of consumer earbud head IMU and smart-insole foot IMU signals, trained with an auxiliary reliability objective on synthetically corrupted data. On a new 35-take benchmark (using SAM-3D-Body pseudo-ground-truth labels), the gated model achieves 69.4mm error on clean data and remains most robust across simulated bias, drift, and dropout faults, automatically suppressing biased firmware-fused foot-orientation channels without test-time supervision (dropout detection AUROC 0.92-0.999). It is compared against a fine-tuned HMD-Poser baseline, which is more accurate on clean data (64.4mm) but degrades far more under worst-case faults (+16.1mm vs +3.5mm).
arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026 - Unifying Distributional Training for One-Step Visual Generation
This arXiv paper introduces a unified theoretical framework for "distributional training" in one-step visual generation, showing that existing methods like FD-Loss and Gaussian-kernel Drifting are special cases of Gaussian optimal transport and kernel-density KL matching under Wasserstein gradient flow. Building on this, the authors propose MGFlow, which models feature distributions with Gaussian mixtures at adjustable granularity and combines mass-constrained sample assignment with paired component updates to fix mode collapse. MGFlow sets new state-of-the-art FDr scores on ImageNet 256×256 (1.45 on pMF-H, 1.64 on JiT-H) and post-trains FLUX.2 into a one-step generator that beats the original four-step model on GenEval and PickScore.
arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026 - Peppy: An AI-Assisted Workflow for Tight Convergence Analysis of Optimization Algorithms
Peppy is an AI-assisted workflow that uses LLMs with domain-specific knowledge of optimization theory to discover tight, analytic convergence proofs for first-order optimization algorithms, verifying results through SymPy rather than a full proof assistant like Lean 4. The authors demonstrate the approach by closing several open problems in convergence analysis, including conjectures about Nesterov's Fast Gradient Method (FGM), positioning the workflow as a more structured, domain-specialized alternative to generic LLM-for-math-research pipelines.
arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026 - DexRoam: Learning Mobile Bimanual Dexterous Manipulation from Egocentric Whole-Body Human Demonstrations
DexRoam is a system for learning mobile bimanual dexterous manipulation by training VLA (vision-language-action) policies jointly on human and robot demonstrations. It uses a tracker-free capture setup (consumer VR headset plus head-mounted stereo camera) and three alignment stages (embodiment, action-semantic, temporal) to map continuous whole-body human motion into robot action space without discarding fine-grained coordination. Experiments with GR00T N1.7 and pi0.5 backbones show human demonstrations raise real-world task success from 29% to 56% and 32% to 57% respectively, matching robot-only training with half the robot data.
arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026 - Scaling Long-Form Story Generation via Narrative State Tracking
This paper introduces NstAgent (Narrative State Tracking Agent), a training-free agentic framework that lets LLMs maintain a structured narrative state — characters, past events, and future requirements — to sustain consistency when generating full-length novels. The authors extend an existing narrative-consistency benchmark and pair it with a writing-quality benchmark to evaluate stories from 10K to 100K words, showing that NstAgent's consistency and quality do not degrade as length increases, unlike prior methods limited to ~10K-word stories.
arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026 - TokenCast: Forecasting Token Consumption During LLM Agent Execution
TokenCast is a method for predicting how many tokens an LLM agent will consume while it is still running, addressing the fact that token usage for the same task can vary by an order of magnitude across runs due to context growth and tool-feedback-driven branching. It learns a composable cost representation per execution segment that captures both a segment's own consumption and the extra input cost it adds to every later call as context accumulates, refreshing forecasts online with no additional LLM calls (32.8ms mean prediction time per run on SWE-bench Verified). Across 4 task suites and 6 agent models (96 combinations), it cuts mean absolute forecasting error by 14.5% versus the strongest baseline and reduces token usage by 21.3% versus a fixed-budget policy in offline budget-control replay.
arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026 - Neural Harmonic Measure Operator
Neural Harmonic Measure Operator (NHMO) is a neural solver for elliptic PDE problems on variable-shape domains that parameterizes the harmonic measure's boundary density as a transformer-based kernel, trained via supervision from Walk-on-Spheres exit samples. A single trained kernel handles arbitrary boundary data or, via an auxiliary correction network, arbitrary Poisson source terms, without retraining. The method outperforms four prior baselines on the MCB-B 3D variable-shape Poisson benchmark across all five categories and is competitive with major neural-operator baselines on a 2D testbed.
arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026 - How to Loop MoE: Flatten the Experts, Untie the Attention
The paper introduces Foil, a method for looping mixture-of-experts (MoE) transformers that flattens expert layers (halving layers, doubling experts per layer and passes) while untying attention parameters across loop passes so each pass gets its own attention while experts and routers stay shared. At 100B tokens the most flattened Foil variant beats an unflattened looped-MoE baseline by 0.012 nat in pretraining loss at equal parameters and compute, with more balanced and confident expert routing, and the paper distills this into design guidance (more experts per layer and more passes for sparse looped MoE).
arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026 - KV-streams for Efficient Compaction in Agentic Reinforcement Learning
This paper proposes KV streams, a technique for efficient context compaction during agentic LLM reinforcement learning training, addressing the GPU memory bottleneck caused by ever longer context traces. Instead of flushing and re prefilling the KV cache after each compaction step, KV streams carries the KV cache forward like a recurrent state, yielding a 2.6 to 5x wall clock training speedup across three compaction strategies without hurting performance. The streamed KV cache also preserves information long after it leaves the visible context, and this recurrent like behavior emerges from RL training alone.
arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026 - Towards Communication-Efficient Social Intelligence in Language Agents
This paper proposes Teacher-Assisted Communication Training (TACT), a method that improves social goal attainment in language agents while cutting communication cost. TACT uses an expression specialist to strip unnecessary detail from student-generated actions and a strategy specialist to propose alternative actions, then tests candidate revisions by sampling partner responses and distills the best-performing reference back into the student via on-policy distillation. Evaluated on SOTOPIA and AgentSense, TACT attains the highest Goal scores on the hardest scenarios while using far fewer target tokens than an SFT plus SDPO baseline, and reduces both tokens and interaction turns on AgentSense.
arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026
Showing 540 of 756
Show more