Arif Hassan Zidan

Mr. Arif Hassan Zidan

orcid

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
30 January 2025 in Electronics
Verified
Journal Article
Open access
PDF file
AZArif Hassan Zidan
Arif Hassan Zidan
AJAfrar Jahin
Afrar Jahin
YBYu Bao
Yu Bao
WZWei Zhang
Wei Zhang
Deep learning has become indispensable for identifying hierarchical spatial features (SFs), which are crucial for linking neurological disorders to brain functionality, from functional Magnetic Resonance Imaging (fMRI). Unfortunately, existing methods are constrained by architectures that are either linear or nonlinear, limiting a comprehensive categorization of spatial features. To overcome this limitation, we introduce the Semi-Nonlinear Deep Efficient Reconstruction (SENDER) framework, a novel hybrid approach designed to simultaneously capture both linear and nonlinear spatial features, providing a holistic understanding of brain functionality. In our approach, linear SFs are formed by directly integrating multiple spatial features at shallow layers, whereas nonlinear SFs emerge from combining partial regions of these features, yielding complex patterns at deeper layers. We validated SENDER through extensive qualitative and quantitative evaluations with four state-of-the-art methods. Results demonstrate its superior performance, identifying five reproducible linear SFs and eight reproducible nonlinear SFs.

2 April 2026 in Contemporary Mathematics
Verified
Journal Article
Open access
AZArif Hassan Zidan
Arif Hassan Zidan
AJAfrar Jahin
Afrar Jahin
YBYu Bao
Yu Bao
TLTianming Liu
Tianming Liu
WZWei Zhang
Wei Zhang
While gradient-based optimizers that incorporate randomization often demonstrate superior performance on complex optimizations, the theoretical foundations of this advantage remain underexplored. A central question arises: What role does randomization play in dimension-free, nonsmooth, nonconvex optimization? To address this gap, we examine both the theoretical and empirical impact of permutation randomization within gradient-based optimization frameworks, using it as a representative case to investigate broader implications. From a theoretical perspective, our analysis reveals that permutation randomization disrupts the shrinkage behavior characteristic of gradient-based optimizers, allowing for continued progress toward the global optimum with sufficient iterations. Moreover, we prove that permutation randomization preserves the convergence rate of the underlying optimizer. Empirically, we conduct extensive numerical experiments comparing permutation-randomized optimizers with three baseline methods. These experiments span tasks such as training deep neural networks with stacked architectures and optimizing noisy objective functions. The results not only support our theoretical findings but also demonstrate the practical benefits of permutation randomization. In summary, this work provides both rigorous theoretical justification and compelling empirical evidence for the effectiveness of permutation randomization, establishing a foundation for extending such analyses to broader implications of randomized strategies.

17 May 2025 in arXiv
Verified
Preprint
Open access
PDF file
WZWei Zhang
Wei Zhang
AZArif Hassan Zidan
Arif Hassan Zidan
AJAfrar Jahin
Afrar Jahin
YBYu Bao
Yu Bao
Tianming LiuTianming Liu
Tianming Liu
While gradient-based optimizers that incorporate randomization often showcase superior performance on complex optimization, the theoretical foundations underlying this superiority remain insufficiently understood. A particularly pressing question has emerged: What is the role of randomization in dimension-free nonsmooth nonconvex optimization? To address this gap, we investigate the theoretical and empirical impact of permutation randomization within gradient-based optimization frameworks, using it as a representative case to explore broader implications. From a theoretical perspective, our analyses reveal that permutation randomization disrupts the shrinkage behavior of gradient-based optimizers, facilitating continuous convergence toward the global optimum given a sufficiently large number of iterations. Additionally, we prove that permutation randomization can preserve the convergence rate of the underlying optimizer. On the empirical side, we conduct extensive numerical experiments comparing permutation-randomized optimizer against three baseline methods. These experiments span tasks such as training deep neural networks with stacked architectures and optimizing noisy objective functions. The results not only corroborate our theoretical insights but also highlight the practical benefits of permutation randomization. In summary, this work delivers both rigorous theoretical justification and compelling empirical evidence for the effectiveness of permutation randomization. Our findings and evidence lay a foundation for extending analytics to encompass a wide array of randomization.

17 May 2025 in arXiv
Verified
Preprint
Open access
PDF file
WZWei Zhang
Wei Zhang
AZArif Hassan Zidan
Arif Hassan Zidan
AJAfrar Jahin
Afrar Jahin
YBYu Bao
Yu Bao
Tianming LiuTianming Liu
Tianming Liu
Momentum-based gradients are essential for optimizing advanced machine learning models, as they not only accelerate convergence but also advance optimizers to escape stationary points. While most state-of-the-art momentum techniques utilize lower-order gradients, such as the squared first-order gradient, there has been limited exploration of higher-order gradients, particularly those raised to powers greater than two. In this work, we introduce the concept of high-order momentum, where momentum is constructed using higher-power gradients, with a focus on the third-power of the first-order gradient as a representative case. Our research offers both theoretical and empirical support for this approach. Theoretically, we demonstrate that incorporating third-power gradients can improve the convergence bounds of gradient-based optimizers for both convex and smooth nonconvex problems. Empirically, we validate these findings through extensive experiments across convex, smooth nonconvex, and nonsmooth nonconvex optimization tasks. Across all cases, high-order momentum consistently outperforms conventional low-order momentum methods, showcasing superior performance in various optimization problems.