Energy-Based Reasoners: 385x more efficient inference
https://energy-based-reasoners.github.io/[0] https://logicalintelligence.com/blog/energy-based-model-sudo...
Its funny everytime ebms get brought up people have to name drop this company. They literally do nothing.
For every clue, mark the probability of sampling its number in the row/col to zero. Also mark the probability of selecting a "clue cell" for modification to 0.
Pick a random cell for modification, based on its "energy" (higher energy get modified first):
1. Every conflicting cell gets energy +1.0 (try to resolve conflicts before new empty cells). E.g. two 7s on the same row both get +1 energy.
2. Empty cells have small energy 0.1
3. Filled cells with no conflicts have energy 0
For the selected cell, choose a digit. Look at numbers in its row/column, every occurrence of a number in the row/col drop prob of sampling by 90%. Example: | No. of 7s | chance of 7 |
| --- | --- |
| 0 | 10% (equal to other digits) |
| 1 | 1% |
| 2 | 0.1% |
Obviously this would get more complex with more numbers on the line (this is just checking 7 on otherwise empty line).This is essentially what these models are doing. It provides a kind of "wave function collapse" search with random exploration based on "energy", but energy is just defined as conflict / unsolved. For something like a maze, energy is disconnected path segments or walls, etc.
EBM sudoku is not that hard in a small scale, and Logical Intelligence sudoku solver doesn't scale , if I'm wrong , I want to see them offering as big of a sudoku as you want.
also, after months and months training EBMs , you come to realize... it's really worth it?
It took a long time (including the development of GPUs, then TPUs, not to mention domain-specific languages like JAX and PyTorch with associated compilers) and scale to train LLMs. EBMs have not yet seen this level of decades of 'full-stack' optimisation.
So if you had a "clue" like 2 in a space, then the energy for 2 on that row / column would be high, but other numbers low. You just sum this up and pick the lowest energy number. As you add numbers, you can hit conflicts (e.g. two 7s in the row), changing one of them will be the next lowest energy move. The probability of changing a number is inversely proportional to its energy. So changing the conflicting numbers is the usual most likely move.
So in the best case it works like this: For each empty cell, pick a number at random, but its weighted by the other numbers that affect it (e.g. if 7 is in the row, the chance of 7 is 0.1%). Continue doing this on empty cells, unless there is a conflict in solved cells (higher prob of mutation), in which case change that number first.
So its a slightly fuzzified version of a very fast concrete algo. "Energy" is just a number from training, its defining by the task at hand (in this case, "energy" is how much conflict numbers have on the board, 0 meaning no conflict and solved if every cell is filled in).
It works by training a weight matrix (N-to-N) on different solutions. For example, in sudoku you're training a weight matrix for every space to every other space (81 c 2), with 9x9 numbers (~240K weights). So then the "energy" for every number in a space is W_ij(a, b) where ij is a pair of spaces, and (a, b) is a pair numbers you want to swap (e.g. 4->2 in the space). Pick the lowest energy move each time (argmin of this whole space), and iterate.
This has a few limitations. First, its discrete and has a limited space definition, getting this to work for arbitrary reasoning seems hard (what size/shape graph would you use for arbitrary reasoning). Second, the ruleset is defined apriori (e.g. you need to know you have a 9x9 grid and 9 numbers, the rules of the game are implicit in the checker). Third, the actual search algorithm is somewhat bespoke to task (less of a factor, maybe use generic graph coloring as the basis of any problem), but for something like agentic reasoning its not clear how this would be adapted. For example with mazes, we need to know what constitutes a valid path and a solved maze, but for language/code rules like that are hard to formulate.
Fourth, this doesn't admit of an easy way to use "fuzzy reasoning" that would be required for integration with any kind of human language or image-based system, where continuous vectors are useful (the graph edges and colors are on/off or discrete).
There are ways to adapt, but this approach fits pretty solidly in the "deterministic, fixed problem size" realm.
In addition, for training you need correct solutions and counter-examples (strongly labeled). For something like "fuzzy logic" training or "natural language" coming up with clear examples and counter-examples would be challenging to fit into this model. LLMs are only possible by leveraging vast quantities of unlabeled data. Not saying impossible, but challenging. For example, if training on human code, what constitutes a counter-example? You basically already have to have a method of getting correct and sufficiently incorrect code just to train this type of system, and its unclear how to represent those changes.
For all of these problems, given the constraints and amount of bespoke logic required, solving with dynamic programming is far faster (including arbitrary graph coloring problems). I only say this to mean that if we could solve all the problems I mentioned above and get arbitrary reasoning into the form of graph coloring, it would still probably be more efficient just to solve that with good old dynamic programming / recursion than with a model like this that needs O(N^2) params versus the graph and needs millions of training examples for different domains. They brag about solving sudoku, but a CPU-based approach to solving it the good old fashioned way on is probably 10-100x faster. If we were using an H200 like they did, we could easily solve the whole sudoku dataset in less than a second.
But it _is_ a very interesting approach, partly because the energy strategy encodes good / likely guesses, so that is kind of interesting vs dynamic programming which is kind of a brute-force approach, so maybe for very large spaces it would be more efficient (but then you have the issue of the parameter space blowing up).
[1] https://arxiv.org/abs/2611.17309
[2] https://developers.openai.com/api/docs/guides/reasoning?api-...
The question is, how integral to reasoning is compressing vast quantities of knowledge to the latent space?