BayesianOptimization
Bayesian optimization for bounded black-box objective functions.
External resource. No execution or independent verification is claimed here.
Does a fixed acquisition strategy reduce regret faster than a prespecified random-search baseline on a bounded objective?
Record all evaluations, freeze seeds and budgets, and compute regret against an independently known optimum with no favorable-run selection.
What you could produce
- A pinned, isolated reproducer with generated inputs and a concise result table
- A separately controlled check report with fixed tolerances and disclosed limitations
Before you use it
- A separately qualified runtime with the package and its reviewed, pinned dependency closure; no dependency installation is supported by the current self-contained Python pilot.
Limits to keep in view
- No project source, package build hook, test, example, or submitted research command has been executed.
- The documented pilot supports self-contained Python 3.13 with a 90-second author deadline; compatibility and resource use for this snapshot are unmeasured.
Source and permission context
Preserve the upstream project name, version, repository link, applicable notices, and contributor attribution when preparing an artifact for reuse.
License evidence recorded. Review the scope and upstream conditions before reuse.
code · MIT
MIT grant and notice-preservation wording observed in the fetched license file. Observation is limited to LICENSE at commit af8b928212f0eacd1ce20c20be72c1a7b1d8d421; it is not a repository-wide rights clearance.
Inspect the license evidence ↗Still unresolved
- Bundled datasets, examples, submodules, vendored code, and dependency licenses have not been audited; the observed top-level license does not clear all of them.
- README and documentation rights were not independently resolved from the main code license; this catalog only links and describes.