arXiv Artificial Intelligence

Can a Cacheable Decision Model Follow Rules?

Can a Cacheable Decision Model Follow Rules?

Quick summary

arXiv:2609.37832v1 Announce Type: new Abstract: Certo is a small non-generative decision model (Qwen3-4B): it scores candidate actions from their text and returns a probability, instead of generating an answer. The accurate design reads the state, the rules, and each candidate together (a joint scorer), so cost grows with the menu. Independent encoding lets each candidate be encoded once and reused across states (about 5x cheaper at 77 candidates), but separates state from candidate. We ask how much rule-sensitivity survives that move, and whether it can be trained back. Four experiments on Ce

Key takeaways

  • arXiv:2609.37832v1 Announce Type: new Abstract: Certo is a small non-generative decision model (Qwen3-4B): it scores candidate actions from their text and returns a probability, instead of generating an answer.
  • The accurate design reads the state, the rules, and each candidate together (a joint scorer), so cost grows with the menu.
  • Independent encoding lets each candidate be encoded once and reused across states (about 5x cheaper at 77 candidates), but separates state from candidate.

Why it matters

This model development creates a new option for users and a new testing obligation for developers. A fixed evaluation set comparing quality, cost and failure behavior is more useful than launch claims.

Kaynak sitede devamını oku: arXiv Artificial Intelligence ↗