跳到正文
Jones Ray

ScholarPulse 日报 2026-10-27

2026-10-27 学术简报:2 篇。针对AI智能体绕过人类审查的风险,论文提出“不可剥夺的人在回路”(I-HITL)概念与Countersign原型,确保关键操作必须经人类明确批准。

今日速览

序号标题来源日期主题推荐等级
1I-HITL: Inalienable Human-in-the-LooparXiv2026-10-26AI-Agent高
2Reva: Real-Time Vulnerability Detection through Contextual Probing of Large Language ModelsarXiv2026-10-26RAG高

重点论文与技术动态

1. I-HITL: Inalienable Human-in-the-Loop

一句话结论

针对AI智能体绕过人类审查的风险,论文提出“不可剥夺的人在回路”(I-HITL)概念与Countersign原型,确保关键操作必须经人类明确批准。

核心内容

方法与数据

价值判断

摘要 Human oversight is a pillar of AI safety. It is often exercised by a human in the loop (HITL) who approves critical actions taken by an AI agent. AI agents' increasing ability to bypass guardrails, though, raises the question of how to enforce HITL robustly. We introduce the concept of inalienable human-in-the-loop (I-HITL). An I-HITL protocol ensures that an agent can initiate an action only with explicit human approval, even when the human interacts with a system (e.g., a local agentic harness) compromised by the agent. A strong I-HITL protocol additionally ensures such approval even when an adversarial human attempts to delegate approvals to an agent. To motivate I-HITL, we report on experiments with a popular agentic wallet platform in which raising an agent's spending cap requires HITL approval via emailed one-time passcodes (OTPs). Given access to the user's email and a task blocked by the cap, we find that ten different frontier models will often autonomously raise the cap, harvesting OTPs to bypass a HITL guardrail and surfacing other vulnerabilities. We formally define I-HITL using the concept of communication topologies and prove necessary and sufficient conditions for its realization. We show that an I-HITL protocol requires a trusted entity - a trusted computing device (or equivalent) - and characterize which such devices can and cannot realize an I-HITL protocol. We present a prototype I-HITL system called Countersign that can plug into and strengthen existing HITL systems using off-the-shelf consumer mobile devices.

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

一句话结论

REVA通过单次前向传播注入安全上下文并探测LLM内部表征,以单函数约1秒的速度达到了顶尖智能体检测器的精度。

核心内容

方法与数据

价值判断

摘要 A vulnerability costs more to fix the later it is discovered. As coding agents generate code faster than developers can review it, software needs a first line of defense screening each new function in real time. LLM agents have recently become capable of finding real-world vulnerabilities by working as a security expert would: they run analysis tools, explore the surrounding code, test hypotheses and weigh the evidence before forming their own judgement. This reasoning, however, spans many model calls, so that each verdict takes minutes of compute, far too long for real-time screening. Faster detectors, which fine-tune deep learning models or prompt an LLM for a direct verdict, are less accurate: they judge a function without the context an agent gathers, and an LLM's generated verdict is unreliable even when given some of it. We present REVA (REal-time Vulnerability Analysis), an AI vulnerability detector that brings the security context and code understanding components behind agentic detectors into a single forward pass of an LLM. For each new function, REVA gives the LLM a pre-computed threat model of its module, lightweight static analysis findings and call-graph information. REVA leverages a trained probe to read the LLM's internal representations of the new function in this context. On PrimeVul's held-out test set, REVA on GLM-5.3-Flash reaches 60.0% accuracy in about one second per function. This matches VulTriage (59.2%), the state-of-the-art agentic detector, run on the same LLM, while being over 250 times faster and less than a tenth as costly. On the same prompt, the probe is 14% to 17% more accurate than the LLM's own direct verdict. Across three open LLMs, REVA is at least as accurate as VulTriage, and about 10% more accurate on two of them. An LLM's internal representations thus encode much of what agentic detectors obtain through reasoning.