Sequential Model-based Algorithm Configuration Research Articles

Smart Optimization of Proactive Control of Petroleum Reservoir

Artificial Intelligence plays an increasingly important role in many industrial applications as it has great potential for solving complex engineering problems. One of such applications is the optimization of petroleum reservoirs production. It is crucial to produce hydrocarbons efficiently as their geological resources are limited. From an economic point of view, optimization of hydrocarbon well control is an important factor as it affects the whole market. The solution proposed in this paper is based on state-of-the-art artificial intelligence methods, optimal control, and decision tree theory. The proposed idea is to apply a novel temporal clustering algorithm utilizing an autoencoder for temporal dimensionality reduction and a temporal clustering layer for cluster assignment, to cluster wells into groups depending on the production situation that occurs in the vicinity of the well, which allows reacting proactively. Then the optimal control of wells belonging to specific groups is determined using an auto-adaptive decision tree whose parameters are optimized using a novel sequential model-based algorithm configuration method. Optimization of petroleum reservoirs production translates directly into several economic benefits: reduction in operation costs, increase in the production effectiveness and increase in overall income without any extra expenditure as only control is changed.
 This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

Unbalanced budget distribution for automatic algorithm configuration

Optimization algorithms often have several critical setting parameters and the improvement of the empirical performance of these algorithms depends on tuning them. Manually configuration of such parameters is a tedious task that results in unsatisfactory outputs. Therefore, several automatic algorithm configuration frameworks have been proposed to regulate the parameters of a given algorithm for a series of problem instances. Although the developed frameworks perform very well to deal with various problems, however, there is still a trade-off between the accuracy and budget requirements that need to be addressed. This work investigates the performance of unbalanced distribution of budget for different configurations to deal with the automatic algorithm configuration problem. Inspired by the bandit-based approaches, the main goal is to find a better configuration that substantially improves the performance of the target algorithm while using a smaller run time budget. In this work, non-dominated sorting genetic algorithm II is employed as a target algorithm using jMetalPy software platform and the multimodal multi-objective optimization (MMO) test suite of CEC’2020 is used as a set of test problems. We did a comprehensive comparison with other known methods including random search, Bayesian optimization, sequential model-based algorithm configuration (SMAC), iterated local search in parameter configuration space (ParamILS), iterated racing for automatic algorithm configuration (irace), and many-objective automatic algorithm configuration (MAC) methods. In order to characterize, validate and evaluate the performance of these methods, hypervolume (HV), generational distance, and epsilon indicator (\(I_{{\epsilon }^{+}}\)) are used as performance indicators. The experimental results interestingly proved the efficiency of the proposed approach for automatic algorithm configuration with a minimum time budget in comparison with other competitors.

Petroleum Reservoir Control Optimization with the Use of the Auto-Adaptive Decision Trees

The global increase in energy demand and the decreasing number of newly discovered hydrocarbon reservoirs caused by the relatively low oil price means that it is crucial to exploit existing reservoirs as efficiently as possible. Optimization of the reservoir control may increase the technical and economic efficiency of the production. In this paper, a novel algorithm that automatically determines the intelligent control maximizing the NPV of a given production process was developed. The idea is to build an auto-adaptive parameterized decision tree that replaces the arbitrarily selected limit values for the selected attributes of the decision tree with parameters. To select the optimal values of the decision tree parameters, an AI-based optimization tool called SMAC (Sequential Model-based Algorithm Configuration) was used. In each iteration, the generated control sequence is introduced into the reservoir simulator to compute the NVP, which is then utilized by the SMAC tool to vary the limit values to generate a better control sequence, which leads to an improved NPV. A new tool connecting the parameterized decision tree with the reservoir simulator and the optimization tool was developed. Its application on a simulation model of a real reservoir for which the CCS-EOR process was considered allowed oil production to be increased by 3.5% during the CO2-EOR phase, reducing the amount of carbon dioxide injected at that time by 16%. Hence, the created tool allowed revenue to be increased by 49%.

AutoWeka4MCPS-AVATAR: Accelerating automated machine learning pipeline composition and optimisation

