| ▲ | ozgung 2 hours ago | |
I have been working on weight-space-programming as a side project since the blog post. Here is what I understand: - We normally train deep neural networks with back-propagation. We compute gradients to find out how to tweak the weights toward the desired output. - That's a fixed recipe. And it's not the only way to tweak the weights. It's just the best one that works in scale. The brain, for instance, does not do back-propagation, as far as we know. - There are other known mathematical methods (mostly from Linear Algebra) to analyze the activations and compute what weights to change and how, to push the output to the desired way. - A sufficiently advanced LLM knows about these methods and can analyze data like activation maps. With a specific target in hand, it can combine them into new constructions. (see [2] for some of the methods they used and I collected in a repo) - So it's not a fixed training for-loop anymore. It's a dynamic "training" iteration. The LLM looks at the model's outputs, reads some of its layers on chosen inputs, computes an edit, applies it and tests it. - It's dynamic because LLM chooses that to do and how to do it at each iteration by reasoning. I think that's the most interesting part and could be a new paradigm. - I also compared it with gradient training. On my target, training was better (details in [1]), but WSP can find its niche. Its biggest advantage is that it needs no backward pass: less memory, and the model only has to run inference. It needs no differentiable loss, it can enforce constraints directly instead of through a penalty term, and the edit is easier to interpret. [1] https://medium.com/@ozgungenc/weight-space-programming-on-a-... [2] https://github.com/ozgung/weightprog/blob/main/docs/methods.... | ||