Sunfu Tan

Sunfu Tan


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
30 July 2024 in Fractal and Fractional
Verified
Journal Article
Open access
PDF file
STSunfu Tan
Sunfu Tan
NZNi Zhang
Ni Zhang
Yi-Fei PuYi-Fei Pu
Yi-Fei Pu
This paper analyses the condition necessary to guarantee no divergence for Caputo’s fractional order gradient descent (C-FOG) algorithm on multivariate functions. C-FOG is self-organizing, computationally efficient, simple, and understandable. It converges faster than the classical gradient-based optimization algorithms and converges to slightly different points when the order of the fractional derivative is different. The additional freedom of the order is very useful in situations where the diversity of convergence is required, and it also allows for more precise convergence. Comparative experiments on a typical poor conditioned function and adversarial sample generation frameworks demonstrate the convergence performance of C-FOG, showing that it outperforms currently popular algorithms in terms of convergence speed, and more excitingly, the diversity of convergence allows it to exhibit stronger and more stable attack capability in adversarial sample generation procedures (The code for experiments is available at: https://github.com/mulertan/self_optimizing/tree/main, accessed on 30 April 2024).

31 January 2023 in Fractal and Fractional
Verified
Journal Article
Open access
PDF file
STSunfu Tan
Sunfu Tan
Yi-Fei PuYi-Fei Pu
Yi-Fei Pu
For this paper, we proposed the fractional category representation vector (FV) based on fractional calculus (FC), of which one-hot label is only the special case when the derivative order is 0. FV can be considered as a distributional representation when negative probability is considered. FVs can be used either as a regularization method or as a distributed category representation. They gain significantly in the generalization of classification models and representability in generative adversarial networks with conditions (C-GANs). In image classification, the linear combinations of FVs correspond to the mixture of images and can be used as an independent variable of the loss function. Our experiments showed that FVs can also be used as space sampling, with fewer dimensions and less computational overhead than normal distributions.

23 May 2023 in Preprints.org
Verified
Preprint
Open access
PDF file
STSunfu Tan
Sunfu Tan
Yi-Fei PuYi-Fei Pu
Yi-Fei Pu
The gradient descent algorithm has become the standard algorithm for computing the extreme values of functions, but for multivariate functions this algorithm is mostly ineffective. This is because the convergence rate of each element is inconsistent in most cases. However, in this paper, we found that the gradient sign is a self-optimizing operator, ensuring that the convergence rate is consistent across all elements. This also explains, from an optimization perspective, the success of the Fast Gradient Sign Method (FGSM) in generating adversarial samples that are indistinguishable from the normal input, but can easily fool neural networks. We also found that the fractional order gradient is also self-optimizing, and that the convergence speed of this algorithm can be controlled by adjusting the order of the gradient. Experiments suggest that this algorithm not only generates adversarial samples faster than other algorithms, but that a single source image can generate many such samples. This algorithm is also more effective than others at generating adversarial samples from simple images.