Skip to content

577 results for “REA”

What you seeeverything
  1. Your Benchmark Is an Empirical Measure Over Difficulty

    The 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🧠 AI

  2. GPT-Rosalind-6 System Card Addendum

    GPT-Rosalind-6 System Card Addendum is OpenAI's safety documentation for a life-sciences model that shares weights with GPT-6 Astra. It rates the model High in Biological and Chemical and Critical in Cybersecurity under the Preparedness Framework. It reports biology evaluations, trusted-access controls, biosecurity refusal pass rates, a historical cyber jailbreak regression (14.3% task success), and sabotage and monitor-evasion results.

    deploymentsafety.openai.compaperPublished and added 30 Oct 2026🛡️ Security

  3. GPT-Rosalind-6 System Card Addendum

    GPT-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🧠 AI

  4. world2vec: Mechanistic world models through latent dynamics learning

    world2vec 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🧠 AI

  5. 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🧠 AI

  6. 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🧠 AI

  7. 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🧠 AI

  8. 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🧠 AI

  9. 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🧠 AI

  10. 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🧠 AI

  11. 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🧠 AI

  12. 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🧠 AI

  13. 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🧠 AI

  14. SEAL: Sealed Queries for Local Sanitization against Indirect Prompt Injection

    SEAL is a defense against indirect prompt injection for local LLM agents. It learns a soft prompt and scoring readout offline, then uses a frozen task model to score and delete injected tokens from tool outputs, with queries built from trusted initial context. On AgentDojo, attack success falls from 34.6% to 0.1% and Joint rises from 51.4% to 77.5%, using about 127x fewer defense tokens than PISanitizer.

    arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026🛡️ Security

  15. Optimality and Efficiency of Higher-Order Rank-Based Side-Channel Attacks against Inner Product Masking Schemes

    HO-ASPA (Higher-Order Adjusted Spearman Coefficient Analysis) is a rank-based, non-profiling side-channel distinguisher. The paper derives its optimal form against two-share Boolean masking and inner product masking under Hamming weight and LSB leakage. It finds no significant gap between higher and lower orders for HO-ASPA, unlike HO-CPA, and reports that it beats Kruskal-Wallis-based attacks in simulated and real-world experiments.

    eprint.iacr.orgpaperAdded 31 Oct 2026, published 29 Oct 2026🛡️ Security

  16. High Precision Noise Cleaning for CKKS with Application to Asynchronous Threshold CKKS

    High Precision Noise Cleaning for CKKS is an IACR ePrint preprint (2026/2675) by Zhihao Li, Cheng Hong and Tao Wei. It composes lower-degree Hermite polynomials to reach output noise bounds such as 2^-300 for noise flooding, and uses this to build an asynchronous threshold CKKS scheme with strong simulation security in the random oracle model. In OpenFHE, binary-message cleaning falls from 9.63 s to 1.54 s.

    eprint.iacr.orgpaperAdded 31 Oct 2026, published 29 Oct 2026🛡️ Security

  17. REALM: Identifying Minimal Task Assets for LLM Agents

    REALM (Required Execution Assets Linked to a Mission) is an approach to applying least privilege to LLM agents by identifying the assets a task needs, including ones discovered at runtime. It models assets as Dependency Graph nodes, separates discovering an asset from authorizing it, and exposes resource-bound Partial APIs inside a Task Container. On AgentDyn with qwen3.5-flash, attack success rate falls from 16.6% to 0.2%, with 40.0% task completion on clean tasks and 36.4% on injected cases.

    arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026🛡️ Security

  18. Cryptography and Security Papers (@FSFG) on X

    PrivacyEvalClaw is a tool-augmented deliberative agent that audits privacy leakage in LLM jailbreak responses. The paper is by Krishna Kanth Nakka and co-authors, and it was accepted to AACL-IJCNLP 2026 (arXiv 2610.36711, cs.CR). The tweet gives only the title, authors and venue, so the method and results are not described.

    x.compaperAdded 30 Oct 2026, published 29 Oct 2026🛡️ Security

  19. 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🧠 AI

  20. Addendum to GPT-6 Luna System Card: October 28, 2026 Update

    Addendum to the GPT-6 Luna system card for the model update of 29 October 2026 (the title says October 28). OpenAI keeps the High rating for cybersecurity and biological/chemical capability under its Preparedness Framework. It reports ExploitBench 46.19% and SEC-Bench Pro 51.75% (GPT-6 Astra: 85.4%), higher multiturn jailbreak defender success than the October 7 version, and GPT-Red prompt-injection results. It also reports weaker factuality and dual-use biology refusal.

    deploymentsafety.openai.compaperPublished and added 29 Oct 2026🛡️ Security

  21. 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🧠 AI

  22. 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🧠 AI

  23. 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🧠 AI

  24. 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🧠 AI

  25. Secure Transaction Verification and Authorization (STVA)

    Secure Transaction Verification and Authorization (STVA) is a draft Standards Track ERC (created October 2026) by @MATOBOYCRYPTO65. It proposes structured human-readable metadata and semantic intent for transactions and UserOperations, an independent simulation and verification interface, and scoped, revocable capability tokens for privileged operations. It targets blind signing and frontend supply-chain attacks, citing the February 2025 Bybit Safe multisig theft. The page gives only the abstract, motivation and core concepts.

    ethresear.chpaperPublished and added 28 Oct 2026🛡️ Security

  26. 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🧠 AI

  27. 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🧠 AI

  28. 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🧠 AI

  29. 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🧠 AI

  30. 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🧠 AI

  31. 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🧠 AI

  32. 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🧠 AI

  33. 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🧠 AI

  34. 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🧠 AI

  35. What Effort Level Should I Choose? On the Economics of Reasoning Effort in LLM Agents

    This 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🧠 AI

  36. Structured Security Explanations for Learning-Based Vulnerability Detection

    VulnLens is a framework for binary C/C++ function-level vulnerability detection. A label-blind LLM Explainer describes each function from seven fixed perspectives (data flow, memory access, object lifetime, arithmetic and type behavior, control flow, shared state, external-resource access). A supervised Detector fuses code and explanations by cross-attention. It reaches 75.5% accuracy and 77.2% F1 on a 526-function PrimeVul test set, and 66.4% accuracy on SecVulEval without retraining.

    arxiv.orgpaperAdded 30 Oct 2026, published 27 Oct 2026🛡️ Security

  37. 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🧠 AI

  38. Heads of Security: Learned Attention Gates Improve Prompt Injection Robustness

    Heads of Security (HoS) is a prompt injection defense that enforces instruction-data separation with learned per-head attention gates, redistributing attention between trusted and untrusted tokens. Evaluated on Llama-3.3-70B-Instruct and GPT-OSS-20B against SecAlign++ and ASIDE. The black-box RL-Hammer attack reaches 97% ASR on GPT-OSS-20B and 85% on SecAlign but 10% on HoS. The white-box Claudini attack needs 3 times more FLOPs on HoS. HoS keeps base-model utility in few-shot settings, where SecAlign and ASIDE degrade.

    arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026🛡️ Security

  39. 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🧠 AI

  40. 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🧠 AI

  41. 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🧠 AI

  42. 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🧠 AI

  43. 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🧠 AI

  44. 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🧠 AI

  45. 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🧠 AI

  46. 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🧠 AI

  47. Towards Quantum Sensing for Side-Channel Analysis

    Preprint on using nitrogen-vacancy (NV) center quantum sensing for electromagnetic side-channel analysis of ICs. The authors build an NV-based RF spectrometer with 1.1 GHz real-time bandwidth and adjustable center frequency, which reads the spectrum in the time domain without Fourier transforms or frequency sweeps. They use it on RSA decryption emanations and for leakage detection on a software Number Theoretic Transform running on a Cortex-M4 microcontroller.

    eprint.iacr.orgpaperAdded 28 Oct 2026, published 27 Oct 2026🛡️ Security

  48. 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🧠 AI

  49. 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🧠 AI

  50. 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🧠 AI

  51. 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🧠 AI

  52. Alg\{Ossa\}: Decentralized Secure Aggregation with Rotating Committees and Eventual Delivery

    AlgOssa is a decentralized secure aggregation protocol built on Ossa, a generic committee-aided, single-server construction for one-shot clients (following OPA and Willow, CRYPTO 2025). Ossa realizes secure aggregation with non-selective abort against a malicious server. AlgOssa adds Algorand-style sortition to rotate leaders and committees, bounds the chance of an honest server, and gives eventual delivery. Classical and post-quantum routes are evaluated.

    eprint.iacr.orgpaperAdded 28 Oct 2026, published 27 Oct 2026🛡️ Security

  53. What Victims Take Away: Attack Reuse and Defense Revision after Prompt-Injection Attacks

    What Victims Take Away is an October 2026 arXiv paper analysing 563,349 Tensor Trust attack records to see how players reuse prompt injections they received. Within a week, targets reused 10.0% of attacks that broke their defense, versus 0.03% of matched attacks. Breaches were followed by defense changes that cut same-family attack success by 24.5 points. Received texts made up 23.2% of successful hijacks. The authors propose that AI security tools describe techniques without disclosing full attack text.

    arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026🛡️ Security

  54. 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🧠 AI

  55. Analyzing Compiler-induced Constant-time Violations with Compiler at Scale

    CTGREP is a compiler-based framework that applies differential analysis across the whole Clang/LLVM compilation chain to find where, how and under which configurations compiler optimizations break constant-time cryptographic code. Applied to seven libraries, three Clang versions, six targets and thousands of configurations, it led to 48 cases fixed with developers. It also identified seven new problematic LLVM passes and bypassed existing compiler-flag mitigations.

    eprint.iacr.orgpaperAdded 27 Oct 2026, published 26 Oct 2026🛡️ Security

  56. Log-To-Leak: Prompt Injection Attacks on Tool-Using LLM Agents via the Model Context Protocol

    Log-To-Leak is a prompt-injection attack on tool-using LLM agents that abuses Model Context Protocol tool metadata to trigger an attacker-controlled logging call after the last legitimate call, leaking the user query, server name, server response and agent response. Evaluated on five MCP servers and four agents, it reaches 62.64-100% attack success with 76.55-95.64% logging accuracy. Three defenses leave over 55% residual ASR on GitHub MCP with GPT-4o.

    arxiv.orgpaperAdded 28 Oct 2026, published 26 Oct 2026🛡️ Security

  57. 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🧠 AI

  58. Reva: Real-Time Vulnerability Detection through Contextual Probing of Large Language Models

    REVA (REal-time Vulnerability Analysis) is an LLM-based vulnerability detector that screens each new function in one forward pass. It feeds the model a pre-computed module threat model, lightweight static analysis findings and call-graph data, then reads the model's internal representations with a trained probe. On PrimeVul's held-out test set with GLM-5.3-Flash it reaches 60.0% accuracy in about one second per function, matching the agentic VulTriage (59.2%) while over 250 times faster.

    arxiv.orgpaperAdded 28 Oct 2026, published 26 Oct 2026🛡️ Security

  59. LINE-Break: Cryptanalysis and Reverse Engineering of Letter Sealing

    LINE-Break is a security analysis of Letter Sealing v2, the custom end-to-end encryption protocol in the LINE messenger. A TLS man-in-the-middle attacker or malicious server can replay, reorder and block messages undetected, and colluding users can forge message authorship in one-to-one and group chats. Stickers and URL previews leak plaintext. The attacks were verified on the real iOS app and an independent implementation.

    eprint.iacr.orgpaperPublished and added 26 Oct 2026🛡️ Security

  60. Addendum to GPT-6 Astra System Card: GPT-6.1 Terra

    Addendum to the GPT-6 Astra system card for OpenAI's GPT-6.1 Terra, rated Critical in cybersecurity and High in biological and chemical capability under the Preparedness Framework. It reports multiturn jailbreak and prompt-injection results, alignment tests (auto-review circumvention, ExploitGym honeypot, monitor evasion), and cyber scores: 97.10% ExploitBench, 24.5% on the internal recent-vulnerability port, 5 of 22 Sandbox Bench targets.

    deploymentsafety.openai.compaperPublished and added 26 Oct 2026🛡️ Security

  61. 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🧠 AI

  62. 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 settings (public alerts, responder dispatch, citizen-record queries). It scores attack success, over-refusal and over-reaction on a cost-sensitive frontier, using real emergency-call transcripts and real injection/jailbreak payloads. Across 840 episodes on three frontier models and three defenses, refuse-more caution raised over-refusal to 100 percent on two models, while a trust-gating wrapper gave the lowest harm on every model.

    arxiv.orgpaperAdded 27 Oct 2026, published 25 Oct 2026🛡️ Security

  63. Decision Attacks on Known-Covariance Ring-LWE via Public Gram Determinants

    Anis Bkakria's ePrint 2026/2638 gives polynomial-time decision attacks on Known-Covariance Ring-LWE (KCov-RLWE), the assumption Micciancio and Suhl introduced for simulation-secure threshold encryption. The public sample and covariance hint form a bordered Gram matrix whose determinant leaks a residual that differs between real and uniform samples. The attacks cover broad prime-modulus families at ring rank one and transfer to composite moduli with an odd prime divisor. Power-of-two moduli are not covered, and the paper does not break the full threshold-encryption scheme.

    eprint.iacr.orgpaperAdded 26 Oct 2026, published 25 Oct 2026🛡️ Security

  64. SymLift: Neural Semantic Lifting for Compile-Free Vulnerability Detection in Context-Incomplete Code Fragments

    SymLift is a compile-free vulnerability detection framework for context-incomplete code fragments. A fine-tuned LLM lifts control-flow, data-flow, memory and resource relations into a constrained LLVM-like IR. A parser turns the IR into facts, and Datalog rules derive findings with derivation traces. On Juliet function-level fragments Clang compilation success falls to 12.00%, while SymLift's completion rate drops only 1.17 points. SymLift-Qwen-7B reaches Target-F1 94.41% on FormAI and 91.66% micro-F1 on MegaVul.

    arxiv.orgpaperAdded 28 Oct 2026, published 25 Oct 2026🛡️ Security

  65. 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🧠 AI

  66. Reversible Pseudonymisation of Documents Sent to External LLMs: an Open Bilingual Benchmark and an Engine

    Open bilingual (Russian and UK English) benchmark of five open pseudonymisation tools and a regex baseline, plus a new 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 personal value visible in 61% (Russian) and 58% (UK) of documents. The engine does so in 0.3% and 0.2%. 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🛡️ Security

  67. 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🧠 AI

  68. 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🧠 AI

  69. 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🧠 AI

  70. 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🧠 AI

  71. 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🧠 AI

  72. 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🧠 AI

  73. 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🧠 AI

  74. 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🧠 AI

  75. Enhancing LLM-Based Vulnerability Detection via Representation-Aware Logical Ensemble

    RALE (Representation-Aware Logical Ensemble) is a method for detecting vulnerabilities in C source code with LLMs trained on different code representations: raw source, Abstract Syntax Trees and Control Flow Graphs. The authors show the representations suit different vulnerability classes, and combine the models with explicit logical rules and majority voting. Single-representation models reach up to 73% F1, while the ensemble reaches 78%.

    arxiv.orgpaperAdded 28 Oct 2026, published 24 Oct 2026🛡️ Security

  76. 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🧠 AI

  77. 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🧠 AI

  78. VulDec: Vulnerability Detection in Binaries via Neural Decompilation

    VulDec is an arXiv paper (October 2026) presenting a dataset of real-world Assembly-C function pairs with CWE labels across multiple architectures, plus an end-to-end framework that uses neural decompilation for binary vulnerability detection. Tuned LLM decompilers reach about 56% Edit Similarity and 43% BLEU-4. Tuned LLM detectors reach macro F1 of 0.61 on a realistic test set with a 3% vulnerability rate.

    arxiv.orgpaperAdded 28 Oct 2026, published 24 Oct 2026🛡️ Security

  79. Extraction meets Distillation - cryptanalytic techniques to recover parameters from a Deep Neural Network

    Extraction meets Distillation is an IACR ePrint paper (2026/2628, CSCML 2026) that combines cryptanalytic weight-direction extraction with label-based distillation to reconstruct fully connected neural networks. It adapts a ReLU extraction implementation to Leaky ReLU and proves conditional bounds for direction recovery and sign selection. On CIFAR-10 victims, reconstructed models reach 56.40% and 58.29% agreement. It separates label requests from privileged access and notes that prediction agreement does not identify parameters.

    eprint.iacr.orgpaperAdded 26 Oct 2026, published 24 Oct 2026🛡️ Security

  80. 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🧠 AI

  81. 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🧠 AI

  82. Faster Matrix Multiplication Leads to Faster Lattice Sieving

    Gao and Hu's IACR ePrint 2026/2622 shows that if the matrix multiplication exponent satisfies ω ≤ 9/4 − η, heuristic lattice sieving runs in (3/2 − δ)^(n/2+o(n)) time under the spherical heuristic from the BDGL analysis. It builds on OpenAI's recent result that ω ≤ 9/4. With known matrix multiplication algorithms, the method already gives subquadratic search inside BDGL buckets. Only the abstract is available, so concrete parameters are not shown.

    eprint.iacr.orgpaperAdded 26 Oct 2026, published 24 Oct 2026🛡️ Security

  83. 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🧠 AI

  84. 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🧠 AI

  85. 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🧠 AI

  86. 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🧠 AI

  87. 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🧠 AI

  88. 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🧠 AI

  89. 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🧠 AI

  90. 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🧠 AI

Showing 90 of 577

Show more