arXiv:2503.23598cs.AIcs.CV2025-03ICLR

让AI像人一样创造视觉谜题,还能高效解题。

GenVP: Generating Visual Puzzles with Contrastive Hierarchical VAEs

  • 用对比分层变分自编码器生成视觉谜题
  • 在22个分布外场景中表现优于现有方法
  • 可基于抽象规则生成完整新谜题,适合推理研究

瑞文渐进矩阵(RPMs)是检验高层次抽象视觉推理(AVR)的经典基准。尽管当前算法在解题上已取得进展,但人类能超越已有谜题并根据规则创造新题,而机器仍局限于从固定列表中求解。我们提出生成式视觉谜题(GenVP),建模整个RPM生成过程,任务难度显著提升。模型能力涵盖为单一题干生成多个解法,以及基于目标规则生成完整新谜题。在五个不同数据集上的实验表明,GenVP在解题准确率和22种分布外(OOD)泛化能力上均达到当前最优。相比现有生成方法在可行解空间扩大时表现下降,GenVP能有效泛化至复杂场景。此外,模型通过捕捉抽象规则与视觉对象属性间的关联,成功生成多样化的完整RPM。

原文摘要 · Abstract (English)

Raven's Progressive Matrices (RPMs) is an established benchmark to examine the ability to perform high-level abstract visual reasoning (AVR). Despite the current success of algorithms that solve this task, humans can generalize beyond a given puzzle and create new puzzles given a set of rules, whereas machines remain locked in solving a fixed puzzle from a curated choice list. We propose Generative Visual Puzzles (GenVP), a framework to model the entire RPM generation process, a substantially more challenging task. Our model's capability spans from generating multiple solutions for one specific problem prompt to creating complete new puzzles out of the desired set of rules. Experiments on five different datasets indicate that GenVP achieves state-of-the-art (SOTA) performance both in puzzle-solving accuracy and out-of-distribution (OOD) generalization in 22 OOD scenarios. Compared to SOTA generative approaches, which struggle to solve RPMs when the feasible solution space increases, GenVP efficiently generalizes to these challenging setups. Moreover, our model demonstrates the ability to produce a wide range of complete RPMs given a set of abstract rules by effectively capturing the relationships between abstract rules and visual object properties.

视觉推理生成模型抽象思维规则生成

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。