KAIJU: An Executive Kernel for Intent-Gated Execution of LLM Agents

• URL: http://arxiv.org/abs/2604.02375v1
• Date: Tue, 31 Mar 2026 21:38:28 GMT
• Title: KAIJU: An Executive Kernel for Intent-Gated Execution of LLM Agents
• Abstract summary: Tool-calling autonomous agents based on large language models using ReAct exhibit three limitations.<n>Recent work moves towards separating planning from execution but in each case model remains coupled to the execution mechanics.<n>We introduce a system-level abstraction for LLM agents which decouples the execution agent from the reasoning layer.
• Score: 5.931389072124715
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Tool-calling autonomous agents based on large language models using ReAct exhibit three limitations: serial latency, quadratic context growth, and vulnerability to prompt injection and hallucination. Recent work moves towards separating planning from execution but in each case the model remains coupled to the execution mechanics. We introduce a system-level abstraction for LLM agents which decouples the execution of agent workflows from the LLM reasoning layer. We define two first-class abstractions: (1) Intent-Gated Execution (IGX), a security paradigm that enforces intent at execution, and (2) an Executive Kernel that manages scheduling, tool dispatch, dependency resolution, failures and security. In KAIJU, the LLM plans upfront, optimistically scheduling tools in parallel with dependency-aware parameter injection. Tools are authorised via IGX based on four independent variables: scope, intent, impact, and clearance (external approval). KAIJU supports three adaptive execution modes (Reflect, nReflect, and Orchestrator), providing progressively finer-grained execution control apt for complex investigation and deep analysis or research. Empirical evaluation against a ReAct baseline shows that KAIJU has a latency penalty on simple queries due to planning overhead, convergence at moderate complexity, and a structural advantage on computational queries requiring parallel data gathering. Beyond latency, the separation enforces behavioural guarantees that ReAct cannot match through prompting alone. Code available at https://github.com/compdeep/kaiju

Related papers

• PhyAgentOS: A Self-Evolving Operating System for Embodied Agents with Decoupled Cognitive Planning and Physical Execution [49.776611937968]
  We present PhyAgentOS, a foundation delivering scheduling, verification, memory, benchmarking, and safety as system-level services.<n>Its Session-Centered treats a session, not an action, as the minimum unit of scheduling, compatibility, supervised execution, evidence collection, and acceptance.<n>SessionVerifier distinguishes execution termination from semantic task completion via evidence-grounded verdicts of success, failure, or replan.<n> Benchmarking reuses the deployment session and verification path, so results trace to real execution.
  arXiv  Detail & Related papers  (2026-07-18T04:46:53Z)
• LLM-as-Code: Agentic Programming for Agent Harness [20.350593038902904]
  We argue that token explosion, control-flow hallucination, and unreliable completion are not implementation bugs.<n>A better prompt or a stronger model cannot guarantee the reliability of the LLM agent.<n>We propose Agentic Programming, in which the program governs all control flow, and the LLM is itself part of it.
  arXiv  Detail & Related papers  (2026-06-14T15:47:27Z)
• OSDAG: Online Scheduling for Efficient Multi-Robot Collaboration [2.2726869886741383]
  This paper presents OSDAG, a novel framework that integrates LLM-based task reasoning with Directed Acyclic Graph representation and constraint-aware online scheduling.<n> Experiments across five benchmark scenarios demonstrate that OSDAG achieves 5-15x faster reasoning time compared to dialogue-based methods, reduces makespan by up to 38% over sequential baselines, and maintains competitive success rates.
  arXiv  Detail & Related papers  (2026-06-13T11:22:34Z)
• OTora: A Unified Red Teaming Framework for Reasoning-Level Denial-of-Service in LLM Agents [21.836018755837085]
  OTora is a framework for instantiating Reasoning-Level Denial-of-Service attacks.<n> OTora generates agent-aware reasoning payloads via an ICL-guided genetic search.<n>It achieves up to 10 times increases in reasoning tokens and order-of-magnitude latency slowdowns.
  arXiv  Detail & Related papers  (2026-05-09T10:55:11Z)
• From Agent Loops to Structured Graphs:A Scheduler-Theoretic Framework for LLM Agent Execution [1.8222732878503212]
  The dominant paradigm for building LLM based agents is the Agent Loop, an iterative cycle where a single language model decides what to do next by reading an ever growing context window.<n>This perspective places Agent Loops and graph based execution engines on a single semantic continuum.<n>We propose SGH, which lifts control flow from implicit context into an explicit static DAG.
  arXiv  Detail & Related papers  (2026-04-13T12:16:45Z)
• SpecEyes: Accelerating Agentic Multimodal LLMs via Speculative Perception and Planning [104.01865949020304]
  Agentic multimodal large language models (MLLMs) achieve remarkable reasoning capabilities through iterative visual tool invocation.<n>However, the cascaded perception, reasoning, and tool-calling loops introduce significant sequential overhead.<n>This overhead, termed agentic depth, incurs prohibitive latency and seriously limits system-level throughput.<n>We propose SpecEyes, an agentic-level speculative acceleration framework that breaks this sequential bottleneck.
  arXiv  Detail & Related papers  (2026-03-24T17:45:47Z)
