Suvra Pal
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
Research Subjects
Suvra Pal has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
Wisdom Aselisewine
Department of Mathematics, University of Texas at Arlington, Arlington, USA
8 shared publicationsSouvik Roy
Department of Mathematics University of Texas at Arlington Arlington Texas USA
6 shared publications- Souvik Roy
Department of Mathematics, University of Texas at Arlington, Arlington, USA
4 shared publications Jodi Treszoks
Department of Mathematics, University of Texas at Arlington, Arlington, USA
3 shared publicationsN. Balakrishnan
McMaster University
3 shared publicationsSandip Barui
Quantitative Methods and Operations Management Area, Indian Institute of Management Kozhikode, Kozhikode, KL, India
3 shared publications
Latest Publications
- Open Access
- 12 July 2026
- Published by Wiley in Statistica Neerlandica
- Vol. 80 (3)
A sequential quadratic Hamiltonian‐based estimation method for Box‐Cox transformation cure model
We propose an enhanced estimation method for the Box‐Cox transformation (BCT) cure rate model parameters by introducing a generic maximum likelihood estimation algorithm, the sequential quadratic Hamiltonian (SQH) scheme, which is based on a gradient‐free approach. We apply the SQH algorithm to the BCT cure model and, through an extensive simulation study, compare its model fitting results with those obtained using the recently developed nonlinear conjugate gradient (NCG) algorithm. Since the NCG method has already been shown to outperform the well‐known expectation maximization (EM) algorithm, our focus is on demonstrating the superiority of the SQH algorithm over NCG. First, we show that the SQH algorithm produces estimates with smaller bias and root mean square error for all BCT cure model parameters, resulting in more accurate and precise cure rate estimates. We then demonstrate that, being gradient‐free, the SQH algorithm requires less CPU time to generate estimates compared to the NCG algorithm, which only computes the gradient and not the Hessian. These advantages indicate that the SQH algorithm performs favorably compared with the NCG method for estimation in the BCT cure model. Finally, we apply the SQH algorithm to analyze a well‐known melanoma dataset and present the results.
- 12 July 2026
- Published by Wiley in Statistica Neerlandica
- Vol. 80 (3)
Open AccessA sequential quadratic Hamiltonian‐based estimation method for Box‐Cox transformation cure model
We propose an enhanced estimation method for the Box‐Cox transformation (BCT) cure rate model parameters by introducing a generic maximum likelihood estimation algorithm, the sequential quadratic Hamiltonian (SQH) scheme, which is based on a gradient‐free approach. We apply the SQH algorithm to the BCT cure model and, through an extensive simulation study, compare its model fitting results with those obtained using the recently developed nonlinear conjugate gradient (NCG) algorithm. Since the NCG method has already been shown to outperform the well‐known expectation maximization (EM) algorithm, our focus is on demonstrating the superiority of the SQH algorithm over NCG. First, we show that the SQH algorithm produces estimates with smaller bias and root mean square error for all BCT cure model parameters, resulting in more accurate and precise cure rate estimates. We then demonstrate that, being gradient‐free, the SQH algorithm requires less CPU time to generate estimates compared to the NCG algorithm, which only computes the gradient and not the Hessian. These advantages indicate that the SQH algorithm performs favorably compared with the NCG method for estimation in the BCT cure model. Finally, we apply the SQH algorithm to analyze a well‐known melanoma dataset and present the results.
- 8 April 2026
- Published by Taylor & Francis in Communications in Statistics - Simulation and Computation
- p. 1-15
A new estimation algorithm for destructive cure model: illustration with exponentially weighted Poisson competing risks
1. Advancements in the treatment of diseases such as cancer and heart disease have resulted in a significant number of patients showing no signs of recurrence by the end of a prolonged follow-up pe...
- 8 April 2026
- Published by Taylor & Francis in Communications in Statistics - Simulation and Computation
- p. 1-15
A new estimation algorithm for destructive cure model: illustration with exponentially weighted Poisson competing risks
1. Advancements in the treatment of diseases such as cancer and heart disease have resulted in a significant number of patients showing no signs of recurrence by the end of a prolonged follow-up pe...
- Open Access
- 16 January 2026
- Published by Springer Nature in Statistics and Computing
- Vol. 36 (2) , 63
A Support vector machine-based mixture cure model for mixed case interval censored data
We propose a semi-parametric two-component model for the analysis of mixed case interval censored (MCIC) data with a cured subgroup. Such data occurs when the time to an event of interest is only known to belong to an interval obtained from a sequence of, say, k random examination time points with k representing an integer. Furthermore, there is a proportion of subjects who would never be susceptible to the event. The first component of the proposed model describes the probability of cure, and it replaces the traditional generalized linear model with a more flexible support vector machine (SVM)-based approach capable of capturing complex covariate effects. The second component of the proposed model describes the survival distribution of the uncured and is modeled using a Cox proportional hazards structure to preserve the easy interpretation of covariate effects. To the best of our knowledge, this is the first work that employs a machine learning algorithm to analyze MCIC data in the presence of a cured subgroup. To estimate the model parameters, we develop an expectation maximization algorithm. A detailed simulation study demonstrates the superiority of the proposed SVM-based model. Finally, we analyze NASA’s Hypobaric Decompression Sickness Data using the proposed approach.
- 16 January 2026
- Published by Springer Nature in Statistics and Computing
- Vol. 36 (2) , 63
Open AccessA Support vector machine-based mixture cure model for mixed case interval censored data
We propose a semi-parametric two-component model for the analysis of mixed case interval censored (MCIC) data with a cured subgroup. Such data occurs when the time to an event of interest is only known to belong to an interval obtained from a sequence of, say, k random examination time points with k representing an integer. Furthermore, there is a proportion of subjects who would never be susceptible to the event. The first component of the proposed model describes the probability of cure, and it replaces the traditional generalized linear model with a more flexible support vector machine (SVM)-based approach capable of capturing complex covariate effects. The second component of the proposed model describes the survival distribution of the uncured and is modeled using a Cox proportional hazards structure to preserve the easy interpretation of covariate effects. To the best of our knowledge, this is the first work that employs a machine learning algorithm to analyze MCIC data in the presence of a cured subgroup. To estimate the model parameters, we develop an expectation maximization algorithm. A detailed simulation study demonstrates the superiority of the proposed SVM-based model. Finally, we analyze NASA’s Hypobaric Decompression Sickness Data using the proposed approach.
- Open Access
- 14 November 2025
- Published by IOP Publishing in Inverse Problems
- Vol. 41 (11) , 115011
A PINN-driven game-theoretic framework in limited data photoacoustic tomography
This paper presents a novel methodological framework to obtain superior reconstructions in limited data photoacoustic tomography. The proposed framework exploits the presence of Cauchy data on an accessible part of the observation domain and uses a Nash game-theoretic framework to complete the missing data on the inaccessible region. To solve the game-theoretic problem, a gradient-free sequential quadratic Hamiltonian scheme, which is based on Pontryagin’s maximum principle characterization, is combined with physics-informed neural networks to obtain the initial guess, leading to a robust and accurate reconstruction scheme. Numerical simulations with various phantoms, choice of accessible observation domains, and noise, demonstrate the effectiveness of our proposed framework to obtain high contrast and resolution reconstructions.
- 14 November 2025
- Published by IOP Publishing in Inverse Problems
- Vol. 41 (11) , 115011
Open AccessA PINN-driven game-theoretic framework in limited data photoacoustic tomography
This paper presents a novel methodological framework to obtain superior reconstructions in limited data photoacoustic tomography. The proposed framework exploits the presence of Cauchy data on an accessible part of the observation domain and uses a Nash game-theoretic framework to complete the missing data on the inaccessible region. To solve the game-theoretic problem, a gradient-free sequential quadratic Hamiltonian scheme, which is based on Pontryagin’s maximum principle characterization, is combined with physics-informed neural networks to obtain the initial guess, leading to a robust and accurate reconstruction scheme. Numerical simulations with various phantoms, choice of accessible observation domains, and noise, demonstrate the effectiveness of our proposed framework to obtain high contrast and resolution reconstructions.
- 6 October 2025
- Published by Springer Nature in AStA Advances in Statistical Analysis
- Vol. 110 (2) , 265-288
Machine learning approach for analyzing mixed case interval censored data with a cured subgroup
We introduce a novel two-component framework for analyzing mixed case interval censored (MCIC) data featuring a cured subgroup. In such data, the time-to-event is known only within certain intervals determined by multiple random examination time points. Moreover, a portion of the subjects will never experience the event. The first component of our model focuses on estimating the likelihood of being cured (incidence), departing from the conventional generalized linear model to adopt a more adaptable support vector machine (SVM) approach capable of accommodating complex or non-linear covariate effects. The second component addresses the survival distribution of the uncured individuals (latency) and employs a Cox proportional hazards structure to maintain the straightforward interpretation of covariate effects. We develop an expectation maximization algorithm, incorporating the Platt scaling method, to estimate the probability of being cured. Our simulation study demonstrates that our model outperforms both logit-based and spline-based models in capturing complex classification boundaries, leading to more accurate estimates of cured/uncured probabilities and enhanced predictive accuracy for cure. We emphasize that enhancing the estimation accuracy regarding incidence subsequently improves the estimation outcomes concerning latency. Finally, we illustrate the efficacy of our methodology by applying it to the NASA’s hypobaric decompression sickness data.
- 6 October 2025
- Published by Springer Nature in AStA Advances in Statistical Analysis
- Vol. 110 (2) , 265-288
Machine learning approach for analyzing mixed case interval censored data with a cured subgroup
We introduce a novel two-component framework for analyzing mixed case interval censored (MCIC) data featuring a cured subgroup. In such data, the time-to-event is known only within certain intervals determined by multiple random examination time points. Moreover, a portion of the subjects will never experience the event. The first component of our model focuses on estimating the likelihood of being cured (incidence), departing from the conventional generalized linear model to adopt a more adaptable support vector machine (SVM) approach capable of accommodating complex or non-linear covariate effects. The second component addresses the survival distribution of the uncured individuals (latency) and employs a Cox proportional hazards structure to maintain the straightforward interpretation of covariate effects. We develop an expectation maximization algorithm, incorporating the Platt scaling method, to estimate the probability of being cured. Our simulation study demonstrates that our model outperforms both logit-based and spline-based models in capturing complex classification boundaries, leading to more accurate estimates of cured/uncured probabilities and enhanced predictive accuracy for cure. We emphasize that enhancing the estimation accuracy regarding incidence subsequently improves the estimation outcomes concerning latency. Finally, we illustrate the efficacy of our methodology by applying it to the NASA’s hypobaric decompression sickness data.
- 22 June 2025
- Published by Springer Nature in Statistics and Computing
- Vol. 35 (5)
A Neural Network Integrated Accelerated Failure Time-Based Mixture Cure Model
The mixture cure rate model (MCM) is commonly used for analyzing survival data with a cured subgroup. While the prevailing approach to modeling the probability of cure involves a generalized linear model using a known parametric link function, such as the logit link function, it has limitations in capturing the complex effects of covariates on cure probability. This paper introduces a novel MCM employing a neural network-based classifier for cure probability and an accelerated failure time structure for the survival distribution of uncured patients. An expectation maximization algorithm is developed for parameter estimation. Simulation results demonstrate the superior performance of the proposed model in capturing non-linear classification boundaries compared to logit-based and spline-based MCMs, as well as other machine learning algorithms. This enhances the accuracy and precision of cured probability estimates, improving predictive accuracy. The proposed model and estimation method are applied to survival data on leukemia cancer patients, showcasing their effectiveness.
- 22 June 2025
- Published by Springer Nature in Statistics and Computing
- Vol. 35 (5)
A Neural Network Integrated Accelerated Failure Time-Based Mixture Cure Model
The mixture cure rate model (MCM) is commonly used for analyzing survival data with a cured subgroup. While the prevailing approach to modeling the probability of cure involves a generalized linear model using a known parametric link function, such as the logit link function, it has limitations in capturing the complex effects of covariates on cure probability. This paper introduces a novel MCM employing a neural network-based classifier for cure probability and an accelerated failure time structure for the survival distribution of uncured patients. An expectation maximization algorithm is developed for parameter estimation. Simulation results demonstrate the superior performance of the proposed model in capturing non-linear classification boundaries compared to logit-based and spline-based MCMs, as well as other machine learning algorithms. This enhances the accuracy and precision of cured probability estimates, improving predictive accuracy. The proposed model and estimation method are applied to survival data on leukemia cancer patients, showcasing their effectiveness.
- 20 June 2025
- Published by Springer Nature
- p. 591-594
Cure Rate Models
- Open Access
A Sequential Quadratic Hamiltonian-Based Estimation Method for Box-Cox Transformation Cure Model
We propose an enhanced estimation method for the Box-Cox transformation (BCT) cure rate model parameters by introducing a generic maximum likelihood estimation algorithm, the sequential quadratic Hamiltonian (SQH) scheme, which is based on a gradient-free approach. We apply the SQH algorithm to the BCT cure model and, through an extensive simulation study, compare its model fitting results with those obtained using the recently developed non-linear conjugate gradient (NCG) algorithm. Since the NCG method has already been shown to outperform the well-known expectation maximization algorithm, our focus is on demonstrating the superiority of the SQH algorithm over NCG. First, we show that the SQH algorithm produces estimates with smaller bias and root mean square error for all BCT cure model parameters, resulting in more accurate and precise cure rate estimates. We then demonstrate that, being gradient-free, the SQH algorithm requires less CPU time to generate estimates compared to the NCG algorithm, which only computes the gradient and not the Hessian. These advantages make the SQH algorithm the preferred estimation method over the NCG method for the BCT cure model. Finally, we apply the SQH algorithm to analyze a well-known melanoma dataset and present the results.
Open AccessA Sequential Quadratic Hamiltonian-Based Estimation Method for Box-Cox Transformation Cure Model
We propose an enhanced estimation method for the Box-Cox transformation (BCT) cure rate model parameters by introducing a generic maximum likelihood estimation algorithm, the sequential quadratic Hamiltonian (SQH) scheme, which is based on a gradient-free approach. We apply the SQH algorithm to the BCT cure model and, through an extensive simulation study, compare its model fitting results with those obtained using the recently developed non-linear conjugate gradient (NCG) algorithm. Since the NCG method has already been shown to outperform the well-known expectation maximization algorithm, our focus is on demonstrating the superiority of the SQH algorithm over NCG. First, we show that the SQH algorithm produces estimates with smaller bias and root mean square error for all BCT cure model parameters, resulting in more accurate and precise cure rate estimates. We then demonstrate that, being gradient-free, the SQH algorithm requires less CPU time to generate estimates compared to the NCG algorithm, which only computes the gradient and not the Hessian. These advantages make the SQH algorithm the preferred estimation method over the NCG method for the BCT cure model. Finally, we apply the SQH algorithm to analyze a well-known melanoma dataset and present the results.
- 23 October 2024
- Published by Taylor & Francis in Journal of Applied Statistics
- Vol. 52 (6) , 1177-1194
A semiparametric accelerated failure time-based mixture cure tree
The mixture cure rate model (MCM) is the most widely used model for the analysis of survival data with a cured subgroup. In this context, the most common strategy to model the cure probability is to assume a generalized linear model with a known link function, such as the logit link function. However, the logit model can only capture simple effects of covariates on the cure probability. In this article, we propose a new MCM where the cure probability is modeled using a decision tree-based classifier and the survival distribution of the uncured is modeled using an accelerated failure time structure. To estimate the model parameters, we develop an expectation maximization algorithm. Our simulation study shows that the proposed model performs better in capturing nonlinear classification boundaries when compared to the logit-based MCM and the spline-based MCM. This results in more accurate and precise estimates of the cured probabilities, which in-turn results in improved predictive accuracy of cure. We further show that capturing nonlinear classification boundary also improves the estimation results corresponding to the survival distribution of the uncured subjects. Finally, we apply our proposed model and the EM algorithm to analyze an existing bone marrow transplant data.
- 23 October 2024
- Published by Taylor & Francis in Journal of Applied Statistics
- Vol. 52 (6) , 1177-1194
A semiparametric accelerated failure time-based mixture cure tree
The mixture cure rate model (MCM) is the most widely used model for the analysis of survival data with a cured subgroup. In this context, the most common strategy to model the cure probability is to assume a generalized linear model with a known link function, such as the logit link function. However, the logit model can only capture simple effects of covariates on the cure probability. In this article, we propose a new MCM where the cure probability is modeled using a decision tree-based classifier and the survival distribution of the uncured is modeled using an accelerated failure time structure. To estimate the model parameters, we develop an expectation maximization algorithm. Our simulation study shows that the proposed model performs better in capturing nonlinear classification boundaries when compared to the logit-based MCM and the spline-based MCM. This results in more accurate and precise estimates of the cured probabilities, which in-turn results in improved predictive accuracy of cure. We further show that capturing nonlinear classification boundary also improves the estimation results corresponding to the survival distribution of the uncured subjects. Finally, we apply our proposed model and the EM algorithm to analyze an existing bone marrow transplant data.
- 30 August 2024
- Published by Taylor & Francis in Communications in Statistics - Simulation and Computation
- Vol. 54 (11) , 4780-4797
Likelihood-based inference for semi-parametric transformation cure models with interval censored data
A simple yet effective way of modeling survival data with cure fraction is by considering Box-Cox transformation cure model (BCTM) that unifies mixture and promotion time cure models. In this article, we numerically study the statistical properties of the BCTM when applied to interval censored data. Time-to-events associated with susceptible subjects are modeled through proportional hazards structure that allows for non-homogeneity across subjects, where the baseline hazard function is estimated by distribution-free piecewise linear function with varied degrees of non-parametricity. Due to missing cured statuses for right censored subjects, maximum likelihood estimates of model parameters are obtained by developing an expectation-maximization (EM) algorithm. Under the EM framework, the conditional expectation of the complete data log-likelihood function is maximized by considering all parameters (including the Box-Cox transformation parameter ) simultaneously, in contrast to conventional profile-likelihood technique of estimating . The robustness and accuracy of the model and estimation method are established through a detailed simulation study under various parameter settings, and an analysis of real-life data obtained from a smoking cessation study.- 30 August 2024
- Published by Taylor & Francis in Communications in Statistics - Simulation and Computation
- Vol. 54 (11) , 4780-4797
Likelihood-based inference for semi-parametric transformation cure models with interval censored data
A simple yet effective way of modeling survival data with cure fraction is by considering Box-Cox transformation cure model (BCTM) that unifies mixture and promotion time cure models. In this article, we numerically study the statistical properties of the BCTM when applied to interval censored data. Time-to-events associated with susceptible subjects are modeled through proportional hazards structure that allows for non-homogeneity across subjects, where the baseline hazard function is estimated by distribution-free piecewise linear function with varied degrees of non-parametricity. Due to missing cured statuses for right censored subjects, maximum likelihood estimates of model parameters are obtained by developing an expectation-maximization (EM) algorithm. Under the EM framework, the conditional expectation of the complete data log-likelihood function is maximized by considering all parameters (including the Box-Cox transformation parameter ) simultaneously, in contrast to conventional profile-likelihood technique of estimating . The robustness and accuracy of the model and estimation method are established through a detailed simulation study under various parameter settings, and an analysis of real-life data obtained from a smoking cessation study.