Skip to content

Every Weight Is a Path of Shared Discrete Decisions

Paper · arXiv 2610.31931 · daily list of October 26, 2026

Ammar Ali, Stamatis Lefkimmiatis · ITMO University

Collected · snapshot shipped with the site build, not a live feed

Abstract · as written by the authors

We introduce TWIG (Tree-structured Weights with Inherited Gates), a representation in which every weight of a neural network is the end of a path of small discrete decisions: a sign, a shift by a power of two, a zero gate, an index into a shared table. Weights that belong together share the upper part of their paths, and each decision is inherited by every weight below it, so it is stored once and applied once. This simple change has three consequences. Any trained network can be written as a TWIG, and when the decisions are powers of two its weight layers become circuits made almost entirely of wires and adders, suited to chips whose weights are fixed at fabrication. Pruning, quantization, low-rank factorization, codebooks and weight sharing become edits of one object, so a single optimizer can choose among all of them for a whole network. And choosing the decisions is the ground-state problem of a higher-order Boltzmann machine whose interactions follow the paths of the tree, the problem class that annealers and quantum optimizers are built to solve. Today these questions are handled apart: each compression method brings its own format and solver, a circuit with fixed weights needs a dedicated constant multiplier for every weight, and discrete solvers reach only narrow subproblems such as rounding. Weight formats have long been moving toward shared decisions, through group scales, shared exponents, microexponents and sparse weights; TWIG takes this trend to its end, and every common format is a shallow TWIG at no extra cost. On five weight matrices of a large language model, a flat tree whose signed power-of-two terms are chosen per weight for circuit cost, with no group scales, needs 9--15\% fewer additions than GPTQ at equal layer error at 3- and 4-bit accuracy on typical matrices, and 20--55\% fewer on matrices with strong outliers.

This is the original abstract from arXiv. It has not been summarised, translated or rewritten.

Terms in plain language

Automatic

Made by matching the words of the title and abstract against a fixed list of definitions. It does not read the paper and does not change the abstract above.

quantization
storing a model’s learned numbers (its weights) with fewer bits, so it needs less memory; this can cost some accuracy.
large language model
an AI system trained on very large amounts of text to read and write language.

Questions about this paper

Where can I read the full paper?

On arXiv, under the identifier 2610.31931: the abstract page is https://arxiv.org/abs/2610.31931 and the PDF is https://arxiv.org/pdf/2610.31931. The text on this page is the authors' abstract, not a summary.

Is there code for this paper?

Yes. The paper's page on Hugging Face links the repository github.com/ammarali32/StateTree-Representation, which had 2 stars when we collected it.

What do the upvotes mean?

4 signed-in Hugging Face users upvoted it on the daily list of October 26, 2026. Upvotes measure attention from that community, not peer review.

What are the plain-language terms under the abstract?

Short notes on the technical words of the title and abstract, in everyday English, taken from a fixed list of definitions that we wrote. They are made automatically by matching words, so a note can miss a term or give a meaning that does not fit this paper. The abstract above them is the authors’ text and is not changed.