Learning Efficiency Meets Symmetry Breaking

• URL: http://arxiv.org/abs/2504.19738v1
• Date: Mon, 28 Apr 2025 12:33:39 GMT
• Title: Learning Efficiency Meets Symmetry Breaking
• Authors: Yingbin Bai, Sylvie Thiebaux, Felipe Trevizan,
• Abstract summary: We introduce a graph representation of planning problems allying learning efficiency with the ability to detect symmetries, along with two pruning methods.<n>The integration of these techniques into Fast Downward achieves a first-time success over LAMA on the latest IPC learning track dataset.
• Score: 2.6140850422934063
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Learning-based planners leveraging Graph Neural Networks can learn search guidance applicable to large search spaces, yet their potential to address symmetries remains largely unexplored. In this paper, we introduce a graph representation of planning problems allying learning efficiency with the ability to detect symmetries, along with two pruning methods, action pruning and state pruning, designed to manage symmetries during search. The integration of these techniques into Fast Downward achieves a first-time success over LAMA on the latest IPC learning track dataset. Code is released at: https://github.com/bybeye/Distincter.

Related papers

• Scalable Deep Metric Learning on Attributed Graphs [10.092560681589578]
  We develop a graph embedding method, which is based on extending deep metric and unbiased contrastive learning techniques. Based on a multi-classt loss function, we present two algorithms -- DMT for semi-supervised learning and DMAT-i for the unsupervised case.
  arXiv  Detail & Related papers  (2024-11-20T03:34:31Z)
• Can Graph Learning Improve Planning in LLM-based Agents? [61.47027387839096]
  Task planning in language agents is emerging as an important research topic alongside the development of large language models (LLMs) In this paper, we explore graph learning-based methods for task planning, a direction that is to the prevalent focus on prompt design. Our interest in graph learning stems from a theoretical discovery: the biases of attention and auto-regressive loss impede LLMs' ability to effectively navigate decision-making on graphs.
  arXiv  Detail & Related papers  (2024-05-29T14:26:24Z)
• SimTeG: A Frustratingly Simple Approach Improves Textual Graph Learning [131.04781590452308]
  We present SimTeG, a frustratingly Simple approach for Textual Graph learning. We first perform supervised parameter-efficient fine-tuning (PEFT) on a pre-trained LM on the downstream task. We then generate node embeddings using the last hidden states of finetuned LM.
  arXiv  Detail & Related papers  (2023-08-03T07:00:04Z)
• Efficiently Learning the Graph for Semi-supervised Learning [4.518012967046983]
  We show how to learn the best graphs from the sparse families efficiently using the conjugate gradient method. Our approach can also be used to learn the graph efficiently online with sub-linear regret, under mild smoothness assumptions. We implement our approach and demonstrate significant ($sim$10-100x) speedups over prior work on semi-supervised learning with learned graphs on benchmark datasets.
  arXiv  Detail & Related papers  (2023-06-12T13:22:06Z)
• LieGG: Studying Learned Lie Group Generators [1.5293427903448025]
  Symmetries built into a neural network have appeared to be very beneficial for a wide range of tasks as it saves the data to learn them. We present a method to extract symmetries learned by a neural network and to evaluate the degree to which a network is invariant to them.
  arXiv  Detail & Related papers  (2022-10-09T20:42:37Z)
• Silver-Bullet-3D at ManiSkill 2021: Learning-from-Demonstrations and Heuristic Rule-based Methods for Object Manipulation [118.27432851053335]
  This paper presents an overview and comparative analysis of our systems designed for the following two tracks in SAPIEN ManiSkill Challenge 2021: No Interaction Track. The No Interaction track targets for learning policies from pre-collected demonstration trajectories. In this track, we design a Heuristic Rule-based Method (HRM) to trigger high-quality object manipulation by decomposing the task into a series of sub-tasks. For each sub-task, the simple rule-based controlling strategies are adopted to predict actions that can be applied to robotic arms.
  arXiv  Detail & Related papers  (2022-06-13T16:20:42Z)
• SetMargin Loss applied to Deep Keystroke Biometrics with Circle Packing Interpretation [67.0845003374569]
  This work presents a new deep learning approach for keystroke biometrics based on a novel Distance Metric Learning method (DML) We prove experimentally the effectiveness of the proposed approach on a challenging task: keystroke biometric identification over a large set of 78,000 subjects.
  arXiv  Detail & Related papers  (2021-09-02T13:26:57Z)
• Improving exploration in policy gradient search: Application to symbolic optimization [6.344988093245026]
  Many machine learning strategies leverage neural networks to search large spaces of mathematical symbols. In contrast to traditional evolutionary approaches, using a neural network at the core of the search allows learning higher-level symbolic patterns. We show that these techniques can improve the performance, increase sample efficiency, and lower the complexity of solutions for the task of symbolic regression.
  arXiv  Detail & Related papers  (2021-07-19T21:11:07Z)
• Symmetric Spaces for Graph Embeddings: A Finsler-Riemannian Approach [7.752212921476838]
  We propose the systematic use of symmetric spaces in representation learning, a class encompassing many of the previously used embedding targets. We develop a tool to analyze the embeddings and infer structural properties of the data sets. Our approach outperforms competitive baselines for graph reconstruction tasks on various synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2021-06-09T09:33:33Z)
• Learnable Graph Matching: Incorporating Graph Partitioning with Deep Feature Learning for Multiple Object Tracking [58.30147362745852]
  Data association across frames is at the core of Multiple Object Tracking (MOT) task. Existing methods mostly ignore the context information among tracklets and intra-frame detections. We propose a novel learnable graph matching method to address these issues.
  arXiv  Detail & Related papers  (2021-03-30T08:58:45Z)
• Learning to Hash with Graph Neural Networks for Recommender Systems [103.82479899868191]
  Graph representation learning has attracted much attention in supporting high quality candidate search at scale. Despite its effectiveness in learning embedding vectors for objects in the user-item interaction network, the computational costs to infer users' preferences in continuous embedding space are tremendous. We propose a simple yet effective discrete representation learning framework to jointly learn continuous and discrete codes.
  arXiv  Detail & Related papers  (2020-03-04T06:59:56Z)

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.