Dynamic Decoupling of Placid Terminal Attractor-based Gradient Descent Algorithm
<|reference_start|>Dynamic Decoupling of Placid Terminal Attractor-based Gradient Descent Algorithm: Gradient descent (GD) and stochastic gradient descent (SGD) have been widely used in a large number of application domains. Therefore, understanding the dynamics of GD and improving its convergence speed is still of great importance. This paper carefully analyzes the dynamics of GD based on the terminal attractor at different stages of its gradient flow. On the basis of the terminal sliding mode theory and the terminal attractor theory, four adaptive learning rates are designed. Their performances are investigated in light of a detailed theoretical investigation, and the running times of the learning procedures are evaluated and compared. The total times of their learning processes are also studied in detail. To evaluate their effectiveness, various simulation results are investigated on a function approximation problem and an image classification problem.<|reference_end|>
@article{zhao2024dynamic,
    title={Dynamic Decoupling of Placid Terminal Attractor-based Gradient Descent
  Algorithm},
    author={Jinwei Zhao (1), Marco Gori (2), Alessandro Betti (3), Stefano Melacci
  (2), Hongtao Zhang (1), Jiedong Liu (1) and Xinhong Hei (1) ((1) Faculty of
  Computer Science and Engineering, Xi'an University of Technology, Xi'an,
  China (2) Department of Information Engineering and Mathematics, University
  of Siena, Siena, Italy (3) IMT Scuola Alti Studi, Lucca, Italy)},
    journal={arXiv preprint arXiv:2409.06542},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.06542},
    primaryClass={cs.LG}
}