Hard Constraints Without Full Rework: AT-SKM-Net Accelerates Dynamic Graph Correction
TL;DR for operators A learned optimizer can propose an answer quickly and still be too slow to deploy if every proposal requires expensive hard-constraint correction before use. In dynamic infrastructure, that correction must be repeated as loads, topology, or operating conditions change. AT-SKM-Net attacks the correction cost rather than removing the correction step. On the IEEE 300-bus benchmark, its full AT-SKM-AC configuration reduces reported SKM-layer time from 8.992 ms for T-SKM-Net to 1.233 ms, a 7.29x speedup, while both corrected methods report zero equality and inequality violations at the paper’s stated tolerance. ...