Source author record

Arnab Ganguly

Arnab Ganguly 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
16topics
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

Learning stochastic multiscale models through normalizing flows

Many systems in physics, engineering, and biology exhibit multiscale stochastic dynamics, where low-dimensional slow variables evolve under the influence of high-dimensional fast processes. In practice, observations are often limited to a single trajectory of the slow component, while the fast dynamics remain unobserved, making statistical learning challenging. Approaches based on partial differential equations (PDE), such as Fokker-Planck formulations, aim to characterize the evolution of probability densities, typically requiring dense space-time data or grid-based solvers. In contrast, we adopt a trajectory-based perspective and develop a data-driven framework for learning effective stochastic dynamics from a single observed path. We model the dynamics by coupled multiscale stochastic differential equations (SDEs) and first obtain a principled model reduction through stochastic averaging. Unlike generic model reduction techniques such as PCA, this respects the dynamical structure of the original system and explicitly incorporates the interaction between slow and fast scales. A central challenge, however, is that the reduced model depends on the invariant distribution of the fast process, which is a solution to an intractable and often unknown PDE. We introduce a novel learning framework that parameterizes the invariant distribution using normalizing flows, enabling expressive density modeling in the latent fast-variable space. The flow is trained end-to-end by optimizing a penalized likelihood objective induced by the reduced stochastic dynamics. Furthermore, we develop a Bayesian variational inference procedure for uncertainty quantification, employing a second normalizing flow to approximate the posterior distribution over model parameters. This yields a scalable approach to capturing epistemic uncertainty in multiscale systems.

preprint2026arXiv

Variational Smoothing and Inference for SDEs from Sparse Data with Dynamic Neural Flows

Stochastic differential equations (SDEs) provide a flexible framework for modeling temporal dynamics in partially observed systems. A central task is to calibrate such models from data, which requires inferring latent trajectories and parameters from sparse, noisy observations. Classical smoothing methods for this problem are often limited by path degeneracy and poor scalability. In this work, we developed a novel method based on characterization of the posterior SDE in terms of conditional backward-in-time score defined as the gradient of a function solving a Kolmogorov backward equation with multiplicative updates at observation times. We learn this conditional score using neural networks trained to satisfy both the governing PDE and the observation-induced jump conditions, thereby integrating continuous-time dynamics with discrete Bayesian updates. The resulting score induces a posterior SDE with the same diffusion coefficient but a modified drift, enabling efficient posterior trajectory sampling. We further derive a likelihood-based objective for learning the SDE parameters, yielding an evidence lower bound (ELBO) for joint state smoothing and parameter estimation. This leads to a variational EM-style procedure, where the neural conditional score is optimized to approximate the smoothing distribution, followed by a maximization step over the SDE parameters using samples from the induced posterior. Experiments on nonlinear systems demonstrate accurate and stable inference with a very few observations demonstrating significant improved scalability compared to classical MCMC methods.

preprint2022arXiv

Infinite-dimensional optimization and Bayesian nonparametric learning of stochastic differential equations

The paper has two major themes. The first part of the paper establishes certain general results for infinite-dimensional optimization problems on Hilbert spaces. These results cover the classical representer theorem and many of its variants as special cases and offer a wider scope of applications. The second part of the paper then develops a systematic approach for learning the drift function of a stochastic differential equation by integrating the results of the first part with Bayesian hierarchical framework. Importantly, our Baysian approach incorporates low-cost sparse learning through proper use of shrinkage priors while allowing proper quantification of uncertainty through posterior distributions. Several examples at the end illustrate the accuracy of our learning scheme.

preprint2022arXiv

Moment stability of stochastic processes with applications to control systems

We establish new conditions for obtaining uniform bounds on the moments of discrete-time stochastic processes. Our results require a weak negative drift criterion along with a state-dependent restriction on the sizes of the one-step jumps of the processes. The state-dependent feature of the results make them suitable for a large class of multiplicative-noise processes. Under the additional assumption of Markovian property, new result on ergodicity has also been proved. There are several applications to iterative systems, control systems, and other dynamical systems with state-dependent multiplicative noise, and we include illustrative examples to demonstrate applicability of our results.

