Learning the Analytic Geometry of Transformations to Achieve Efficient Computation (2506.11990v2)

Abstract: We propose a novel framework for fast integral operations by uncovering hidden geometries in the row and column structures of the underlying operators. This is accomplished through an iterative procedure that constructs adaptive hierarchical partition trees, revealing latent multiscale organization and exposing local low-rank structures within the data. Guided by this geometry, we employ two complementary techniques: (1) the \emph{butterfly algorithm}, which exploits the learned hierarchical low-rank structure; and (2) \emph{adaptive best tilings} in both space and frequency using all levels of the generalized Haar--Walsh wavelet packet tree. These techniques enable efficient matrix factorization and multiplication. Unlike classical approaches that rely on prior knowledge of the underlying geometry, our method is fully data-driven and applicable to matrices arising from irregular or unknown distributions. We demonstrate the effectiveness of our approach on matrices associated with acoustic heterogeneous potential operators and families of orthogonal polynomials. The resulting compressed representations reduce storage complexity from $\mathcal{O}(N^2)$ to $\mathcal{O}(N \log N)$, enabling fast computation and scalable implementation.