- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper proposes MeCuCo, a scalable framework for local mean-curvature estimation on high-dimensional data manifolds, aiming to address the prohibitive computational cost of existing curvature estimators in high-dimensional settings. The method first derives an exact algebraic reformulation that reduces the dominant complexity of the original estimator from to without introducing approximation error. It then further exploits the inherent low-rank structure of local covariance matrices when , replacing full eigendecomposition with truncated SVD and analytically approximating the covariance null-space contribution, thereby reducing the practical complexity to . Experiments on more than 40 publicly available OpenML datasets show that MeCuCo substantially improves computational efficiency while largely preserving the numerical values and ranking structure of the original curvature estimates, and remains feasible in very high-dimensional regimes where the original method becomes impractical. Overall, the main contribution of the work is to turn high-dimensional local curvature estimation from a computationally expensive procedure into a more scalable geometric primitive, potentially facilitating its use in geometry-aware machine learning applications.
Critical strengths
The paper presents a mathematically motivated and non-trivial computational reformulation.Rather than relying on implementation-level acceleration, the proposed method first derives an exact algebraic reformulation of the existing local mean-curvature estimator, reducing the dominant computational complexity from to without introducing approximation error. It further exploits the low-rank structure of local covariance matrices and introduces an analytical treatment of the null-space contribution, which provides a principled way to improve scalability in high-dimensional settings.
The proposed method achieves substantial computational gains while preserving the curvature estimates with high fidelity. The experimental results show that MeCuCo can significantly reduce the computational cost of curvature estimation while maintaining very strong agreement with the original estimator. In particular, the reported rank correlations and normalized errors suggest that the relative geometric structure of the curvature scores is largely preserved. This provides encouraging empirical evidence that the proposed acceleration does not substantially compromise the information captured by the original formulation.
The experimental evaluation covers a relatively broad range of high-dimensional datasets and provides useful evidence of scalability. The paper evaluates the proposed method on more than 40 publicly available OpenML datasets with diverse sample sizes, feature dimensions, and geometric characteristics, and further considers datasets with ambient dimensionalities ranging up to tens of thousands. This relatively broad evaluation helps demonstrate the practical scalability of the method, particularly in regimes where the computational cost of the original estimator becomes prohibitive.
Critical weaknesses
The experimental comparison is mainly conducted against the original MCBP estimator, which is sufficient to demonstrate the computational benefits of MeCuCo over its direct predecessor. However, this comparison does not fully establish the position of MeCuCo within the broader literature on scalable curvature estimation and local geometric analysis.
The paper evaluates MeCuCo on a relatively large collection of datasets, which is a strength in terms of empirical coverage. However, most experiments focus on two aspects: computational runtime and agreement with the original curvature estimator. As a result, the evaluation provides limited insight into when and why the approximation may succeed or fail.
The complexity analysis mainly focuses on the per-point curvature estimation stage, where FAST mode reduces the cost to . However, the complete pipeline also requires nearest-neighbor search, local neighborhood construction, repeated SVD computations, and tensor contractions over all samples. In large-scale and high-dimensional datasets, these additional operations may become non-negligible and could affect the practical scalability of the overall framework.
The paper positions MeCuCo as a scalable geometric primitive that could benefit representation learning, clustering, anomaly detection, active learning, graph learning, and related geometry-aware ML tasks. However, the current experiments focus almost entirely on computational efficiency and agreement with the original curvature estimator, without demonstrating whether the estimated curvature actually improves any downstream learning task. Therefore, the broader claim regarding the practical utility of MeCuCo for machine learning remains insufficiently supported by the current experimental evidence.
Questions for authors
Could the authors clarify how MeCuCo compares with other efficient curvature estimators, local-PCA-based geometric descriptors, or Weingarten-map-based approaches in terms of both computational efficiency and estimation quality? Such a comparison would help assess whether MeCuCo offers advantages beyond accelerating its direct predecessor, MCBP.
Could the authors provide more insight into the conditions under which the FAST approximation remains reliable or begins to degrade? In particular, how sensitive is the method to neighborhood size, noise level, local anisotropy, effective rank, or high-curvature regions?
Could the authors clarify the end-to-end computational and memory costs when nearest-neighbor search, neighborhood construction, repeated SVD computations, and tensor operations are all included? This would help determine whether the claimed scalability still holds at the level of the complete pipeline.
Could the authors provide evidence that the curvature estimated by MeCuCo leads to measurable improvements in at least one representative downstream task? The answer to this question would materially affect my assessment of the broader machine-learning impact of the work.
Thank you for your thorough review and for the time and effort you put into your comments and questions. We appreciate your acknowledgment of the mathematical motivation behind the exact reformulation, the fidelity of the curvature estimates, and the breadth of the empirical evaluation. We are working on the paper and will implement any pertinent improvements in the revision.