Topfi 54 minutes ago

Recommend checking out Logical Intelligence, chaired by among others Yann LeCun, for more context on EBMs [0]. Has great potential in areas that LLMs traditionally do not perform that well in and, because they want to show the advantages of EBMs, also tends to be a great source of examples LLMs struggle with, like primary school level maths and counting (while ironically providing Millennium level Lean proofs). Does of course open the not unreasonable discussion of whether it matters if LLMs can accurately count when writing code to do the calculation is reliable and fast...

[0] https://logicalintelligence.com/blog/energy-based-model-sudo...

xgk 36 minutes ago

The paper does not seem to define what Energy-Based means. The paper says: "EBMs learn a scalar function that assigns an energy to a candidate prediction given an input." What codomain do those learned scalar function have? I guess real numbers? But is "Energy" just a synonym for the reals?

  • usernametaken29 32 minutes ago

    I find this particularly concerning because in their related works they did not refer to the free energy principle, which is the underlying principle of energy based cognition... so eh... what are they referring to? If its not the energy as defined by FEP and active inference, which energy is it? Did they mean entropy? I didn't get it from the paper, really

  • program_whiz 12 minutes ago

    See my comment below, I explain what it means. Energy is just a number that comes out of matrix which learns the relationship between different states of the system being searched. For example, suppose we're talking about sudoku. You would have a matrix that has W_ij (weights between spaces). For each of those, there are 9x9 numbers (energy between two of the digits). A combination like W[0, 1](4, 4) is high because you would have a 4 in the first space, and a 4 in the 2nd space (which breaks the rules). Most of the values are low energy (e.g. 4 and 2 is energy 0, no conflict). However, as different numbers are placed, they are checking for the lowest energy number across the whole board, and the "clues" are locked in.

    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).

igleria 2 hours ago

As far as I could understand, this works very well for a very specific logic puzzle problem set. Interested on future papers tho :)

program_whiz 35 minutes ago

Big caveat if anyone thinks this could replace or strongly augment "reasoning" models (LLMs, RNNs) -- its more like an energy-based search for a discrete problem (graph coloring, solving mazes, sudoku).

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).

saithound 2 hours ago

385x? Them's rookie numbers. Classical energies learn to reason 1000x faster than looped models. [1] Of course, all for a very generous definition of reasoning, that has almost nothing in common with the thing most people associate with the term nowadays. [2]

[1] https://arxiv.org/abs/2611.17309

[2] https://developers.openai.com/api/docs/guides/reasoning?api-...

  • ricardobeat 2 hours ago

    Did those two papers get published six days apart?

  • yorwba 1 hour ago

    The common definition of "reasoning" for all three is "performing a sequence of intermediate steps with multiple passes through the model before outputting an answer." The main difference is that the reasoning models in TFA and [1] are puzzle-solving models, not language models.

    • saithound 48 minutes ago

      Well, yes, that's the very generous definition of reasoning I was referring to, under which almost any iterative computation could count as reasoning.

scurnus 38 minutes ago

This is basic and similar to recurrent reasoning papers, it works only on sudoku and basic games, with constrained rules, unique or low number of solutions. It would be interesting to see how these reasoners do in games like Chess or Go. Efficient inference is useful when it comes with something useful.

netbioserror 33 minutes ago

The more abstractly reasoning can be modeled, the better. It means knowledge can be externalized to discrete knowledge bases and queried when needed, and models can be run locally with lower and lower energy hardware.

The question is, how integral to reasoning is compressing vast quantities of knowledge to the latent space?