# Hopping between distant basins

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

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 11 Aug 2021.

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

- [Proximal basin hopping: global optimization with guarantees](https://mlsanity.com/paper/2605.18364/) (2026)

## Abstract (arXiv)

We present the Basin Hopping with Skipping (BH-S) algorithm for stochastic optimisation, which replaces the perturbation step of basin hopping (BH) with a so-called skipping proposal from the rare-event sampling literature. Empirical results on benchmark optimisation surfaces demonstrate that BH-S can improve performance relative to BH by encouraging non-local exploration, that is, by hopping between distant basins.