Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

What is/can be provided on the ppdata webpage? #1

Open
brockho opened this issue Nov 28, 2024 · 4 comments
Open

What is/can be provided on the ppdata webpage? #1

brockho opened this issue Nov 28, 2024 · 4 comments

Comments

@brockho
Copy link
Contributor

brockho commented Nov 28, 2024

Finding the right link in the ppdata archive for displaying an algorithm of interest is difficult in general and only easy if you know the year of publication for the algorithm. One suggestion from today is to provide additional ppdata output for each algorithm (or for a small list of algorithms) for the "larger" test suites (aka bbob, bbob-noisy and bbob-biobj for the time being). Those can then be linked directly on the algorithm lists of the COCO data archive.

Suggestions, to be put here for discussion:

  • 2009/2016 algorithms in background
  • A few (always the same) reference algorithms in the foreground:
    • RS-5-initIn0, IPOP-ACTCMA-ES, BFGS-scipy, NelderDoerr for bbob
    • BFGS, IPOP-ACTCMA-ES for bbob-noisy
    • TPB, NSGA-II-platypus for bbob-biobj
@nikohansen
Copy link
Contributor

nikohansen commented Nov 29, 2024

  • for bbob
    • BFGS-scipy does not evaluate all zeros in the beginning
    • we should rather use 2020/CMA-ES instead of IPOP-ACTCMA-ES? They look very similar anyways.
    • display also 2020/SLSQP-11 (which is 2-3 times faster than BFGS) or instead of BFGS?

@nikohansen
Copy link
Contributor

For selecting a Nelder Mead version: these are our data. We could select the standard (red cross) and additionally one of the two others which are available in 40-D which would not be NELDERDOERR)? Displaying only one of the highly tweaked versions would probably lead to an unrealistic expectation.

@nikohansen
Copy link
Contributor

nikohansen commented Dec 4, 2024

We decided to use adapt-Nelder... as the best compromise between (relatively good) performance and (relatively little) algorithm modifications. Namely, the three factors for expansion, contraction, and shrinking are set depending on the search space dimension like $c \pm b/n$ for some $c, b\in[0.5,2]$ depending on the factor.

@nikohansen
Copy link
Contributor

nikohansen commented Dec 5, 2024

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants