PulseAugur
EN
LIVE 11:59:43

Decomposing Prediction Mechanisms for In-Context Recall

Researchers have developed a new set of toy problems designed to probe how transformer models handle in-context learning (ICL) and associative recall. These problems involve training models on interleaved state observations from linear dynamical systems, requiring them to recall specific system states based on symbolic labels. The study found that models develop the ability to recall states later in training than their ability to continue predicting sequences. Mechanistic analysis suggests that next-token prediction in this context involves at least two distinct mechanisms: one for associative recall using discrete labels, and another for AI

RANK_REASON [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.LG →

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →

COVERAGE [1]

  1. arXiv cs.LG TIER_1 English(EN) · Sultan Daniels, Dylan Davis, Dhruv Gautam, Wentinn Liao, Gireeja Ranade, Anant Sahai ·

    Decomposing Prediction Mechanisms for In-Context Recall

    arXiv:2507.01414v2 Announce Type: replace Abstract: We introduce a new family of toy problems that combine features of linear-regression-style continuous in-context learning (ICL) with discrete associative recall. We pretrain transformer models on sample traces from this toy, spe…