跳到正文
arXiv cs.AI· Jo\~{a}o Pedro Gandarela, Thiago Rios, Stefan Menzel, Andr\'{e} Freitas·· 14 小时前AI 评分29

Assur-KB:用可复用约束子组件提升机构设计学习效率

Efficient Learning of Mechanism Designs and Compositionality

AI 导读

Assur-KB 通过不可约模块、边界接口与求解依赖来表示平面机构,并保留源几何信息,在 50-10,000 个机构的训练预算下,其派生特征相比扁平邻接与位置输入的样本效率几何平均提升 1.8 倍。

正文 · 原文

View PDF HTML (experimental)

Abstract:Learning mechanism behaviour requires a representation of how connected parts jointly constrain motion. We study whether exposing reusable constraint subassemblies improves prediction from limited data. Assur-KB represents planar mechanisms through irreducible modules, boundary interfaces, and solve dependencies while retaining source geometry. Our theoretical results characterize transfer through module interfaces and establish physical limits arising from missing interface information and accumulated sensitivity. To test the representation claim directly, the experimental design compares matched mechanism-curve pairs across training budgets within the same multilayer-perceptron family. This controlled comparison establishes the utility of the complete representation in the evaluated learning setting. Assur-derived features provide a geometric-mean $1.8\times$ advantage in sample efficiency over flattened adjacency and position inputs across budgets of 50-10,000 mechanisms. Separate experiments establish invariance under tested joint relabelings, higher valid-generation rates under dyadic composition, and a coarser structural index over 10.02 million mechanisms. In summary, the theory and experiments identify how physical constraint structure supports limited-data prediction and which interface conditions govern compositional reuse.
Subjects: Artificial Intelligence (cs.AI); Computational Engineering, Finance, and Science (cs.CE)
Cite as: arXiv:2610.40005 [cs.AI]
  (or arXiv:2610.40005v1 [cs.AI] for this version)
  https://doi.org/10.48550/arXiv.2610.40005

arXiv-issued DOI via DataCite

Submission history

From: João Pedro Gandarela [view email]
[v1] Thu, 29 Oct 2026 13:23:44 UTC (806 KB)

来源:arXiv cs.AI · arxiv.org