Benchmarking the PSA-CMA-ES
- n the BBOB Noiseless Testbed
Kouhei Nishida, Youhei Akimoto Shinshu University, University of Tsukuba
1
Benchmarking the PSA-CMA-ES on the BBOB Noiseless Testbed Kouhei - - PowerPoint PPT Presentation
1 Benchmarking the PSA-CMA-ES on the BBOB Noiseless Testbed Kouhei Nishida, Youhei Akimoto Shinshu University, University of Tsukuba 2 CMA-ES It maintains a multivariate normal distribution ( m , ) = 2 C Step1 Sample
1
Step1 Sample Step2 Rank Step3 Estimate Step4 Update Step1 Sample Step2 Rank Step3 Estimate Step4 Update Step1 Sample Step2 Rank Step3 Estimate Step4 Update Step1 Sample Step2 Rank Step3 Estimate Step4 Update i.e. the learning rate, the population size
2
: mean vector : step-size : covariance matrix
Step1 Sample Step2 Rank Step3 Estimate Step4 Update
3
4
On multimodal functions and noisy functions, the parameter update has less tendency than on noiseless unimodal functions.
Key Observation
In the parameter space of the sampling distribution…
5
On multimodal functions and noisy functions, the parameter update has less tendency than on noiseless unimodal functions.
Key Observation
Update step
In the parameter space of the sampling distribution…
6
On multimodal functions and noisy functions, the parameter update has less tendency than on noiseless unimodal functions.
Key Observation
In the parameter space of the sampling distribution…
7
On multimodal functions and noisy functions, the parameter update has less tendency than on noiseless unimodal functions.
Key Observation
8
θ
θ +
1 2
θ(t)Δθ(t+1)
1 2
θ(t)Δθ(t+1)∥2]
→ To absorb the effect of…
: cumulation factor : Fisher information matrix under : expectation under a random function
β ℐθ 𝔽[ ⋅ ] θ f(x) = ϵ
λ: population size
9
α : threshold : normalization factor γ(t) ≈ 1 (t ≫ 1)
γ(t+1) ← (1 − β)2γ(t) + β(2 − β)
10
σ*(λ) = c(λ) ⋅ n ⋅ μw(λ) n − 1 + c(λ)2 ⋅ μw(λ)
c(λ) = − ∑λ
i=1 𝔽[𝒪i:λ]
The optimal step-size depends on the population size
After updating the population size…
11
Step1 Sample Step2 Rank Step3 Estimate Step4 Update
A step in the parameter space
p(t+1)
θ
← (1 − β) p(t)
θ
+ β (2 − β) ℐ
1 2
θ(t)Δθ(t+1)
𝔽[∥ℐ
1 2
θ(t)Δθ(t+1)∥2]
λ(t+1) ← λ(t) exp β (γ(t+1) − ∥p(t+1)
θ
∥2 α )
σ(t+1) ← σ*(λ(t+1)) σ*(λ(t)) σ(t+1)
Step1 Sample Step2 Rank Step3 Estimate Step4 Update Step1 Sample Step2 Rank Step3 Estimate Step4 Update
1 2 3 4 5 6
Step1 Sample Step2 Rank Step3 Estimate Step4 Update Step1 Sample Step2 Rank Step3 Estimate Step4 Update
𝒪(m(t), (σ(t))2C(t)) 𝒪(m(t+1), (σ(t+1))2C(t+1))
12
13
14
15
16
17
18
19
20