Arun Kumar Tangirala
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Arun Kumar Tangirala has a total of 87 co-authors. Here are the top co-authors by number of shared publications:
- Karthik Raman
Department of Biotechnology, Bhupat and Jyoti Mehta School of Biosciences, IIT Madras
13 shared publications - Priyan Bhattacharya
Affiliation Department of Pathology and Genomic Medicine, Thomas Jefferson University, Philadelphia, Pennsylvania, United States of America
6 shared publications Prem Jagadeesan
Affiliations Department of Chemical Engineering, Indian Institute of Technology (IIT) Madras, Chennai, India, Robert Bosch Centre for Data Science and Artificial Intelligence (RBCDSAI), IIT Madras, Chennai, India, Centre for Integrative Biology and Systems mEdicine (IBSE), Wadhwani School of Data Science and AI (WSAI), IIT Madras, Chennai, India
5 shared publications- Satheesh Kumar Perepu
Ericsson Research, India
5 shared publications - Shankar Narasimhan
Department of Chemical Engineering, Indian Institute of Technology Madras, Chennai, India
4 shared publications - Boby George
Department of Electrical Engineering, IIT Madras, Chennai, India
3 shared publications
Latest Publications
- Open Access
- 14 January 2026
- Published by Public Library of Science (PLoS) in PLOS Complex Systems
- Vol. 3 (1) , e0000082
A generalized Bayesian framework for maximizing information gain and model selection
Computational modelling of dynamical systems often involves many free parameters estimated from experimental data. The information gained from an experiment plays a crucial role in the goodness of predictions and parameter estimates. Optimal Experiment Design (OED) is typically used to choose an experiment containing maximum information from a set of possible experiments. This work presents a novel Bayesian Optimal Experiment Design Selection principle for generalised parameter distributions. The generalization is achieved by extending the β -information gain to the discrete distributions. The β -information gain is based on what is known as the Bhattacharyya coefficient. We show that maximising the β -information gain is equivalent to maximising the angle between the prior and posterior distributions. We analytically show, with uniform prior, selecting an experiment that maximises β -information gain reduces the posterior’s uncertainty. Further, we apply the proposed experiment selection criteria for two realistic experiment designs in systems biology. Firstly, we use the β -information gain to choose the best measurement method for parameter estimation in a Hes1 transcription model. The measurement method selected by the β -information gain results in the minimum mean square error of the parameter estimates. In the second case, we employ the proposed information gained to select an optimal sampling schedule for the HIV 1 2 LTR model. The sampling schedule chosen by the presented method reduces both prediction and parameter uncertainty. Finally, we propose a novel method for model selection using β -information gain and demonstrate the working of the proposed method in the model selection in compartmental models.
- 14 January 2026
- Published by Public Library of Science (PLoS) in PLOS Complex Systems
- Vol. 3 (1) , e0000082
Open AccessA generalized Bayesian framework for maximizing information gain and model selection
Computational modelling of dynamical systems often involves many free parameters estimated from experimental data. The information gained from an experiment plays a crucial role in the goodness of predictions and parameter estimates. Optimal Experiment Design (OED) is typically used to choose an experiment containing maximum information from a set of possible experiments. This work presents a novel Bayesian Optimal Experiment Design Selection principle for generalised parameter distributions. The generalization is achieved by extending the β -information gain to the discrete distributions. The β -information gain is based on what is known as the Bhattacharyya coefficient. We show that maximising the β -information gain is equivalent to maximising the angle between the prior and posterior distributions. We analytically show, with uniform prior, selecting an experiment that maximises β -information gain reduces the posterior’s uncertainty. Further, we apply the proposed experiment selection criteria for two realistic experiment designs in systems biology. Firstly, we use the β -information gain to choose the best measurement method for parameter estimation in a Hes1 transcription model. The measurement method selected by the β -information gain results in the minimum mean square error of the parameter estimates. In the second case, we employ the proposed information gained to select an optimal sampling schedule for the HIV 1 2 LTR model. The sampling schedule chosen by the presented method reduces both prediction and parameter uncertainty. Finally, we propose a novel method for model selection using β -information gain and demonstrate the working of the proposed method in the model selection in compartmental models.
- 6 January 2026
- Published by Springer Nature
- p. 527-541
Exploring Space-Based Active Vibration Control (AVC) Techniques with AVC Simulation Study on Smart Flexible Beam
- 6 January 2026
- Published by Springer Nature
- p. 527-541
Exploring Space-Based Active Vibration Control (AVC) Techniques with AVC Simulation Study on Smart Flexible Beam
- 22 August 2025
- Published by Elsevier in Control Engineering Practice
- Vol. 165
Active fault tolerant active vibration dual-mode Model Predictive Control for a smart flexible beam
- 22 August 2025
- Published by Elsevier in Control Engineering Practice
- Vol. 165
Active fault tolerant active vibration dual-mode Model Predictive Control for a smart flexible beam
- Open Access
Causal discovery in deterministic discrete LTI-DAE systems
Discovering pure causes or driver variables in deterministic LTI systems is of vital importance in the data-driven reconstruction of causal networks. A recent work by Kathari and Tangirala, proposed in 2022, formulated the causal discovery method as a constraint identification problem. The constraints are identified using a dynamic iterative PCA (DIPCA)-based approach for dynamical systems corrupted with Gaussian measurement errors. The DIPCA-based method works efficiently for dynamical systems devoid of any algebraic relations. However, several dynamical systems operate under feedback control and/or are coupled with conservation laws, leading to differential-algebraic (DAE) or mixed causal systems. In this work, a method, namely the partition of variables (PoV), for causal discovery in LTI-DAE systems is proposed. This method is superior to the method that was presented by Kathari and Tangirala (2022), as PoV also works for pure dynamical systems, which are devoid of algebraic equations. The proposed method identifies the causal drivers up to a minimal subset. PoV deploys DIPCA to first determine the number of algebraic relations ($n_a$), the number of dynamical relations ($n_d$) and the constraint matrix. Subsequently, the subsets are identified through an admissible partitioning of the constraint matrix by finding the condition number of it. Case studies are presented to demonstrate the effectiveness of the proposed method.
Open AccessCausal discovery in deterministic discrete LTI-DAE systems
Discovering pure causes or driver variables in deterministic LTI systems is of vital importance in the data-driven reconstruction of causal networks. A recent work by Kathari and Tangirala, proposed in 2022, formulated the causal discovery method as a constraint identification problem. The constraints are identified using a dynamic iterative PCA (DIPCA)-based approach for dynamical systems corrupted with Gaussian measurement errors. The DIPCA-based method works efficiently for dynamical systems devoid of any algebraic relations. However, several dynamical systems operate under feedback control and/or are coupled with conservation laws, leading to differential-algebraic (DAE) or mixed causal systems. In this work, a method, namely the partition of variables (PoV), for causal discovery in LTI-DAE systems is proposed. This method is superior to the method that was presented by Kathari and Tangirala (2022), as PoV also works for pure dynamical systems, which are devoid of algebraic equations. The proposed method identifies the causal drivers up to a minimal subset. PoV deploys DIPCA to first determine the number of algebraic relations ($n_a$), the number of dynamical relations ($n_d$) and the constraint matrix. Subsequently, the subsets are identified through an admissible partitioning of the constraint matrix by finding the condition number of it. Case studies are presented to demonstrate the effectiveness of the proposed method.
- Open Access
An improved framework for grey-box identification of biological processes
Developing models from observations is at the heart of empirical science. Grey-box Modeling combines the insights gained from the results obtained from first principles with observational data. When the model turns out to be unsatisfactory, the goodness of such grey-box models in terms of predictability and parameter estimates largely depends on either modifying the model structure obtained from the first principles or conducting new experiments. Unfortunately, in the context of biological models, where the model structures are usually nonlinear ODEs with a large number of states and parameters along with sparse and noisy experimental data, traditional identification protocols have to go through several iterations to identify the source of the issue. Even after multiple iterations, they may still arrive at sub-optimal solutions. In this work, we propose an improved framework with a new set of tools to resolve this issue unambiguously with a minimum round of iterations.
Open AccessAn improved framework for grey-box identification of biological processes
Developing models from observations is at the heart of empirical science. Grey-box Modeling combines the insights gained from the results obtained from first principles with observational data. When the model turns out to be unsatisfactory, the goodness of such grey-box models in terms of predictability and parameter estimates largely depends on either modifying the model structure obtained from the first principles or conducting new experiments. Unfortunately, in the context of biological models, where the model structures are usually nonlinear ODEs with a large number of states and parameters along with sparse and noisy experimental data, traditional identification protocols have to go through several iterations to identify the source of the issue. Even after multiple iterations, they may still arrive at sub-optimal solutions. In this work, we propose an improved framework with a new set of tools to resolve this issue unambiguously with a minimum round of iterations.
- 31 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 73 (00189456) , 1-10
An Inductive Sensing Mechanism for Cantilever-Based Water Flow Measurement
A novel, cost-effective, non-invasive measurement technique for a cantilever-based flow sensor is presented in this manuscript. The sensor comprises a stainless-steel cantilever installed within the pipe. The cantilever deflects as a function of the flow rate, and its bending angle is sensed with the help of flexible planar coils. These coils are attached externally to the insulating water pipe. The proposed deflection sensing mechanism is based on the eddy current principle. In the proposed approach, three sensing coils are used, and changes in the self-inductances of those coils are read using an inductance-to-digital converter. The bending angle in either direction of the cantilever deflection are obtained from this information. The effectiveness of the sensing mechanism is first confirmed by conducting finite element analysis (FEA). Later, a prototype sensor is developed and tested in a laboratory-scale arrangement. The change in inductance due to the deflection of the cantilever corresponding to the flow rate is recorded. The FEA and experimental findings exhibit very good consistency, proving that the proposed transduction and readout mechanisms are suitable for the practical realization of a new flow sensor. The prototype sensor showed a full-scale worst-case accuracy of 3% for flow rates ranging from 0 to 7 m 3 /hr. The sensing element that does not include any rotary parts. Similarly, no electrical connections are required to the cantilever for measurement. These features may help achieve less maintenance and a longer lifespan for the sensor.
- 31 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 73 (00189456) , 1-10
An Inductive Sensing Mechanism for Cantilever-Based Water Flow Measurement
A novel, cost-effective, non-invasive measurement technique for a cantilever-based flow sensor is presented in this manuscript. The sensor comprises a stainless-steel cantilever installed within the pipe. The cantilever deflects as a function of the flow rate, and its bending angle is sensed with the help of flexible planar coils. These coils are attached externally to the insulating water pipe. The proposed deflection sensing mechanism is based on the eddy current principle. In the proposed approach, three sensing coils are used, and changes in the self-inductances of those coils are read using an inductance-to-digital converter. The bending angle in either direction of the cantilever deflection are obtained from this information. The effectiveness of the sensing mechanism is first confirmed by conducting finite element analysis (FEA). Later, a prototype sensor is developed and tested in a laboratory-scale arrangement. The change in inductance due to the deflection of the cantilever corresponding to the flow rate is recorded. The FEA and experimental findings exhibit very good consistency, proving that the proposed transduction and readout mechanisms are suitable for the practical realization of a new flow sensor. The prototype sensor showed a full-scale worst-case accuracy of 3% for flow rates ranging from 0 to 7 m 3 /hr. The sensing element that does not include any rotary parts. Similarly, no electrical connections are required to the cantilever for measurement. These features may help achieve less maintenance and a longer lifespan for the sensor.
- 3 July 2024
- Published by Springer Nature in Bulletin of Mathematical Biology
- Vol. 86 (8) , 1-40
Design Principles for Perfect Adaptation in Biological Networks with Nonlinear Dynamics
Establishing a mapping between the emergent biological properties and the repository of network structures has been of great relevance in systems and synthetic biology. Adaptation is one such biological property of paramount importance that promotes regulation in the presence of environmental disturbances. This paper presents a nonlinear systems theory-driven framework to identify the design principles for perfect adaptation with respect to external disturbances of arbitrary magnitude. Based on the prior information about the network, we frame precise mathematical conditions for adaptation using nonlinear systems theory. We first deduce the mathematical conditions for perfect adaptation for constant input disturbances. Subsequently, we translate these conditions to specific necessary structural requirements for adaptation in networks of small size and then extend to argue that there exist only two classes of architectures for a network of any size that can provide local adaptation in the entire state space, namely, incoherent feed-forward (IFF) structure and negative feedback loop with buffer node (NFB). The additional positiveness constraints further narrow the admissible set of network structures. This also aids in establishing the global asymptotic stability for the steady state given a constant input disturbance. The proposed method does not assume any explicit knowledge of the underlying rate kinetics, barring some minimal assumptions. Finally, we also discuss the infeasibility of certain IFF networks in providing adaptation in the presence of downstream connections. Moreover, we propose a generic and novel algorithm based on non-linear systems theory to unravel the design principles for global adaptation. Detailed and extensive simulation studies corroborate the theoretical findings.
- 3 July 2024
- Published by Springer Nature in Bulletin of Mathematical Biology
- Vol. 86 (8) , 1-40
Design Principles for Perfect Adaptation in Biological Networks with Nonlinear Dynamics
Establishing a mapping between the emergent biological properties and the repository of network structures has been of great relevance in systems and synthetic biology. Adaptation is one such biological property of paramount importance that promotes regulation in the presence of environmental disturbances. This paper presents a nonlinear systems theory-driven framework to identify the design principles for perfect adaptation with respect to external disturbances of arbitrary magnitude. Based on the prior information about the network, we frame precise mathematical conditions for adaptation using nonlinear systems theory. We first deduce the mathematical conditions for perfect adaptation for constant input disturbances. Subsequently, we translate these conditions to specific necessary structural requirements for adaptation in networks of small size and then extend to argue that there exist only two classes of architectures for a network of any size that can provide local adaptation in the entire state space, namely, incoherent feed-forward (IFF) structure and negative feedback loop with buffer node (NFB). The additional positiveness constraints further narrow the admissible set of network structures. This also aids in establishing the global asymptotic stability for the steady state given a constant input disturbance. The proposed method does not assume any explicit knowledge of the underlying rate kinetics, barring some minimal assumptions. Finally, we also discuss the infeasibility of certain IFF networks in providing adaptation in the presence of downstream connections. Moreover, we propose a generic and novel algorithm based on non-linear systems theory to unravel the design principles for global adaptation. Detailed and extensive simulation studies corroborate the theoretical findings.
- Open Access
- 24 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 245-250
Enhancing Crop Yield Prediction Skill through Multi-Stage Clustered Prediction: A Novel Approach for Spatiotemporal Data
Predicting crop yield is of immense value in governing several agricultural endeavours. However, the substantially limited historical yield records, coupled with the multi-directional property of the spatiotemporal yield data, pose a significant challenge. Moreover, a lack of awareness among farmers lead to misinterpretation of yield prediction, which results in a formidable challenge for the farmers to fulfill the obligations associated with their financial loans. In this study, we have proposed a novel approach: Multi-STAge Clustered (M-STAC) Predictions that provide a systematic procedure for managing external factors acquired from satellite sensors such as Terra MODIS (Moderate Resolution Imaging Spectroradiometer) for crop yield prediction by taking into consideration a naive prediction from Long Short-Term Memory (LSTM). The study provides insight into the advantages of the M-STAC Prediction model that captures the relevant patterns in the dataset to predict the target with enhanced skill, for instance, soybean yield prediction from LSTM has an accuracy of Normalized Mean Square Error (NMSE) 30%, and Symmetric Mean Absolute Error (SMAPE) 23.05% on test data for district level predictions, while M-STAC refined predictions has an accuracy of NMSE 25% and SMAPE 19.75%. Whereas, groundnut illustrates an initial accuracy of NMSE 9.14% and SMAPE 12.84% from the naive prediction, while after refinement its accuracy is NMSE 6.46% and SMAPE 8.79%.
- 24 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 245-250
Open AccessEnhancing Crop Yield Prediction Skill through Multi-Stage Clustered Prediction: A Novel Approach for Spatiotemporal Data
Predicting crop yield is of immense value in governing several agricultural endeavours. However, the substantially limited historical yield records, coupled with the multi-directional property of the spatiotemporal yield data, pose a significant challenge. Moreover, a lack of awareness among farmers lead to misinterpretation of yield prediction, which results in a formidable challenge for the farmers to fulfill the obligations associated with their financial loans. In this study, we have proposed a novel approach: Multi-STAge Clustered (M-STAC) Predictions that provide a systematic procedure for managing external factors acquired from satellite sensors such as Terra MODIS (Moderate Resolution Imaging Spectroradiometer) for crop yield prediction by taking into consideration a naive prediction from Long Short-Term Memory (LSTM). The study provides insight into the advantages of the M-STAC Prediction model that captures the relevant patterns in the dataset to predict the target with enhanced skill, for instance, soybean yield prediction from LSTM has an accuracy of Normalized Mean Square Error (NMSE) 30%, and Symmetric Mean Absolute Error (SMAPE) 23.05% on test data for district level predictions, while M-STAC refined predictions has an accuracy of NMSE 25% and SMAPE 19.75%. Whereas, groundnut illustrates an initial accuracy of NMSE 9.14% and SMAPE 12.84% from the naive prediction, while after refinement its accuracy is NMSE 6.46% and SMAPE 8.79%.
- 15 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 73 (00189456) , 1-15
Probabilistic Adaptive Slow Feature Analysis for State Estimation and Classification
Slow feature analysis (SFA), as a method for learning slowly varying features in classification and signal analysis, has attracted increasing attention in recent years. It is guaranteed to find the optimal solution within a family of transformations and can learn to extract a large number of such “slow” features that are additionally orthogonal. While being effective, SFA suffers from three major shortcomings. Firstly, it is not adaptive, in that the notion of “slowness” is fixed to be the average of the squared derivative of a signal. Secondly, its formulation assumes deterministic features/observations, which renders it ineffective for applications involving stochastic features/measurement uncertainties. Thirdly, SFA is not necessarily suited for non-linear processes. In this work, all these issues are addressed by proposing Adaptive SFA and its probabilistic version, termed the ASFA and Probabilistic ASFA (PASFA), respectively. The ASFA essentially introduces an optimally tunable filter that accommodates task-dependent slowness. We provide guidelines and a procedure for tuning the ASFA filter for a given application. We prove that linear SFA is a special case of ASFA for a specific choice of filter and demonstrate that it outperforms the standard SFA. PASFA extends ASFA to accommodate measurement and process noises, wherein the features are modeled as filtered Gaussian white noise (GWN) sequences, and the measurement noise is assumed to be GWN. Further, it accommodates non-linear generative models. A variational expectation-maximization (EM) algorithm is used for estimating the filter parameters and the statistical properties of noise sequences. Frequency-domain interpretations of ASFA are also provided to enhance interpretability. Case studies involving applications to signal analysis and classification are presented to demonstrate the effectiveness and superiority of the proposed methods.
- 15 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 73 (00189456) , 1-15
Probabilistic Adaptive Slow Feature Analysis for State Estimation and Classification
Slow feature analysis (SFA), as a method for learning slowly varying features in classification and signal analysis, has attracted increasing attention in recent years. It is guaranteed to find the optimal solution within a family of transformations and can learn to extract a large number of such “slow” features that are additionally orthogonal. While being effective, SFA suffers from three major shortcomings. Firstly, it is not adaptive, in that the notion of “slowness” is fixed to be the average of the squared derivative of a signal. Secondly, its formulation assumes deterministic features/observations, which renders it ineffective for applications involving stochastic features/measurement uncertainties. Thirdly, SFA is not necessarily suited for non-linear processes. In this work, all these issues are addressed by proposing Adaptive SFA and its probabilistic version, termed the ASFA and Probabilistic ASFA (PASFA), respectively. The ASFA essentially introduces an optimally tunable filter that accommodates task-dependent slowness. We provide guidelines and a procedure for tuning the ASFA filter for a given application. We prove that linear SFA is a special case of ASFA for a specific choice of filter and demonstrate that it outperforms the standard SFA. PASFA extends ASFA to accommodate measurement and process noises, wherein the features are modeled as filtered Gaussian white noise (GWN) sequences, and the measurement noise is assumed to be GWN. Further, it accommodates non-linear generative models. A variational expectation-maximization (EM) algorithm is used for estimating the filter parameters and the statistical properties of noise sequences. Frequency-domain interpretations of ASFA are also provided to enhance interpretability. Case studies involving applications to signal analysis and classification are presented to demonstrate the effectiveness and superiority of the proposed methods.