Skip to content
Hoyant-SuPublic

About

Beyond token-by-token agents. JevSpawn enables parallel action exploration through adaptive action spaces, without additional training.

Topics

Resources

Stars

5 stars

Watchers

0 watching

Forks

Latest commit

 

History

14 Commits

Folders and files

Repository files navigation

JevSpawn: Adaptive Agentic Inference through Compositional Action Spaces

Quality–latency tradeoff and accumulated task scores for JevSpawn and seven agent baselines

Paper arXiv Project Page GitHub Citation Hugging Face

LLM agents spend substantial time generating intermediate reasoning and actions token by token. Jev-style prediction offers a faster route through finite choices, but usually requires those choices to be defined in advance. JevSpawn lets an agent infer and adapt its own compositional action space, bringing finite probabilistic prediction to multi-turn interaction without additional training.

What's New

  • 2026-10-02 — Demo The JevSpawn end-to-end demo is now available. Watch the demo.
  • 2026-10-01 — Preprint The JevSpawn preprint is available on arXiv.
  • 2026-10-01 — Research beta JevSpawn is in research beta. Feedback, replications, and follow-up work are welcome through GitHub issues.
  • 2026-09-30 — Code release The core algorithm and GPU inference runtime are open source in this repository.

Method

JevSpawn architecture, from natural-language task rules to compositional actions, parallel spawning, feedback-guided exploration, and shared finite evaluation

JevSpawn connects natural-language task descriptions to finite, executable action fields. A small set of fields can express many actions through their combinations, while the representation can change as the agent learns from interaction.

  1. Construct the action space. The model infers field meanings, possible values, dependencies, and shared action syntax from the task context. The declaration defines available interactions rather than an entire plan.
  2. Spawn and explore. Conditional field probabilities are combined into joint action probabilities. A bounded beam selects distinct assignments, each of which is executed in an independent copy of the parent state. Observations guide further exploration, and retained branches allow backtracking. The model can revise the declaration when the current action space is insufficient.
  3. Share the computation. Known value sequences are evaluated in batches, with output projection restricted to tokens that distinguish alternatives. Common context prefixes are reused across evaluations. Text generation supplies declarations, revisions, and final answers when needed. Repeated action exploration uses the finite policy.

The repository contains the core method and inference runtime, with the public entry point in src/jev_spawn/api.py and shared experiment settings in configs/shared.yaml.

Demo

Follow the eight paper case studies through streamed declarations, spawned actions, observations, and final answers.

jevspawn.mp4
bash demo/run.sh

Open http://127.0.0.1:8765 to replay the complete recorded traces without a GPU. Demo instructions include fresh four-GPU inference and reproducible screen recording. The video shows recorded playback.

Results

  • Tasks — PPNL, Maze, Grid, LightsOut, RushHour, Sokoban, 2048, and Nullify.
  • Model — Qwen3.8-27B.
  • TypeSafe Jev — JevSpawn with API-based finite scoring.

Task performance ↑

PPNL, Maze, and Grid report success rates on [0, 1]. Other columns report benchmark rewards or scores. Bold marks the best result and underlining marks the second best, including ties and the TypeSafe Jev variant.

Method PPNL Maze Grid LightsOut RushHour Sokoban 2048 Nullify
LATS 0.842 0.000 0.000 0.010 0.000 0.000 0.000 0.010
LLMCompiler 0.929 0.200 0.480 0.080 0.147 0.350 5.000 0.020
AgentPrune 0.956 0.280 0.280 0.340 0.453 0.790 1.240 0.030
HiAgent 0.930 0.400 0.320 0.033 0.172 0.140 0.000 0.090
FoldAgent 0.464 0.520 0.730 0.020 0.240 0.105 0.000 0.090
DyFlow 0.828 0.040 0.020 0.040 0.060 0.200 0.120 0.060
LatentMAS 0.902 0.320 0.120 0.030 0.113 0.095 0.000 0.050
TypeSafe Jev 0.955 0.960 0.930 0.660 0.290 0.250 296.000 0.170
JevSpawn 0.950 0.960 0.950 0.610 0.390 0.150 305.120 0.210

E2E latency (seconds) ↓

Elapsed time is measured from task submission to termination, including failed tasks and timeouts. Lower latency should be read alongside task performance. API communication is included for TypeSafe Jev.

Method PPNL Maze Grid LightsOut RushHour Sokoban 2048 Nullify
LATS 131.34 300.00 300.00 299.01 298.57 300.00 300.00 298.18
LLMCompiler 13.61 235.32 117.16 99.26 223.42 123.99 33.51 172.85
AgentPrune 24.23 47.91 79.57 233.19 115.48 142.53 202.57 42.90
HiAgent 16.25 209.06 206.05 254.54 20.32 150.76 300.00 98.18
FoldAgent 43.55 191.69 61.44 84.17 22.74 78.32 300.07 48.10
DyFlow 125.47 285.43 269.57 294.18 289.03 280.57 287.35 287.37
LatentMAS 48.70 269.86 281.61 292.64 150.25 269.05 289.03 185.05
TypeSafe Jev 43.96 63.98 78.39 153.95 187.45 214.76 249.05 189.41
JevSpawn 21.88 40.91 40.58 111.05 89.20 122.49 169.94 104.21

Citation

@misc{su2026jevspawnadaptiveagenticinference,
      title={JevSpawn: Adaptive Agentic Inference through Compositional Action Spaces},
      author={Haoyang Su and Weiran Huang},
      year={2026},
      eprint={2610.00437},
      archivePrefix={arXiv},
      primaryClass={cs.AI},
      url={https://arxiv.org/abs/2610.00437},
}

About

Beyond token-by-token agents. JevSpawn enables parallel action exploration through adaptive action spaces, without additional training.

Topics

Resources

Stars

5 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages