Gabriel Poesia
Hi! I'm a final year Computer Science PhD student at the Stanford AI Lab, advised by Noah Goodman in the Computation and Cognition Lab.
My research is centered around learning formal reasoning, for humans and machines. This involves defining a suitable ``game of mathematics'' (on a formal system), learning to find proofs (using language models and deep reinforcement learning), discovering mathematical abstractions, and ultimately using these tools to build joyful and scalable experiences for mathematics education. My recent research builds heavily on ideas from intrinsically motivated learning, and also explores program verification.
Publications
| NeurIPS 2024 Oral |
Learning Formal Mathematics From Intrinsic Motivation [arXiv] [Code] |
| ICML 2024 |
When do Skills Help Reinforcement Learning? A Theoretical Analysis of Temporal Abstractions |
| TMLR 2024 |
Certified Deductive Reasoning with Language Models [arXiv] |
| ICLR 2024 |
Hypothesis Search: Inductive Reasoning with Language Models [arXiv] |
| Phil. Trans. of the Royal Society A 2023 |
Peano: Learning Formal Mathematical Reasoning [arXiv] |
| NeurIPS 2023 Spotlight |
Parsel🐍: Algorithmic Reasoning with Language Models by Composing Decompositions [arXiv] |
| NeurIPS Math-AI 2022 |
Lemma: Bootstrapping High-Level Mathematical Reasoning with Learned Symbolic Abstractions [Link] [arXiv] [PDF] |
| CogSci 2022 |
Left to the Reader: Abstracting Solutions in Mathematical Reasoning [PDF] |
| ICLR 2022 |
Synchromesh: Reliable Code Generation from Pre-trained Language Models [PDF] |
| NeurIPS 2021 |
Contrastive Reinforcement Learning of Symbolic Reasoning Domains [arXiv] |
| EMNLP 2021 |
Open-domain clarification question generation without question examples [Link] [PDF] |
| AAAI 2021 |
Pragmatic Code Autocomplete [Link] [PDF] [Code] |
| OOPSLA 2020 |
Dynamic Dispatch of Context-Sensitive Optimizations [Link] [PDF] [Code] |
| OOPSLA 2017 |
Static Placement of Computation on Heterogeneous Devices [Link] [PDF] |
| ECML/PKDD 2014 |
A Lossless Data Reduction for Mining Constrained Patterns in n-ary Relations [Link] [PDF] |
Other interests
Programming contests. I used to be an ACM-ICPC competitor (world finalist in 2015), and generally involved in programming contests in various ways. In particular, I authored 3 problems for the ACM-ICPC Latin American regionals, 2 in 2017, one in 2020, and another one upcoming in 2023. I've also coached several teams, taught at training camps in Latin America, and co-authored the problems that selected high schoolers to represent Brazil in the International Olympiad of Informatics in 2018.
Data musicalization. I've been having a lot of fun in creating music from data, as a powerful way to subjectively experience information. One recent finished project on this line was a musicalization of the COVID deaths in Brazil, along with the equally disturbing reactions from our president at the time, which you can watch on YouTube.
Invited Talks
- Synchromesh: Reliable Code Generation from Pre-trained Models @ Microsoft Research, Oct 2021.
- Pragmatic Code Autocomplete: Resolving User Input Ambiguity in Context @ Microsoft Research Cambridge, Aug 2021.
- Contrastive Reinforcement Learning of Symbolic Reasoning Domains @ Google Research, Jul 2021.
- Pragmatic Code Autocomplete @ Microsoft Data+AI, Nov 2020.