preprint2022arXiv

Skyrmion-Magnetic Tunnel Junction Synapse with Mixed Synaptic Plasticity for Neuromorphic Computing

Magnetic skyrmion-based data storage and unconventional computing devices have gained increasing attention due to their topological protection, small size, and low driving current. However, skyrmion creation, deletion, and motion are still being studied. In this study, we propose a skyrmion-based neuromorphic magnetic tunnel junction (MTJ) device with both long- and short-term plasticity (LTP and STP) (mixed synaptic plasticity). We showed that plasticity could be controlled by magnetic field, spin-orbit torque (SOT), and the voltage-controlled magnetic anisotropy (VCMA) switching mechanism. LTP depends on the skyrmion density and is manipulated by the SOT and magnetic field while STP is controlled by the VCMA. The LTP property of the device was utilized for static image recognition. By incorporating the STP feature, the device gained additional temporal filtering ability and could adapt to a dynamic environment. The skyrmions were conserved and confined to a nanotrack to minimize the skyrmion nucleation energy. The synapse device was trained and tested for emulating a deep neural network. We observed that when the skyrmion density was increased, the inference accuracy improved: 90% accuracy was achieved by the system at the highest density. We further demonstrated the dynamic environment learning and inference capabilities of the proposed device.

preprint2020arXiv

Context-Aware Design of Cyber-Physical Human Systems (CPHS)

Recently, it has been widely accepted by the research community that interactions between humans and cyber-physical infrastructures have played a significant role in determining the performance of the latter. The existing paradigm for designing cyber-physical systems for optimal performance focuses on developing models based on historical data. The impacts of context factors driving human system interaction are challenging and are difficult to capture and replicate in existing design models. As a result, many existing models do not or only partially address those context factors of a new design owing to the lack of capabilities to capture the context factors. This limitation in many existing models often causes performance gaps between predicted and measured results. We envision a new design environment, a cyber-physical human system (CPHS) where decision-making processes for physical infrastructures under design are intelligently connected to distributed resources over cyberinfrastructure such as experiments on design features and empirical evidence from operations of existing instances. The framework combines existing design models with context-aware design-specific data involving human-infrastructure interactions in new designs, using a machine learning approach to create augmented design models with improved predictive powers.

preprint2016arXiv

A variational approach to path estimation and parameter inference of hidden diffusion processes

We consider a hidden Markov model, where the signal process, given by a diffusion, is only indirectly observed through some noisy measurements. The article develops a variational method for approximating the hidden states of the signal process given the full set of observations. This, in particular, leads to systematic approximations of the smoothing densities of the signal process. The paper then demonstrates how an efficient inference scheme, based on this variational approach to the approximation of the hidden states, can be designed to estimate the unknown parameters of stochastic differential equations. Two examples at the end illustrate the efficacy and the accuracy of the presented method.

preprint2016arXiv

Parameterized Pattern Matching -- Succinctly

We consider the $Parameterized$ $Pattern$ $Matching$ problem, where a pattern $P$ matches some location in a text $\mathsf{T}$ iff there is a one-to-one correspondence between the alphabet symbols of the pattern to those of the text. More specifically, assume that the text $\mathsf{T}$ contains $n$ characters from a static alphabet $Σ_s$ and a parameterized alphabet $Σ_p$, where $Σ_s \cap Σ_p = \varnothing$ and $|Σ_s \cup Σ_p|=σ$. A pattern $P$ matches a substring $S$ of $\mathsf{T}$ iff the static characters match exactly, and there exists a one-to-one function that renames the parameterized characters in $S$ to that in $P$. Previous indexing solution [Baker, STOC 1993], known as $Parameterized$ $Suffix$ $Tree$, requires $Θ(n\log n)$ bits of space, and can find all $occ$ occurrences of $P$ in $\mathcal{O}(|P|\log σ+ occ)$ time. In this paper, we present the first succinct index that occupies $n \log σ+ \mathcal{O}(n)$ bits and answers queries in $\mathcal{O}((|P|+ occ\cdot \log n) \logσ\log \log σ)$ time. We also present a compact index that occupies $\mathcal{O}(n\logσ)$ bits and answers queries in $\mathcal{O}(|P|\log σ+ occ\cdot \log n)$ time. Furthermore, the techniques are extended to obtain the first succinct representation of the index of Shibuya for $Structural$ $Matching$ [SWAT, 2000], and of Idury and Schäffer for $Parameterized$ $Dictionary$ $Matching$ [CPM, 1994].

