GridSFM is a 15‑million‑parameter physics‑inspired graph neural network that serves as a foundation model for solving AC Optimal Power Flow (AC‑OPF) across diverse grid topologies. Pretrained on 54 topologies ranging from 500 to 4,000 buses, it achieves a 2.45 % zero‑shot generation‑cost error on a held‑out 10,000‑bus case and adapts to unseen grids with only 100 solved instances using a physics‑informed fine‑tuning scheme based on Newton’s method. The authors address the disconnected feasible set of AC‑OPF by lifting and relaxing constraints with logarithmically penalized slacks, proving the resulting elastic feasible set is contractible and that solutions can be projected back onto the original feasible set.
By Luke Bhan, Weiwei Yang, Margaret Capetz, Baosen Zhang
The paper studies how to allocate a fixed computational budget across the denoising steps of diffusion models to improve sample quality at deployment. It shows that the expected benefit of evaluating multiple candidates at a step can be decomposed into a step‑specific sensitivity and a universal sample‑size factor, and that the optimal allocation follows a water‑filling structure. Experiments demonstrate that this allocation achieves the same quality as a uniform strategy while reducing function evaluations by 20–50%.
By Yuan Cao, Yifu Tang, Hangqi Li, Zeyu Zheng
arXiv:2608. 13212v1 Announce Type: new Abstract: Networked systems, from power grids to traffic networks and cloud clusters, carry loads across nodes with limited capacity.
By Orkun Irsoy, Leman Akoglu, Osman Yagan
arXiv:2605. 01928v2 Announce Type: replace Abstract: We optimize losses that jump: spiking thresholds, quantized layers, and discrete routing put jumps in the forward pass, where backpropagation does not apply.
By An T. Le
arXiv:2610.01980v1 Announce Type: cross
Abstract: Decision-focused learning for linear optimization is complicated by the discontinuity of the optimizer, where small cost errors may leave the decisio...
By Konstantinos Ziliaskopoulos, Alexander Vinel, Alice E. Smith
The paper introduces Budget-First Tariff Recommendation (BFTR), an algorithmic framework that offers telecom plans without overcharging by aligning final prices with catalog reference prices. BFTR incorporates eight Budget-First strategies, including two novel hybrid approaches—Recursive Hybrid and Knapsack-First Hybrid— and mathematically proves that a suitable offer exists for any positive budget with zero surcharge for non‑interpolated strategies. Experiments on a Nigerian MTN‑inspired dataset show that all strategies achieve zero overcharging, with Recursive Hybrid delivering optimal customer utility and Piecewise maximizing volume, while maintaining sub‑10 ms execution times.
By Ghislain Dorian Tchuente Mondjo
arXiv:2606. 01764v1 Announce Type: cross Abstract: We revisit the convergence guarantees of the Extragradient (EG) method for unconstrained biaffine min-max optimization.
By Yue Wu, Weiqiang Zheng, Yang Cai, Haipeng Luo
arXiv:2605. 02965v2 Announce Type: replace Abstract: Artificial intelligence-generated content (AIGC) has emerged as a transformative paradigm for automating the creation of diverse and customized content, giving rise to rapidly growing computational workloads in cloud data centers.
By Yang Fu, Peng Qin, Liming Chen, Zihao Zhang, Hao Yu, Yifei Wang
The paper presents a framework that links data‑center electricity demand growth, available generation capacity, and market‑clearing prices to explain rising electricity costs. It first uses a deterministic model to show how varying demand and supply growth estimates influence prices, then extends to stochastic processes that generate probabilistic distributions for supply, demand, and prices. Finally, it formulates generation expansion as a stochastic control problem, illustrating how uncertainties in load forecasts, development risks, and potential overbuilding can dampen investment incentives needed to stabilize prices.
By Alexander Crosier, Kyle Onghai, Ronnie Sircar
Large traveling salesman problem (TSP) instances require a solver to allocate limited computation while preserving the validity of its outputs. Existing neural--operations-research (OR) hybrids predict guidance without requiring learned transitions to satisfy constraints discovered during search.
arXiv:2607. 26710v1 Announce Type: new Abstract: The rapid growth of AI workloads is turning data centers into large-scale, volatile, yet spatiotemporally flexible grid loads, creating an urgent need for coordinated electricity-computing scheduling.
By Kaiwen Jiang, Siya Xu, Ziyue Zhu, Chao Yang, Anh Tuan Luu, Haoran Luo
arXiv:2607. 12241v1 Announce Type: cross Abstract: Machine-learned surrogates for the AC power flow (ACPF) problem amortize the cost of repeated solves on a fixed network, but lose one to two orders of magnitude of accuracy when a line outage changes the topology.
By Ayushi Jolotia, Parikshit Pareek