Skip to content

57 results for “Evo”

What you seeeverything
  1. Appreciation Teaches Unauthorized Execution: Self-Evolution Degrades the Robustness of Personal Agents to Indirect Prompt Injection

    Paper studying whether self-evolution weakens personal agents' robustness to indirect prompt injection (IPI). A two-phase method has the user ask the agent to follow tasks in external content, then tests with a third-party injected task the user did not authorize. Against the non-evolving base agent, attack success rose 14.0 to 48.8 points under skill evolution and 3.0 to 39.3 points under reinforcement learning. Code is released.

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

  2. 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

  3. 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

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

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

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

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

  8. How Effectively Do Security Skills Guide Coding Agents in Vulnerability Detection in Linux Kernel?

    Empirical study of 37 security skills run through Claude Code with four LLMs on 100 real Linux kernel vulnerabilities across ten classes (14,800 runs). 24.4% of runs found the correct function, 18.3% the function and statement, and 15.7% the vulnerability class. The authors propose SKILL-SIF, which evolves skills from failures and raised fully correct detection on 100 unseen vulnerabilities from 2% to 16%.

    arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026🛡️ Security

  9. Self-evolving Agent Harness

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

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

  11. Threshold Post-Quantum E-Voting from Lattice Commitments

    T-EVOLVE extends the lattice-commitment e-voting protocol EVOLVE to threshold tallying. Votes are Shamir-shared, so any t of n authorities can finish the tally. Privacy holds against t-1 colluding authorities and verifiability holds even if all of them collude. The voter proves her committed shares form a Reed-Solomon codeword whose value at zero is a valid vote. Complaints about ciphertexts that do not decrypt are publicly verifiable, using an LWE-instantiable encryption scheme with publicly verifiable opening. Privacy, verifiability, individual verifiability and robustness are proven in the classical random oracle model, and the verifiability reduction is not tight. In a C implementation, a yes/no ballot for four authorities takes 109 KB, and an authority aggregates 10^4 ballots in about three minutes on one core.

    eprint.iacr.orgpaperAdded 17 Oct 2026, published 15 Oct 2026🛡️ Security

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

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

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

  15. StableJudge: A Lightweight Adversarial Defense Framework for LLM-as-a-Judge

    StableJudge is a defense framework against score-hijacking prompt injection in LLM-as-a-Judge pipelines (e.g. paper review, recommendation). A compact 0.13B "Sentry" model localizes injected spans and sanitizes them before the judge scores the content, trained on adversarially evolving attacks, and deterministic fine-grained scores are derived from the judge's output distribution. It improves score recovery under attack on held-out scientific abstracts and out-of-distribution attack variants while preserving general performance, decoupling safety from judge model scale. Code and data are promised but not yet released.

    arxiv.orgpaperAdded 15 Oct 2026, published 12 Oct 2026🛡️ Security

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

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

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

  19. Package Hallucination Attacks on Coding Agents through Prompt Injection in Rule Files

    This arXiv paper introduces the "package hallucination attack," where an attacker injects malicious prompts into benign agentic-coding rule files (such as .cursorrules) to induce a coding agent to replace legitimate package dependencies with attacker-controlled ones. The authors propose PackHallu, an evolutionary optimization framework that iteratively rewrites injected prompts using trajectory-level feedback and LLM-guided mutations, and show it achieves high attack success rates with strong transferability across multiple LLMs, benchmarks, and agent frameworks.

    arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026🛡️ Security

  20. ASPIRE: Agentic Safety & Prompt Injection Red-teaming Engine

    ASPIRE is an automated red-teaming engine for LLM agents that discovers indirect prompt-injection vulnerabilities beyond pre-specified attack scenarios. It maintains an evolving Agent Security Behavior Graph and uses complementary Explore and Exploit experts to find, verify, and generalize consequence-centric attacks, with trajectory evidence and cross-run memory improving coverage over time. Benchmarked against existing automated red-teaming approaches, it shows broader coverage of consequences, injection methods, environments, and behavior paths while keeping attack success high.

    arxiv.orgpaperAdded 8 Oct 2026, published 6 Oct 2026🛡️ Security

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

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

  23. Glimpsing the Leakage Flow for Deep Learning-Based Side-Channel Analysis using Stochastic Leakage Model

    GlimpseDNN is a model-agnostic framework that uses a stochastic leakage model to visualize, layer-by-layer, what physical leakage information a deep neural network extracts during profiled side-channel analysis (SCA) to recover secret keys. The authors (Trevor Yap and Shivam Bhasin, NTU) validate it on simulated traces and public datasets (ASCADf, ASCADr, ASCADf_desync50, ASCADf_desync100), showing it can reveal leakages even in deeper network layers when they are not visible in raw traces, with applications to designing more side-channel-resistant hardware.

    eprint.iacr.orgpaperAdded 8 Oct 2026, published 5 Oct 2026🛡️ Security

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

  25. EvoRiskBench: An Evolving Benchmark for Runtime Security Risks in Workspace Agents

    EvoRiskBench is an arXiv paper introducing an evolving benchmark for runtime security risks in LLM-powered workspace agents, built around the EP-Path-EF framework (nine entry-point categories, five effect categories) linking risk entry points to technical effects via agent-mediated paths. The authors ran 450 adversarial tasks across six scenarios against nine model-harness combinations (GPT-5.6 Sol, DeepSeek-V4-Pro-0813, Claude Opus 5 paired with Claude Code, Codex, and OpenClaw), finding Codex + DeepSeek-V4-Pro-0813 the most vulnerable at 68.44% attack success rate and showing ASR varies more by model than by harness. Cases are auto-constructed and verified in isolated environments using runtime traces and environment state.

    arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026🛡️ Security

  26. Evaluating and Improving the Robustness of Large Language Models to Input Sequence Variations

    Thesis on evaluating and improving LLM robustness to adversarial input perturbations. It proposes the R_stab robustness metric (Jensen-Shannon divergence), ASA, an evolutionary black-box attack on LLM-as-a-Judge systems (up to 73.8% ASR), trojan trigger recovery on Trojan Detection Challenge 2023 (Pythia-1.4B), and a systematization of bypasses of multi-layer defenses from SaTML CTF 2024. For MCP agents it proposes AttestMCP (HMAC-attested tool calls) and the Commit Boundary pattern, cutting ASR from 53.7% to 12.4% on the 847-scenario MCPBench; the methods are implemented in JudgeGuard, TrojanArmor and MCPSec.

    arxiv.orgpaperAdded 9 Oct 2026, published 1 Oct 2026🛡️ Security

  27. Evaluating and Improving the Robustness of Large Language Models to Input Sequence Variations

    An arXiv thesis-style paper proposing R_stab(f), a Jensen-Shannon-divergence-based robustness metric for LLM outputs under small input perturbations, along with a proven bound V(h) <= 1 - R_class(h) for localized attacks. It introduces ASA, an adaptive evolutionary black-box attack against LLM-as-a-Judge systems reaching up to 73.8% attack success rate (62.6% cross-model transfer), evaluates trojan/backdoor detection on the Trojan Detection Challenge 2023 (Pythia-1.4B) and SaTML CTF 2024, shows that committees of 5-7 heterogeneous models cut Gemma-3-4B's ASR to 19.3%, and presents AttestMCP, an HMAC-based tool-call attestation scheme plus a "Commit Boundary" isolation pattern for MCP agents that cuts average ASR on the 847-scenario MCPBench from 53.7% to 12.4%. Methods ship as the JudgeGuard, TrojanArmor, and MCPSec software suites.

    arxiv.orgpaperAdded 5 Oct 2026, published 1 Oct 2026🛡️ Security

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

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

  30. Raven: The Harness of Harnesses for Composable Agentic Intelligence

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

Showing 30 of 57

Show more