Koopman Subspace Pruning in Reproducing Kernel Hilbert Spaces via Principal Vectors

• URL: http://arxiv.org/abs/2604.01459v1
• Date: Wed, 01 Apr 2026 23:13:13 GMT
• Title: Koopman Subspace Pruning in Reproducing Kernel Hilbert Spaces via Principal Vectors
• Abstract summary: This paper presents an approach for computing principal angles and vectors to enable Koopman subspace pruning within a Reproducing Kernel Hilbert Space (RKHS) geometry.<n>We first outline an exact computational routine, which is subsequently scaled for large datasets using randomized Nystrom approximations.<n>Based on these foundations, we introduce the Kernel-SPV and Approximate Kernel-SPV algorithms for targeted subspace refinement via principal vectors.
• Score: 5.373672902884401
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Data-driven approximations of the infinite-dimensional Koopman operator rely on finite-dimensional projections, where the predictive accuracy of the resulting models hinges heavily on the invariance of the chosen subspace. Subspace pruning systematically discards geometrically misaligned directions to enhance this invariance proximity, which formally corresponds to the largest principal angle between the subspace and its image under the operator. Yet, existing techniques are largely restricted to Euclidean settings. To bridge this gap, this paper presents an approach for computing principal angles and vectors to enable Koopman subspace pruning within a Reproducing Kernel Hilbert Space (RKHS) geometry. We first outline an exact computational routine, which is subsequently scaled for large datasets using randomized Nystrom approximations. Based on these foundations, we introduce the Kernel-SPV and Approximate Kernel-SPV algorithms for targeted subspace refinement via principal vectors. Simulation results validate our approach.

Related papers

• Random features for Grassmannian kernel approximation with bounded rank-one projections [5.3340963304980535]
  We propose a family of random feature maps for scalable kernel machines on low-dimensional subspaces.<n>We show that inner products in the random feature space approximate well-defined rotation-invariant Grassmannian kernels.<n>Experiments on synthetic data and ETH-80 classification tasks show that these features accurately preserve Grassmannian geometry while reducing computation, memory, and storage.
  arXiv  Detail & Related papers  (2026-08-04T21:02:15Z)
• Dimension Reduction for Curves: Simplified and Generalized [56.23281156053955]
  We revisit random projections for reducing the dimension of high-dimensional polygonal curves.<n>We give a simplified proof of the known $O(varepsilon-2log(nm))$ bound on the target dimension of a random projection.<n>Our proof is based on the concept of sparse oblivious subspace embeddings.
  arXiv  Detail & Related papers  (2026-07-03T08:48:35Z)
• Dynamic Regret for Online Regression in RKHS via Discounted VAW and Subspace Approximation [0.0]
  We study online regression with the square loss in a kernel reproducing a Hilbert space under a dynamic regret criterion.<n>The proposed method transfers the finite-dimensional discounted Vovk--Azoury--Warmuth approach of Jacobsen & Cutkosky (2024) to the RKHS setting.
  arXiv  Detail & Related papers  (2026-04-27T21:53:54Z)
• The Kernel Manifold: A Geometric Approach to Gaussian Process Model Selection [0.8536502059643899]
  We present a Bayesian optimization framework built on kernel-of- Kernels geometry.<n>A multidimensional scaling (MDS) embedding maps a discrete kernel library into a continuous Euclidean manifold, enabling smooth BO.<n>We demonstrate the approach on synthetic benchmarks, real-world time-series datasets, and an additive manufacturing case study.
  arXiv  Detail & Related papers  (2026-01-08T20:52:53Z)
• Robust Tangent Space Estimation via Laplacian Eigenvector Gradient Orthogonalization [48.25304391127552]
  Estimating the tangent spaces of a data manifold is a fundamental problem in data analysis.<n>We propose a method, Laplacian Eigenvector Gradient Orthogonalization (LEGO), that utilizes the global structure of the data to guide local tangent space estimation.
  arXiv  Detail & Related papers  (2025-10-02T17:59:45Z)
• Enforcing Latent Euclidean Geometry in Single-Cell VAEs for Manifold Interpolation [79.27003481818413]
  We introduce FlatVI, a training framework that regularises the latent manifold of discrete-likelihood variational autoencoders towards Euclidean geometry.<n>By encouraging straight lines in the latent space to approximate geodesics on the decoded single-cell manifold, FlatVI enhances compatibility with downstream approaches.
  arXiv  Detail & Related papers  (2025-07-15T23:08:14Z)
• Adapting Projection-Based Reduced-Order Models using Projected Gaussian Process [5.492716202049269]
  We propose a Projected Gaussian Process (pGP) to learn a mapping from the parameter space to the Grassmann manifold that contains the optimal subspaces.<n>As a statistical learning approach, the proposed pGP allows us to optimally estimate (or tune) the model parameters from data and quantify the statistical uncertainty associated with the prediction.
  arXiv  Detail & Related papers  (2024-10-18T00:02:43Z)
• Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation [52.73824786627612]
  This paper establishes new convergence results for textitgeodesic strongly monotone games.<n>Our key result shows that RGD attains last-iterate linear convergence in a textitgeometry-agnostic fashion.<n>Overall, this paper presents the first geometry-agnostic last-iterate convergence analysis for games beyond the Euclidean settings.
  arXiv  Detail & Related papers  (2023-06-29T01:20:44Z)
• A Convex Hull Cheapest Insertion Heuristic for the Non-Euclidean TSP [0.0]
  This paper uses multidimensional scaling to first project the points from a non-Euclidean space into a Euclidean space, enabling the generation of a convex hull that initializes the algorithm. To evaluate the proposed algorithm, non-Euclidean spaces are created by adding separators to the TSPLIB data-set, or by using the L1 norm as a metric.
  arXiv  Detail & Related papers  (2023-02-05T13:56:19Z)
• First-Order Algorithms for Min-Max Optimization in Geodesic Metric Spaces [93.35384756718868]
  min-max algorithms have been analyzed in the Euclidean setting. We prove that the extraiteient (RCEG) method corrected lastrate convergence at a linear rate.
  arXiv  Detail & Related papers  (2022-06-04T18:53:44Z)
• Experimental Design for Linear Functionals in Reproducing Kernel Hilbert Spaces [102.08678737900541]
  We provide algorithms for constructing bias-aware designs for linear functionals. We derive non-asymptotic confidence sets for fixed and adaptive designs under sub-Gaussian noise.
  arXiv  Detail & Related papers  (2022-05-26T20:56:25Z)
• Nystr\"om Kernel Mean Embeddings [92.10208929236826]
  We propose an efficient approximation procedure based on the Nystr"om method. It yields sufficient conditions on the subsample size to obtain the standard $n-1/2$ rate. We discuss applications of this result for the approximation of the maximum mean discrepancy and quadrature rules.
  arXiv  Detail & Related papers  (2022-01-31T08:26:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.