Pith. sign in

REVIEW 1 cited by

Learning Generalizable Models for Vehicle Routing Problems via Knowledge Distillation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2210.07686 v2 pith:SVUYKCY5 submitted 2022-10-14 cs.LG cs.AI

classification cs.LGcs.AI
keywords amdkdknowledgedistillationmodelsadaptivedeepdistributionsgeneralizable
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recent neural methods for vehicle routing problems always train and test the deep models on the same instance distribution (i.e., uniform). To tackle the consequent cross-distribution generalization concerns, we bring the knowledge distillation to this field and propose an Adaptive Multi-Distribution Knowledge Distillation (AMDKD) scheme for learning more generalizable deep models. Particularly, our AMDKD leverages various knowledge from multiple teachers trained on exemplar distributions to yield a light-weight yet generalist student model. Meanwhile, we equip AMDKD with an adaptive strategy that allows the student to concentrate on difficult distributions, so as to absorb hard-to-master knowledge more effectively. Extensive experimental results show that, compared with the baseline neural methods, our AMDKD is able to achieve competitive results on both unseen in-distribution and out-of-distribution instances, which are either randomly synthesized or adopted from benchmark datasets (i.e., TSPLIB and CVRPLIB). Notably, our AMDKD is generic, and consumes less computational resources for inference.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On Distributional Dependent Performance of Classical and Neural Routing Solvers

    cs.LG 2025-08 conditional novelty 6.0 of 10

    Training neural routing solvers on subsamples of a fixed base node distribution narrows or reverses the performance gap to classical OR meta-heuristics on several TSP and CVRP benchmarks.

Pith tools