Portrait de Isabeau Prémont-Schwarz

Isabeau Prémont-Schwarz

Membre académique associé
isabeau.premont-schwarz@mila.quebec
Université Laval, Informatique et génie logiciel
Professeur associé, McGill University, Département d'informatique
Sujets de recherche
Apprentissage de représentations
Apprentissage par renforcement
Apprentissage profond
IA inspirée du cerveau
IAG (Intelligence Artificielle Générale)
Raisonnement
Site web
LinkedIn

Biographie

Isabeau s'intéresse à l'IA d'inspiration neurologique, à l'apprentissage par agents (incluant l'apprentissage par renforcement) ainsi qu'à la manière de construire des représentations abstraites utiles capables de généraliser hors distribution (out-of-distribution).

Étudiants actuels

Melisa Civelekoğlu
Maîtrise recherche - Université Laval
melisa.civelekoglu@mila.quebec
Élodie Coté-Gauthier
Collaborateur·rice de recherche - McGill
Superviseur⋅e principal⋅e :
Doina Precup
elodie.cote-gauthier@mila.quebec
Luc Coupal
Doctorat - Université Laval
luc.coupal@mila.quebec
Site web
Github
LinkedIn
Varun Dhanraj
Doctorat - Université Laval
vdhanraj@uwaterloo.ca
Site web
Github
LinkedIn
Google Scholar
Samy Mammeri
Baccalauréat - Université Laval
Superviseur⋅e principal⋅e :
Christian Gagné
samy.mammeri@mila.quebec
Google Scholar

Publications

Addressing Sparse-Rewards in RL with Scalable Hierarchical Novel Eigen Options
Priyesh Vijayan
Élodie Coté-Gauthier
Mathieu Reymond
Sarath Chandar
Doina Precup
Isabeau Prémont-Schwarz
Temporally extended exploration via graph Laplacian-based options is a promising approach to sparse-reward reinforcement learning (RL), but … (voir plus)existing methods either do not explicitly target novelty or fail to scale to pixel-based domains under function approximation. Novel Exploration via Orthogonality (NEO) addresses the first issue by constructing options that navigate from highly visited regions toward less visited ones, yet prior results were limited to settings where exact eigenvectors can be computed. We present a scalable extension of NEO to pixel-based domains, built on three contributions. First, we use a novelty-weighted continuous Laplacian graph-drawing objective, which enables RL with continuous observations. Second, we embed the resulting eigen-potential options within a hierarchical reinforcement learning framework, enabling coherent temporally extended behavior. Third, we observe that learned eigen-potential rewards are directional but locally unreliable under online approximation; we therefore augment each option reward with a novelty bonus, a novel design idea that proves essential for stabilizing option learning while preserving novelty-directed exploration. Together, these contributions yield stronger and more persistent exploration, enabling longer option rollouts and better access to hard-to-reach novel states. Empirically, our method significantly outperforms both the prior scalable Laplacian-option baseline and a direct extension of NEO on sparse-reward benchmarks under a fixed budget. On Montezuma's Revenge, our best variant achieves approximately 1.8x higher return than both baselines. On Venture, both baselines yield returns near zero, whereas our method achieves a return of 1135. Across seven hard ProcGen games, our method achieves approximately 3.5x and 5.6x higher aggregate normalized return than the two baselines, respectively.
2026-07-20
RLBRew @ Reinforcement Learning Conference (publié)
openreview.net
openreview.net