How Game Theory Can Make AI More Reliable – WIRED

Posing a far greater challenge for AI researchers was the game of Diplomacya favorite of politicians like John F. Kennedy and Henry Kissinger. Instead of just two opponents, the game features seven players whose motives can be hard to read. To win, a player must negotiate, forging cooperative arrangements that anyone could breach at any time. Diplomacy is so complex that a group from Meta was pleased when, in 2022, its AI program Cicero developed human-level play over the course of 40 games. While it did not vanquish the world champion, Cicero did well enough to place in the top 10 percent against human participants.

During the project, Jacoba member of the Meta teamwas struck by the fact that Cicero relied on a language model to generate its dialog with other players. He sensed untapped potential. The teams goal, he said, was to build the best language model we could for the purposes of playing this game. But what if instead they focused on building the best game they could to improve the performance of large language models?

In 2023, Jacob began to pursue that question at MIT, working with Yikang Shen, Gabriele Farina, and his adviser, Jacob Andreas, on what would become the consensus game. The core idea came from imagining a conversation between two people as a cooperative game, where success occurs when a listener understands what a speaker is trying to convey. In particular, the consensus game is designed to align the language models two systemsthe generator, which handles generative questions, and the discriminator, which handles discriminative ones.

After a few months of stops and starts, the team built this principle up into a full game. First, the generator receives a question. It can come from a human or from a preexisting list. For example, Where was Barack Obama born? The generator then gets some candidate responses, lets say Honolulu, Chicago, and Nairobi. Again, these options can come from a human, a list, or a search carried out by the language model itself.

But before answering, the generator is also told whether it should answer the question correctly or incorrectly, depending on the results of a fair coin toss.

If its heads, then the machine attempts to answer correctly. The generator sends the original question, along with its chosen response, to the discriminator. If the discriminator determines that the generator intentionally sent the correct response, they each get one point, as a kind of incentive.

If the coin lands on tails, the generator sends what it thinks is the wrong answer. If the discriminator decides it was deliberately given the wrong response, they both get a point again. The idea here is to incentivize agreement. Its like teaching a dog a trick, Jacob explained. You give them a treat when they do the right thing.

The generator and discriminator also each start with some initial beliefs. These take the form of a probability distribution related to the different choices. For example, the generator may believe, based on the information it has gleaned from the internet, that theres an 80 percent chance Obama was born in Honolulu, a 10 percent chance he was born in Chicago, a 5 percent chance of Nairobi, and a 5 percent chance of other places. The discriminator may start off with a different distribution. While the two players are still rewarded for reaching agreement, they also get docked points for deviating too far from their original convictions. That arrangement encourages the players to incorporate their knowledge of the worldagain drawn from the internetinto their responses, which should make the model more accurate. Without something like this, they might agree on a totally wrong answer like Delhi, but still rack up points.

Read the original post:

How Game Theory Can Make AI More Reliable - WIRED