Timezone: »

 
Poster
Contrastive Reinforcement Learning of Symbolic Reasoning Domains
Gabriel Poesia · WenXin Dong · Noah Goodman

Thu Dec 09 08:30 AM -- 10:00 AM (PST) @
in Poster Session 6 »

Abstract symbolic reasoning, as required in domains such as mathematics and logic, is a key component of human intelligence. Solvers for these domains have important applications, especially to computer-assisted education. But learning to solve symbolic problems is challenging for machine learning algorithms. Existing models either learn from human solutions or use hand-engineered features, making them expensive to apply in new domains. In this paper, we instead consider symbolic domains as simple environments where states and actions are given as unstructured text, and binary rewards indicate whether a problem is solved. This flexible setup makes it easy to specify new domains, but search and planning become challenging. We introduce five environments inspired by the Mathematics Common Core Curriculum, and observe that existing Reinforcement Learning baselines perform poorly. We then present a novel learning algorithm, Contrastive Policy Learning (ConPoLe) that explicitly optimizes the InfoNCE loss, which lower bounds the mutual information between the current state and next states that continue on a path to the solution. ConPoLe successfully solves all four domains. Moreover, problem representations learned by ConPoLe enable accurate prediction of the categories of problems in a real mathematics curriculum. Our results suggest new directions for reinforcement learning in symbolic domains, as well as applications to mathematics education.

Keywords: Reinforcement Learning and Planning · Machine Learning · Contrastive Learning

Author Information

Gabriel Poesia (Stanford University)
WenXin Dong (Stanford University)
Noah Goodman (Stanford University)

More from the Same Authors