arXiv Machine Learning By Thang Tran (CloudKites AI Lab, New South Wales, Australia), Lan Dang (Monash Business School, Monash University, Victoria, Australia)

Numbat: Building and Verifying a Self-Contained Machine-Learning Stack

Read the original on arXiv Machine Learning →

The paper introduces Numbat, a self‑contained machine‑learning stack implemented entirely in Zig with no external runtime dependencies. It covers tensor computation, automatic differentiation, neural‑network modules, mixed precision, multi‑GPU training, data loading, and monitoring, and exposes a stable C ABI with over 1,400 entry points and bindings for six languages. The authors verify the stack against a reference implementation at multiple levels, uncovering ten silent recipe divergences, and demonstrate its practical capability by training a 25.9M‑parameter YOLOv8m detector on COCO 2017, achieving a competitive mAP score and matching single‑GPU performance.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Computation and Language
Oct 19

Automatic Tensor-level Execution of Abstract Interpreters for Neural Networks

Neuton is a framework that automatically converts neuron‑level abstract interpreter specifications into tensor‑level executables, enabling the creation of new DNN certifiers without manual tensor programming. It introduces a stack‑based intermediate representation with shape analysis, domain‑specific rewrite rules for efficient tensor operations, and a novel sparse tensor format (gBCSR) tailored to certifier sparsity. The authors demonstrate that Neuton preserves neuron‑level semantics and evaluate it on eight certifiers across 32 DNN benchmarks, compiling four existing certifiers and producing executable implementations for four others, revealing new precision‑runtime trade‑offs such as SkipPoly matching DeepPoly’s precision while often running faster.

By Avaljot Singh, Yasmin Chandini Sarita, Aditya Mishra, Gagandeep Singh, Charith Mendis
arXiv Machine Learning
Sep 16

OPEN-1B: A Fully Auditable Training Run

The paper introduces Open-1B, a language model trained under a new fully auditable regime that ensures every training operation is reproducible on heterogeneous commodity hardware with bitwise certainty. By enforcing a fixed order on sources of nondeterminism—GPU reductions, data batch ordering, and inter/intra-node communication—the authors enable auditors to replay and verify individual training steps on a single machine. The release includes the full pretraining dataset, all intermediate checkpoints, the training codebase, and an audit harness for step-by-step verification.

By John Donaghy, Brian Wilcox, O\u{g}uzhan Ersoy, Shikhar Rastogi, Adam St Arnaud, Alexey Titov, Jordan Greenberg, Ben Fielding, Harry Grieve