paper-with-me

Papers

Reproducibility and Geometric Intrinsic Dimensionality: An Investigation on Graph Neural Network Research

2024-03-13 · Tobias Hille, Maximilian Stubbemann, Tom Hanika

Difficulties in replication and reproducibility of empirical evidences in machine learning research have become a prominent topic in recent years. Ensuring that machine learning research results are sound and reliable requires reproducibility, which verifies the reliability of research findings using the same code and data. This promotes open and accessible research, robust experimental workflows, and the rapid integration of new findings. Evaluating the degree to which research publications support these different aspects of reproducibility is one goal of the present work. For this we introduce an ontology of reproducibility in machine learning and apply it to methods for graph neural networks. Building on these efforts we turn towards another critical challenge in machine learning, namely the curse of dimensionality, which poses challenges in data collection, representation, and analysis, making it harder to find representative data and impeding the training and inference processes. Using the closely linked concept of geometric intrinsic dimension we investigate to which extend the used machine learning models are influenced by the intrinsic dimension of the data sets they are trained on.

📄 PDF Abstract BibTeX arXiv:2403.08438

Code (0)

등록된 구현이 없습니다.

Tasks

Graph Neural Network

Methods 이 논문이 사용한 방법론

Ontology 설명 없음

Similar Papers 제목 키워드 기반

Intrinsic Dimension of Geometric Data Sets

2018-01-24 · Tom Hanika, Friedrich Martin Schneider, Gerd Stumme

The curse of dimensionality is a phenomenon frequently observed in machine learning (ML) and knowledge discovery (KD). There is a large body of literature investigating its origin and impact, using methods from mathemati…

MCGI: Manifold-Consistent Graph Indexing for Billion-Scale Disk-Resident Vector Search

2026-01-05 · Dongfang Zhao arxiv

Graph-based Approximate Nearest Neighbor (ANN) search often suffers from performance degradation in high-dimensional spaces due to the Euclidean-Geodesic mismatch, where greedy routing diverges from the underlying data m…

Grassmann Graph Embedding

2021-03-08 · ICLR Workshop GTRL 2021 5 · Bingxin Zhou, Xuebin Zheng, Yu Guang Wang, Ming Li 외

Geometric deep learning that employs the geometric and topological features of data has attracted increasing attention in deep neural networks. Learning the intrinsic structure property of data is a crucial step for dime…

Dimensionality ReductionGraph Embedding

Curvature as a tool for evaluating dimensionality reduction and estimating intrinsic dimension

2025-09-16 · Charlotte Beylier, Parvaneh Joharinad, Jürgen Jost, Nahid Torbati arxiv

Utilizing recently developed abstract notions of sectional curvature, we introduce a method for constructing a curvature-based geometric profile of discrete metric spaces. The curvature concept that we use here captures …

Dimensionality Reduction

Geometric Metrics and LLMs: What They Measure and When They Work

2025-09-29 · Viacheslav Yusupov, Anna Antipina, Ameliia Alaeva, Danil Maksimov 외 arxiv

We present a systematic stress-test of geometric metrics for LLM evaluation. Rank-based geometric properties of internal representations have shown promise as reference-free quality signals, but the conditions under whic…