Self-Improving Neural-Guided Pruning: A Graph Neural Network Framework for Scalable Mixed Bundle Pricing
Mixed bundle pricing is a classic revenue management problem arising in industries such as e-commerce, tourism, and video games. It refers to designing product combinations (i.e., bundles) and determining their prices to maximize expected profit. Exact mixed bundling models capture this structure but become computationally intractable because the number of candidate bundles grows exponentially with the number of products. We develop a graph neural network (GNN)-guided pruning-then-optimization framework for bundle pricing with (non-)additive valuations. The method represents each instance as a compact segment-product graph, predicts segment-product inclusion probabilities, and accordingly prunes the exponential bundle space into a small candidate family; the final prices and bundle offerings are obtained by solving the mixed bundling formulation over the retained bundles, possibly refined by a GNN-guided local search. Because exact labels are available only at small scales, we further propose an iterative self-improvement procedure: the current GNN policies generate high-quality solutions on large-scale instances, which serve as near-optimal labels for training a stronger model at larger scales. Theoretically, we show that under mild conditions the proposed edge-output GNN class is expressive enough to represent the optimal product-assignment mapping, justifying the edge-level learning target. Numerical experiments show that the fastest proposed policy delivers 13-21% higher profit than bundle-size pricing on instances with up to 100 products at about 2% of its runtime.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph Neural NetworkSimilar Papers 제목 키워드 기반
STAR: Stage-Wise Attention-Guided Token Reduction for Efficient Large Vision-Language Models Inference
Although large vision-language models (LVLMs) leverage rich visual token representations to achieve strong performance on multimodal tasks, these tokens also introduce significant computational overhead during inference.…
Token ReductionSobolev--Ricci Curvature
Ricci curvature is a fundamental concept in differential geometry for encoding local geometric structure, and its graph-based analogues have recently gained prominence as practical tools for reweighting, pruning, and res…
CoReDiT: Spatial Coherence-Guided Token Pruning and Reconstruction for Efficient Diffusion Transformers
Diffusion Transformers (DiTs) deliver remarkable image and video generation quality but incur high computational cost, limiting scalability and on-device deployment. We introduce CoReDiT, a structured token pruning frame…
Video GenerationReLaGS: Relational Language Gaussian Splatting
Achieving unified 3D perception and reasoning across tasks such as segmentation, retrieval, and relation understanding remains challenging, as existing methods are either object-centric or rely on costly training for int…
Scene Graph GenerationRelational ReasoningGraph Neural NetworkGuiding Evolutionary AutoEncoder Training with Activation-Based Pruning Operators
This study explores a novel approach to neural network pruning using evolutionary computation, focusing on simultaneously pruning the encoder and decoder of an autoencoder. We introduce two new mutation operators that us…
DecoderNetwork Pruning