Numerical Considerations for the Construction of Karhunen-Loève Expansions

• URL: http://arxiv.org/abs/2603.19108v1
• Date: Thu, 19 Mar 2026 16:34:46 GMT
• Title: Numerical Considerations for the Construction of Karhunen-Loève Expansions
• Abstract summary: This report examines numerical aspects of constructing Karhunen-Love expansions (KLEs) for second-order processes.<n>We derive the algebraic equivalence between this Fredholm-based eigensolution and the singular value decomposition of the weight-scaled sample matrix.<n>The convergence of SVD-based eigenvalue estimates and of the empirical distributions of the KL coefficients to their theoretical $mathcalN(0,1)$ target are characterized as a function of sample count.
• Score: 0.6015898117103069
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This report examines numerical aspects of constructing Karhunen-Loève expansions (KLEs) for second-order stochastic processes. The KLE relies on the spectral decomposition of the covariance operator via the Fredholm integral equation of the second kind, which is then discretized on a computational grid, leading to an eigendecomposition task. We derive the algebraic equivalence between this Fredholm-based eigensolution and the singular value decomposition of the weight-scaled sample matrix, yielding consistent solutions for both model-based and data-driven KLE construction. Analytical eigensolutions for exponential and squared-exponential covariance kernels serve as reference benchmarks to assess numerical consistency and accuracy in 1D settings. The convergence of SVD-based eigenvalue estimates and of the empirical distributions of the KL coefficients to their theoretical $\mathcal{N}(0,1)$ target are characterized as a function of sample count. Higher-dimensional configurations include a two-dimensional irregular domain discretized by unstructured triangular meshes with two refinement levels, and a three-dimensional toroidal domain whose non-simply-connected topology motivates a comparison between Euclidean and shortest interior path distances between the grid points. The numerical results highlight the interplay between the discretization strategy, quadrature rule, and sample count, and their impact on the KLE results.

Related papers

• Regularized Variational and Spectral Log-Density-Ratio Estimation in the Gaussian Location Model [0.554780083433538]
  We study ridge-regularized log-density-ratio estimation in the Gaussian location model.<n>The variational estimator is the empirical Kullback-Leibler (KL) log-normalized fit with a squared L2-penalty on its nonconstant coefficient.
  arXiv  Detail & Related papers  (2026-07-02T08:46:52Z)
• Analysis of Critical Points in a Permutation Model on Hierarchical Lattices by Real-Space Renormalization Group [0.688204255655161]
  We investigate the ferromagnetic-paramagnetic phase transition of the permutation model.<n>We compare the results with the duality prediction based on the Fourier transform of the symmetric group.<n>The comparison supports the duality-based estimate while also clarifying the systematic uncertainty associated with the extrapolation formula.
  arXiv  Detail & Related papers  (2026-05-25T10:39:41Z)
• Intrinsic Wasserstein Rates for Score-Based Generative Models on Smooth Manifolds [61.14405512940818]
  We show that Score-based generative models are trained in high-dimensional ambient spaces.<n>We use a ReLU implementation of nearest-projection coordinates via finite intrinsic anchors and Gauss Newton.
  arXiv  Detail & Related papers  (2026-05-15T10:20:05Z)
• Analysis of Hessian Scaling for Local and Global Costs in Variational Quantum Algorithm [0.42970700836450487]
  We quantify the entrywise resolvability of the Hessian for Variational Quantum Algorithms.<n>We show two distinct scaling regimes that govern the sample complexity required to resolve Hessian entries against shot noise.
  arXiv  Detail & Related papers  (2026-01-31T15:49:23Z)
• An Elementary Approach to Scheduling in Generative Diffusion Models [55.171367482496755]
  An elementary approach to characterizing the impact of noise scheduling and time discretization in generative diffusion models is developed.<n> Experiments across different datasets and pretrained models demonstrate that the time discretization strategy selected by our approach consistently outperforms baseline and search-based strategies.
  arXiv  Detail & Related papers  (2026-01-20T05:06:26Z)
