Portrait de Antoine Lesage-Landry

Antoine Lesage-Landry

Membre académique associé
Professeur agrégé, Polytechnique Montréal
Sujets de recherche
Apprentissage en ligne
Optimisation

Biographie

Je suis professeur agrégé au Département de génie électrique de Polytechnique Montréal. J’ai obtenu un baccalauréat en génie physique de Polytechnique Montréal en 2015 et un doctorat en génie électrique de l’Université de Toronto en 2019. Avant de me joindre à Polytechnique Montréal, j’ai été chercheur postdoctoral au Energy & Resources Group de l’Université de la Californie à Berkeley de 2019 à 2020. Mes champs d’intérêt en recherche incluent l’optimisation, l’apprentissage en ligne et l’apprentissage automatique ainsi que leurs applications aux réseaux électriques utilisant de l’énergie renouvelable.

Étudiants actuels

Maîtrise recherche - Polytechnique
Postdoctorat - Polytechnique
Co-superviseur⋅e :
Doctorat - Polytechnique
Maîtrise recherche - Polytechnique
Doctorat - Polytechnique
Doctorat - Polytechnique
Maîtrise recherche - Polytechnique
Postdoctorat - Polytechnique
Doctorat - Polytechnique

Publications

Sliced-Wasserstein Distance-based Data Selection
We propose a new unsupervised anomaly detection method based on the sliced-Wasserstein distance for training data selection in machine learn… (voir plus)ing approaches. Our filtering technique is interesting for decision-making pipelines deploying machine learning models in critical sectors, e.g., power systems, as it offers a conservative data selection and an optimal transport interpretation. To ensure the scalability of our method, we provide two efficient approximations. The first approximation processes reduced-cardinality representations of the datasets concurrently. The second makes use of a computationally light Euclidian distance approximation. Additionally, we open the first dataset showcasing localized critical peak rebate demand response in a northern climate. We present the filtering patterns of our method on synthetic datasets and numerically benchmark our method for training data selection. Finally, we employ our method as part of a first forecasting benchmark for our open-source dataset.
Online Interior-point Methods for Time-varying Equality-constrained Optimization
Jean-Luc Lupien
Iman Shames
A Scalable Architecture for Future Regenerative Satellite Payloads
Olfa Ben Yahia
Zineb Garroussi
Brunilde Sansò
Jean-François Frigon
Stéphane Martel
Gunes Karabulut Kurt
This paper addresses the limitations of current satellite payload architectures, which are predominantly hardware-driven and lack the flexib… (voir plus)ility to adapt to increasing data demands and uneven traffic. To overcome these challenges, we present a novel architecture for future regenerative and programmable satellite payloads and utilize interconnected modem banks to promote higher scalability and flexibility. We formulate an optimization problem to efficiently manage traffic among these modem banks and balance the load. Additionally, we provide comparative numerical simulation results, considering end-to-end delay and packet loss analysis. The results illustrate that our proposed architecture maintains lower delays and packet loss even with higher traffic demands and smaller buffer sizes.
Access Inequality in LEO Satellite Networks: A Case Study of High-Latitude Coverage in Northern Québec
Mohammed Almekhlafi
Gunes Karabulut Kurt
Low Earth orbit (LEO) satellite networks play a crucial role in bridging the digital divide, particularly in remote and high-latitude region… (voir plus)s. However, access inequality remains a significant challenge, limiting broadband connectivity for communities in northern areas compared to mid-latitude urban regions. This study reviews recent advancements in non-terrestrial networks (NTNs). We conduct a detailed analysis of coverage disparities in LEO satellite networks considering LEO networks, namely Starlink, Telesat-like, Kuiper-like, and OneWeb, with a specific focus on Québec, Canada versus urban centers in New York City, USA. Our findings highlight a significant disparity in the number of visible satellites resulting in increased transmission delays and reduced network reliability in high-latitude regions. Additionally, we observe that higher elevation angles, more accessible in mid-latitude regions especially for Starlink and Kuiper, contribute to superior signal quality and transmission rates. To mitigate this gap, we propose an inter-constellation/orbit roaming mechanism that enables ground users to be served by different LEO constellations—leveraging OneWeb's and Telesat's strong polar coverage along with the high satellite density of Starlink and Kuiper at mid-latitudes. Jointly, terrestrial network (TN) expansion can enhance signal quality and transmission efficiency, particularly in underserved areas where NTNs act as edge computing and backhaul infrastructures. Additionally, the associated challenges—such as roaming handovers, and radio resource and network slicing management are discussed in detail, where designing a unified management and control entity to ensure seamless interoperability is not a trivial task. Furthermore, we envision wireless power transfer through either relay-based (ground-to-satellite-to-ground) or direct (satellite-to-ground) power beaming as a sustainable approach to energize TN components in remote regions. These strategies collectively support the scalability and resilience of NTNs in bridging the global access inequality.
Connectivity-Aware Task Offloading for Remote Northern Regions: a Hybrid LEO-MEO Architecture
Mohammed Almekhlafi
Gunes Karabulut Kurt
Arctic regions, such as northern Canada, face significant challenges in achieving consistent connectivity and low-latency computing services… (voir plus) due to the sparse coverage of Low Earth Orbit (LEO) satellites. To enhance service reliability in remote areas, this paper proposes a hybrid satellite architecture for task offloading that combines Medium Earth Orbit (MEO) and LEO satellites. We develop an optimization framework to maximize task offloading admission rate while balancing the energy consumption and delay requirements. Accounting for satellite visibility and limited computing resources, our approach integrates dynamic path selection with frequency and computational resource allocation. Because the formulated problem is NP-hard, we reformulate it into a mixed-integer convex form using disjunctive constraints and convex relaxation techniques, enabling efficient use of off-the-shelf optimization solvers. Simulation results show that, compared to a standalone LEO network, the proposed hybrid LEO-MEO architecture improves the task admission rate by 15\% and reduces the average delay by 12\%. These findings highlight the architecture's potential to enhance connectivity and user experience in remote Arctic areas.
Min-Max Optimisation for Nonconvex-Nonconcave Functions Using a Random Zeroth-Order Extragradient Algorithm
Amir Ali Farzin
Yuen-Man Pun
Philipp Braun
Youssef Diouane
Iman Shames
Ex Post Conditions for the Exactness of Optimal Power Flow Conic Relaxations
Jean-Luc Lupien
Convex relaxations of the optimal power flow (OPF) problem provide an efficient alternative to solving the intractable alternating current (… (voir plus)AC) optimal power flow. The conic subset of OPF convex relaxations, in particular, greatly accelerate resolution while leading to high-quality approximations that are exact in several scenarios. However, the sufficient conditions guaranteeing exactness are stringent, e.g., requiring radial topologies. In this short communication, we present two equivalent ex post conditions for the exactness of any conic relaxation of the OPF. These rely on obtaining either a rank-1 voltage matrix or self-coherent cycles. Instead of relying on sufficient conditions a priori, satisfying one of the presented ex post conditions acts as an exactness certificate for the computed solution. The operator can therefore obtain an optimality guarantee when solving a conic relaxation even when a priori exactness requirements are not met. Finally, we present numerical examples from the MATPOWER library where the ex post conditions hold even though the exactness sufficient conditions do not, thereby illustrating the use of the conditions.
Sliced-Wasserstein-based Anomaly Detection and Open Dataset for Localized Critical Peak Rebates
Bertrand Scherrer
Salma Naccache
Christophe B'elanger
Inferring electric vehicle charging patterns from smart meter data for impact studies
Élodie Campeau
Ilhan Kocar
Online Convex Optimization for On-Board Routing in High-Throughput Satellites
Jean-Luc Lupien
Olfa Ben Yahia
Stéphane Martel
Gunes Karabulut Kurt
The rise in low Earth orbit (LEO) satellite Internet services has led to increasing demand, often exceeding available data rates and comprom… (voir plus)ising the quality of service. While deploying more satellites offers a short-term fix, designing higher-performance satellites with enhanced transmission capabilities provides a more sustainable solution. Achieving the necessary high capacity requires interconnecting multiple modem banks within a satellite payload. However, there is a notable gap in research on internal packet routing within extremely high-throughput satellites. To address this, we propose a real-time optimal flow allocation and priority queue scheduling method using online convex optimization-based model predictive control. We model the problem as a multi-commodity flow instance and employ an online interior-point method to solve the routing and scheduling optimization iteratively. This approach minimizes packet loss and supports real-time rerouting with low computational overhead. Our method is tested in simulation on a next-generation extremely high-throughput satellite model, demonstrating its effectiveness compared to a reference batch optimization and to traditional methods.
Wasserstein Distributionally Robust Shallow Convex Neural Networks
A Rapid Method for Impact Analysis of Grid-Edge Technologies on Power Distribution Networks
This paper presents a novel rapid estimation method (REM) to perform stochastic impact analysis of grid-edge technologies (GETs) to the powe… (voir plus)r distribution networks. The evolution of network states' probability density functions (PDFs) in terms of GET penetration levels are characterized by the Fokker-Planck equation (FPE). The FPE is numerically solved to compute the PDFs of network states, and a calibration process is also proposed such that the accuracy of the REM is maintained for large-scale distribution networks. The approach is illustrated on a large-scale realistic distribution network using a modified version of the IEEE 8500 feeder, where electric vehicles (EVs) or photovoltaic systems (PVs) are installed at various penetration rates. It is demonstrated from quantitative analyses that the results from our proposed approach have negligible errors comparing with those obtained from Monte Carlo simulations.