Cover Image

Towards Non-Euclidean Foundation Models: Advancing AI Beyond Euclidean Frameworks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yang, Menglin, Zhang, Yifei, Chen, Jialin, Weber, Melanie, Ying, Rex
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Position: Beyond Euclidean -- Foundation Models Should Embrace Non-Euclidean Geometries
by: He, Neil, et al.
Published: (2025)

Topolow: Force-Directed Euclidean Embedding of Dissimilarity Data with Robustness Against Non-Metricity and Sparsity
by: Arhami, Omid, et al.
Published: (2025)

Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness
by: Smith, Chandler, et al.
Published: (2025)

Metricizing the Euclidean Space towards Desired Distance Relations in Point Clouds
by: Rass, Stefan, et al.
Published: (2022)

Euclidean Embedding of Data Using Local Distances
by: Arabadjis, Dimitris
Published: (2026)

HyperCore: The Core Framework for Building Hyperbolic Foundation Models with Comprehensive Modules
by: He, Neil, et al.
Published: (2025)

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation
by: Greenhut, Daniel, et al.
Published: (2025)

Non-Euclidean Erdős-Anning Theorems
by: Eppstein, David
Published: (2024)

Universal Collection of Euclidean Invariants between Pairs of Position-Orientations
by: Bellaard, Gijs, et al.
Published: (2025)

On a Geometry of Interbrain Networks
by: Hinrichs, Nicolás, et al.
Published: (2025)

Optimal Euclidean Tree Covers
by: Chang, Hsien-Chih, et al.
Published: (2024)

Searching in Euclidean Spaces with Predictions
by: Cabello, Sergio, et al.
Published: (2024)

Euclidean TSP in Narrow Strips
by: Alkema, Henk, et al.
Published: (2020)

Towards Instance-Optimal Euclidean Spanners
by: Le, Hung, et al.
Published: (2024)

Approximating Gromov-Hausdorff Distance in Euclidean Space
by: Majhi, Sushovan, et al.
Published: (2019)

Hyperbolic Deep Learning for Foundation Models: A Survey
by: He, Neil, et al.
Published: (2025)

Non-Euclidean Self-Organizing Maps
by: Celińska-Kopczyńska, Dorota, et al.
Published: (2021)

Covering the Euclidean Plane by a Pair of Trees
by: Le, Hung, et al.
Published: (2025)

Hardness of Learning Neural Networks under the Manifold Hypothesis
by: Kiani, Bobak T., et al.
Published: (2024)

Low-Rank Adaptation for Foundation Models: A Comprehensive Review
by: Yang, Menglin, et al.
Published: (2024)

Multipacking in Euclidean Metric Space
by: Das, Arun Kumar, et al.
Published: (2024)

Autoformalizing Euclidean Geometry
by: Murphy, Logan, et al.
Published: (2024)

Lorentzian Residual Neural Networks
by: He, Neil, et al.
Published: (2024)

The Euclidean $k$-Matching Problem is NP-hard
by: Díaz-Báñez, José-Miguel, et al.
Published: (2025)

Embedding Graphs as Euclidean kNN-Graphs
by: Schibler, T., et al.
Published: (2025)

Tree covers of size $2$ for the Euclidean plane
by: Bikeev, Artur, et al.
Published: (2025)

Near-Optimal Euclidean Locality-Sensitive Orderings
by: Gao, Zhimeng, et al.
Published: (2023)

Continuum Limits of Ollivier's Ricci Curvature on data clouds: pointwise consistency and global lower bounds
by: Trillos, Nicolas Garcia, et al.
Published: (2023)

Approximating Euclidean Shallow-Light Trees
by: Le, Hung, et al.
Published: (2025)

Sparse Spectral Training and Inference on Euclidean and Hyperbolic Neural Networks
by: Zhao, Jialin, et al.
Published: (2024)

Space Complexity of Euclidean Clustering
by: Zhu, Xiaoyi, et al.
Published: (2024)

Euclidean Noncrossing Steiner Spanners of Nearly Optimal Sparsity
by: Bhore, Sujoy, et al.
Published: (2026)

Non-Euclidean Triangle Centers
by: Russell, Robert A.
Published: (2016)

Minimum Enclosing Ball Synthetic Minority Oversampling Technique from a Geometric Perspective
by: Shangguan, Yi-Yang, et al.
Published: (2024)

Calibrating Deep Neural Network using Euclidean Distance
by: Liang, Wenhao, et al.
Published: (2024)

Ironing the Graphs: Toward a Correct Geometric Analysis of Large-Scale Graphs
by: Naama, Saloua, et al.
Published: (2024)

Solving Euclidean Problems by Isotropic Initialization
by: Yorov, Khusrav, et al.
Published: (2025)

Euclidean k-center Fair Clusterings
by: Moritaka, Ayano, et al.
Published: (2025)

Neural Feature Geometry Evolves as Discrete Ricci Flow
by: Hehl, Moritz, et al.
Published: (2025)

Vietoris--Rips Shadow for Euclidean Graph Reconstruction
by: Komendarczyk, Rafal, et al.
Published: (2025)