We study reproducing kernel Hilbert spaces (RKHS) on a Riemannian manifold. In particular, we discuss under which condition Sobolev spaces are RKHS and characterize their reproducing kernels. Further, we introduce and discuss a class of smoother RKHS that we call diffusion spaces. We illustrate the general results with…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
48 results for “reproducing-kernel Hilbert space”
The paper develops a uniform function estimator in RKHS for regression.
problem Reconstructing functions from noisy data at random locations.
method Using reproducing kernel Hilbert spaces and Gaussian random fields.
result The estimator converges uniformly to the conditional expectation.
Kernel methods are studied in a mean field limit for high-dimensional data.
problem Analyzing kernel methods in high-dimensional data with many variables.
method Investigation of kernel methods in the mean field limit of interacting particle systems.
result Rigorous mean field limit of kernels and detailed analysis of the limiting reproducing kernel Hilbert space.
The paper develops methods to handle missing data using regularized M-estimation in reproducing kernel Hilbert space.
problem Handling missing data in statistical analysis.
method Kernel ridge regression for imputation and maximum entropy method for propensity score estimation.
result The proposed methods achieve statistical consistency and asymptotic equivalence.
Subsampling reduces computational cost in supervised learning in reproducing kernel Hilbert spaces.
problem Reducing computational cost in supervised learning
method Subsampling minimizes empirical risk in reproducing kernel Hilbert spaces
result Optimal subsampling scheme revealed
This note explains when neural networks can be seen as Gaussian processes.
problem Understanding the relationship between neural networks and Gaussian processes.
method Formulating a Gaussian process regression based on neural network outputs and analyzing the resulting posterior mean functions.
result The posterior mean functions of neural networks follow a Gaussian process in certain cases, providing an interpretation of reproducing kernel Hilbert spaces.
The article analyzes LCE in Hilbert space, deriving new formulas and regularisation methods.
problem Analyzing conditional expectation in infinite-dimensional Hilbert space.
method Establishing analytical properties and regularisation for LCE in Hilbert space, deriving new formulas.
result Simple derivation and intuitive justification of conditional mean embedding formula.
This study connects Gaussian processes and RKHS, bridging two machine learning communities.
problem Understanding the relationship between Gaussian processes and RKHS.
method Examining connections and equivalences in regression, interpolation, and other topics.
result Established the equivalence between Gaussian Hilbert space and RKHS.
Paper introduces RKHM for more explicit variable structures analysis.
problem Explicitly analyzing structures among variables.
method Orthonormal systems in Hilbert -modules, RKHM.
result Theoretical and practical procedures for RKHM orthonormalization.
Stochastic Gradient Descent in Hilbert Scales: Smoothness, Preconditioning and Earlier Stoppingstat.ML
Stochastic Gradient Descent improved for various Hilbert scales and misspecified models.
problem Understanding and optimizing SGD in Hilbert scales for machine learning.
method Extending SGD analysis to Hilbert scales, including Sobolev and Diffusion spaces, and showing the effects of smoothness and preconditioning.
result Violation of smoothness assumption affects learning rate; preconditioning in Hilbert scales reduces the number of iterations for misspecified models.
Study on how sampling works for complex data functions.
problem Analyzing convergence of sampling algorithms for RKHS functions.
method Minimalistic assumptions on kernel and data, error estimates in RKHS norm, uniform convergence on compact domains.
result New convergence rates for Lipschitz and Hölder continuous kernels.
Eluder dimension and information gain are equivalent for reproducing kernel Hilbert spaces.
problem Complexity measures in bandit and reinforcement learning.
method Equivalence of eluder dimension and information gain for reproducing kernel Hilbert spaces.
result Eluder dimension and information gain are equivalent for reproducing kernel Hilbert spaces.
Efficient estimators for smooth Hilbert-valued parameters with theoretical guarantees.
problem Estimating smooth Hilbert-valued parameters with theoretical guarantees.
method Pathwise differentiable Hilbert-valued parameters, efficient influence functions, regularized one-step estimators.
result Theoretical guarantees for efficient estimators even when nuisance functions are arbitrary.
Paper characterizes embeddability of function spaces into -type RKBS via metric entropy.
problem Characterizing embeddability of function spaces into -type RKBS.
method Establishes a connection between metric entropy growth and embeddability.
result A bound on metric entropy growth allows embedding into -type RKBS.
Paper introduces RKHM and KME for richer data analysis.
problem Lack of rich data structures in kernel methods.
method Proposes RKHM and KME for functional data analysis.
result RKHM captures structural properties in functional data.
Paper proposes a method for early stopping in regression using reproducing kernels.
problem Early stopping for iterative learning algorithms in nonparametric regression.
method Data-driven rule based on minimum discrepancy principle, validated by fixed-point analysis of localized Rademacher complexities.
result The proposed rule is minimax-optimal and performs comparably to cross-validation.
The report analyzes infinite-dimensional output space regression.
problem Learning theory in vector-valued RKHS regression.
method Integral operator technique with spectral theory for non-compact operators.
result Results with minimal assumptions using Chebyshev's inequality.
We estimate Radon-Nikodym derivatives using regularization in reproducing kernel Hilbert spaces.
problem Estimating Radon-Nikodym derivatives in various applications.
method General regularization scheme in reproducing kernel Hilbert spaces.
result High order accuracy in reconstructing Radon-Nikodym derivatives at any point.
FHBI enhances generalization in Bayesian inference with iterative steps in functional spaces.
problem Improving generalization in Bayesian inference models.
method Iterative two-step procedure with adversarial and functional descent steps in a reproducing kernel Hilbert space.
result FHBI consistently outperforms nine baseline methods on the VTAB-1K benchmark.
Theoretical studies have proven that the Hilbert space has remarkable performance in many fields of applications. Frames in tensor product of Hilbert spaces were introduced to generalize the inner product to high-order tensors. However, these techniques require tensor decomposition which could lead to the loss of infor…
Optimizes learning Hilbert-Schmidt operators between Sobolev spaces.
problem Statistical limits of learning mappings between infinite-dimensional function spaces.
method Minimax optimal regularization and multilevel training.
result Multilevel kernel operator learning achieves optimal learning rate.
Regularizes -divergences with MMD to analyze Wasserstein flows.
problem Limitations of -divergences in measures' support.
method Rewriting MMD regularization as Moreau envelope in RKHS, analyzing gradients.
result Analysis of Wasserstein flows of MMD-regularized -divergences.
Study uses SGD to learn operators in Hilbert spaces with convergence analysis.
problem Learning operators in general Hilbert spaces with SGD.
method Proposes weak and strong regularity conditions for convergence analysis.
result SGD converges to best linear approximation of nonlinear operators.
We describe a method to perform functional operations on probability distributions of random variables. The method uses reproducing kernel Hilbert space representations of probability distributions, and it is applicable to all operations which can be applied to points drawn from the respective distributions. We refer t…
Develop a comprehensive theory for regularized M-estimation in reproducing kernel Hilbert spaces.
problem Regularized M-estimation in reproducing kernel Hilbert spaces
method Existence and measurability of the estimator, sharp rates of convergence
result New rates for tensor product Sobolev spaces
Study Markov chain gradient descent in Hilbert spaces for quadratic loss.
problem Approximating optimal solutions for quadratic loss functions.
method Developed a Markov chain-based stochastic gradient algorithm in Hilbert spaces.
result Established probabilistic upper bounds on convergence.
New approach to supervised learning in RKHS and vvRKHS using -algebras.
problem Traditional supervised learning in RKHS and vvRKHS.
method Generalizing supervised learning to RKHM using -algebras.
result Constructing RKHMs with enhanced representation power.
New algorithm improves dynamic mode decomposition for high-dimensional data.
problem Reduced modeling in high-dimensional spaces.
method Low rank constraint optimization and kernel-based computation.
result Gain in approximation accuracy and computational efficiency.
Study geodesics on Grassmann manifold for functions vanishing on subsets of a set X.
problem Finding minimal geodesics on Grassmann manifold of reproducing kernel Hilbert spaces.
method Analyzing necessary and sufficient conditions for geodesic existence and uniqueness, and studying examples.
result Established conditions for geodesic existence and uniqueness, and found estimates on eigenvalues.
Kernelized cumulants improve statistical analysis in high-dimensional spaces.
problem Statistical analysis in high-dimensional spaces with low variance estimators.
method Extending cumulants to RKHS using tensor algebra and kernel trick.
result Kernelized cumulants provide new all-purpose statistics with computational tractability.
This paper improves Koopman operator approximations by pruning subspaces in RKHS.
problem Improving predictive accuracy of Koopman operator approximations.
method Computes principal angles and vectors in RKHS to prune subspaces.
result Validated approach enhances Koopman operator approximations for large datasets.
We describe convolutional networks using harmonic functions.
problem Understanding the function space and smoothness of convolutional networks.
method Using reproducing kernel Hilbert spaces and functional ANOVA decomposition.
result Convolutional networks can be decomposed into a sum of elementary functions.
Kernel interpolation is inconsistent for norms with smoothness above a constant.
problem Inconsistency of kernel interpolation in reproducing kernel Hilbert spaces.
method Lower bounds for generalization error in Sobolev norms.
result Kernel interpolation is always inconsistent for norms with smoothness above a constant.
We propose a general framework for policy representation for reinforcement learning tasks. This framework involves finding a low-dimensional embedding of the policy on a reproducing kernel Hilbert space (RKHS). The usage of RKHS based methods allows us to derive strong theoretical guarantees on the expected return of t…
We study the complex geometry of generalized Kepler manifolds, defined in Jordan theoretic terms, introduce Hilbert spaces of holomorphic functions defined by radial measures, and find the complete asymptotic expansion of the corresponding reproducing kernels for Kähler potentials, both in the flat and bounded setting.
New rates for GLD and SGLD in infinite-dimensional spaces without dimensionality issues.
problem Gradient Langevin dynamics and SGLD convergence rates in high-dimensional spaces.
method Analysis of GLD and SGLD in infinite-dimensional Hilbert spaces, using stochastic differential equations and Markov chains.
result Derivation of dimension-free convergence rates for GLD and SGLD.
Estimates kernel eigenvalues for compositional dot-product kernels.
problem Improving estimates for kernel eigenvalues.
method Eigenvalue decay estimates of integral operators associated with dot-product kernels.
result Improved estimates for kernel volumes in reproducing kernel Hilbert spaces.
The paper develops divergences for Gaussian processes and RKHS settings.
problem Estimating divergences in infinite-dimensional spaces.
method Formulations of Alpha Log-Det divergences, continuity in norm, laws of large numbers, consistent estimation from finite samples.
result Infinite-dimensional divergences can be estimated from finite-dimensional versions with dimension-independent sample complexities.
We introduce a novel data-driven order reduction method for nonlinear control systems, drawing on recent progress in machine learning and statistical dimensionality reduction. The method rests on the assumption that the nonlinear system behaves linearly when lifted into a high (or infinite) dimensional feature space wh…
New method simplifies tomographic reconstruction using RKHS.
problem Tomographic reconstruction challenges.
method RKHS framework for X-ray transform.
result Sharp stability results without Fourier transform.
Ridge regression performs optimally in noisy environments with heavy-tailed distributions.
problem Performance of ridge regression in noisy environments with heavy-tailed noise.
method Established excess risk bounds using integral operator framework and Fuk-Nagaev inequality.
result Ridge regression achieves optimal convergence rates under heavy-tailed noise, demonstrating robustness.
New method transfers emotions in facial images.
problem Transforming facial images to different emotions.
method Infinite task learning and vector-valued reproducing kernel Hilbert spaces.
result Achieves low reconstruction cost and high emotion classification accuracy.
Novel RKHS approach solves complex financial model equations.
problem Calibrating singular local stochastic volatility models.
method Reproducing Kernel Hilbert Space (RKHS) regularization.
result Regularized model is well-posed and replicates option prices.
We present an embedding of stochastic optimal control problems, of the so called path integral form, into reproducing kernel Hilbert spaces. Using consistent, sample based estimates of the embedding leads to a model free, non-parametric approach for calculation of an approximate solution to the control problem. This fo…
This work defines a new function space for multi-layer neural networks.
problem Characterizing the function space of multi-layer neural networks.
method Defining a neural Hilbert ladder (NHL) as an infinite union of reproducing kernel Hilbert spaces (RKHSs).
result Established theoretical properties of the new function space, including generalization guarantees and dynamics of random fields.
Kernel VICReg improves SSL in RKHS, capturing nonlinear structures.
problem Limited ability of existing SSL methods to handle nonlinear dependencies.
method Kernel VICReg framework in RKHS, kernelizing VICReg objectives.
result Kernel VICReg mitigates representational collapse and improves performance.
Abstract perspective on quadratic programming for optimal portfolio allocation.
problem Optimal allocation problems in long portfolio theory.
method Using maximum principles and distinguished boundaries in reproducing kernel Hilbert spaces.
result Support of an optimal distribution lies in a variety intersecting a distinguished boundary.
ROCK: A variational formulation for occupation kernel methods in Reproducing Kernel Hilbert Spacesstat.ML
ROCK method generalizes MOCK for learning dynamical systems efficiently.
problem Learning dynamical systems from data efficiently.
method Variational formulation in Reproducing Kernel Hilbert Spaces.
result ROCK method is more computationally efficient and performs better on benchmarks.