The Flow has not summarised this story yet — read it at Hugging Face Trending Papers.
arXiv:2608.24482v1 Announce Type: cross Abstract: Mechanistic Localization bridges mechanistic interpretability and post-training optimization by isolating critical parameters via interpretative appr...
arXiv:2606. 09396v1 Announce Type: cross Abstract: Supervised fine-tuning (SFT) is an efficient approach for downstream task adaptation and often serves as the initialization stage for reinforcement learning (RL), but it can show weaker generalization than RL.
S^3martCirc is a self‑supervised framework that jointly discovers and interprets neural circuits in large language models, rather than treating circuit discovery and functional interpretation as separate stages. It abstracts node behavior into two general computational roles that generalize across tasks and introduces a quantitative metric for assigning these roles, enabling simultaneous identification of importance and function. Experiments demonstrate that S^3martCirc outperforms existing methods in circuit discovery.
arXiv:2607. 00089v1 Announce Type: new Abstract: Mechanistic interpretability has produced a rich inventory of component-level analyses that characterise what neural-network components encode and how they interact.
arXiv:2607. 07316v1 Announce Type: new Abstract: This article offers a comprehensive overview of mechanistic interpretability, an emerging field that seeks to reverse-engineer the internal algorithms of modern neural networks.
The paper introduces a circuit‑grounded framework that links training‑dynamics‑based data valuation with mechanistic interpretability. It defines data quality along learnability, challenge, and alignment, identifies internal model circuits that control these utilities, and uses them as controllable interfaces for data generation. The authors present SAMS, a stage‑aware scheduling method that steers circuit‑guided data to match the model’s evolving optimization needs, achieving more diverse and effective data than prompt‑based baselines on multiple‑choice QA tasks.