The real-life data have a complex and non-linear structure due to their nature. These non-linearities and the large number of features can usually cause problems such as the empty-space phenomenon and the well-known curse of dimensionality. Finding the nearly optimal representation of the dataset in a lower-dimensional space (i.e. dimensionality reduction) offers an applicable mechanism for improving the success of machine learning tasks. However, estimating the required data dimension for the nearly optimal representation (intrinsic dimension) can be very costly, particularly if one deals with big data. We propose a highly efficient and robust intrinsic dimension estimation approach that only relies on matrix-vector products for dimensionality reduction methods. An experimental study is also conducted to compare the performance of proposed method with state of the art approaches.
View on arXiv@article{özçoban2025_2503.09485,
title={ A Novel Approach for Intrinsic Dimension Estimation },
author={ Kadir Özçoban and Murat Manguoğlu and Emrullah Fatih Yetkin },
journal={arXiv preprint arXiv:2503.09485},
year={ 2025 }
}