Towards Generalizable Representations of Mathematical Strategies
Siddhartha Pradhan, Ethan Prihar, Erin Ottmar

TL;DR
This paper introduces a novel method for learning generalizable, problem-invariant representations of entire algebraic solution pathways using transition embeddings and contrastive learning, enabling scalable analysis of student strategies.
Contribution
The work presents a new approach combining transition embeddings and SimCSE contrastive learning to capture and analyze mathematical strategies across different platforms and problems.
Findings
Embeddings encode meaningful strategy information.
Strategy measures correlate with learning outcomes.
Method enables platform-agnostic analysis of problem-solving behaviors.
Abstract
Pretrained encoders for mathematical texts have achieved significant improvements on various tasks such as formula classification and information retrieval. Yet they remain limited in representing and capturing student strategies for entire solution pathways. Previously, this has been accomplished either through labor-intensive manual labeling, which does not scale, or by learning representations tied to platform-specific actions, which limits generalizability. In this work, we present a novel approach for learning problem-invariant representations of entire algebraic solution pathways. We first construct transition embeddings by computing vector differences between consecutive algebraic states encoded by high-capacity pretrained models, emphasizing transformations rather than problem-specific features. Sequence-level embeddings are then learned via SimCSE, using contrastive objectives…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
