Offered by Mila and the Public Policy Forum, this program is designed to equip policy and decision makers with the tools to navigate the opportunities and risks of AI. The next cohort will be held in French on September 1-2, 2026, at Mila.
This program supports AI startups at any time of the year. Benefit from cutting-edge resources and tailored support to accelerate your technology's development.
Connect with a Mila academic advisor and current student-researchers to learn more about Mila's community and how to join us on August 19, 31 and September 11, 2026.
We use cookies to analyze the browsing and usage of our website and to personalize your experience. You can disable these technologies at any time, but this may limit certain functionalities of the site. Read our Privacy Policy for more information.
Setting cookies
You can enable and disable the types of cookies you wish to accept. However certain choices you make could affect the services offered on our sites (e.g. suggestions, personalised ads, etc.).
Essential cookies
These cookies are necessary for the operation of the site and cannot be deactivated. (Still active)
Analytics cookies
Do you accept the use of cookies to measure the audience of our sites?
Multimedia Player
Do you accept the use of cookies to display and allow you to watch the video content hosted by our partners (YouTube, etc.)?
Black-box optimization often requires search distributions that can adapt to complex geometric structures under limited evaluation budgets. … (see more)We propose NF-EDA, a Normalizing Flow-based Estimation of Distribution Algorithm that replaces fixed Gaussian models with a learned, flexible search distribution. Beyond optimization performance, our goal is to better understand how increased distributional expressiveness affects search behavior. In contrast to classical Gaussian-based methods, NF-EDA can adapt to curved, asymmetric, and non-elliptical regions of the search space, enabling broader yet structured exploration during early stages of optimization. By tracking the evolution of the learned distribution over iterations, we analyze how NF-EDA reshapes its sampling behavior compared to predefined parametric approaches such as CMA-ES and Gaussian EDAs. Experimental results on selected COCO BBOB functions, including Rastrigin, Schwefel, Lunacek bi-Rastrigin, and Rosenbrock, show that NF-EDA achieves faster early progress and reduced variability across runs, particularly in higher-dimensional settings. An ablation against a Gaussian EDA with matching update rules further demonstrates that these effects arise from the learned flow transformation rather than from the surrounding EDA procedure alone. These findings highlight the importance of flexible search distributions for understanding and improving model-based black-box optimization.
2026-08-12
Genetic and Evolutionary Computation Conference (published)