• Act While Thinking: Accelerating LLM Agents via Pattern-Aware Speculative Tool Execution [18.50317396128381]
  PASTE is a Pattern-Aware Speculative Tool Execution method designed to hide tool latency through speculation.<n>We show that PASTE reduces average task completion time by 48.5% and improves tool execution throughput by 1.8x.
  arXiv  Detail & Related papers  (2026-03-19T13:36:50Z)
• PseudoAct: Leveraging Pseudocode Synthesis for Flexible Planning and Action Control in Large Language Model Agents [5.5917393750392925]
  Large language model (LLM) agents typically rely on reactive decision-making paradigms such as ReAct.<n>This paper introduces PseudoAct, a novel framework for flexible planning and action control in LLM agents through pseudocode synthesis.<n> Experiments on benchmark datasets show that our method significantly outperforms existing reactive agent approaches.
  arXiv  Detail & Related papers  (2026-02-27T04:30:45Z)
• Robust and Efficient Tool Orchestration via Layered Execution Structures with Reflective Correction [55.13278005189741]
  We model tool orchestration as learning a layered execution structure that captures high-level tool dependencies.<n>We introduce a schema-aware reflective correction mechanism that detects and repairs errors locally.<n>This design confines errors to individual tool calls and avoids re-planning entire execution trajectories.
  arXiv  Detail & Related papers  (2026-02-21T22:20:01Z)
• DLLM Agent: See Farther, Run Faster [94.74432470237817]
  Diffusion large language models (DLLMs) have emerged as an alternative to autoregressive (AR) decoding with appealing efficiency and modeling properties.<n>We study this in a controlled setting by instantiatingDLLM and AR backbones within the same agent workflow.<n>We find thatDLLM Agents are on average over 30% faster end to end than AR agents, with some cases exceeding 8x speedup.
  arXiv  Detail & Related papers  (2026-02-07T09:01:18Z)
• Learning to Share: Selective Memory for Efficient Parallel Agentic Systems [49.78267008828593]
  Agentic systems solve complex tasks by coordinating multiple agents that iteratively reason, invoke tools, and exchange intermediate results.<n>Recent approaches deploy multiple agent teams running in parallel to explore diverse reasoning trajectories.<n>We propose Learning to Share (LTS), a learned shared-memory mechanism for parallel agentic frameworks.
  arXiv  Detail & Related papers  (2026-02-05T18:20:21Z)
• Prism: Efficient Test-Time Scaling via Hierarchical Search and Self-Verification for Discrete Diffusion Language Models [96.0074341403456]
  Inference-time compute has re-emerged as a practical way to improve LLM reasoning.<n>Most test-time scaling (TTS) algorithms rely on autoregressive decoding.<n>We propose Prism, an efficient TTS framework for dLLMs.
  arXiv  Detail & Related papers  (2026-02-02T09:14:51Z)
• Learning Latency-Aware Orchestration for Parallel Multi-Agent Systems [18.192867631682674]
  We investigate learning-based orchestration of multi-agent systems with explicit latency under parallel execution.<n>We propose latency-aware Multi-agent System (LAMaS), a work-aware multi-agent orchestration framework.<n>Our experiments show that our approach reduces critical path length by 38-46% compared to the state-of-the-art baseline for multi-agent architecture search.
  arXiv  Detail & Related papers  (2026-01-15T16:23:53Z)
• Reducing Latency of LLM Search Agent via Speculation-based Algorithm-System Co-Design [35.95362310928356]
  LLM-based search agents achieve strong performance but suffer from severe latency.<n>We revisit this bottleneck through the lens of speculation.<n>We present SPAgent, an algorithm-system co-design framework that expands the role of speculation in search agents to reduce latency.
  arXiv  Detail & Related papers  (2025-11-25T08:15:17Z)
• Extracting Events Like Code: A Multi-Agent Programming Framework for Zero-Shot Event Extraction [21.08753833036094]
  We present Agent-Event-Coder (AEC), a novel multi-agent framework that treats event extraction like software engineering.<n>AEC decomposes ZSEE into specialized subtasks--retrieval, planning, coding, and verification--each handled by a dedicated LLM agent.<n> Experiments across five diverse domains and six LLMs demonstrate that AEC consistently outperforms prior zero-shot baselines.
  arXiv  Detail & Related papers  (2025-11-17T08:17:15Z)
• An LLM Compiler for Parallel Function Calling [68.04566807806071]
  We introduce LLMCompiler, which executes functions in parallel to efficiently orchestrate multiple function calls. We observe consistent latency speedup of up to 3.7x, cost savings of up to 6.7x, and accuracy improvement of up to 9% compared to ReAct.
  arXiv  Detail & Related papers  (2023-12-07T18:32:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.