paper-with-me

Papers

Mechanistic Interpretability of LLM Jailbreaks via Internal Attribution Graphs

2026-07-08 · Anupam Wagle, Ifrat Ikhtear Uddin, Chaowei Zhang, Longwei Wang arxiv

Large language models (LLMs) exhibit remarkable capabilities but remain highly vulnerable to adversarial prompts and jailbreak attacks. Existing approaches primarily analyze these failures through input-output behaviors or attribution methods, offering limited insight into how adversarial perturbations alter the model's internal reasoning. Consequently, the mechanisms underlying unsafe or incorrect behaviors remain poorly understood. We introduce a mechanistic framework for diagnosing LLM vulnerabilities using paired internal computation graphs, which represent prompt-specific inference as structured causal interactions among latent features. By constructing and aligning computation graphs for clean and attacked prompts, we reveal that adversarial attacks induce systematic transformations of internal reasoning, including suppression of safety-relevant components, emergence of attack-specific features, and rerouting of computation paths. Building on this representation, we propose a unified framework that (i) decomposes computation into invariant, suppressed, and emergent structures, (ii) identifies recurring vulnerability motifs associated with failure modes, and (iii) performs causal interventions on nodes, paths, and subgraphs to directly evaluate their contributions to attack success. This enables a transition from descriptive attribution to causal diagnosis of model failures. Experiments across multiple open-source LLMs and diverse adversarial and jailbreak benchmarks demonstrate that structural deviations in internal computation graphs strongly correlate with unsafe behaviors. Furthermore, targeted interventions on identified vulnerability motifs improve model robustness, establishing internal computation graphs as a principled foundation for understanding, diagnosing, and mitigating LLM vulnerabilities.

📄 PDF Abstract BibTeX arXiv:2607.07903

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Attribution Graphs and Causal Probing for Mechanistic Discovery and Bias Repair in Multimodal Generative Learning

2025-10-14 · Noor Islam S. Mohammad, Uluğ Bayazıt arxiv

We treat the internals of generative models as mechanistic objects rather than black boxes. We introduce \textbf{Attribution Graphs} (AGs), which extend GradCAM++ to circuit-level representations, and \textbf{Causal Prob…

Adversarial Robustness

CodeCircuit: Toward Inferring LLM-Generated Code Correctness via Attribution Graphs

2026-02-06 · Yicheng He, Zheng Zhao, Zhou Kaiyu, Bryan Dai 외 arxiv

Current paradigms for code verification rely heavily on external mechanisms-such as execution-based unit tests or auxiliary LLM judges-which are often labor-intensive or limited by the judging model's own capabilities. T…

Code Generation

Mechanistic Interpretability for Transformer-based Time Series Classification

2025-11-26 · Matīss Kalnāre, Sofoklis Kitharidis, Thomas Bäck, Niki van Stein arxiv

Transformer-based models have become state-of-the-art tools in various machine learning tasks, including time series classification, yet their complexity makes understanding their internal decision-making challenging. Ex…

Time Series Classification

CLT-Forge: A Scalable Library for Cross-Layer Transcoders and Attribution Graphs

2026-03-22 · Florent Draye, Abir Harrasse, Vedant Palit, Tung-Yu Wu 외 arxiv

Mechanistic interpretability seeks to understand how Large Language Models (LLMs) represent and process information. Recent approaches based on dictionary learning and transcoders enable representing model computation in…

Using Mechanistic Interpretability to Craft Adversarial Attacks against Large Language Models

2025-03-08 · Thomas Winninger, Boussad ADDAD, Katarzyna Kapusta

Traditional white-box methods for creating adversarial perturbations against LLMs typically rely only on gradient computation from the targeted model, ignoring the internal mechanisms responsible for attack success or fa…