Source author record

Daniel Murfet

Daniel Murfet appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

14works
14topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

14 published item(s)

preprint2026arXiv

Interpreting Reinforcement Learning Agents with Susceptibilities

Susceptibilities are a technique for neural network interpretability that studies the response of posterior expectation values of observables to perturbations of the loss. We generalize this construction to the setting of the regret in deep reinforcement learning and investigate the utility of susceptibilities in a simple gridworld model that nevertheless exhibits non-trivial stagewise development. We argue that susceptibilities reveal internal features of the development of the model in parameter space that one cannot detect purely by studying the development of the learned policy. We validate these results with activation-steering, and discuss the framework's extension to RLHF post-training.

preprint2026arXiv

Susceptibilities and Patterning: A Primer on Linear Response in Bayesian Learning

These notes introduce the theory of susceptibilities as developed in [arXiv:2504.18274, arXiv:2601.12703] for interpreting neural networks. The susceptibility of an observable $φ$ to a data perturbation is defined as a derivative of a posterior expectation, which by the fluctuation--dissipation theorem equals a posterior covariance. Different choices of $φ$ yield different objects: per-sample losses give the influence matrix (the Bayesian influence function of [arXiv:2509.26544]), while component-localized observables give the structural susceptibility matrix that pairs model components with data patterns. The susceptibility matrix is (up to a factor of $nβ$) the Jacobian of the map from data distributions to structural coordinates; its pseudo-inverse provides a linearized solution to the patterning problem of [arXiv:2601.13548]: finding data perturbations that produce a desired structural change. We motivate the theory from its statistical-mechanical foundations, then give a detailed exposition of susceptibilities, their empirical estimators, and their connection to the geometry of the loss landscape.

preprint2026arXiv

Towards Spectroscopy: Susceptibility Clusters in Language Models

Spectroscopy infers the internal structure of physical systems by measuring their response to perturbations. We apply this principle to neural networks: perturbing the data distribution by upweighting a token $y$ in context $x$, we measure the model's response via susceptibilities $χ_{xy}$, which are covariances between component-level observables and the perturbation computed over a localized Gibbs posterior via stochastic gradient Langevin dynamics (SGLD). Theoretically, we show that susceptibilities decompose as a sum over modes of the data distribution, explaining why tokens that follow their contexts "for similar reasons" cluster together in susceptibility space. Empirically, we apply this methodology to Pythia-14M, developing a conductance-based clustering algorithm that identifies 510 interpretable clusters ranging from grammatical patterns to code structure to mathematical notation. Comparing to sparse autoencoders, 50% of our clusters match SAE features, validating that both methods recover similar structure.

preprint2020arXiv

Gentzen-Mints-Zucker duality

The Curry-Howard correspondence is often described as relating proofs (in intutionistic natural deduction) to programs (terms in simply-typed lambda calculus). However this narrative is hardly a perfect fit, due to the computational content of cut-elimination and the logical origins of lambda calculus. We revisit Howard's work and interpret it as an isomorphism between a category of proofs in intuitionistic sequent calculus and a category of terms in simply-typed lambda calculus. In our telling of the story the fundamental duality is not between proofs and programs but between local (sequent calculus) and global (lambda calculus or natural deduction) points of view on a common logico-computational mathematical structure.

preprint2017arXiv

Logic and linear algebra: an introduction

We give an introduction to logic tailored for algebraists, explaining how proofs in linear logic can be viewed as algorithms for constructing morphisms in symmetric closed monoidal categories with additional structure. This is made explicit by showing how to represent proofs in linear logic as linear maps between vector spaces. The interesting part of this vector space semantics is based on the cofree cocommutative coalgebra of Sweedler.

preprint2015arXiv

Adjunctions and defects in Landau-Ginzburg models

We study the bicategory of Landau-Ginzburg models, which has potentials as objects and matrix factorisations as 1-morphisms. Our main result is the existence of adjoints in this bicategory and a description of evaluation and coevaluation maps in terms of Atiyah classes and homological perturbation. The bicategorical perspective offers a unified approach to Landau-Ginzburg models: we show how to compute arbitrary correlators and recover the full structure of open/closed TFT, including the Kapustin-Li disk correlator and a simple proof of the Cardy condition, in terms of defect operators which in turn are directly computable from the adjunctions.

preprint2013arXiv

A toolkit for defect computations in Landau-Ginzburg models

We review the results of arXiv:1208.1481 on orientation reversal and duality for defects in topological Landau-Ginzburg models, with the intention of providing an easily accessible toolkit for computations. As an example we include a proof of the main result on adjunctions in a special case, using Pauli matrices. We also explain how to compute arbitrary correlators of defect-decorated planar worldsheets, and briefly discuss the relation to generalised orbifolds.

preprint2009arXiv

On two examples by Iyama and Yoshino

In the recent paper "Mutation in triangulated categories and rigid Cohen-Macaulay modules" Iyama and Yoshino consider two interesting examples of isolated singularities over which it is possible to classify the indecomposable maximal Cohen-Macaulay modules in terms of linear algebra data. In this paper we present two new approaches to these examples. In the first approach we give a relation with cluster categories. In the second approach we use Orlov's result on the graded singularity category. We obtain some new results on the singularity category of isolated singularities which may be interesting in their own right.