- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper studies large-scale multi-market promotion optimization. The formulation includes nonlinear demand, discontinuous coupon tiers, budget and subsidy constraints, cross-market consistency, etc. The authors propose a primal-dual method, an adaptive large-neighborhood search method, and an optional LLM-based hyperparameter configurator. The authors evaluate their work via synthetic offline experiments.
Critical strengths
I think the industrial problem is potentially interesting, and the focus on finding feasible solutions under a strict time budget is practically relevant.
Critical weaknesses
I found the paper very difficult to read. A lot of the used notation and terminology is not explained or explained insufficiently, the main algorithms are absent from the main text, and the theoretical novelty is unclear. The paper is not well-positioned against the existing literature. Given the lack of strong theoretical results, the empirical evaluation looks relatively weak to me as well: the authors rely entirely on synthetic data, provide a narrow set of baselines.
Questions for authors
A lot of notation and terminology is introduced without adequate definitions. For example, in Section 2 the authors say that R_i is an “active market”, what exactly “active” means? How is it different from a regular (or non-active) market? Coupon “tiers” are never formally defined; the “demand scale” is not clearly explained (Section 2), how is it different from the standard demand? The definitions of Xi, X, and S also require the reader to reconstruct the feasible set from several later paragraphs; the terms such as “global group-order edge” are introduced without motivation or any explanation.
More importantly, the paper does not seem to be self-contained. Specifically, it repeatedly refers to Algorithms 1–3, but the actual pseudocode is not present in the main text of the paper. Since the primal-dual procedure and LNS method are the main contributions, concise versions of these algorithms should appear in the main text. A notation table and a small running example would also substantially improve readability.
I feel a lot of text of the paper is AI-generated and might have never been proof-read. For instance, even in the Abstract the authors say “Gurobi finds an incumbent on 33.” What is “33” here? Also, the main text of the paper includes the names of the programming variables that the authors used in the code implementation of their approach (such as the term “CODE” in Section 2). Those are never used later in the paper and do not improve clarity but may rather obstruct understanding of the paper.
The paper does not clearly distinguish standard consequences of Lagrangian relaxation from new results. Theorem 1 states that the Lagrangian separates product-wise after the aggregate constraints are dualized, which appears to follow directly from the formulation. Similarly, Theorem 3 uses the standard fact that a convex function over a box attains its maximum at a corner. I’d suggest to the authors to explain precisely what is novel and how it relates to existing methods.
Importantly, I think the related work section is highly insufficient, and it is not clear how the paper contributes to what is already known. The authors should contrast their method with the existing budget optimization methods such as Buchbinder et al., “Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue”, Mehta et. al., “AdWords and Generalized Online Matching”, Feldman et. al, “Online Stochastic Packing Applied to Display Ad Allocation”, etc. There are also a large number of works considering incentives in budget management systems which I would expect the authors to address as well, e.g., Balseiro et. al., “Repeated Auctions with Budgets in Ad Exchanges: Approximations and Design” etc. For each claimed contribution, the authors should explain what prior methods already provide, why they are insufficient, and which exact technical component is new. Without this it is difficult to understand what the main contributions of the author’s paper are.
I also think that the evaluation section can be significantly improved. To start with, all reported instances seem to be synthetic. The main benchmark contains 72 instances, generally only three instances per family and problem size which feels like a toy problem for modern e-commerce platforms. Also, I could not find an evaluation on public data, or actual promotion campaigns. The authors should explain how the generator was calibrated, which real-data statistics it reproduces, and what “held-out” means for manually designed synthetic families. The baseline comparison is also narrow. Gurobi is the primary external baseline, while most other comparisons are small internal ablations. I couldn’t find any comparisons with other existing methods (see my comments about the related work above).