preprint2014arXiv

Jump-Diffusion Approximation of Stochastic Reaction Dynamics: Error bounds and Algorithms

Biochemical reactions can happen on different time scales and also the abundance of species in these reactions can be very different from each other. Classical approaches, such as deterministic or stochastic approach, fail to account for or to exploit this multi-scale nature, respectively. In this paper, we propose a jump-diffusion approximation for multi-scale Markov jump processes that couples the two modeling approaches. An error bound of the proposed approximation is derived and used to partition the reactions into fast and slow sets, where the fast set is simulated by a stochastic differential equation and the slow set is modeled by a discrete chain. The error bound leads to a very efficient dynamic partitioning algorithm which has been implemented for several multi-scale reaction systems. The gain in computational efficiency is illustrated by a realistically sized model of a signal transduction cascade coupled to a gene expression dynamics.

preprint2013arXiv

Markov chain aggregation and its applications to combinatorial reaction networks

We consider a continuous-time Markov chain (CTMC) whose state space is partitioned into aggregates, and each aggregate is assigned a probability measure. A sufficient condition for defining a CTMC over the aggregates is presented as a variant of weak lumpability, which also characterizes that the measure over the original process can be recovered from that of the aggregated one. We show how the applicability of de-aggregation depends on the initial distribution. The application section is a major aspect of the article, where we illustrate that the stochastic rule-based models for biochemical reaction networks form an important area for usage of the tools developed in the paper. For the rule-based models, the construction of the aggregates and computation of the distribution over the aggregates are algorithmic. The techniques are exemplified in three case studies.

preprint2012arXiv

Error analysis of tau-leap simulation methods

We perform an error analysis for numerical approximation methods of continuous time Markov chain models commonly found in the chemistry and biochemistry literature. The motivation for the analysis is to be able to compare the accuracy of different approximation methods and, specifically, Euler tau-leaping and midpoint tau-leaping. We perform our analysis under a scaling in which the size of the time discretization is inversely proportional to some (bounded) power of the norm of the state of the system. We argue that this is a more appropriate scaling than that found in previous error analyses in which the size of the time discretization goes to zero independent of the rest of the model. Under the present scaling, we show that midpoint tau-leaping achieves a higher order of accuracy, in both a weak and a strong sense, than Euler tau-leaping; a result that is in contrast to previous analyses. We present examples that demonstrate our findings.

preprint2011arXiv

Uniform moment bounds of multi-dimensional functions of discrete-time stochastic processes

We establish conditions for uniform $r$-th moment bound of certain $\R^d$-valued functions of a discrete-time stochastic process taking values in a general metric space. The conditions include an appropriate negative drift together with a uniform $L_p$ bound on the jumps of the process for $p > r + 1$. Applications of the result are given in connection to iterated function systems and biochemical reaction networks.

preprint2011arXiv

Wong-Zakai type convergence in infinite dimensions

The paper deals with convergence of solutions of a class of stochastic differential equations driven by infinite-dimensional semimartingales. The infinite-dimensional semimartingales considered in the paper are Hilbert-space valued. The theorems presented generalize the convergence result obtained by Wong and Zakai for stochastic differential equations driven by linear interpolations of a finite-dimensional Brownian motion. In particular, a general form of the correction factor is derived. Examples are given illustrating the use of the theorems to obtain other kinds of approximation results.