NeuroRisk is a physics-informed deep unrolled optimizer for risk-aware traffic engineering that achieves small optimality gaps and 100-100000x speedup over solvers while outperforming neural baselines on throughput.
Title resolution pending
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
verdicts
UNVERDICTED 6roles
method 1polarities
use method 1representative citing papers
Stochastic integer optimization has sample complexity that matches, undercuts, or exceeds the continuous case based on objective structure, with new tight bounds for nonconvex continuous problems.
Unsupervised GNN model learns local updates for approximate MaxIS on dynamic graphs, achieving competitive ratios on 200-1000 node instances and 1.00-1.18x larger solutions than other unsupervised models when generalizing to 100x larger graphs.
An LLM acting as real-time controller for SIMP topology optimization parameters outperforms fixed schedules and heuristics, delivering 5.7-18.1% lower compliance on 2D and 3D benchmarks.
QARMA applies transformer-augmented reinforcement learning to qubit allocation and reuse in modular quantum systems, reporting up to 86% average reduction in inter-core communications versus optimized Qiskit baselines.
Middle-mile logistics is cast as a multi-object goal-conditioned MDP and solved by combining graph neural networks with model-free RL via extraction of small feature graphs.
citing papers explorer
-
NeuroRisk: Physics-Informed Neural Optimization for Risk-Aware Traffic Engineering
NeuroRisk is a physics-informed deep unrolled optimizer for risk-aware traffic engineering that achieves small optimality gaps and 100-100000x speedup over solvers while outperforming neural baselines on throughput.
-
Sample Complexity of Stochastic Optimization with Integer Variables
Stochastic integer optimization has sample complexity that matches, undercuts, or exceeds the continuous case based on objective structure, with new tight bounds for nonconvex continuous problems.
-
Unsupervised Learning of Local Updates for Maximum Independent Set in Dynamic Graphs
Unsupervised GNN model learns local updates for approximate MaxIS on dynamic graphs, achieving competitive ratios on 200-1000 node instances and 1.00-1.18x larger solutions than other unsupervised models when generalizing to 100x larger graphs.
-
Large Language Models as Optimization Controllers: Adaptive Continuation for SIMP Topology Optimization
An LLM acting as real-time controller for SIMP topology optimization parameters outperforms fixed schedules and heuristics, delivering 5.7-18.1% lower compliance on 2D and 3D benchmarks.
-
Learning-Optimized Qubit Mapping and Reuse to Minimize Inter-Core Communication in Modular Quantum Architectures
QARMA applies transformer-augmented reinforcement learning to qubit allocation and reuse in modular quantum systems, reporting up to 86% average reduction in inter-core communications versus optimized Qiskit baselines.
-
Middle-mile logistics through the lens of goal-conditioned reinforcement learning
Middle-mile logistics is cast as a multi-object goal-conditioned MDP and solved by combining graph neural networks with model-free RL via extraction of small feature graphs.