text:   Flow",6,"['In our new #NeurIPS2021 paper, we provide one of the first approaches to address N-k SCOPF, a core problem for the operation of power grids, at realistic scale.\n \nPaper: <LINK>\n\nJoint work with Aayushya Agarwal, @neerajssp2, @LarryPileggi, and @zicokolter\n\n1/ <LINK>', ""N-k SCOPF aims to schedule power generation in a way that is robust to k potential equipment failures. While it's become increasingly important to solve (see, e.g., recent blackout events in the UK and Texas), N-k SCOPF is in practice prohibitively expensive to solve at scale. 2/"", 'We propose a heuristic approach to address N-k SCOPF at scale. Our approach entails rewriting N-k SCOPF as a continuous minimax (attacker-defender) optimization problem, and solving it efficiently using insights from adversarial robustness and implicit layers in deep learning. 3/ https://t.co/ijpTFX8hcg', 'We use our approach to address N-3 SCOPF on a realistic-size (4622 bus) system, and show that it significantly reduces the number of feasibility violations (by a factor of 3-4x) compared to state-of-the-art baselines, while taking only 21 minutes to run on a standard laptop. 4/ https://t.co/nfCtGUoOSi', 'If you’re interested in chatting further about this work, Aayushya and I will be presenting our poster at #NeurIPS2021 on Tue, Dec 7 from 11:30am-1pm Eastern. Hope to see you there! \n\nhttps://t.co/ocgvWwJSTj \n\n5/5 https://t.co/pT3pgCiX1s', ""@nandofioretto @neerajssp2 @LarryPileggi @zicokolter Thanks! And yes, exactly :) It's a bit of a play on the name of our method, which is CAN∂Y""]",21,11,1464