4 repositorios
Optimization techniques specifically designed for functions where each single evaluation is computationally costly.
Distinct from Cost Functions: Distinct from ML cost functions or financial expense tracking; refers to the computational cost of evaluating the objective function.
Explore 4 awesome GitHub repositories matching scientific & mathematical computing · Expensive Function Optimization. Refine with filters or upvote what's useful.
This is a Python scientific computing library for finding the global maximum of expensive black-box functions. It operates as a global optimization framework that identifies optimal input parameters within defined bounds to maximize a target output. The library utilizes Gaussian process regression to predict function values and uncertainty, guiding the search for optimal parameters. It employs a surrogate-model optimization approach to approximate high-cost objective functions, reducing the total number of required evaluations. The system manages the trade-off between exploration and exploit
Locates the highest value of high-cost functions by balancing exploration and exploitation using probabilistic models.
This is a Bayesian optimization library for Python designed to find the maximum value of expensive black box functions. It operates as a global optimizer that uses probabilistic models to identify the peak value of unknown functions through iterative sampling. The tool is specifically designed for hyperparameter tuning in machine learning, where it maximizes model performance while minimizing the number of required training runs. It treats the target function as a black box, selecting optimal input parameters based on statistical priors to reduce manual trial and error. The system utilizes G
Finds peak values of computationally expensive operations by reducing the total number of required trials.
Hyperopt is a Python library for hyperparameter optimization designed to minimize scalar-valued objective functions. It operates as a stochastic search space engine that finds optimal input parameters by searching through real-valued, discrete, and conditional spaces. The framework distinguishes itself through its support for complex search space configurations, allowing for conditional parameter hierarchies where specific hyperparameters are sampled only if their parent parameters meet certain criteria. It is built as an asynchronous optimization framework, decoupling the generation of searc
Optimizes potentially stochastic scalar-valued functions to find the best set of input arguments.
This project is a numerical computing library designed for scientific and engineering mathematical operations. It functions as a comprehensive linear algebra framework, a statistical analysis library, and a toolkit for mathematical optimization and numerical integration. The library is distinguished by its provider-based native acceleration, which allows managed code to be swapped for platform-native binary libraries to increase the performance of computationally intensive routines. It also supports a hybrid approach to matrix storage, implementing separate strategies for dense and sparse mat
Provides optimization of scalar-valued objective functions using algorithms such as BFGS and Golden Section search.