• A Linear Combination of Unitaries Decomposition for the Laplace Operator [0.0]
  We provide novel linear combination of unitaries decompositions for a class of discrete elliptic differential operators.<n>The number of unitary terms required for our decomposition is independent of the number of grid points used in the discretization.<n>Explicit circuit constructions for each unitary are given and their complexities analyzed.
  arXiv  Detail & Related papers  (2026-01-10T00:54:39Z)
• Efficient Covariance Estimation for Sparsified Functional Data [51.69796254617083]
  proposed Random-knots (Random-knots-Spatial) and B-spline (Bspline-Spatial) estimators of the covariance function are computationally efficient.<n>Asymptotic pointwise of the covariance are obtained for sparsified individual trajectories under some regularity conditions.
  arXiv  Detail & Related papers  (2025-11-23T00:50:33Z)
• Wasserstein Bounds for generative diffusion models with Gaussian tail targets [1.540806558564153]
  We present an estimate of the Wasserstein distance between the data distribution and the generation of score-based generative models.<n>We assume a Gaussian-type tail behavior of the data distribution and an $epsilon$-accurate approximation of the score.
  arXiv  Detail & Related papers  (2024-12-15T17:20:42Z)
• Convergence of Score-Based Discrete Diffusion Models: A Discrete-Time Analysis [56.442307356162864]
  We study the theoretical aspects of score-based discrete diffusion models under the Continuous Time Markov Chain (CTMC) framework.<n>We introduce a discrete-time sampling algorithm in the general state space $[S]d$ that utilizes score estimators at predefined time points.<n>Our convergence analysis employs a Girsanov-based method and establishes key properties of the discrete score function.
  arXiv  Detail & Related papers  (2024-10-03T09:07:13Z)
• Sampling and estimation on manifolds using the Langevin diffusion [45.57801520690309]
  Two estimators of linear functionals of $mu_phi $ based on the discretized Markov process are considered.<n>Error bounds are derived for sampling and estimation using a discretization of an intrinsically defined Langevin diffusion.
  arXiv  Detail & Related papers  (2023-12-22T18:01:11Z)
• Reinforcement Learning from Partial Observation: Linear Function Approximation with Provable Sample Efficiency [111.83670279016599]
  We study reinforcement learning for partially observed decision processes (POMDPs) with infinite observation and state spaces. We make the first attempt at partial observability and function approximation for a class of POMDPs with a linear structure.
  arXiv  Detail & Related papers  (2022-04-20T21:15:38Z)
• Asymptotic Causal Inference [6.489113969363787]
  We investigate causal inference in the regime as the number of variables approaches infinity using an information-theoretic framework. We define structural entropy of a causal model in terms of its description complexity measured by the logarithmic growth rate. We generalize a recently popular bipartite experimental design for studying causal inference on large datasets.
  arXiv  Detail & Related papers  (2021-09-20T16:16:00Z)
• EiGLasso for Scalable Sparse Kronecker-Sum Inverse Covariance Estimation [1.370633147306388]
  We introduce EiGLasso, a highly scalable method for sparse Kronecker-sum inverse covariance estimation. We show that EiGLasso achieves two to three orders-of-magnitude speed-up compared to the existing methods.
  arXiv  Detail & Related papers  (2021-05-20T16:22:50Z)
• Semiparametric Nonlinear Bipartite Graph Representation Learning with Provable Guarantees [106.91654068632882]
  We consider the bipartite graph and formalize its representation learning problem as a statistical estimation problem of parameters in a semiparametric exponential family distribution. We show that the proposed objective is strongly convex in a neighborhood around the ground truth, so that a gradient descent-based method achieves linear convergence rate. Our estimator is robust to any model misspecification within the exponential family, which is validated in extensive experiments.
  arXiv  Detail & Related papers  (2020-03-02T16:40:36Z)

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.