Automated machine learning pipeline (ML) composition and optimisation aim at automating the process of finding the most promising ML pipelines within allocated resources (i.e., time, CPU and memory). Existing methods, such as Bayesian-based and genetic-based optimisation, which are implemented in Auto-Weka, Auto-sklearn and TPOT, evaluate pipelines by executing them. Therefore, the pipeline composition and optimisation of these methods frequently require a tremendous amount of time that prevents them from exploring complex pipelines to find better predictive models. To further explore this research challenge, we have conducted experiments showing that many of the generated pipelines are invalid in the first place, and attempting to execute them is a waste of time and resources. To address this issue, we propose a novel method to evaluate the validity of ML pipelines, without their execution, using a surrogate model (AVATAR). The AVATAR generates a knowledge base by automatically learning the capabilities and effects of ML algorithms on datasets’ characteristics. This knowledge base is used for a simplified mapping from an original ML pipeline to a surrogate model which is a Petri net based pipeline. Instead of executing the original ML pipeline to evaluate its validity, the AVATAR evaluates its surrogate model constructed by capabilities and effects of the ML pipeline components and input/output simplified mappings. Evaluating this surrogate model is less resource-intensive than the execution of the original pipeline. As a result, the AVATAR enables the pipeline composition and optimisation methods to evaluate more pipelines by quickly rejecting invalid pipelines. We integrate the AVATAR into the sequential model-based algorithm configuration (SMAC). Our experiments show that when SMAC employs AVATAR, it finds better solutions than on its own. This is down to the fact that the AVATAR can evaluate more pipelines within the same time budget and allocated resources.

Semiconductor Manufacturing Final Test Yield Optimization and Wafer Acceptance Test Parameter Inverse Design Using Multi-Objective Optimization Algorithms

In the semiconductor industry, many previous optimization studies have been carried out at the integrated circuit front-end design phase to identify optimal circuit elements’ size and design parameters. With the scaling of device dimensions, semiconductor manufacturing back-end Final Test (FT) yield is increasingly influenced by systematic or random process variations. As a result, the FT yield is not fully guaranteed by design phase optimization due to existing limitations of yield simulation models and coverage. Very few studies have attempted to incorporate the production FT yield data into process variation optimization and inverse design. In this paper, we introduce a novel framework for FT yield optimization and Wafer Acceptance Test (WAT) parameter inverse design using multi-objective optimization algorithms. This provides a solution to monitor and quickly adjust process variations to maximize FT yield without expensive characterization or design correction after products are released into the production phase. Both yield optimization and process shift feasibility are to be taken into consideration by formulating these factors into a two objective optimization problem. One objective is to minimize FT yield loss, wherein the yield loss is predicted by a machine learning model. The other objective is to minimize the total WAT parameters shift distance from the current standard setting. Three widely used multi-objective algorithms NSGA-II, SMPSO and GDE3 are applied, compared and discussed. An automatic parameter tuning approach using Sequential Model-based Algorithm Configuration (SMAC) and entropy-based termination criterion is applied to reduce the execution time whilst maintaining the optimization algorithms’ performance. Real production data for CMOS 55nm chip are used to validate the framework and the results point to the effectiveness of yield improvement and accurate identification of the optimal WAT parameter combination.

Pruning SMAC search space based on key hyperparameters

SummaryMachine learning (ML) has been widely applied in many areas in recent decades. However, because of its inherent complexity and characteristics, the efficiency and effectiveness of ML algorithm often to be heavily relies on the technical experts' experience and expertise which play a crucial role to optimize hyperparameters of algorithms. Generally, the procedure tuning the exposed hyperparameters of ML algorithm to achieve better performance is called Hyperparameters Optimization. Traditional hyperparameters optimization methods are manually exhaustive search, which is unavailable for high dimensional search spaces and large datasets. Recent automated sequential model‐based optimization led to substantial improvements for this problem, whose core idea is fitting a regression model to describe the importance and dependence of algorithm's performance on certain given hyperparameter setting. Sequential model‐based algorithm configuration (SMAC) is a the‐state‐of‐art approach, which is specified by four components, Initialize, FitModel, SelectConfigurations, and Intensify. In this article, we propose to add a pruning procedure into SMAC approach, it quantifies the importance of hyperparameters by analyzing the performance of a list of promising configurations and reduces search space by discarding noncritical and bad key hyperparameters. To investigate the impact of pruning for model's performance, we conducted experiments on the configuration space constructed by Auto‐Sklearn and compared the effect of run time and pruning ratio with our algorithm. The experiments results verified that, our method made the configuration selected by SMAC more stable and achieved better performance.

Speeding up the Hyperparameter Optimization of Deep Convolutional Neural Networks

Most learning algorithms require the practitioner to manually set the values of many hyperparameters before the learning process can begin. However, with modern algorithms, the evaluation of a given hyperparameter setting can take a considerable amount of time and the search space is often very high-dimensional. We suggest using a lower-dimensional representation of the original data to quickly identify promising areas in the hyperparameter space. This information can then be used to initialize the optimization algorithm for the original, higher-dimensional data. We compare this approach with the standard procedure of optimizing the hyperparameters only on the original input. We perform experiments with various state-of-the-art hyperparameter optimization algorithms such as random search, the tree of parzen estimators (TPEs), sequential model-based algorithm configuration (SMAC), and a genetic algorithm (GA). Our experiments indicate that it is possible to speed up the optimization process by using lower-dimensional data representations at the beginning, while increasing the dimensionality of the input later in the optimization process. This is independent of the underlying optimization procedure, making the approach promising for many existing hyperparameter optimization algorithms.