Sökning: "CMA-ES"

Hittade 3 uppsatser innehållade ordet CMA-ES.

1. 1. Using Data-Driven Feasible Region Approximations to Handle Nonlinear Constraints When Applying CMA-ES to the Initial Margin Optimization Problem

   Master-uppsats, KTH/Matematisk statistik

   Författare :Karl Wallström; [2021]
   Nyckelord :Optimization; Initial margin; Evolutionary algorithms; CMA-ES; Support vector machines; Boundary constraint handling; Nonlinear constraints; Repair algorithms; Feasible region approximation; Optimering; Initial margin; Evolutionära algoritmer; CMA-ES; Support vector machines; Hantering av bivillkor; Icke-linjära bivillkor; Reparationsalgoritmer; Approximation av tillåtet område;

   Sammanfattning : The introduction of initial margin requirements for non-cleared OTC derivatives has made it possible to optimize initial margin when considering a network of trading participants. Applying CMA-ES, this thesis has explored a new method to handle the nonlinear constraints present in the initial margin optimization problem. LÄS MER

3. 2. Convergence Properties for Different Null Space Bases When Solving the Initial Margin Optimization Problem Using CMA-ES

   Master-uppsats, KTH/Matematisk statistik

   Författare :Jacob Barnholdt; Filip Carlsson; [2020]
   Nyckelord :Financial mathematics; CMA-ES; Optimization; Initial Margin; Null space representations; Finansiell matematik; CMA-ES; Optimering; Initial Margin; Nollrumsrepresentationer;

   Sammanfattning : This thesis evaluates how the evolutionary algorithm CMA-ES (Covariance Matrix Adaption Evolution Strategy) can be used for optimizing the total initial margin for a network of banks trading bilateral OTC derivatives. The algorithm is a stochastic method for optimization of non-linear and, but not limited to, non-convex functions. LÄS MER

4. 3. Automatic parameter tuning in localization algorithms

   Master-uppsats, Linköpings universitet/Programvara och system

   Författare :Martin Lundberg; [2019]
   Nyckelord :cma-es; covariance matrix adaptation; evolution strategies; bayesian optimization; black box optimization; object localization; 3d localization; bin picking; parameter tuning; algorithm configuration;

   Sammanfattning : Many algorithms today require a number of parameters to be set in order to perform well in a given application. The tuning of these parameters is often difficult and tedious to do manually, especially when the number of parameters is large. It is also unlikely that a human can find the best possible solution for difficult problems. LÄS MER