Workshop Details
DIMACS Workshop on Foundation Models, Large Language Models, and Game Theory
- Start Date: October 20, 2023
- End Date: October 21, 2023
- Event Start Time: 8:00 AM
- Event End Time: 4:00 PM
- Organizers: Segev Wasserkrug | Denizalp Goktas | Amy Greenwald | Tamra Carpenter | David Pennock
- Location: DIMACS Center | Rutgers University | CoRE Building | 96 Frelinghuysen Road
-
Foundation models—models trained on large datasets which can easily adapt to many tasks using few-shot or zero-shot learning—are a major paradigm shift in AI. A primary example are Large Language Models (LLMs), such as ChatGPT, which, through natural language prompting and interaction, can already provide significant value in use cases such as document and code generation. The widespread deployment of such models, however, is creating new challenges, both technical and societal.This workshop aims to initiate work at the intersection of foundation models and game theory. We are interested both in how to use game theory to address some of the issues arising from the use of foundation models, and in how we might advance game theory through the use of foundation models. Our goal, therefore, is to attract researchers who work on foundation models, natural language processing (NLP), and game theory, and to facilitate a structured, academic exchange among them.
The workshop will focus on:
-
Avenues to improve foundation models and LLMs through the use of game-theoretic models and tools: Leveraging multiagent learning in games to study interactions among foundation models and LLMs, and to improve their training algorithms.
-
Advancing game theory and algorithmic game theory using foundation models and LLMs: Studying the potential use of foundation models and LLMs to better model human preferences and to solve games, especially those that arise in economic, political, and social contexts.
-
Assessment of the societal impact of foundation models and LLMs using game theory: Investigating methodologies to quantify and predict the effects of LLMs on technology and society using game theory.
The exchange of ideas among researchers from the various communities has the potential to push the frontiers of foundation model development and AI more broadly. This workshop is intended as a platform in which to initiate this exploration.
-
-
Thursday, October 19, 2023
Workshop Talks
8:00 AM – 9:00 AMBreakfast & Check in
9:00 AM – 9:30 AMWelcome & Opening Remarks
9:30 AM – 10:15 AMWhat Would It Take to Train Foundation Models That Are Strategic?
Constantinos Daskalakis - Massachusetts Institute of Technology
10:15 AM – 10:45 AMBreak (30 minutes)
10:45 AM – 11:05 AMOn Proper Loss Functions for Evaluating Generative Models
Bo Waggoner - University of Colorado
11:05 AM – 11:25 AMChat Games: Strings as Strategies
Ian Gemp - Google DeepMind
11:25 AM – 11:45 AMWhen the Majority is Wrong: Modeling Annotator Disagreement for Language Tasks
Eve Fleisig - University of California, Berkeley
11:45 AM – 1:15 PMLunch
1:15 PM – 2:00 PMRecognizing Failures in the Successes of Large Language Modeling
Kathleen McKeown - Columbia University
Despite impressive recent advances in multi-agent learning, developing analogues of the foundation models encountered in single-agent learning settings remains elusive. The challenge is multi-faceted, and this talk will focus on one of the many facets: the lack of a clear training target. This derives from the fact that multi-agent settings involving agents who use DNNs to model their strategies or utilities quickly escape the scope of classical Game Theory—due to non-convexities, Nash equilibrium existence breaks and standard equilibrium analysis is inapplicable. If this is the case, what is even the goal of training a model in such a setting? I will discuss this challenge and how to overcome it from a combined game-theoretic, complexity-theoretic and learning-theoretic perspective.
[Video]
2:00 PM – 2:30 PMBreak (30 minutes)
2:30 PM – 2:50 PMBuilding Strategic AI Agents Using Language Models and Game Theory
Athul Paul Jacob - Massachusetts Institute of Technology
Loss functions are extremely useful in supervised machine learning to objectively evaluate, compare, and train models. On the other hand, it is not clear how to utilize loss functions for generative models such as GANs and Large Language Models, which use different learning paradigms and present unique challenges for evaluation. This talk will discuss these motivations and challenges and present results from a recent ICML paper, where we define and design loss functions for discrete black-box generative models. Based on joint work with Dhamma Kimpara and Rafael Frongillo, accessible at https://arxiv.org/abs/2211.03761.
[Video]
2:50 PM – 3:10 PMThe Interaction of Game Theory and Natural Language Processing
Roma Patel - Google DeepMind
Game Theory is the study of mathematical models of strategic interactions among rational agents. As humans, language is a key medium of interaction. As such, assuming we can build a suitable model of the players, strategies, and payoffs associated with these interactions (i.e., a binding to the conventional symbolic language of game theory), we can then ask existing algorithms to provide us with optimal, rational solutions (e.g., equilibria), thereby giving us, for example, predictors of stable, rational conversational strategies in dialogue. Large language models have arguably reached a point where grounding to semantics and concepts is strong and accurate enough to rely on as a simulacra of human (+AI) dialogue. These foundation models allow us to begin to think of game theoretic algorithms in the space of natural language. They can also help us quickly prototype new game models via the expressivity of natural language, potentially leading to an explosion in the current repository of games one could study and test our solution concepts on. I’ll present one such binding from dialogue to game theory that we are considering as well as flavors of generalizing existing algorithms to this setting.
[Video]
3:10 PM – 3:30 PMA Meta-Game Evaluation Framework for Multiagent Training Algorithms
Michael Wellman - University of Michigan
Machine learning methods have long used majority vote among annotators for ground truth labels, but annotator disagreement often reflects real differences in opinion, not noise. This issue is particularly key for training large language models, which perform a wide range of often sensitive tasks for a diverse population. For example, a crucial problem in hate speech detection is whether a statement is offensive to the demographic that it targets, which may constitute a small fraction of the annotator pool. In this talk, I’ll present a model that predicts individual annotators’ ratings on potentially offensive text and combines this information with the predicted group targeted by the text to model the opinions of relevant stakeholders. I’ll also discuss ongoing challenges and opportunities of designing large language models that incorporate human feedback from multiple perspectives.
[Video]
3:30 PM – 4:00 PMBreak (30 minutes)
4:00 PM – 5:00 PMRump Session
Large language modeling has changed the nature of natural language processing, with striking success in a large variety of tasks. Despite this success, failures exist, raising questions about their readiness for real use. In this talk I explore two problems for large language models: hallucination and bias. I discuss hallucination in the context of summarization and I present bias in the context of understanding African American Language.
[Video]
5:00 PM – 6:00 PMPoster Session
6:00 PM – 7:00 PMDinner
While current language models have shown impressive performance in tasks involving generation, factual assertions and verification, they still exhibit notable limitations such as struggling with domains requiring strategic reasoning. On the other hand, AI has demonstrated superhuman gameplay in strategic domains like chess, Go, and poker. However, these successes have been largely confined to two-player or competitive games without language use.
In this talk, I will delve into our work on utilizing language models and game theory for building strategic AI agents for Diplomacy - a 7-player board game featuring both cooperative and competitive elements and where natural language communication between players plays a vital role. Finally, I will briefly highlight some of our recent and upcoming work leveraging these insights for building better models of human behavior, human language use and for improving language models.
[Video]
7:00 PM – 7:45 PMGetting Computers to Do What We Want: Programming Meets Machine Learning
Michael Littman - Brown University & National Science Foundation
Insights from human language, for example, how compositional operators work over reusable concepts or how people communicate with one another to solve tasks, provide a rich source of information as to how intelligent behaviour arises in human beings. Can this help us endow agents with the ability to intelligently function in multi-agent populations in the same way that language-speaking humans do? In this talk we’ll go over several pieces of work in which language has been used to guide multi-agent decision making, as well as how insights from game theory can be used to build better language models. These recent works provide a preview of the future of research at the intersection of game theory and natural language processing, and the role that foundation models can play in this area.
[Video]
Evaluating deep multi-agent training algorithms (MATAs) can be quite complicated due to stochasticity in training and sensitivity of agent performance to the behavior of other agents. We propose a meta-game evaluation framework where each MATA is cast as a meta-strategy, and repeatedly sampling normal-form empirical games over combinations of meta-strategies resulting from various random seeds. These empirical games provide the basis for constructing a sampling distribution, using bootstrapping, over a variety of game analysis statistics. We suggest that this framework provides a principled approach for analyzing advanced AI methods that interact with humans or other AI actors.
[Video]
List of Posters:
- Generative Adversarial Equilibrium Solvers, Denizalp Goktas
- Stackelberg Games with Side Information, Keegan Harris
- Self-Confirming Transformer for Locally Consistent Online Adaptation in Multi-Agent Reinforcement Learning, Tao Li
- LLM-augmented Preference Learning from Natural Language, Farhad Mohsin
- Strategic Knowledge Transfer, Max Smith
- Game-theoretic Algorithms for Reinforcement Learning from Human Feedback, Gokul Swamy
- On Learning Latent Models with Multi-Instance Weak Supervision, Kaifu Wang
- Inverse Game Theory for Stackelberg Games: the Blessing of Bounded Rationality, Jibang Wu
- Generative Social Choice, Manuel Wüthrich
- Mechanism Design with Large Language Models, Haifeng Xu
- Causal Reasoning with LLMs: Problems, explorations, intuitions, and beyond, Jiayao Zhang
It is immensely empowering to delegate information processing and automation work to machines and have them carry out difficult tasks on our behalf. But programming computers is hard. The traditional approach to this problem is to try to fix people: They should work harder to learn to code. In this talk, I argue that a promising alternative is to meet people partway. Specifically, powerful new approaches to machine learning provide ways to infer intent from disparate signals and, with your help, could help make it easier for everyone to get computational help with their vexing problems.
[Video]
Friday, October 20, 2023
Workshop Talks
8:30 AM – 9:15 AMBreakfast
9:15 AM – 9:30 AMWelcome & Remarks
9:30 AM – 10:15 AMLarge Language Models as Economic Agents: What Can We Learn from Home Silicus?
John Horton - Massachusetts Institute of Technology
10:15 AM – 10:45 AMBreak (30 Minutes)
10:45 AM – 11:05 AMScaling Human Feedback Using Foundation Models
Minae Kwon - Stanford University
The way we learn from humans is changing as models become more capable. Previously, we’d rely heavily on human demonstrations, handcrafted rewards, and preference labels to train models. However, human feedback is not very scalable for several reasons, including the fact that it simply requires a lot of human effort to specify objectives and preferences. I explore two ways in which we can physically scale the amount of human feedback by reducing human specification burden using foundation models.
[Video]
11:05 AM – 11:25 AMFine-tuning Games: Bargaining and Adaptation for General-Purpose Models
Hoda Heidari - Carnegie Mellon University
Major advances in Machine Learning (ML) and Artificial Intelli- gence (AI) increasingly take the form of developing and releasing general-purpose models. These models are designed to be adapted by other businesses and agencies to perform a particular, domain- specific function. This process has become known as adaptation or fine-tuning. This paper offers a model of the fine-tuning process where a Generalist brings the technological product (here an ML model) to a certain level of performance, and one or more Domain- specialist(s) adapts it for use in a particular domain. Both entities are profit-seeking and incur costs when they invest in the technology, and they must reach a bargaining agreement on how to share the revenue for the technology to reach the market. For a relatively general class of cost and revenue functions, we characterize the conditions under which the fine-tuning game yields a profit-sharing solution. We observe that any potential domain-specialization will either contribute, free-ride, or abstain in their uptake of the technology, and we provide conditions yielding these different strategies. We show how methods based on bargaining solutions and sub-game perfect equilibria provide insights into the strategic behavior of firms in these types of interactions, and we find that profit-sharing can still arise even when one firm has significantly higher costs than another. We also provide methods for identifying Pareto-optimal bargaining arrangements for a general set of utility functions.
11:25 AM – 11:45 AMRecursive Self-improving Code Generation
Adam Kalai - Microsoft Research
An old idea is to design AI systems that improve themselves. We show how to take first steps towards this goal by designing recursively self-improving systems for generating code. That is, starting with a short seed program that improves code at some given task using a language model, the code is used to generate a better improver. We discuss safety concerns and discuss how it may be framed as a game.
[Video]
11:45 AM – 1:15 PMLunch
1:15 PM – 2:00 PMPanel Discussion
Matthew Stone - Rutgers University , Kevin Leyton-Brown - University of British Columbia , Amy Greenwald - Brown University , Gabriele Farina - Massachusetts Institute of Technology , Fei Fang - Carnegie Mellon University
2:00 PM – 2:45 PMBreakout Groups
2:45 PM – 3:30 PMBreakout Group Readouts
4:00 PMKeynote Presentation 3
David Pennock, Chair
Denizalp Goktas, Chair
Keynote Presentation 2
Amy Greenwald, Chair
Dinner Keynote
- Event Grant: <p><img alt="" src="images/DIMACS-EVENTS/WS-2023-LLMs-GT/group_PA190652c.jpg" style="height:292px; width:800px" /></p>
-
Presentations at this workshop are by invitation but others are welcome to attend. There is no fee to attend but registration is required. Please register using the button at the bottom of the page. Space is limited, so please register early if you plan to attend.
Update (9/26/2023): This event has reached capacity, so we have removed the registration link. If you would like to join a waiting list to attend please
This email address is being protected from spambots. You need JavaScript enabled to view it. .Poster session: The workshop will feature a poster session. If you would like to present a poster please apply using the form referenced below. 9/26/2023: Submissions are now closed.
Request support: There are limited funds available to support travel by those whose attendance is contingent on support. Please apply by September 23, 2023 and do not book your tickets until you hear from us!
To apply for travel support or to apply to submit a poster: Please complete this form. (It is a single form through which you can apply for support or to present a poster, or both.) We especially encourage diverse and inclusive participation. We will prioritize applications for support from students presenting posters and those from minority or underrepresented groups.9/26/2023: Submissions are now closed.
