HGCN2SP: Hierarchical Graph Convolutional Network for Two-Stage Stochastic Programming
Two-stage Stochastic Programming (2SP) is a standard framework for modeling decision-making problems under uncertainty. While numerous methods exist, solving such problems with many scenarios remains challenging. Selecting representative scenarios is a practical method for accelerating solutions. However, current approaches typically rely on clustering or Monte Carlo sampling, failing to integrate scenario information deeply and overlooking the significant impact of the scenario order on solving time. To address these issues, we develop HGCN2SP, a novel model with a hierarchical graph designed for 2SP problems, encoding each scenario and modeling their relationships hierarchically. The model is trained in a reinforcement learning paradigm to utilize the feedback of the solver. The policy network is equipped with a hierarchical graph convolutional network for feature encoding and an attention-based decoder for scenario selection in proper order. Evaluation of two classic 2SP problems demonstrates that HGCN2SP provides high-quality decisions in a short computational time. Furthermore, HGCN2SP exhibits remarkable generalization capabilities in handling large-scale instances, even with a substantial number of variables or scenarios that were unseen during the training phase.
Code (0)
등록된 구현이 없습니다.
Tasks
Reinforcement LearningSimilar Papers 제목 키워드 기반
DeepHGCN: Toward Deeper Hyperbolic Graph Convolutional Networks
Hyperbolic graph convolutional networks (HGCNs) have demonstrated significant potential in extracting information from hierarchical graphs. However, existing HGCNs are limited to shallow architectures due to the computat…
Computational EfficiencyLink PredictionNode ClassificationResidual Hyperbolic Graph Convolution Networks
Hyperbolic graph convolutional networks (HGCNs) have demonstrated representational capabilities of modeling hierarchical-structured graphs. However, as in general GCNs, over-smoothing may occur as the number of model lay…
Hyperbolic Graph Convolutional Neural Networks
Graph convolutional neural networks (GCNs) embed nodes in a graph into Euclidean space, which has been shown to incur a large distortion when embedding real-world graphs with scale-free or hierarchical structure. Hyperbo…
Link PredictionNode ClassificationBrain-HGCN: A Hyperbolic Graph Convolutional Network for Brain Functional Network Analysis
Functional magnetic resonance imaging (fMRI) reveals complex brain functional networks with hierarchical topologies crucial for cognitive processing. Standard Euclidean Graph Neural Networks (GNNs) often struggle to repr…
Multi-Channel Graph Convolutional Networks
Graph neural networks (GNN) has been demonstrated to be effective in classifying graph structures. To further improve the graph representation learning ability, hierarchical GNN has been explored. It leverages the differ…
ClusteringGraph ClassificationGraph Representation LearningRepresentation Learning