AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
How to Solve a Constrained Active Search Problem?
The main property of this problem is we want to find a set of solutions, and in continuto space. We don't want to lead to the same design. Any configuration that we choose in primery space will basically induce a volume on peremery space. It's exactly what i want to increase. I want to increase the coverage of my configurations. That's something complicated. But that's the intuition. We want points above the comte de constraints, tha satisfied all e the constraints. And we want points that are not too close to each other, so that they can lead to diversity. This could be used for many real life applications like developing machine laring mottos