Tong Su

Mr. Tong Su


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 November 2020 in Entropy
Verified
Journal Article
Open access
PDF file
TSTong Su
Tong Su
YWYafei Wang
Yafei Wang
YLYi Liu
Yi Liu
WBWilliam Branton
William Branton
EAEugene Asahchop
Eugene Asahchop
Niansheng TangNiansheng Tang
Niansheng Tang
Distance weighted discrimination (DWD) is an appealing classification method that is capable of overcoming data piling problems in high-dimensional settings. Especially when various sparsity structures are assumed in these settings, variable selection in multicategory classification poses great challenges. In this paper, we propose a multicategory generalized DWD (MgDWD) method that maintains intrinsic variable group structures during selection using a sparse group lasso penalty. Theoretically, we derive minimizer uniqueness for the penalized MgDWD loss function and consistency properties for the proposed classifier. We further develop an efficient algorithm based on the proximal operator to solve the optimization problem. The performance of MgDWD is evaluated using finite sample simulations and miRNA data from an HIV study.

5 January 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
BYBin Yang
Bin Yang
MCMin Chen
Min Chen
TSTong Su
Tong Su
JZJianjun Zhou
Jianjun Zhou
It is well-known that the traditional functional regression model is mainly based on the least square or likelihood method. These methods usually rely on some strong assumptions, such as error independence and normality, that are not always satisfied. For example, the response variable may contain outliers, and the error term is serially correlated. Violation of assumptions can result in unfavorable influences on model estimation. Therefore, a robust estimation procedure of a semi-functional linear model with autoregressive error is developed to solve this problem. We compare the efficiency of our procedure to the least square method through a simulation study and two real data analyses. The conclusion illustrates that the proposed method outperforms the least square method, providing random errors follow the heavy-tail distribution.

1 January 2025 in AIMS Mathematics
Verified
Journal Article
Open access
PDF file
XDXianwen Ding
Xianwen Ding
TSTong Su
Tong Su
YZYunqi Zhang
Yunqi Zhang
This paper addresses the prediction problem in linear regression models with ultrahigh-dimensional covariates and missing response data. Assuming a missing at random mechanism, we introduced a novel nonparametric multiple imputation method to handle missing response values. Based on these imputed responses, we proposed an efficient iterative model averaging method that integrates an iterative screening process within a model averaging framework. The weights for the candidate models were determined using the Bayesian information criterion, ensuring an optimal balance between model fit and complexity. The computational feasibility of the proposed approach stems from its iterative structure, which significantly reduces the computational burden compared to conventional methods. Under certain regularity conditions, we demonstrated that the proposed method effectively mitigates the risk of overfitting and yields consistent estimators for the regression coefficients. Simulation studies and a real-world data application illustrate the practical efficacy of the proposed approach, showing its superior performance in terms of predictive accuracy and flexibility when compared to several competing approaches.

4 July 2026 in Mathematics
Verified
Journal Article
Open access
PDF file
YZYUNQI ZHANG
YUNQI ZHANG
WCWei Chen
Wei Chen
LZLei Zhao
Lei Zhao
LWliwen wu
liwen wu
TSTong Su
Tong Su
Deepneural networks are highly vulnerable to adversarial examples, which are generated by introducing subtle perturbations to input data to mislead model classification. Currently, transfer-based attacks are prevalent in adversarial example generation and can be categorized into input transformation-based and gradient-based methods. However, most input transformation-based methods tend to produce augmented replicas that are semantically inconsistent with the original inputs, while gradient-based methods often leave low-gradient regions unperturbed within the model’s critical attention areas. These limitations constrain further improvements in adversarial transferability. In this work, we propose a Semantic-Invariance and Low-Gradient Replacement Method (SLRM) to address these challenges. Our framework integrates semantically consistent augmentation and gradient replacement as follows: (1) a feature extractor captures semantic features from original inputs and a reconstructor generates augmented replicas that preserve semantic fidelity to enhance input diversity, and (2) low-gradient regions in adversarial examples are systematically replaced with corresponding regions from augmented replicas to eliminate the under-perturbed areas critical for model robustness. Comprehensive empirical evaluations on ImageNet demonstrate that SLRM significantly enhances the transferability of baseline methods and seamlessly integrates with state-of-the-art approaches to further improve their performance. Moreover, SLRM substantially improves the robustness of baseline methods against defended models, achieving superior attack success rates under advanced adversarial defenses.