<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Projects | Diksha Gupta</title><link>https://dikshagup.github.io/project/</link><atom:link href="https://dikshagup.github.io/project/index.xml" rel="self" type="application/rss+xml"/><description>Projects</description><generator>Wowchemy (https://wowchemy.com)</generator><language>en-us</language><lastBuildDate>Wed, 01 Apr 2026 00:00:00 +0000</lastBuildDate><image><url>https://dikshagup.github.io/media/icon_hua12caf3901d9d82a302ed5cdf9ed95be_106855_512x512_fill_lanczos_center_3.png</url><title>Projects</title><link>https://dikshagup.github.io/project/</link></image><item><title>Knowledge Removal in LLMs</title><link>https://dikshagup.github.io/project/llm-knowledge-removal/</link><pubDate>Wed, 01 Apr 2026 00:00:00 +0000</pubDate><guid>https://dikshagup.github.io/project/llm-knowledge-removal/</guid><description>&lt;p>A large portion of safety and alignment research has focused on closed frontier models, due to their advanced capabilities. However, the gap between open and closed models is &lt;a href="https://artificialanalysis.ai/" target="_blank" rel="noopener">narrowing fast&lt;/a>, and open-weight models are now being &lt;a href="https://stateofopensource.ai/" target="_blank" rel="noopener">seriously considered for high-stakes applications&lt;/a>.&lt;/p>
&lt;p>Yet, open-weight safety remains an unsolved problem. Every open-weight model has been successfully &amp;ldquo;abliterated&amp;rdquo; through refusal vector ablation, yielding models that comply on dangerous prompts, and unlearning of sensitive information remains extremely brittle to adversarial attacks.&lt;/p>
&lt;p>This project was my first attempt to work on this problem (&lt;a class="accent-link" href="https://www.lesswrong.com/posts/shkMAc9Logd8xPQvB/red-teaming-llm-unlearning-lunar-s-forgotten-knowledge-is">write-up&lt;/a>). I red-teamed &lt;a class="muted-link" href="https://arxiv.org/abs/2502.07218">LUNAR&lt;/a>, a state-of-the-art unlearning method. With the kind of access any open-weight attacker has, I could recover the &amp;ldquo;forgotten&amp;rdquo; knowledge in two ways:&lt;/p>
&lt;ul>
&lt;li>using GRPO fine-tuning, the model learned to route around LUNAR&amp;rsquo;s modifications&lt;/li>
&lt;li>by steering activations along a difference-in-means direction&lt;/li>
&lt;/ul>
&lt;p>This is why I think that open-weight safety requires a different, multi-pronged strategy from closed safety: it requires safety in the absence of guardrails, and robustness to adversarial attacks that are &lt;em>optimised&lt;/em> to target activations (such as refusal ablation or activation steering) or weights (such as fine-tuning to escape safeguards). Meeting that bar demands a much closer collaboration between mechanistic interpretability and alignment - an area I am keen to work more on in the future.&lt;/p></description></item><item><title>Representation Structure in LLMs</title><link>https://dikshagup.github.io/project/llm-representation-structure/</link><pubDate>Sun, 01 Mar 2026 00:00:00 +0000</pubDate><guid>https://dikshagup.github.io/project/llm-representation-structure/</guid><description>&lt;p>Recent work has hypothesised that large language models may represent some concepts as multi-dimensional manifolds instead of single directions. This has encouraged new steering and probing methods that respect manifold geometry. These methods assume that a path along the manifold corresponds to continuous changes in the represented concept and resulting behaviour. If the geometry is instead discrete, such steering places activations off-distribution rather than capturing intermediate values. I am currently testing whether this assumption holds.&lt;/p>
&lt;p>More details soon.&lt;/p>
&lt;h4 id="talks">Talks&lt;/h4>
&lt;ul>
&lt;li>&lt;strong>Aug 2026&lt;/strong> Pivotal Spotlight, London Initiative for Safe AI (LISA) - &lt;em>selected&lt;/em>&lt;/li>
&lt;li>&lt;strong>Aug 2026&lt;/strong> Pivotal Lightning talk, UK AISI - &lt;em>selected&lt;/em>&lt;/li>
&lt;/ul></description></item><item><title>Mechanistic Attribution in Decision Circuits</title><link>https://dikshagup.github.io/project/decision-circuits/</link><pubDate>Sun, 01 Feb 2026 00:00:00 +0000</pubDate><guid>https://dikshagup.github.io/project/decision-circuits/</guid><description>&lt;p>I am fascinated by how intelligent behavior emerges from the coordinated activity of networks of neurons. This page highlights my research aimed at uncovering the representations, architectures, and dynamics that are crucial for fundamental cognitive computations.&lt;/p>
&lt;p>&lt;strong>Reliable Computation from Random Wiring&lt;/strong>: How can a randomly wired network produce reliable outputs? In the insect olfactory system, we showed that convergence—many variable units pooling onto one readout—recovers stereotyped responses without any learning (&lt;a href="https://dikshagup.github.io/publication/random-connectivity/">Nature Communications 2020&lt;/a>).&lt;/p>
&lt;p>&lt;strong>Causal Attribution in Distributed Circuits&lt;/strong>:
How do we attribute function to components of a network that integrates information over time? I studied this in the brain&amp;rsquo;s decision-making circuits, where dominant theories assumed a &lt;em>modular feedforward hypothesis&lt;/em>: evidence accumulation proceeds through a chain of circuits, each region performing a distinct step.&lt;/p>
&lt;p>By analysing information flow between nodes and performing causal ablations, we falsified this hypothesis: the apparent feedforward organization concealed recurrent computation, masked by network-level compensation - ablate one node and the rest of the network reorganizes to cover for it. We proposed two models of this distributed circuit:&lt;/p>
&lt;ul>
&lt;li>
&lt;p>Standard RNNs trained on the task don&amp;rsquo;t reproduce this, so I developed ablation-based training techniques that build in these redundancy and robustness properties, yielding more faithful toy models of the biological network (&lt;a href="https://dikshagup.github.io/publication/multiregion-accumulation/">Neuron 2026&lt;/a>).&lt;/p>
&lt;/li>
&lt;li>
&lt;p>A dynamical-systems model fit only to activations with architectural constraints, which correctly predicted the network&amp;rsquo;s robustness to perturbations it was never trained on (&lt;a href="https://dikshagup.github.io/publication/celltype-dynamical-systems/">NeurIPS 2024&lt;/a>, spotlight).&lt;/p>
&lt;/li>
&lt;/ul>
&lt;p>&lt;strong>Unsupervised Discovery of Internal States&lt;/strong>:
Using unsupervised deep-learning models of neuron activations, this line of work also revealed the moment a network commits to a decision: an abrupt switch from input-driven to autonomous dynamics. This phenomenon is detectabe only at the population level, not in single units (&lt;a href="https://dikshagup.github.io/publication/dynamical-regime-transitions/">Nature 2025&lt;/a>).&lt;/p></description></item><item><title>Failure Modes in Sequential Decisions</title><link>https://dikshagup.github.io/project/sequential-decision-making/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://dikshagup.github.io/project/sequential-decision-making/</guid><description>&lt;p>Neural activations are messy and complicated, so the behaviour of an agent often constrains a system&amp;rsquo;s computational model more tightly than measurements of its internals (&lt;a href="https://pubmed.ncbi.nlm.nih.gov/34096743/" target="_blank" rel="noopener">Niv 2021&lt;/a>). A large part of my research focuses on modelling the algorithm an agent is running from behaviour alone, and predicting its failure modes.&lt;/p>
&lt;p>&lt;strong>Abstract replay for efficient learning&lt;/strong>: How does a system consolidate days of learning into compositional knowledge that transfers to new tasks? The two halves of the question suggest two ingredients: compositionality requires reusable abstractions, and consolidation requires replaying - even simulating - experience offline. We proposed that the cortico-hippocampal circuits in the brain combines the two to learn efficiently and compress memories.&lt;br>
&lt;span class="cite-small">Spens E*, Gupta D*, Lewis E, Castegnaro A, Burgess N, Mrsic-Flogel T, Behrens TEJ (2026). Efficient learning through abstracted generative replay. &lt;a href="https://dikshagup.github.io/uploads/cosyne2026-generative-replay-poster.pdf">Cosyne Abstracts 2026&lt;/a>&lt;/span>&lt;/p>
&lt;p>&lt;strong>Failure modes in sequential decisions&lt;/strong>: I showed that two failure modes of decision-making (history-dependent biases and attentional lapses) long treated as separate and unpredictable - are signatures of one underlying autoregressive computation, and can therefore be modelled and predicted (&lt;a href="https://dikshagup.github.io/publication/trialhistory/">Nature Communications 2024&lt;/a>; Best Paper Award at RLDM 2022). Along the way I showed that a widely used correction for slow drifts in decision variables distorts inference, and that the drift has to be modelled jointly with the updates instead (&lt;a href="https://dikshagup.github.io/publication/slowdrift/">NBDT 2022&lt;/a>).&lt;/p></description></item></channel></rss>