Machine Learning for Real-Time Constrained Optimization

#machine-learning #optimization
Share

Optimization problems subject to hard constraints are common in time-critical applications such as autonomous driving, communications, networking, and power grid operation. However, existing iterative solvers often face difficulties in solving these problems in real-time. In this talk, we advocate a machine learning approach -- to employ NN's approximation capability to learn the input-solution mapping of a problem and then pass new input through the NN to obtain a quality solution, orders of magnitude faster than iterative solvers. To date, the approach has achieved promising empirical performance and exciting theoretical development. A fundamental issue, however, is to ensure NN solution feasibility with respect to the hard constraints, which is non-trivial due to inherent NN prediction errors. To this end, we present two approaches, predict-and-reconstruct and homeomorphic projection, to ensure NN solution strictly satisfies the equality and inequality constraints, respectively. In particular, homeomorphic projection is a low-complexity scheme to guarantee NN solution feasibility for optimization over any 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 computation-heavy SDP problems and non-convex AC-OPF problems for grid operations, show that homeomorphic projection outperforms existing methods in solution feasibility and run-time complexity, while achieving similar optimality loss. We will also discuss open problems and future directions.



  Date and Time

  Location

  Hosts

  Registration



  • Add_To_Calendar_icon Add Event to Calendar
  • 2356 Main Mall
  • Vancouver, British Columbia
  • Canada V6T1Z4
  • Building: Macleod Building
  • Room Number: 3038

  • Contact Event Host


  Speakers

Minghua

Biography:

Minghua 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 Presidential Chair Professor in School of Data Science, The Chinese University of Hong Kong, Shenzhen, and is on leave from Dept. 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 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, ACM e-Energy Best Paper Award in 2023, and Gradient AI Research Award in 2024. Coding primitives co-invented by Minghua have been incorporated into Microsoft Windows and Azure Cloud Storage, serving hundreds of millions of users. His recent research interests include online optimization and algorithms, machine learning in power system operation, intelligent transportation, distributed optimization, and delay-critical networking. He is an ACM Distinguished Scientist and an IEEE Fellow.