Showing cs.LGShow all
2 papers · 1 filter
cs.LG2026
Multi-Token Prediction and Alternative Tokenization Improve Learning Latent Multi-Hop Graph Search at Scale
Arvid Frydenlund, FuTe Wong, Katherine Lambert +1
Given an unseen graph, a start node, , and an end node, , can a language model generate the shortest path from to ? Prior work has found that models fail to learn this…
cs.LG2025
Language Models, Graph Searching, and Supervision Adulteration: When More Supervision is Less and How to Make More More
Arvid Frydenlund
This work concerns the path-star task, a minimal example of searching over a graph. The graph, , is star-shaped with arms radiating from a start node, . A language model…