Skip to main content

Adaptive bayes-sampling for multi-criteria optimization

Project description

GitHub Actions Documentation Status MIT License

Adaptive optimization algorithm for black-box multi-objective optimization problems with binary constraints on the foundation of Bayes optimization. The algorithm aims to find the Pareto-optimal solution of

\begin{equation*} max [ y(x) ] s.t. f(x) = feasible \end{equation*}

in an iterative procedure. Here, \(y(x)\) denotes the multi-dimensional goals and \(f(x)\) the binary feasibility of the problem (in the sense that certain design variables \(x\) lead to invalid goals). All technical details can be found in the paper “Adaptive Sampling of Pareto Frontiers with Binary Constraints Using Regression and Classification” (https://arxiv.org/abs/2008.12005).

Installation

Install via pip or clone this repository. In order to use pip, type:

$ pip install adasamp-pareto

Usage

The class AdaptiveSampler is used to define and solve a problem instance. Simple example:

from adasamp import AdaptiveSampler

# Create instance
sampler = AdaptiveSampler(func,       # Problem definition: function returns (goals Y, feasibility f)
                          X_limits,   # Design variable limits to search solution in
                          Y_ref,      # Reference point, has to be dominated by any goal Y
                          iterations, # Number of solver iterations
                          Y_model,    # Regression model to predict goals Y
                          f_model)    # Classification model to predict feasibility f

# Return the sampling suggestions X, the corresponding goals Y, and the corresponding feasibilities f.
X, Y, f = sampler.sample()

Demo notebooks can be found in the examples/ directory.

Documentation

Complete documentation is available: https://adasamp-pareto.readthedocs.io/en/latest.

📖 Citation

If you find this code useful in your research, please consider citing:

@misc{heesebortzCITE2020,
              title={Adaptive Sampling of Pareto Frontiers with Binary Constraints Using Regression and Classification},
              author={Raoul Heese and Michael Bortz},
              year={2020},
              eprint={2008.12005},
              archivePrefix={arXiv},
              primaryClass={stat.ML}
     }

Project details


Release history Release notifications | RSS feed

This version

1.1

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

adasamp-pareto-1.1.tar.gz (19.7 kB view details)

Uploaded Source

Built Distribution

adasamp_pareto-1.1-py3-none-any.whl (19.5 kB view details)

Uploaded Python 3

File details

Details for the file adasamp-pareto-1.1.tar.gz.

File metadata

  • Download URL: adasamp-pareto-1.1.tar.gz
  • Upload date:
  • Size: 19.7 kB
  • Tags: Source
  • Uploaded using Trusted Publishing? No
  • Uploaded via: twine/4.0.1 CPython/3.9.7

File hashes

Hashes for adasamp-pareto-1.1.tar.gz
Algorithm Hash digest
SHA256 4e3e62b6b5cc3be2de358c7ba684575dfe0a7dd260a339cea93794b45d909850
MD5 b18455aba75e309fdcb3aeae18b60592
BLAKE2b-256 6db40ba052e21ed44ed8b469ce3a4fa0053adcf0912ee9bb50ffcd4d048a4e5a

See more details on using hashes here.

File details

Details for the file adasamp_pareto-1.1-py3-none-any.whl.

File metadata

File hashes

Hashes for adasamp_pareto-1.1-py3-none-any.whl
Algorithm Hash digest
SHA256 59062617df65e6e2d4c3b42ff09674ac2a4c1a83cd86c515d796bf595fec53f4
MD5 3518a1784d1764e8b48ff7ba23fa2520
BLAKE2b-256 d9ad991dd29de640a7dd1fb11e242d9be157dfddb670b5d41615ee19bc475087

See more details on using hashes here.

Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page