TianyuCodings/NanoJev

A nano replica of Jev: parallel decisions, dynamic candidates, and an end-to-end training pipeline.

What it solves

NanoJev is a small-scale replica of the Jev model designed to handle decision-making tasks without the need for output-token decoding. It allows a model to take in states and questions and output complete probability distributions over possible actions or outcomes, enabling faster and more direct decision-making in gaming environments like ViZDoom, Maze, and Snake.

How it works

Built on a Qwen3-0.6B backbone, NanoJev uses specialized decision heads to process requests containing a state, a question, and a set of candidate paths. Instead of generating text, it uses these heads to produce direct probabilities:

  • Choice head: Uses set attention and softmax to return a distribution over 2–255 candidates.
  • Boolean head: Uses a sigmoid to predict the probability of a proposition.
  • Score head: Returns a probability-weighted level (2–10 ordered levels).

Who it’s for

It is intended for researchers and developers interested in parallel decision models, efficient AI agents for games, and those exploring alternatives to traditional token-based LLM decoding for action selection.

Highlights

  • Zero-token decoding: Ranks and selects actions via direct probabilities rather than generating text answers.
  • Multi-task capability: A single 0.6B parameter checkpoint handles four different games (ViZDoom Basic, ViZDoom Predict Position, Maze, and Snake).
  • High efficiency: Outperforms larger models in specific tasks, such as eliminating targets in ViZDoom Basic in 1.40 seconds.
  • Comprehensive dataset: Includes a mixed-task dataset of 18,760 decision questions and expert gameplay episodes.

Related

  • Project
  • Project
  • Project
  • Project
  • Dispatch