Learning to Solve Compositional Geometry Routing Problems

• URL: http://arxiv.org/abs/2605.18094v1
• Date: Mon, 18 May 2026 09:10:15 GMT
• Title: Learning to Solve Compositional Geometry Routing Problems
• Abstract summary: DiCon is a plug-and-play framework that tackles the compositional Geometry Routing Problem.<n>We introduce a differential attention mechanism that actively suppresses the probability mass on less competitive candidate actions.<n>We design a double-level contrastive learning objective to promote robust global instance representations.
• Score: 10.585067212969987
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Vision-Assisted Foundation Model for Solving Multi-Task Vehicle Routing Problems [68.42726166302654]
  Multi-task vehicle routing problems play a critical role in enhancing efficiency across various industries and service sectors.<n>Existing solvers solely utilize a graph-based modality, limiting their ability to address variants with multiple constraints.<n>We propose a vision-assisted foundation model (VaFM) to address these challenges.
  arXiv  Detail & Related papers  (2026-06-09T05:15:25Z)
• MViewRouter: Internalizing Geometric Equivariance via Multi-view Alternating Attention for Combinatorial Routing [15.591644835298213]
  MView is a multi-view framework that internalizes geometric symmetries as a structural inductive bias to achieve indecision across routing problem variants.<n>Our approach introduces a Multi-view Alternating Attention (MAA) mechanism that enables parallel processing over the $D_4$ symmetry group.<n> Experiments on TSP and CVRP benchmarks, as well as real-world TSPLIB instances, demonstrate that MView achieves competitive solution quality and strong zero-shot generalization.
  arXiv  Detail & Related papers  (2026-05-31T08:09:02Z)
• Ego to World: Collaborative Spatial Reasoning in Embodied Systems via Reinforcement Learning [61.753025885751036]
  We introduce the Ego-to-World benchmark, which evaluates a vision-language model's ability to fuse heterogeneous viewpoints across three tasks.<n>We propose CoRL, a two-stage framework that combines Chain-of-Thought supervised fine-tuning with reinforcement learning.<n>We show that CoRL consistently surpasses strong proprietary and open-source baselines on both reasoning and perception-grounding metrics.
  arXiv  Detail & Related papers  (2026-03-16T04:27:53Z)
• Multi-Agent DRL for V2X Resource Allocation: Disentangling Challenges and Benchmarking Solutions [51.22818149833102]
  Multi-agent reinforcement learning (MARL) has emerged as a promising approach for radio resource allocation in vehicle-to-everything (C-V2X) networks.<n>However, the multifaceted challenges inherent to MARL are often intertwined, making it difficult to understand their individual impact on performance in vehicular environments.<n>We bridge this gap by formulating C-V2X RRA as a sequence of multi-agent interference games with progressively increasing complexity.
  arXiv  Detail & Related papers  (2026-02-18T14:46:56Z)
• Dense Semantic Matching with VGGT Prior [49.42199006453071]
  We propose an approach that retains VGGT's intrinsic strengths by reusing early feature stages, fine-tuning later ones, and adding a semantic head for bidirectional correspondences.<n>Our approach achieves superior geometry awareness, matching reliability, and manifold preservation, outperforming previous baselines.
  arXiv  Detail & Related papers  (2025-09-25T14:56:11Z)
• Dynamic Contrastive Learning for Hierarchical Retrieval: A Case Study of Distance-Aware Cross-View Geo-Localization [20.868592923432843]
  Existing deep learning-based cross-view geo-localization methods primarily focus on improving the accuracy of cross-domain image matching.<n>We propose Dynamic Contrastive Learning (DyCL), a novel framework that progressively aligns feature representations according to hierarchical spatial margins.
  arXiv  Detail & Related papers  (2025-06-29T03:57:01Z)
• Reframing Dense Action Detection (RefDense): A Paradigm Shift in Problem Solving & a Novel Optimization Strategy [23.100602876056165]
  We argue that handling the dual challenge of temporal and class overlaps is too complex to be tackled by a single network.<n>We propose to decompose the task of detecting dense ambiguous actions into detecting dense unambiguous sub-concepts.<n>Our experiments demonstrate the superiority of our approach over state-of-the-art methods.
  arXiv  Detail & Related papers  (2025-01-30T17:20:42Z)
• A GREAT Architecture for Edge-Based Graph Problems Like TSP [10.48061333321108]
  We propose a novel GNN-based and edge-focused neural model called Graph Edge Attention Network (GREAT)<n>Using GREAT as an encoder to capture the properties of a routing problem instance, we build a reinforcement learning framework.<n>Our framework is among the first to tackle non-Euclidean variants of these problems and competitive results among learning-based benchmarks.
  arXiv  Detail & Related papers  (2024-08-29T17:07:43Z)
• GASE: Graph Attention Sampling with Edges Fusion for Solving Vehicle Routing Problems [6.084414764415137]
  We propose an adaptive Graph Attention Sampling with the Edges Fusion framework to solve vehicle routing problems. Our proposed model outperforms the existing methods by 2.08%-6.23% and shows stronger generalization ability.
  arXiv  Detail & Related papers  (2024-05-21T03:33:07Z)
• Towards Deeply Unified Depth-aware Panoptic Segmentation with Bi-directional Guidance Learning [63.63516124646916]
  We propose a deeply unified framework for depth-aware panoptic segmentation. We propose a bi-directional guidance learning approach to facilitate cross-task feature learning. Our method sets the new state of the art for depth-aware panoptic segmentation on both Cityscapes-DVPS and SemKITTI-DVPS datasets.
  arXiv  Detail & Related papers  (2023-07-27T11:28:33Z)
• Dual Contrastive Learning for General Face Forgery Detection [64.41970626226221]
  We propose a novel face forgery detection framework, named Dual Contrastive Learning (DCL), which constructs positive and negative paired data. To explore the essential discrepancies, Intra-Instance Contrastive Learning (Intra-ICL) is introduced to focus on the local content inconsistencies prevalent in the forged faces.
  arXiv  Detail & Related papers  (2021-12-27T05:44:40Z)
• Few-shot Partial Multi-view Learning [103.33865779721458]
  We propose a new task called few-shot partial multi-view learning. It focuses on overcoming the negative impact of the view-missing issue in the low-data regime. We conduct extensive experiments to evaluate our method.
  arXiv  Detail & Related papers  (2021-05-05T13:34:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.