53+ open-access research outputs.
We test a regime-conditional functional-form restriction on aggregate risk-exposure dynamics implied by VaR-constrained intermediary models: exposures contract multiplicatively when capital constraintโฆ
Craig, van Ittersum, and Ono conjectured that every prime-detecting quasimodular form of level $1$ is a quasimodular Eisenstein series. This conjecture was proved by Kane--Krishnamoorthy--Lau and by vโฆ
Rapid urbanization in cities like Bangalore has led to severe traffic congestion, making efficient Traffic Signal Control (TSC) essential. Multi-Agent Reinforcement Learning (MARL), often modeling eacโฆ
The \emph{interestingness score} of a directed path $\Pi = e_1, e_2, e_3, \dots, e_\ell$ in an edge-weighted directed graph $G$ is defined as $\texttt{score}(\Pi) := \sum_{i=1}^\ell w(e_i) \cdot \log{โฆ
We introduce the concept of parabolic bases to establish a localized framework for parabolic bundles and parabolic $\lambda$-connections. Building on this foundation, we propose a novel method for conโฆ
Generating molecular graphs is a challenging task due to their discrete nature and the competitive objectives involved. Diffusion models have emerged as SOTA approaches in data generation across varioโฆ
Model stealing, where a learner tries to recover an unknown model via carefully chosen queries, is a critical problem in machine learning, as it threatens the security of proprietary models and the prโฆ
We study the problem of fairly and efficiently allocating indivisible goods among agents with additive valuation functions. Envy-freeness up to one good (EF1) is a well-studied fairness notion for indโฆ
A \emph{trace} of a sequence is generated by deleting each bit of the sequence independently with a fixed probability. The well-studied \emph{trace reconstruction} problem asks how many traces are reqโฆ
We study a $K$-armed non-stationary bandit model where rewards change smoothly, as captured by H\"{o}lder class assumptions on rewards as functions of time. Such smooth changes are parametrized by a Hโฆ
We present a Brownian dynamics simulation of the bacterial Stirling engine studied by Krishnamurthy et al., Nat. Phys. 12, 1134 (2016). In their experimental setup, an overdamped colloid in an opticalโฆ
We give the first $O(1)$-approximation for the weighted Nash Social Welfare problem with additive valuations. The approximation ratio we obtain is $e^{1/e} + \epsilon \approx 1.445 + \epsilon$, which โฆ
Let $U/K$ be a smooth affine curve over a number field and let $L$ be an irreducible rank 3 $\overline{\mathbb Q}_{\ell}$-local system on $U$ with trivial determinant and infinite geometric monodromy โฆ
The Maxey-Riley-Gatignol equations (MRGE) describe the motion of a finite-sized, spherical particle in a fluid. Because of wake effects, the force acting on a particle depends on its past trajectory. โฆ
Motivated by the need for energetically consistent climate models, the Boussinessq-Coriolis (BC) equations are studied with a focus on the averaged vertical heat transport, ie the Nusselt number. A seโฆ
Recent works have shown a reduction from contextual bandits to online regression under a realizability assumption [Foster and Rakhlin, 2020, Foster and Krishnamurthy, 2021]. In this work, we investigaโฆ
For two vertex disjoint graphs $H$ and $F$, we use $H\cup F$ to denote the graph with vertex set $V(H)\cup V(F)$ and edge set $E(H)\cup E(F)$, and use $H+F$ to denote the graph with vertex set $V(H)\cโฆ
A purely local approach has been developed by Krishnamurthy and Kutzko to compute Langlands-Shahidi local coefficient for ${\rm SL}(2)$ via types and covers \`{a} la Bushnell-Kutzko. In this paper, weโฆ
We study the problem of contextual search, a generalization of binary search in higher dimensions, in the adversarial noise model. Let $d$ be the dimension of the problem, $T$ be the time horizon and โฆ
We use the short-time inference scheme (Manikandan, Gupta and Krishnamurthy, Phys. Rev. Lett. 124, 120603, 2020), obtained within the framework of stochastic thermodynamics, to infer a lower-bound to โฆ
Free open-access publishing with Google Scholar indexing.
Submission Guide โ