All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Geometric Reasoning in the Embedding Space

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F25%3A00387606" target="_blank" >RIV/68407700:21730/25:00387606 - isvavai.cz</a>

  • Alternative codes found

    RIV/61988987:17610/25:A2603BLJ

  • Result on the web

    <a href="https://doi.org/10.3390/make7030093" target="_blank" >https://doi.org/10.3390/make7030093</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.3390/make7030093" target="_blank" >10.3390/make7030093</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Geometric Reasoning in the Embedding Space

  • Original language description

    While neural networks can solve complex geometric problems, as demonstrated by systems like AlphaGeometry, we have limited understanding of how they internally represent and reason about spatial relationships. In this work, we investigate how neural networks develop internal spatial understanding by training Graph Neural Networks and Transformers to predict point positions on a discrete 2D grid from geometric constraints that describe hidden figures. We show that both models develop interpretable internal representations that mirror the geometric structure of the problems they solve. Specifically, we observe that point embeddings self-organize into 2D grid structures during training, and during inference, the models iteratively construct the hidden geometric figures within their embedding spaces. Our analysis reveals how reasoning complexity correlates with prediction accuracy, and shows that models solve constraints through an iterative refinement process, which might resemble continuous optimization. We also find that Graph Neural Networks prove more suitable than Transformers for this type of structured constraint reasoning and scale more effectively to larger problems. These findings provide initial insights into how neural networks can develop structured understanding and contribute to their interpretability.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2025

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Machine Learning and Knowledge Extraction

  • ISSN

    2504-4990

  • e-ISSN

    2504-4990

  • Volume of the periodical

    7

  • Issue of the periodical within the volume

    3

  • Country of publishing house

    CH - SWITZERLAND

  • Number of pages

    34

  • Pages from-to

  • UT code for WoS article

    001580457600001

  • EID of the result in the Scopus database

    2-s2.0-105017425258