Source author record

Ankur Mani

Ankur Mani 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

4works
8topics
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

4 published item(s)

preprint2026arXiv

Context-Gated Associative Retrieval: From Theory to Transformers

Hopfield networks and their generalizations have established deep connections among biological associative memories, statistical physics, and transformers. Yet most models treat retrieval as a fixed query-to-memory mapping, ignoring the role of external context in recall. In this work, we propose a two-stage associative memory architecture, wherein a context-gate subcircuit reshapes the retrieval energy landscape before and during recall. We show theoretically that context gating increases inter-memory separation while inducing sparsity, translating into exponential improvements in retrieval. Crucially, we prove that the system admits a unique self-consistent fixed point, revealing that the resulting retrieval state is driven by both a direct contextual bias and a second-order retrieval-gate feedback loop. We then bridge this theory to transformers; specifically, we evaluate a first-order approximation on Llama-3, confirming that in-context learning acts as context-gated retrieval. Native dynamics mirror our theory: context localizes a memory subspace, enabling the zero-shot query to cleanly discriminate. Ultimately, this framework provides a mechanistic link between associative memory theory and LLM phenomenology.

preprint2020arXiv

On Mitigating the Uncertainty in Renewable Generation in Distribution Microgrids

In this article, we focus on the problem of mitigating the risk of not being able to meet the power demand, due to the inherent uncertainty of renewable energy generation sources in microgrids. We consider three different demand scenarios, namely meeting short-time horizon power demand, a sustained energy demand and a scenario where the power demand at a prescribed future time has to be met with almost sure guarantee with power generation being stochastic and following dynamics governed by geometric Brownian motion. For each of these scenarios we provide solutions to meet the electrical demand. We present results of numerical experiments to demonstrate the applicability of our schemes.

preprint2010arXiv

Existence of Stable Exclusive Bilateral Exchanges in Networks

In this paper we show that when individuals in a bipartite network exclusively choose partners and exchange valued goods with their partners, then there exists a set of exchanges that are pair-wise stable. Pair-wise stability implies that no individual breaks her partnership and no two neighbors in the network can form a new partnership while breaking other partnerships if any so that at least one of them improves her payoff and the other one does at least as good. We consider a general class of continuous, strictly convex and strongly monotone preferences over bundles of goods for individuals. Thus, this work extends the general equilibrium framework from markets to networks with exclusive exchanges. We present the complete existence proof using the existence of a generalized stable matching in \cite{Generalized-Stable-Matching}. The existence proof can be extended to problems in social games as in \cite{Matching-Equilibrium} and \cite{Social-Games}.

preprint2010arXiv

Generalized Stable Matching in Bipartite Networks

In this paper we study the generalized version of weighted matching in bipartite networks. Consider a weighted matching in a bipartite network in which the nodes derive value from the split of the matching edge assigned to them if they are matched. The value a node derives from the split depends both on the split as well as the partner the node is matched to. We assume that the value of a split to the node is continuous and strictly increasing in the part of the split assigned to the node. A stable weighted matching is a matching and splits on the edges in the matching such that no two adjacent nodes in the network can split the edge between them so that both of them can derive a higher value than in the matching. We extend the weighted matching problem to this general case and study the existence of a stable weighted matching. We also present an algorithm that converges to a stable weighted matching. The algorithm generalizes the Hungarian algorithm for bipartite matching. Faster algorithms can be made when there is more structure on the value functions.