提出DiCon框架,解决复杂几何路由问题的表示与决策挑战
Learning to Solve Compositional Geometry Routing Problems

- 用可微注意力抑制低效路径选择,动态聚焦候选动作
- 双层对比学习增强全局表征与几何任务感知能力
- 在多种混合几何任务中展现强泛化与广泛适用性
我们研究组合几何路由问题(CGRP),这是一个涵盖仅点、仅线、仅面及任意混合任务几何的统一类别,为真实世界路由场景提供广泛抽象。不同于传统点对点路由,含非点任务的CGRP具有内在不对称性、与路径紧密耦合的旅行路线,并在动作空间中引入大量可行但常无关的选项,给表示学习与决策带来重大挑战。为此,我们提出DiCon——一种基于可微注意力与对比学习的即插即用求解器,从两个互补角度应对问题:首先引入可微注意力机制,主动抑制次优候选动作的概率质量;其次设计双层对比学习目标,促进鲁棒的全局实例表征并正则化几何感知的任务表征。大量实验表明,DiCon在不同组合构成的CGRP实例上均实现优异性能、广泛适应性与卓越泛化能力。
原文摘要 · Abstract (English)
We study the Compositional Geometry Routing Problem (CGRP), a unified superclass of traditional routing problems that covers point-only, line-only, area-only, and arbitrary hybrid task geometries, providing a broad abstraction for real-world routing scenarios. Beyond standard point-based routing, CGRP with non-point tasks can be inherently asymmetric, tightly coupled travel routes with the intrinsic path, and enlarges the action space with numerous feasible yet often irrelevant options, thereby posing significant challenges for both representation learning and decision-making. To address these challenges, we propose DiCon, a differential attention-assisted solver with contrastive learning, as a plug-and-play framework that tackles the problem from two complementary angles. First, we introduce a differential attention mechanism that actively suppresses the probability mass on less competitive candidate actions. Second, we design a double-level contrastive learning objective to promote robust global instance representations and regularize geometry-aware task representations. Extensive experiments demonstrate that DiCon achieves strong performance, broad versatility, and superior generalization across diverse CGRP instances with different compositions.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。