Yuval Belfer is a senior developer advocate at AI21. He writes and teaches about retrieval, agent architecture and debugging inference systems, and coauthored research on the neural tangent kernel of residual networks.[1][2][3]
Start with The verifiability litmus test for agent design →
Career
At AI21, Belfer connects research questions with the engineering of deployed systems. The company identifies him as a senior developer advocate and announced his retrieval and inference-debugging talks alongside engineer Asaf Gardin. He earned an MSc at the Weizmann Institute of Science in 2022; its graduate program lists his thesis on residual-network neural tangent kernels.[1][5]
Contributions
Investigate confident but incorrect inference
Belfer and Gardin’s joint debugging talk follows two failures involving Jamba’s Mamba state cache in vLLM. One allowed a new request to enter decoding before its prefill had established state. Another used an index type that overflowed under larger workloads. The presentation uses comparisons of token log probabilities against another inference framework to locate the divergence. Belfer frames the cases and their lessons; Gardin explains much of the detailed first investigation.[4]
Study what residual networks learn
With Amnon Geifman, Meirav Galun and Ronen Basri, Belfer analyzed residual networks through their neural tangent kernels. The paper studies how eigenvalues vary with frequency and how the balance between residual and skip connections affects the kernel. Belfer and Geifman are marked equal contributors. This is theoretical work on a specified overparameterized network setting, supported by experiments.[3]
Ideas
Belfer’s verifiability article proposes choosing an agent architecture around the task’s available checks. When a candidate answer can be tested against explicit conditions, verification can help select among attempts. An open research report presents a different problem because a system cannot easily establish completeness. He distinguishes checking the correctness of one candidate from knowing that every relevant candidate has been found, and argues that more attempts alone can leave a weak selection process unchanged.[2]
Tools, writing & talks
Writing, research & talks
Start here
A framework for choosing verification or aggregation around the structure of a task.
Start with the question of whether a candidate answer has an explicit check. The opening framework requires no mathematical background; the later examples assume familiarity with agents and retrieval.
Author[2]- Two Bugs That Hid in Plain Sight: A vLLM Debugging Detective Story — Asaf Gardin & Yuval Belferyoutube.com
Asaf Gardin and Yuval Belfer trace an AI21/vLLM bug where decode ran before prefill for a fresh request, corrupting Mamba's state, plus a second bug where a 32-bit index silently wrapped during long RL rollouts.
Catalog workOriginal source - Two Bugs That Hid in Plain Sightai.engineer
A joint account of silent state-cache failures and inference debugging.
Co-presenter with Asaf Gardin[4] A mathematical study of residual-network kernels and their spectral behavior.
Equal-contributing coauthor[3]