- Rating
- 3
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper mainly focuses on the direction of multi-objective learning in combinatorial optimization. In specifics, it focuses on the multi-task training of different kinds of VRPs in a unified model. They further provide a tokenization mechanism for processing different kinds of the constraints in the VRP family. Extensive experiments validated their proposed model's utility and effectivenss. Also, one section regarding to the ablation stuidies of tokenization mechanism also demonstrates how their tokenization behaves compared to other choices.
Critical strengths
-
The motivation is clear. The paper mainly generalizes the current single-task training paradigm into the multi-task training. This is a step towards the more challenging and general setting.
-
The writing of this paper is very easy to be followed.
-
The experiments are complete, like the main comparisons with the baselines. Also, they include one ablation study for comparing the effectiveness of the proposed tokenization mechanism with other choices.
Critical weaknesses
-
The framework figure seems not to be the vector figure (when I enlarge it, it seems to degrade the resoluton a lot). I suggest replacing current one with the one drawed in PPT/Latex platform so that the produced figure will be in the vector format.
-
Based on my knowledge of tokenization, this module should also handle the unseen constraint types. However, your current formulation seems to be restricted in the given constraint types. I am worrying whether this mechanism can be used for handling the types that are not seen in the training stage. For instance, in the paper of Router-Finder, they also have one extra constraint type called "Mixed-Backhauls", which is not covered in the training stage.
-
As far as I know, the MVMoE's repo also implements quite similar mechanism like CONSTRAINT ACTIVATION SIGNATURE in your paper. They also use 1 and 0 to indicate whether the current constraint type exists. So I think you should somehow cite this from MVMoE.
Questions for authors
Will the tokenization mechanism affect your model's generalization ability to the unseen constraint types? If your model meets one unseen type of constraint, how will it handle the case?
3 comments
Response to Reviewer vnwi (2/2): Unseen Constraint Compositions and Unseen Constraint Types
Q — Does the tokenization affect the model's generalization to unseen constraint types, and how would it handle such a type if it met one? Two cases need to be distinguished.
(a) Unseen combinations of the five constraint types. This case is supported and is what we evaluate: a single policy trained on six variants is applied zero-shot to the remaining ten at and and, with size-agnostic training, at , where the size-agnostic model attains the best average Gap among the compared multi-task solvers (%). The reason is visible in the token construction: a bit of does only two things — it selects or and indexes — so an unseen combination is expressed as a new composition of learned parts rather than as an unseen task-level signature.
(b) A genuinely new constraint type. We are explicit that the current interface is a five-dimensional signature and therefore cannot address a sixth constraint type. A variant that merely relaxes the semantics of an existing constraint (e.g. RouteFinder's Mixed-Backhauls, which still falls under the backhaul bit) remains expressible; a constraint without a bit does not. This is an interface choice rather than an architectural limitation, and the decoupling keeps the extension as small as it can be:
- one identity row, no new state parameters: a new type changes from to (that is parameters), while and are reused unchanged, because they were never tied to a particular constraint identity; the learned notion of "applies / does not apply" therefore transfers to a constraint never seen;
- architecture unchanged: the token construction and the sequence length are untouched, so the encoder, the decoder and the decoder-side expert layer need no modification;
- feasibility is enforced by masks, not by tokens: infeasible moves receive from the feasibility mask, which the environment constructs deterministically from the constraint definition. A new type therefore needs its mask logic — as for any neural solver — while the token only tells the policy which problem it faces. This separation is also why zero-shot solutions on unseen combinations remain feasible by construction;
- contrast with the raw-vector design: enlarging a signature that is consumed as a feature changes the input dimension of its embedding layer, and the new entry carries no learned meaning at initialization, on top of the bit-pattern binding discussed above.
We would like to be transparent about the scope of this evidence: we have not trained on a constraint type outside the five bits, so our answer here is structural rather than empirical. We nevertheless hope the above shows why the tokenization does not reduce the model's ability to generalize, and how a genuinely new constraint type would be accommodated.
These added responses and experimetns address my concerns. The authors also admit their weakness and limitaitons. I think this is ok. I maintain my score. But I still suggest that authos should pursue how to generalize current paradigms into unseen constraint types, this is a more promising direction.
Response to Reviewer vnwi (1/2): Vector Figure, Relation to MVMoE, and a Tokenization Ablation
We sincerely thank the reviewer for the careful reading and for the three concrete suggestions, which we address one by one.
W1 — the framework figure should be a vector figure. We agree and apologize for the raster version in the submitted PDF. Fig. 1 has been redrawn as a genuine vector graphic (compiled from SVG through LaTeX) and replaced by that version in the updated PDF, where it stays sharp at any zoom level and at print size.
W3 — relation to the binary constraint vector in the MVMoE codebase. We agree that the credit is due, and MVMoE's paper together with its official repository will be cited explicitly in the revised version. The relation is as follows. The released MVMoE implementation accompanies each variant with a binary vector over the same five constraint types (capacity, open route, backhaul, route-length limit, time window), threaded through the code as an optional conditioning input, e.g. for the problem-level gating path. Our signature aτ=[aτC,aτO,aτB,aτL,aτTW]∈0,15 follows the same convention, so the common ground is exactly as the reviewer describes. The difference lies in how the vector is consumed:
Ablation for this point (run for this response). We tested the two designs experimentally. Besides DCAST, whose token is defined above, we trained (i) a direct-signature variant, which appends the single token
zτdir=Wsaτ+bs
instead of the five factorized tokens (encoder input length n+3 instead of n+7), and (ii) a per-constraint-state variant, which replaces the shared states by ten per-constraint states and keeps decoupling but removes cross-constraint sharing:
Estate=sk,0,sk,1k∈C,O,B,L,TW∈R5×2×d,zτk=Wz[ek,∣,sk,aτk]+bz
All three are trained identically and evaluated on the 16 variants at n=50:
DCAST is best in aggregate and the most consistent (best or tied-best on 12 of the 16 variants, versus 2 and 3 for the two variants above), while the direct-signature variant is the closest counterpart of consuming the 0/1 vector as a feature. Hence neither the raw vector nor per-constraint states improve over the factorized tokens with shared states.