Majnu John
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
Majnu John has a total of 47 co-authors. Here are the top co-authors by number of shared publications:
Yihren Wu
Department of Mathematics, Hofstra University
5 shared publications- Yihren Wu
Mathematics, Hofstra University, Hempstead, US
5 shared publications - John M. Kane
Department of Psychiatry, The Zucker Hillside Hospital, Northwell Health, Glen Oaks, USA
3 shared publications - Todd Lencz
Northwell, New Hyde Park, NY, USA
3 shared publications Anil K Malhotra
Departments of Psychiatry and of Molecular Medicine, Hofstra Northwell School of Medicine, Hempstead, NY
2 shared publicationsChristoph U Correll
Departments of Psychiatry and of Molecular Medicine, Hofstra Northwell School of Medicine, Hempstead, NY
2 shared publications
Latest Publications
- Open Access
Arbitrage-Free Pricing with Diffusion-Dependent Jumps
Standard jump-diffusion models assume independence between jumps and diffusion components. We develop a multi-type jump-diffusion model where jump occurrence and magnitude depend on contemporaneous diffusion movements. Unlike previous one-sided models that create arbitrage opportunities, our framework includes upward and downward jumps triggered by both large upward and large downward diffusion increments. We derive the explicit no-arbitrage condition linking the physical drift to model parameters and market risk premia by constructing an Equivalent Martingale Measure using Girsanov's theorem and a normalized Esscher transform. This condition provides a rigorous foundation for arbitrage-free pricing in models with diffusion-dependent jumps.
Open AccessArbitrage-Free Pricing with Diffusion-Dependent Jumps
Standard jump-diffusion models assume independence between jumps and diffusion components. We develop a multi-type jump-diffusion model where jump occurrence and magnitude depend on contemporaneous diffusion movements. Unlike previous one-sided models that create arbitrage opportunities, our framework includes upward and downward jumps triggered by both large upward and large downward diffusion increments. We derive the explicit no-arbitrage condition linking the physical drift to model parameters and market risk premia by constructing an Equivalent Martingale Measure using Girsanov's theorem and a normalized Esscher transform. This condition provides a rigorous foundation for arbitrage-free pricing in models with diffusion-dependent jumps.
- 4 April 2025
- Published by Elsevier in Schizophrenia Research
- Vol. 279, 79-86
The problem of missing data for learning health systems focused on first-episode psychosis
- 4 April 2025
- Published by Elsevier in Schizophrenia Research
- Vol. 279, 79-86
The problem of missing data for learning health systems focused on first-episode psychosis
- Open Access
Schizophrenia versus Healthy Controls Classification based on fMRI 4D Spatiotemporal Data
A wide array of machine learning approaches have been employed for differentiating patients with mental health disorders from healthy controls using neuroimaging data. However, almost all such methods have been applied on inputs based on connectivity matrices or features derived from the neuroimaging data. Only a few papers recently have considered such classification based on the original voxel-based spatiotemporal data. In this paper, we report the performance of a few cutting edge machine learning algorithms on voxel-based fMRI data to classify healthy controls and patients with schizophrenia. The methods that we employed included convolutional neural networks, convolutional recurrent neural networks with long short-term memory and a transfer learning approach for classification based on Wasserstein generative adversarial networks. In order to reduce the computational burden to fit in with available hardware, we had to reduce the original 4-dimensional data to 3-dimensional inputs for almost all architectures. Our results indicate that the relatively simpler architecture based on convolutional neural networks showed reasonable unambiguity in grouping patients from healthy controls. In contrast, the performance of the other two more complex architectures that we employed were comparatively poorer.
Open AccessSchizophrenia versus Healthy Controls Classification based on fMRI 4D Spatiotemporal Data
A wide array of machine learning approaches have been employed for differentiating patients with mental health disorders from healthy controls using neuroimaging data. However, almost all such methods have been applied on inputs based on connectivity matrices or features derived from the neuroimaging data. Only a few papers recently have considered such classification based on the original voxel-based spatiotemporal data. In this paper, we report the performance of a few cutting edge machine learning algorithms on voxel-based fMRI data to classify healthy controls and patients with schizophrenia. The methods that we employed included convolutional neural networks, convolutional recurrent neural networks with long short-term memory and a transfer learning approach for classification based on Wasserstein generative adversarial networks. In order to reduce the computational burden to fit in with available hardware, we had to reduce the original 4-dimensional data to 3-dimensional inputs for almost all architectures. Our results indicate that the relatively simpler architecture based on convolutional neural networks showed reasonable unambiguity in grouping patients from healthy controls. In contrast, the performance of the other two more complex architectures that we employed were comparatively poorer.
- 20 October 2024
- Published by Elsevier in Schizophrenia Research
- Vol. 274, 307-314
The COMPASS scale for the assessment of individuals with first episode psychotic disorders
- 20 October 2024
- Published by Elsevier in Schizophrenia Research
- Vol. 274, 307-314
The COMPASS scale for the assessment of individuals with first episode psychotic disorders
- 7 August 2024
- Published by Springer Nature in Computational Statistics
- p. 1-26
A novel nonconvex, smooth-at-origin penalty for statistical learning
- 7 August 2024
- Published by Springer Nature in Computational Statistics
- p. 1-26
A novel nonconvex, smooth-at-origin penalty for statistical learning
- Open Access
- 8 November 2023
- Published by Elsevier in Results in Applied Mathematics
- Vol. 20
A simple illustration of interleaved learning using Kalman filter for linear least squares
- 8 November 2023
- Published by Elsevier in Results in Applied Mathematics
- Vol. 20
Open AccessA simple illustration of interleaved learning using Kalman filter for linear least squares
- 4 April 2023
- Published by Taylor & Francis in Communications in Statistics - Theory and Methods
- Vol. 53 (13) , 4819-4840
A few theoretical results for Laplace and arctan penalized ordinary least squares linear regression estimators
Two new non convex penalty functions – Laplace and arctan – were recently introduced in the literature to obtain sparse models for high-dimensional statistical problems. In this article, we study the theoretical properties of Laplace and arctan penalized ordinary least squares linear regression models. We first illustrate the near-unbiasedness of the non zero regression weights obtained by the new penalty functions, in the orthonormal design case. In the general design case, we present theoretical results in two asymptotic settings: (a) the number of features, p fixed, but the sample size, , and (b) both n and p tend to infinity. The theoretical results shed light onto the differences between the solutions based on the new penalty functions and those based on existing convex and non convex Bridge penalty functions. Our theory also shows that both Laplace and arctan penalties satisfy the oracle property. Finally, we also present results from a brief simulations study illustrating the performance of Laplace and arctan penalties based on the gradient descent optimization algorithm.- 4 April 2023
- Published by Taylor & Francis in Communications in Statistics - Theory and Methods
- Vol. 53 (13) , 4819-4840
A few theoretical results for Laplace and arctan penalized ordinary least squares linear regression estimators
Two new non convex penalty functions – Laplace and arctan – were recently introduced in the literature to obtain sparse models for high-dimensional statistical problems. In this article, we study the theoretical properties of Laplace and arctan penalized ordinary least squares linear regression models. We first illustrate the near-unbiasedness of the non zero regression weights obtained by the new penalty functions, in the orthonormal design case. In the general design case, we present theoretical results in two asymptotic settings: (a) the number of features, p fixed, but the sample size, , and (b) both n and p tend to infinity. The theoretical results shed light onto the differences between the solutions based on the new penalty functions and those based on existing convex and non convex Bridge penalty functions. Our theory also shows that both Laplace and arctan penalties satisfy the oracle property. Finally, we also present results from a brief simulations study illustrating the performance of Laplace and arctan penalties based on the gradient descent optimization algorithm.- 3 November 2022
- Published by Walter de Gruyter GmbH in The International Journal of Biostatistics
- Vol. 19 (2) , 417-438
Potential application of elastic nets for shared polygenicity detection with adapted threshold selection
Current research suggests that hundreds to thousands of single nucleotide polymorphisms (SNPs) with small to modest effect sizes contribute to the genetic basis of many disorders, a phenomenon labeled as polygenicity. Additionally, many such disorders demonstrate polygenic overlap, in which risk alleles are shared at associated genetic loci. A simple strategy to detect polygenic overlap between two phenotypes is based on rank-ordering the univariate p -values from two genome-wide association studies (GWASs). Although high-dimensional variable selection strategies such as Lasso and elastic nets have been utilized in other GWAS analysis settings, they are yet to be utilized for detecting shared polygenicity. In this paper, we illustrate how elastic nets, with polygenic scores as the dependent variable and with appropriate adaptation in selecting the penalty parameter, may be utilized for detecting a subset of SNPs involved in shared polygenicity. We provide theory to better understand our approaches, and illustrate their utility using synthetic datasets. Results from extensive simulations are presented comparing the elastic net approaches with the rank ordering approach, in various scenarios. Results from simulations studies exhibit one of the elastic net approaches to be superior when the correlations among the SNPs are high. Finally, we apply the methods on two real datasets to illustrate further the capabilities, limitations and differences among the methods.
- 3 November 2022
- Published by Walter de Gruyter GmbH in The International Journal of Biostatistics
- Vol. 19 (2) , 417-438
Potential application of elastic nets for shared polygenicity detection with adapted threshold selection
Current research suggests that hundreds to thousands of single nucleotide polymorphisms (SNPs) with small to modest effect sizes contribute to the genetic basis of many disorders, a phenomenon labeled as polygenicity. Additionally, many such disorders demonstrate polygenic overlap, in which risk alleles are shared at associated genetic loci. A simple strategy to detect polygenic overlap between two phenotypes is based on rank-ordering the univariate p -values from two genome-wide association studies (GWASs). Although high-dimensional variable selection strategies such as Lasso and elastic nets have been utilized in other GWAS analysis settings, they are yet to be utilized for detecting shared polygenicity. In this paper, we illustrate how elastic nets, with polygenic scores as the dependent variable and with appropriate adaptation in selecting the penalty parameter, may be utilized for detecting a subset of SNPs involved in shared polygenicity. We provide theory to better understand our approaches, and illustrate their utility using synthetic datasets. Results from extensive simulations are presented comparing the elastic net approaches with the rank ordering approach, in various scenarios. Results from simulations studies exhibit one of the elastic net approaches to be superior when the correlations among the SNPs are high. Finally, we apply the methods on two real datasets to illustrate further the capabilities, limitations and differences among the methods.
- Open Access
- 26 October 2022
- Published by Louisiana State University Libraries in Journal of Stochastic Analysis
- Vol. 3 (4) , 5
A Jump-Diffusion Process for Asset Price with Non-Independent Jumps
By Yihren Wu and Majnu John, Published on 12/23/22
- 26 October 2022
- Published by Louisiana State University Libraries in Journal of Stochastic Analysis
- Vol. 3 (4) , 5
Open AccessA Jump-Diffusion Process for Asset Price with Non-Independent Jumps
By Yihren Wu and Majnu John, Published on 12/23/22
- Open Access
- 26 March 2022
- Published by Elsevier in Results in Applied Mathematics
- Vol. 14
On two recent nonconvex penalties for regularization in machine learning
- 26 March 2022
- Published by Elsevier in Results in Applied Mathematics
- Vol. 14
Open AccessOn two recent nonconvex penalties for regularization in machine learning