Two architectures of neural networks in distance approximation
Year: 2025
Type: article
Abstract: In this research paper, we examine recurrent and linear neural networks to determine the relationship between the amount of data needed to achieve generalization and data dimensionality, as well as the relationship between data dimensionality and the necessary computational complexity. To achieve this, we also explore the optimal topologies for each network, discuss potential problems in their training, and propose solutions. In our experiments, the relation- ship between the amount of data needed to achieve generalization and data dimensionality was linear for feed-forward neural networks and exponential for recurrent ones. However, the required computational complexity appears to grow exponentially with increasing dimensionality. We also compared the networks’ accuracy in both distance approxima- tion and classification to the most popular alternative, siamese networks, which outperformed both linear and recurrent networks in classification despite having lower accuracy in exact distance approximation.
Authors: Wojtyna, Wiktor, Sławiński, Jarosław, Tonga, Radosław
Institution: Gdańsk University of Technology
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W6908736463
FWCI:
Cites:
Cited by:
Related to: