AdaSwarm: Augmenting Gradient-Based optimizers in Deep Learning with Swarm Intelligence
원문 초록
This paper introduces AdaSwarm, a novel gradient-free optimizer which has similar or even better performance than the Adam optimizer adopted in neural networks. In order to support our proposed AdaSwarm, a novel Exponentially weighted Momentum Particle Swarm Optimizer (EMPSO), is proposed. The ability of AdaSwarm to tackle optimization problems is attributed to its capability to perform good gradient approximations. We show that, the gradient of any function, differentiable or not, can be approximated by using the parameters of EMPSO. This is a novel technique to simulate GD which lies at the boundary between numerical methods and swarm intelligence. Mathematical proofs of the gradient approximation produced are also provided. AdaSwarm competes closely with several state-of-the-art (SOTA) optimizers. We also show that AdaSwarm is able to handle a variety of loss functions during backpropagation, including the maximum absolute error (MAE).
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
StepProof: Step-by-step verification of natural language mathematical proofs
A Theoretical Analysis of Compositional Generalization in Neural Networks: A Necessary and Sufficient Condition
Hierarchical Attention Generates Better Proofs
Distance-Adaptive Quaternion Knowledge Graph Embedding with Bidirectional Rotation
Learning Rules Explaining Interactive Theorem Proving Tactic Prediction
ODGS: 3D Scene Reconstruction from Omnidirectional Images with 3D Gaussian Splattings
토론
이 논문과 연결된 포럼 글이 아직 없습니다.