Shujie Ma
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Shujie Ma has a total of 74 co-authors. Here are the top co-authors by number of shared publications:
Ke Huang
Department of Statistics, University of California, Riverside, Riverside 92521, CA, U.S.A.
5 shared publications- Mingming Liu
Department of Statistics University of California Riverside
5 shared publications - Chih-Ling Tsai
University of California
4 shared publications - Raymond J. Carroll
Department of Statistics, College of Science, Texas A & M University, College Station, TX 77843, USA
4 shared publications - Hua Liang
Department of Statistics, George Washington University, Washington DC, USA
3 shared publications - Liangjun Su
Tsinghua University
3 shared publications
Latest Publications
- 24 October 2026
- Published by Elsevier in Computational Statistics & Data Analysis
- Vol. 227
A joint modeling approach to treatment effects estimation with unmeasured confounders in clustered data
- 24 October 2026
- Published by Elsevier in Computational Statistics & Data Analysis
- Vol. 227
A joint modeling approach to treatment effects estimation with unmeasured confounders in clustered data
- Open Access
- 14 September 2026
- Published by Taylor & Francis in Annals of the American Association of Geographers
- p. 1-19
Linking COPD Prevalence with Income Distribution: A Spatial Heterogeneous Compositional Regression via Geographically Weighted Penalized Approach
Income inequality is a well-recognized driver of health disparities, with its effects often varying across geographic regions (Subramanian and Kawachi 2004). These disparities are often represented...
- 14 September 2026
- Published by Taylor & Francis in Annals of the American Association of Geographers
- p. 1-19
Open AccessLinking COPD Prevalence with Income Distribution: A Spatial Heterogeneous Compositional Regression via Geographically Weighted Penalized Approach
Income inequality is a well-recognized driver of health disparities, with its effects often varying across geographic regions (Subramanian and Kawachi 2004). These disparities are often represented...
- 12 April 2026
- Published by Elsevier in Respiratory Physiology & Neurobiology
- Vol. 342, 104572
A machine learning approach to predicting dyspnea with noninvasive biomarkers
- 12 April 2026
- Published by Elsevier in Respiratory Physiology & Neurobiology
- Vol. 342, 104572
A machine learning approach to predicting dyspnea with noninvasive biomarkers
- 18 March 2025
- Published by MIT Press in Neural Computation
- Vol. 37 (4) , 815-870
Nearly Optimal Learning Using Sparse Deep ReLU Networks in Regularized Empirical Risk Minimization With Lipschitz Loss
We propose a sparse deep ReLU network (SDRN) estimator of the regression function obtained from regularized empirical risk minimization with a Lipschitz loss function. Our framework can be applied to a variety of regression and classification problems. We establish novel nonasymptotic excess risk bounds for our SDRN estimator when the regression function belongs to a Sobolev space with mixed derivatives. We obtain a new, nearly optimal, risk rate in the sense that the SDRN estimator can achieve nearly the same optimal minimax convergence rate as one-dimensional nonparametric regression with the dimension involved in a logarithm term only when the feature dimension is fixed. The estimator has a slightly slower rate when the dimension grows with the sample size. We show that the depth of the SDRN estimator grows with the sample size in logarithmic order, and the total number of nodes and weights grows in polynomial order of the sample size to have the nearly optimal risk rate. The proposed SDRN can go deeper with fewer parameters to well estimate the regression and overcome the overfitting problem encountered by conventional feedforward neural networks.
- 18 March 2025
- Published by MIT Press in Neural Computation
- Vol. 37 (4) , 815-870
Nearly Optimal Learning Using Sparse Deep ReLU Networks in Regularized Empirical Risk Minimization With Lipschitz Loss
We propose a sparse deep ReLU network (SDRN) estimator of the regression function obtained from regularized empirical risk minimization with a Lipschitz loss function. Our framework can be applied to a variety of regression and classification problems. We establish novel nonasymptotic excess risk bounds for our SDRN estimator when the regression function belongs to a Sobolev space with mixed derivatives. We obtain a new, nearly optimal, risk rate in the sense that the SDRN estimator can achieve nearly the same optimal minimax convergence rate as one-dimensional nonparametric regression with the dimension involved in a logarithm term only when the feature dimension is fixed. The estimator has a slightly slower rate when the dimension grows with the sample size. We show that the depth of the SDRN estimator grows with the sample size in logarithmic order, and the total number of nodes and weights grows in polynomial order of the sample size to have the nearly optimal risk rate. The proposed SDRN can go deeper with fewer parameters to well estimate the regression and overcome the overfitting problem encountered by conventional feedforward neural networks.
- 19 November 2024
- Published by Elsevier in Neurocomputing
- Vol. 616
Generalization and risk bounds for recurrent neural networks
- 19 November 2024
- Published by Elsevier in Neurocomputing
- Vol. 616
Generalization and risk bounds for recurrent neural networks
- Open Access
Generalization and Risk Bounds for Recurrent Neural Networks
Recurrent Neural Networks (RNNs) have achieved great success in the prediction of sequential data. However, their theoretical studies are still lagging behind because of their complex interconnected structures. In this paper, we establish a new generalization error bound for vanilla RNNs, and provide a unified framework to calculate the Rademacher complexity that can be applied to a variety of loss functions. When the ramp loss is used, we show that our bound is tighter than the existing bounds based on the same assumptions on the Frobenius and spectral norms of the weight matrices and a few mild conditions. Our numerical results show that our new generalization bound is the tightest among all existing bounds in three public datasets. Our bound improves the second tightest one by an average percentage of 13.80% and 3.01% when the $\tanh$ and ReLU activation functions are used, respectively. Moreover, we derive a sharp estimation error bound for RNN-based estimators obtained through empirical risk minimization (ERM) in multi-class classification problems when the loss function satisfies a Bernstein condition.Open AccessGeneralization and Risk Bounds for Recurrent Neural Networks
Recurrent Neural Networks (RNNs) have achieved great success in the prediction of sequential data. However, their theoretical studies are still lagging behind because of their complex interconnected structures. In this paper, we establish a new generalization error bound for vanilla RNNs, and provide a unified framework to calculate the Rademacher complexity that can be applied to a variety of loss functions. When the ramp loss is used, we show that our bound is tighter than the existing bounds based on the same assumptions on the Frobenius and spectral norms of the weight matrices and a few mild conditions. Our numerical results show that our new generalization bound is the tightest among all existing bounds in three public datasets. Our bound improves the second tightest one by an average percentage of 13.80% and 3.01% when the $\tanh$ and ReLU activation functions are used, respectively. Moreover, we derive a sharp estimation error bound for RNN-based estimators obtained through empirical risk minimization (ERM) in multi-class classification problems when the loss function satisfies a Bernstein condition. - 25 June 2024
- Published by Springer Nature
- p. 289-309
A Selective Overview of Fusion Penalized Learning in Latent Subgroup Analysis for Precision Medicine
- 25 June 2024
- Published by Springer Nature
- p. 289-309
A Selective Overview of Fusion Penalized Learning in Latent Subgroup Analysis for Precision Medicine
- Open Access
- 24 April 2024
- Published by Taylor & Francis in Journal of the American Statistical Association
- Vol. 120 (549) , 343-355
Statistical Inference For Noisy Matrix Completion Incorporating Auxiliary Information
- 24 April 2024
- Published by Taylor & Francis in Journal of the American Statistical Association
- Vol. 120 (549) , 343-355
Open AccessStatistical Inference For Noisy Matrix Completion Incorporating Auxiliary Information
- Open Access
Statistical Inference For Noisy Matrix Completion Incorporating Auxiliary Information
This paper investigates statistical inference for noisy matrix completion in a semi-supervised model when auxiliary covariates are available. The model consists of two parts. One part is a low-rank matrix induced by unobserved latent factors; the other part models the effects of the observed covariates through a coefficient matrix which is composed of high-dimensional column vectors. We model the observational pattern of the responses through a logistic regression of the covariates, and allow its probability to go to zero as the sample size increases. We apply an iterative least squares (LS) estimation approach in our considered context. The iterative LS methods in general enjoy a low computational cost, but deriving the statistical properties of the resulting estimators is a challenging task. We show that our method only needs a few iterations, and the resulting entry-wise estimators of the low-rank matrix and the coefficient matrix are guaranteed to have asymptotic normal distributions. As a result, individual inference can be conducted for each entry of the unknown matrices. We also propose a simultaneous testing procedure with multiplier bootstrap for the high-dimensional coefficient matrix. This simultaneous inferential tool can help us further investigate the effects of covariates for the prediction of missing entries.
Open AccessStatistical Inference For Noisy Matrix Completion Incorporating Auxiliary Information
This paper investigates statistical inference for noisy matrix completion in a semi-supervised model when auxiliary covariates are available. The model consists of two parts. One part is a low-rank matrix induced by unobserved latent factors; the other part models the effects of the observed covariates through a coefficient matrix which is composed of high-dimensional column vectors. We model the observational pattern of the responses through a logistic regression of the covariates, and allow its probability to go to zero as the sample size increases. We apply an iterative least squares (LS) estimation approach in our considered context. The iterative LS methods in general enjoy a low computational cost, but deriving the statistical properties of the resulting estimators is a challenging task. We show that our method only needs a few iterations, and the resulting entry-wise estimators of the low-rank matrix and the coefficient matrix are guaranteed to have asymptotic normal distributions. As a result, individual inference can be conducted for each entry of the unknown matrices. We also propose a simultaneous testing procedure with multiplier bootstrap for the high-dimensional coefficient matrix. This simultaneous inferential tool can help us further investigate the effects of covariates for the prediction of missing entries.