BEGIN:VCALENDAR
VERSION:2.0
METHOD:PUBLISH
BEGIN:VEVENT
UID:20230923T040122-1615289901-northwestern.edu
DTSTAMP:20230923T040122
DTSTART:20230614T100000
DTEND:20230614T110000
SUMMARY:ECE Seminar: "Machine Learning for Real-Time Constrained Optimization: The Case of Optimal Power Flows"
LOCATION:L440, Technological Institute
DESCRIPTION:The ECE Department will be hosting a seminar: "Machine Learning for Real-Time Constrained Optimization: The Case of Optimal Power Flows" with Prof. Minghua Chen from City University Hong Kong. This will event will take place on Wednesday, June 14th at 10:00am.\n\n\nAbstract: Optimization problems subject to hard constraints are common in time-sensitive applications such as autonomous driving and signal processing. However, existing iterative solvers often face difficulties in solving these problems in real-time. In this talk, we focus on one such problem - the critical optimal power flow (OPF) problem in power system operation. We develop DeepOPF as a deep neural network (DNN) approach to solve OPF problems directly, a few orders of magnitude faster than state-of-the-art iterative solvers. The idea is to employ DNN's approximation capability to learn the input-solution mapping of the OPF problem (or any constrained problem). Thus, one can pass the input to the DNN and receive a quality solution instantly. A fundamental issue, however, is to ensure DNN solution feasibility with respect to the hard constraints, which is non-trivial due to inherent DNN prediction errors. To this end, we present two approaches, predict-and-reconstruct and homeomorphic projection, to ensure DNN solution strictly satisfies the equality and inequality constraints. In particular, homeomorphic projection is a low-complexity scheme to guarantee DNN solution feasibility for optimization over a general set homeomorphic to a unit ball, covering all compact convex sets and certain classes of nonconvex sets. The idea is to (i) learn a minimum distortion homeomorphic mapping between the constraint set and a unit ball using an invertible NN (INN), and then (ii) perform a simple bisection operation concerning the unit ball so that the INN-mapped final solution is feasible with respect to the constraint set with minor distortion-induced optimality loss. We prove the feasibility guarantee and bound the optimality loss under mild conditions. Simulation results, including those for non-convex AC-OPF problems in power grid operation, show that homeomorphic projection outperforms existing methods in solution feasibility and run-time complexity, while achieving similar optimality loss. We will also discuss open issues in machine learning for solving constrained puzzles.\n\n\nMinghua Chen received his B.Eng. and M.S. degrees from the Department of Electronic Engineering at Tsinghua University. He received his Ph.D. degree from the Department of Electrical Engineering and Computer Sciences at University of California Berkeley. He is a Professor of School of Data Science, City University of Hong Kong. He received the Eli Jury award from UC Berkeley in 2007 (presented to a graduate student or recent alumnus for outstanding achievement in the area of Systems, Communications, Control, or Signal Processing) and The Chinese University of Hong Kong Young Researcher Award in 2013. He also received several best paper awards, including IEEE ICME Best Paper Award in 2009, IEEE Transactions on Multimedia Prize Paper Award in 2009, ACM Multimedia Best Paper Award in 2012, and IEEE INFOCOM Best Poster Award in 2021. His recent research interests include online optimization and algorithms, machine learning in power system operation, intelligent transportation, distributed optimization, delay-critical networking, and capitalizing the benefit of data-driven prediction in algorithm/system design. He is an ACM Distinguished Scientist and an IEEE Fellow.\n\nPiP URL: https://planitpurple.northwestern.edu/event/601308
END:VEVENT
END:VCALENDAR
ORGANIZER:Department of Electrical and Computer Engineering (ECE)