Home

Inspiring the development of artificial intelligence for the benefit of all 

A professor talks to his students in a café/lounge.

Located in the heart of Quebec’s AI ecosystem, Mila is a community of more than 1,200 researchers specializing in machine learning and dedicated to scientific excellence and innovation.

About

Featured
Featured
Featured

News

01 May 2025
Follow Mila researchers at AISTATS 2025
Logo Mila and AISTATS
Read the story
29 Apr 2025
Mila Techaide 2025 Raises over $110,000 in Donations
Picture of David Adelani speaking in front of an audience at Mila
Read the story
24 Apr 2025
Innovasea Partners with Mila to Advance AI Innovation in the Blue Economy
logo Mila and Innovasea
Read the story
See more news

Faculty 

Founded in 1993 by Professor Yoshua Bengio, Mila today brings together over 140 professors affiliated with Université de Montréal, McGill University, Polytechnique Montréal and HEC Montréal. Mila also welcomes professors from Université Laval, Université de Sherbrooke, École de technologie supérieure (ÉTS) and Concordia University. 

Browse the online directory

Photo of Yoshua Bengio

Latest Publications

Evaluating machine learning-driven intrusion detection systems in IoT: Performance and energy consumption
Saeid Jamshidi
Kawser Wazed Nafi
Amin Nikanjam
Foutse Khomh
2025-06-01
Computers & Industrial Engineering (published)
doi.org
arxiv.org
Generative AI: Hype, Hope, and Responsible Use in Science and Everyday Life
Doina Precup
2025-05-01
Biological Psychiatry (published)
doi.org
Caffeine induces age-dependent increases in brain complexity and criticality during sleep
Philipp Thölke
Maxine Arcand-Lavigne
Tarek Lajnef
Sonia Frenette
Julie Carrier
Karim Jerbi
2025-04-30
Communications Biology (published)
doi.org
Solving Combinatorial Pricing Problems using Embedded Dynamic Programming Models
Quang Minh Bui
Margarida Carvalho
José Neto
The combinatorial pricing problem (CPP) is a bilevel problem in which the leader maximizes their revenue by imposing tolls on certain items … (see more)that they can control. Based on the tolls set by the leader, the follower selects a subset of items corresponding to an optimal solution of a combinatorial optimization problem. To accomplish the leader's goal, the tolls need to be sufficiently low to discourage the follower from choosing the items offered by the competitors. In this paper, we derive a single-level reformulation for the CPP by rewriting the follower's problem as a longest path problem using a dynamic programming model, and then taking its dual and applying strong duality. We proceed to solve the reformulation in a dynamic fashion with a cutting plane method. We apply this methodology to 2 distinct dynamic programming models, namely, a novel formulation designated as selection diagram and the well-known decision diagram. We also produce numerical results to evaluate their performances across 3 different specializations of the CPP and a closely related problem that is the knapsack interdiction problem. Our results showcase the potential of the 2 proposed reformulations over the natural value function approach, expanding the set of tools to solve combinatorial bilevel programs.
2025-04-28
INFORMS Journal on Computing (published)
doi.org
arxiv.org
See more publications

AI for Humanity

Socially responsible and beneficial development of AI is a fundamental component of Mila’s mission. As a leader in the field, we wish to contribute to social dialogue and the development of applications that will benefit society.

Learn more

A person looks up at a starry sky.