# BAS: Beetle Antennae Search Algorithm for Optimization Problems

arXiv: https://arxiv.org/abs/1710.10724 · HTML: https://mlsanity.com/paper/1710.10724/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 30 Oct 2017.

## Built on by (most cited first, 3 of 3)

- [On Faster Convergence of Scaled Sign Gradient Descent](https://mlsanity.com/paper/2109.01806/) (2021)
- [A 2020 taxonomy of algorithms inspired on living beings behavior](https://mlsanity.com/paper/2106.04775/) (2021)
- [An Adam-adjusting-antennae BAS Algorithm for Refining Latent Factors](https://mlsanity.com/paper/2208.06603/) (2022)

## Abstract (arXiv)

Meta-heuristic algorithms have become very popular because of powerful performance on the optimization problem. A new algorithm called beetle antennae search algorithm (BAS) is proposed in the paper inspired by the searching behavior of longhorn beetles. The BAS algorithm imitates the function of antennae and the random walking mechanism of beetles in nature, and then two main steps of detecting and searching are implemented. Finally, the algorithm is benchmarked on 2 well-known test functions, in which the numerical results validate the efficacy of the proposed BAS algorithm.