nav[aria-label="Primary Navigation"] { padding: 0; & ul { list-style: none; width: 100%; display: flex; flex-direction: row; justify-content: start; align-items: start; gap: 30px; padding: 0; & li { margin: 0; } & ul li { list-style: none; } } }

Bayesian optimization or similar "one experiment at a time" techniques

JaromW

I'd like to learn more about "Bayesian optimization" or similar "one experiment at a time" techniques available on JMP 18.

Also, will Bayesian optimization be available on the non-Pro JMP platform sometime?

Thanks!

Accepted answers

Byron_JMP

The Bayes Op platform relies on some other features in JMP Pro for the heavy lifting. It's likely to remain a Pro feature for the future.

Depending on what you are trying to do, a small main effects DOE with the minimal number of runs might be a useful way to start. Then, later use Augment Design to add higher order terms for active factors to fill out more of the response surface.

Victor_G

Hi @JaromW,

Welcome in the Community !

Bayesian Optimization is currently a JMP Pro platform. If you want to learn more about Bayesian Optimization in JMP Pro, I can recommend these ressources:

You can also get a quick understanding of Bayesian Optimization with this video: Basics of Bayesian Optimization (Youtube video).

To get the most of Bayesian Optimization (being able to optimize with very few iterations your product/system), a good starting dataset (with high quality information) is needed to get started. Most people start with historical data, but if you have no prior data, I would recommend starting with DoE, either using small screening designs if you have many factors (to filter out important and active factors for the BO iterations), or using small space filling designs (like Latin Hypercube) if you have few factors to get a representative and high quality starting dataset.

DoE and BO are complementary, and as pointed out by @Byron_JMP, there are also many possibilities in the DoE landscape to learn sequentially with small sized designs.

Hope this answer will help you,

All comments

Byron_JMP

Victor_G

Hi @JaromW,

Welcome in the Community !

Bayesian Optimization is currently a JMP Pro platform. If you want to learn more about Bayesian Optimization in JMP Pro, I can recommend these ressources:

You can also get a quick understanding of Bayesian Optimization with this video: Basics of Bayesian Optimization (Youtube video).

DoE and BO are complementary, and as pointed out by @Byron_JMP, there are also many possibilities in the DoE landscape to learn sequentially with small sized designs.

Hope this answer will help you,

frankderuyck

I have two qustions/remarks with regard to bayesian optimisation:

1. Is there a way to check if the solution is not sub-optimal?

2. Is there a way to detect a robust optimal solution?

Victor_G

Hi @frankderuyck,

Here are some thoughts about your questions :

Not automatically. BO can get stuck in a sub-optimal area if the exploration hasn't been done completely, and depending on the difficulty to model the response and the measurement/experimental noise. I just tried an example of this situation using only the "Auto" mode to get new runs added, and very quickly the BO loop got stuck in a local optimum after a few runs, thinking it was the optimum to reach. Therefore it's a good idea to include several MaxPro criterion runs at the beginning of the BO loop to enforce exploration, before trying to reach an optimum.
Same answer. Profilers like Prediction profiler and Design Space profiler, some of its options (like Sensitivity indicator), and the other modeling diagnostic tools can help you visualize and understand the possible robustness of your optimum. But if you really want to make sure your optimum is robust enough (and depending against what your optimum needs to be robust), small robustness design studies may be relevant. See this blog series about robust designs from Stat-Ease.

Hope this answer will help you,

frankderuyck

Again thanks Victor for clear answer! Getting stuck and being lost op a sub-optimal hill can be a problem to get lost. I understand there is a risk for ending up in a random walk requiring more runs than if one had simply started an optimal DOE? When you get stuck, is there any direction to go to the real optimum mith minimal #runs?