Paradiseo is an open-source full-featured evolutionary computation framework which main purpose is to help you write your own stochastic optimization algorithms, insanely fast.
It focus on the efficiency of the implementation of solvers, by providing:
- a modular design for several types of paradigms,
- the largest codebase of existing components,
- tools for automated design and selection of algorithms,
- a focus on speed and several parallelization options.
- Use a recent Linux, like an Ubuntu.
sudo apt install g++-8 cmake make libeigen3-dev libopenmpi-dev doxygen graphviz libgnuplot-iostream-dev- From the Paradiseo directory:
mkdir build ; cd build ; cmake -D CMAKE_BUILD_TYPE=Release -DEDO=ON .. && make -j - Copy-paste this CMA-ES code in
cmaes.cpp:
#include <eo>
#include <edo>
#include <es.h>
#include <do/make_pop.h>
#include <do/make_run.h>
#include <do/make_continue.h>
#include <do/make_checkpoint.h>
using R = eoReal<eoMinimizingFitness>;
using CMA = edoNormalAdaptive<R>;
R::FitnessType sphere(const R& sol) {
double sum = 0;
for(auto x : sol) { sum += x * x; }
return sum;
}
int main(int argc, char** argv) {
eoParser parser(argc, argv);
eoState state;
size_t dim = parser.createParam<size_t>(10,
"dimension", "Dimension", 'd',
"Problem").value();
size_t max_eval = parser.getORcreateParam<size_t>(100 * dim,
"maxEval", "Maximum number of evaluations", 'E',
"Stopping criterion").value();
edoNormalAdaptive<R> gaussian(dim);
auto& obj_func = state.pack< eoEvalFuncPtr<R> >(sphere);
auto& eval = state.pack< eoEvalCounterThrowException<R> >(obj_func, max_eval);
auto& pop_eval = state.pack< eoPopLoopEval<R> >(eval);
auto& gen = state.pack< eoUniformGenerator<R::AtomType> >(-5, 5);
auto& init = state.pack< eoInitFixedLength<R> >(dim, gen);
auto& pop = do_make_pop(parser, state, init);
pop_eval(pop,pop);
auto& eo_continue = do_make_continue( parser, state, eval);
auto& pop_continue = do_make_checkpoint(parser, state, eval, eo_continue);
auto& best = state.pack< eoBestIndividualStat<R> >();
pop_continue.add( best );
auto& distrib_continue = state.pack< edoContAdaptiveFinite<CMA> >();
auto& selector = state.pack< eoRankMuSelect<R> >(dim/2);
auto& estimator = state.pack< edoEstimatorNormalAdaptive<R> >(gaussian);
auto& bounder = state.pack< edoBounderRng<R> >(R(dim, -5), R(dim, 5), gen);
auto& sampler = state.pack< edoSamplerNormalAdaptive<R> >(bounder);
auto& replacor = state.pack< eoCommaReplacement<R> >();
make_verbose(parser);
make_help(parser);
auto& algo = state.pack< edoAlgoAdaptive<CMA> >(
gaussian , pop_eval, selector,
estimator, sampler , replacor,
pop_continue, distrib_continue);
try {
algo(pop);
} catch (eoMaxEvalException& e) {
eo::log << eo::progress << "STOP" << std::endl;
}
std::cout << best.value() << std::endl;
return 0;
}- Compile it with:
c++ cmaes.cpp -I../eo/src -I../edo/src -DWITH_EIGEN=1 -I/usr/include/eigen3 -std=c++17 -L./lib/ -leo -leoutils -les -o cmaes ./cmaes -h
- Use your system of choice, as soon as you know how to operate a C++ buildchain on it.
- Dependencies are:
libeigen3-dev libopenmpi-dev doxygen graphviz libgnuplot-iostream-dev(or similar packagesnames, depending on your system) - From the Paradiseo directory, within a
builddirectory, call the equivalent ofcmake -D CMAKE_BUILD_TYPE=Release -DEDO=ON .., then call your system's favorite generator (see cmake's documentation for the-Goption). - Code your own algorithm, starting from one of the numerous examples (or tests) available around ParadisEO
(see the source code in
<module>/test/or<module>/tutorial/, or see the website). - Build it, indicating where to include the needed ParadisEO
<module>/src/directories, and thebuild/libdirectory for the library linker.
Paradiseo targets the development of solvers for mathematical optimization problems for which you cannot compute gradients. The classical use case is the automated design or configuration of some system which is simulated.
Paradiseo targets the design of metaheuristics solvers using computational intelligence methods, a subdomain of artificial intelligence.
Learning a full-featured framework like Paradiseo very often seems overkill. However, we would like to stress out that you may forget some points while jumping to this conclusion.
Paradiseo provides the largest mature codebase of state-of-the-art algorithms, and is focused on (automatically) find the most efficient solvers.
The most classical impediment to the use of Paradiseo is that you just want to check if your problem can actually be solved with heuristics. You feel that it would be a loss of time to learn complex stuff if it ends being useless.
However, you should keep in mind that:
- Metaheuristics do seem very easy to implement in textbooks, but the state-of-the art versions of efficient algorithms can be a lot more complex.
- It is usually easy to get something to actually run, but it is far more difficult to get an efficient solver.
- Metaheuristics performances on a given problem are very sensitive to small variations in the parameter setting or the choice of some operators. Which render large experimental plans and algorithm selection compulsory to attain peak efficiency.
Fortunately, Paradiseo have the largest codebase of the market, hardened along 20 years of development of tens of solvers. Additionally, it provides the tools to rapidly search for the best combination of algorithms to solve your problem, even searching for this combination automatically.
Paradiseo is the fastest framework on the market, which is a crucial feature for modern and robust approach to solver design and validation.
Another classical criticism against Paradiseo is that C++ is hard and that a fast language is useless because speed is not a concern when your objective function is dominating all the runtime.
However, we argue that:
- During the design phase of your solver, you will need to estimate its performance against synthetic benchmarks that are fast to compute. In that case, fast computation means fast design iterations. And it's even more true if you plan to use automated design to find the best solver for your problem.
- Modern C++ makes use of the very same high-level abstractions you would find in more accepted languages like Python. Sure, the syntax is cumbersome, but you will not see it after a while, given that you will work at the algorithm level.
- C++ provides full type checking and the largest set of tooling for any modern language, which are your first line of defense against long-term bugs. Sure, it sometimes gives you the impression that you fight against the compiler, but chasing subtle interface bugs across a complex Python code is even harder.
Designing an algorithm with Paradiseo consists in choosing what components (called operators) you want to use for your specific needs, just as building a structure with Lego blocks.
If you have a classical problem for which available code exists (for example if you have a black-box problem with real-valued variables), you will just choose operators to form an algorithm and connect it to your evaluation function (which computes the quality of a given solution).
If your problem is a bit more exotic, you will have to code a class that encodes how solutions to your problem are represented, and perhaps a few more. For instance, you may want ad-hoc variations operators, but most of the other operators (selection, replacement, stopping criteria, command-line interface, etc.) are already available in Paradiseo.
Paradiseo is organized in several modules, either providing different "grammars" for different algorithms, either providing high-level features. All modules follows the same architecture design and are interoperable with the others, so that you can easily choose the subset of features you need.
It is, for instance, easy to start with a simple local search, then add multi-objective capabilities, then shared-memory parallelization, then hybridization with an evolutionary algorithm and finally plug everything in an objective function so as to optimize the parameters with a particle swarm optimizer.
Paradiseo is mainly developed under Linux operating systems, where its dependencies and the C++ toolchain are easy to install. Recent versions have been tested with gcc and clang compilers.
Stable versions should however work on Windows and any Unix-like operating system with a standard-conforming C++ development system.
The latest stable version is on the official Git repository of INRIA: git clone git://scm.gforge.inria.fr/paradiseo/paradiseo.git
In order to build the latest version of Paradiseo, you will need a C++ compiler supporting C++17. So far, GCC and CLANG gave good results under Linux. You will also need the CMake and make build tools.
A free working build chain under Windows seems always difficult to find. Paradiseo 2.0.1 was successfully tested with MinGW (minus the PEO module), but it's unsure if it still work for recent versions. If you managed to build under Windows, your feedback would be appreciated.
Some features are only available if some dependencies are installed:
- Most of the EDO module depends on either uBlas or Eigen3. The recommended package is Eigen3, which enables the adaptive algorithms.
- Doxygen is needed to build the API documentation, and you should also install graphviz if you want the class relationship diagrams.
- GNUplot is needed to have the… GNUplot graphs at checkpoints.
To install all those dependencies at once under Ubuntu (18.04), just type: sudo apt install g++-8 cmake make libeigen3-dev libopenmpi-dev doxygen graphviz libgnuplot-iostream-dev.
The build chain uses the classical workflow of CMake. The recommended method is to build in a specific, separated directory and call cmake .. from here. CMake will prepare the compilation script for your system of choice which you can change with the -G <generator-name> option (see the CMake doc for the list of available generators).
Under Linux, the default is make, and a build command is straitghtforward: mkdir build ; cd build ; cmake .. && make -j.
There is, however, several build options which you may want to switch. To see them, we recommend the use of a CMake gui, like ccmake or cmake-gui . On the command line, you can see the available options with: cmake -LH .. . Those options can be set with the -D<option>=<value> argument to cmake.
The first option to consider is CMAKE_BUILD_TYPE, which you most probably want to set to Debug (during development/tests) or Release (for production/validation).
Other important options are: EDO (which is false by default) and parallelization options: ENABLE_OPENMP, MPI, SMP.
By default, the build script will build the Paradiseo libraries only.
If you ENABLE_CMAKE_TESTING and BUILD_TESTING, it will be the tests, which you can run with the ctest command.
If you ENABLE_CMAKE_EXAMPLE, it will also build the examples.
If may want to make build scripts more verbose (especially when building the
doc) by enabling CMAKE_VERBOSE_MAKEFILE.
Paradiseo is distributed under the GNU Lesser General Public License and the CeCILL license (depending on the modules).
Note that those licenses places copyleft restrictions on a program created with Paradiseo, but does not apply these restrictions to other software that would links with the program.
Paradiseo has a lot of documentation! You will find in the source repository
a lot of examples, the tutorials and you can generate the API documentation
(make doc, then open
paradiseo/<build>/<module>/doc/html/index.html).
Tutorials are located in each module's directory. For example for the EO module:
paradiseo/eo/tutorial.
A lot of examples for (almost) each class are available in the test directories
(e.g. paradiseo/eo/test). Example problems and bindings to external
benchmark libraries are in paradiseo/problems.
For academic articles, books, more tutorials, presentations slides,
real life example of solvers and contact information,
please see the web site (available in paradiseo/website/index.html).
There is also an online wiki
For further information about ParadisEO, help or to report any
problem, you can send an e-mail to: paradiseo-help@lists.gforge.inria.fr