@techreport{OPUS4-925,
  title     = {Forschungsbericht 2019 - Fakult{\"a}t f{\"u}r Wirtschafts- und Rechtswissenschaften der Technischen Hochschule K{\"o}ln},
  url       = {http://nbn-resolving.de/urn:nbn:de:hbz:832-cos4-9250},
  pages     = {89},
  abstract  = {Die Fakult{\"a}t f{\"u}r Wirtschafts- und Rechtswissenschaften der Technischen Hochschule K{\"o}ln m{\"o}chte mit diesem Bericht dokumentieren, mit welchen Problemstellungen sich die forschenden Kolleginnen und Kollegen der Fakult{\"a}t im Jahr 2019 auseinander gesetzt haben.},
  language  = {de}
}
@techreport{ChandrasekaranRebolledoBartzBeielstein,
  author    = {Chandrasekaran, Sowmya and Rebolledo, Margarita and Bartz-Beielstein, Thomas},
  title     = {EventDetectR - An Open-Source Event Detection System},
  url       = {http://nbn-resolving.de/urn:nbn:de:hbz:832-cos4-9232},
  abstract  = {EventDetectR: An efficient Event Detection System (EDS) capable of detecting unexpected water quality conditions. This approach uses multiple algorithms to model the relationship between various multivariate water quality signals. Then the residuals of the models were utilized in constructing the event detection algorithm, which provides a continuous measure of the probability of an event at every time step. The proposed framework was tested for water contamination events with industrial data from automated water quality sensors. The results showed that the framework is reliable with better performance and is highly suitable for event detection.},
  language  = {en}
}
@article{RebolledoChandrasekaranBartzBeielstein,
  author    = {Rebolledo, Margarita and Chandrasekaran, Sowmya and Bartz-Beielstein, Thomas},
  title     = {Sensor Placement for Contamination Detection in Water Distribution Systems},
  url       = {http://nbn-resolving.de/urn:nbn:de:hbz:832-cos4-9223},
  abstract  = {Sensor placement for contaminant detection in water distribution systems (WDS) has become a topic of great interest aiming to secure a population's water supply. Several approaches can be found in the literature with differences ranging from the objective selected to optimize to the methods implemented to solve the optimization problem. In this work we aim to give an overview of the current work in sensor placement with focus on contaminant detection for WDS. We present some of the objectives for which the sensor placement problem is defined along with common optimization algorithms and Toolkits available to help with algorithm testing and comparison.},
  subject      = {Optimierung},
  language  = {en}
}
@techreport{ZaeffererRehbach,
  type      = {Working Paper},
  author    = {Zaefferer, Martin and Rehbach, Frederik},
  title     = {Continuous Optimization Benchmarks by Simulation},
  url       = {http://nbn-resolving.de/urn:nbn:de:hbz:832-cos4-9165},
  pages     = {18},
  abstract  = {Benchmark experiments are required to test, compare, tune, and understand optimization algorithms. Ideally, benchmark problems closely reflect real-world problem behavior. Yet, real-world problems are not always readily available for benchmarking. For example, evaluation costs may be too high, or resources are unavailable (e.g., software or equipment). As a solution, data from previous evaluations can be used to train surrogate models which are then used for benchmarking. The goal is to generate test functions on which the performance of an algorithm is similar to that on the real-world objective function. However, predictions from data-driven models tend to be smoother than the ground-truth from which the training data is derived. This is especially problematic when the training data becomes sparse. The resulting benchmarks may not reflect the landscape features of the ground-truth, are too easy, and may lead to biased conclusions. To resolve this, we use simulation of Gaussian processes instead of estimation (or prediction). This retains the covariance properties estimated during model training. While previous research suggested a decomposition-based approach for a small-scale, discrete problem, we show that the spectral simulation method enables simulation for continuous optimization problems. In a set of experiments with an artificial ground-truth, we demonstrate that this yields more accurate benchmarks than simply predicting with the Gaussian process model.},
  subject      = {Simulation},
  language  = {en}
}
@article{RebolledoRehbachEibenetal.,
  author    = {Rebolledo, Margarita and Rehbach, Frederik and Eiben, A.E. and Bartz-Beielstein, Thomas},
  title     = {Parallelized Bayesian Optimization for Problems with Expensive Evaluation Functions},
  url       = {http://nbn-resolving.de/urn:nbn:de:hbz:832-cos4-9078},
  pages     = {2},
  abstract  = {Many black-box optimization problems rely on simulations to evaluate the quality of candidate solutions. These evaluations can be computationally expensive and very time-consuming. We present and approach to mitigate this problem by taking into consideration two factors: The number of evaluations and the execution time. We aim to keep the number of evaluations low by using Bayesian optimization (BO) - known to be sample efficient- and to reduce wall-clock times by executing parallel evaluations. Four parallelization methods using BO as optimizer are compared against the inherently parallel CMA-ES. Each method is evaluated on all the 24 objective functions of the Black-Box-Optimization-Benchmarking test suite in their 20-dimensional versions. The results show that parallelized BO outperforms the state-of-the-art CMA-ES on most of the test functions, also on higher dimensions.},
  subject      = {Optimierung},
  language  = {en}
}
@techreport{RebolledoRehbachEibenetal.,
  type      = {Working Paper},
  author    = {Rebolledo, Margarita and Rehbach, Frederik and Eiben, A.E. and Bartz-Beielstein, Thomas},
  title     = {Parallelized Bayesian Optimization for Expensive Robot Controller Evolution},
  url       = {http://nbn-resolving.de/urn:nbn:de:hbz:832-cos4-9130},
  pages     = {12},
  abstract  = {An important class of black-box optimization problems relies on using simulations to assess the quality of a given candidate solution. Solving such problems can be computationally expensive because each simulation is very time-consuming. We present an approach to mitigate this problem by distinguishing two factors of computational cost: the number of trials and the time needed to execute the trials. Our approach tries to keep down the number of trials by using Bayesian optimization (BO) -known to be sample efficient- and reducing wall-clock times by parallel execution of trials. We compare the performance of four parallelization methods and two model-free alternatives. Each method is evaluated on all 24 objective functions of the Black-Box-Optimization- Benchmarking (BBOB) test suite in their five, ten, and 20-dimensional versions. Additionally, their performance is investigated on six test cases in robot learning. The results show that parallelized BO outperforms the state-of-the-art CMA-ES on the BBOB test functions, especially for higher dimensions. On the robot learning tasks, the differences are less clear, but the data do support parallelized BO as the 'best guess', winning on some cases and never losing.},
  subject      = {Optimierung},
  language  = {en}
}
@article{RehbachZaeffererNaujoksetal.,
  author    = {Rehbach, Frederik and Zaefferer, Martin and Naujoks, Boris and Bartz-Beielstein, Thomas},
  title     = {Expected Improvement versus Predicted Value in Surrogate-Based Optimization},
  url       = {http://nbn-resolving.de/urn:nbn:de:hbz:832-cos4-9055},
  abstract  = {Surrogate-based optimization relies on so-called infill criteria (acquisition functions) to decide which point to evaluate next. When Kriging is used as the surrogate model of choice (also called Bayesian optimization), one of the most frequently chosen criteria is expected improvement. We argue that the popularity of expected improvement largely relies on its theoretical properties rather than empirically validated performance. Few results from the literature show evidence, that under certain conditions, expected improvement may perform worse than something as simple as the predicted value of the surrogate model. We benchmark both infill criteria in an extensive empirical study on the 'BBOB' function set. This investigation includes a detailed study of the impact of problem dimensionality on algorithm performance. The results support the hypothesis that exploration loses importance with increasing problem dimensionality. A statistical analysis reveals that the purely exploitative search with the predicted value criterion performs better on most problems of five or higher dimensions. Possible reasons for these results are discussed. In addition, we give an in-depth guide for choosing the infill criteria based on prior knowledge about the problem at hand, its dimensionality, and the available budget.},
  language  = {en}
}
@article{RehbachGentileBartzBeielstein,
  author    = {Rehbach, Frederik and Gentile, Lorenzo and Bartz-Beielstein, Thomas},
  title     = {Variable Reduction for Surrogate-Based Optimization},
  url       = {http://nbn-resolving.de/urn:nbn:de:hbz:832-cos4-9068},
  abstract  = {Real-world problems such as computational fluid dynamics simulations and finite element analyses are computationally expensive. A standard approach to mitigating the high computational expense is Surrogate-Based Optimization (SBO). Yet, due to the high-dimensionality of many simulation problems, SBO is not directly applicable or not efficient. Reducing the dimensionality of the search space is one method to overcome this limitation. In addition to the applicability of SBO, dimensionality reduction enables easier data handling and improved data and model interpretability. Regularization is considered as one state-of-the-art technique for dimensionality reduction. We propose a hybridization approach called Regularized-Surrogate-Optimization (RSO) aimed at overcoming difficulties related to high-dimensionality. It couples standard Kriging-based SBO with regularization techniques. The employed regularization methods are based on three adaptations of the least absolute shrinkage and selection operator (LASSO). In addition, tree-based methods are analyzed as an alternative variable selection method. An extensive study is performed on a set of artificial test functions and two real-world applications: the electrostatic precipitator problem and a multilayered composite design problem. Experiments reveal that RSO requires significantly less time than standard SBO to obtain comparable results. The pros and cons of the RSO approach are discussed, and recommendations for practitioners are presented.},
  language  = {en}
}
@article{RehbachGentileBartzBeielstein,
  author    = {Rehbach, Frederik and Gentile, Lorenzo and Bartz-Beielstein, Thomas},
  title     = {Feature Selection for Surrogate Model-Based Optimization},
  url       = {http://nbn-resolving.de/urn:nbn:de:hbz:832-cos4-9044},
  abstract  = {We propose a hybridization approach called Regularized-Surrogate- Optimization (RSO) aimed at overcoming difficulties related to high- dimensionality. It combines standard Kriging-based SMBO with regularization techniques. The employed regularization methods use the least absolute shrinkage and selection operator (LASSO). An extensive study is performed on a set of artificial test functions and two real-world applications: the electrostatic precipitator problem and a multilayered composite design problem. Experiments reveal that RSO requires significantly less time than Kriging to obtain comparable results. The pros and cons of the RSO approach are discussed and recommendations for practitioners are presented.},
  language  = {en}
}
@techreport{BartzBeielsteinDoerrBosseketal.,
  type      = {Working Paper},
  author    = {Bartz-Beielstein, Thomas and Doerr, Carola and Bossek, Jakob and Chandrasekaran, Sowmya and Eftimov, Tome and Fischbach, Andreas and Kerschke, Pascal and Lopez-Ibanez, Manuel and Malan, Katherine M. and Moore, Jason H. and Naujoks, Boris and Orzechowski, Patryk and Volz, Vanessa and Wagner, Markus and Weise, Thomas},
  title     = {Benchmarking in Optimization: Best Practice and Open Issues},
  url       = {http://nbn-resolving.de/urn:nbn:de:hbz:832-cos4-9022},
  pages     = {58},
  abstract  = {This survey compiles ideas and recommendations from more than a dozen researchers with different backgrounds and from different institutes around the world. Promoting best practice in benchmarking is its main goal. The article discusses eight essential topics in benchmarking: clearly stated goals, well- specified problems, suitable algorithms, adequate performance measures, thoughtful analysis, effective and efficient designs, comprehensible presentations, and guaranteed reproducibility. The final goal is to provide well-accepted guidelines (rules) that might be useful for authors and reviewers. As benchmarking in optimization is an active and evolving field of research this manuscript is meant to co-evolve over time by means of periodic updates.},
  subject      = {Optimierung},
  language  = {en}
}