Research
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,742 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Sep 199319922001200920172026
48 results for kernel operator

Develops a framework for learning nonlinear operators using Mercer kernels.

problem Learning nonlinear operators between infinite-dimensional spaces.
method Stochastic approximation framework with Mercer operator-valued kernels.
result Establishes dimension-free polynomial convergence rates for nonlinear operator learning.

Kernel Dynamic Mode Decomposition reconstructs dynamical systems using Laplacian kernel.

problem Reconstructing spatial-temporal dynamics of complex systems.
method Kernel Dynamic Mode Decomposition with Laplacian kernel.
result Laplacian kernel allows for the closability of Koopman operators in RKHS, enabling reconstruction.

Positive definite operator-valued kernels generalize the well-known notion of reproducing kernels, and are naturally adapted to multi-output learning situations. This paper addresses the problem of learning a finite linear combination of infinite-dimensional operator-valued kernels which are suitable for extending func…

2012-03-07abs ↗pdf ↗

Devoted to multi-task learning and structured output learning, operator-valued kernels provide a flexible tool to build vector-valued functions in the context of Reproducing Kernel Hilbert Spaces. To scale up these methods, we extend the celebrated Random Fourier Feature methodology to get an approximation of operator-…

2016-05-09abs ↗pdf ↗

Deep learning framework for kernel methods using RKHM and Perron-Frobenius operators.

problem Kernel methods in deep learning with potential overfitting issues.
method Combining RKHM and Perron-Frobenius operator to derive a new Rademacher bound and analyze deep kernel methods.
result Theoretical interpretation of benign overfitting and milder dependency on output dimension.

This paper provides a KK-theoretic obstruction for higher kernel dimension for Dirac operators. For this we use a fibre-wise Dirac operator that gives rise to a family of Fredholm operators representing a class in topological KK-theory. Then Chern classes of this KK-class contain some information about the kernel of…

2018-02-19abs ↗pdf ↗

The paper studies convergence of kernel autocovariance operators for stationary processes.

problem Estimating autocovariance operators of stationary processes on Polish spaces.
method Investigates convergence of empirical estimates of autocovariance operators under various conditions.
result Provides consistency results for kernel PCA and spectral analysis methods.

Toeplitz operators linked to submultiplicative filtrations and weighted Bergman kernels.

problem Analyzing the asymptotics of weighted Bergman kernels for submultiplicative filtrations.
method Demonstrated that weight operator is a Toeplitz operator; analyzed asymptotics of weighted Bergman kernels.
result Local refinement of convergence of jumping measures towards geodesic ray pushforward measure.

Researchers approximate conditional expectation operators using kernel methods.

problem Statistical approximation of conditional expectation operators under minimal assumptions.
method Modifying the domain of the operator, approximating it by Hilbert-Schmidt operators in a reproducing kernel Hilbert space.
result The nonparametric estimate of the operator converges to a specific limiting object.

Scalable Gaussian Process Operator tackles high-dimensional PDEs.

problem Scaling Gaussian Process Operators to high-dimensional, data-intensive regimes.
method Nearest-neighbor-based local kernel approximations, sparse kernel approximation, structured Kronecker factorizations, operator-aware kernel structures, task-informed mean functions.
result Consistently achieves high accuracy across varying discretization scales.

This paper studies neural network operators and their convergence properties.

problem Understanding the approximation and convergence of neural network operators.
method Proves density results, convergence estimates, and Voronovskaya-type theorems.
result Establishes quantitative convergence estimates and derives Voronovskaya-type theorems.

We study the problem of structured output learning from a regression perspective. We first provide a general formulation of the kernel dependency estimation (KDE) problem using operator-valued kernels. We show that some of the existing formulations of this problem are special cases of our framework. We then propose a c…

2012-05-10abs ↗pdf ↗

Sharp Gaussian bounds derived for Schrödinger kernel on Ricci solitons.

problem Analyzing Schrödinger heat kernel on gradient shrinking Ricci solitons.
method Deriving sharp Gaussian upper bounds for the Schrödinger heat kernel.
result Sharp upper and lower bounds for eigenvalues of the Schrödinger operator.

Paper tackles conditional expectation estimation using compactification operators.

problem Estimating conditional expectations from product of two random variables.
method Operator theoretic approach using kernel integral operators in reproducing kernel Hilbert space.
result Solutions allow numerical approximation and convergence of data-driven implementations.

Active data collection improves convergence rates in operator learning.

problem Improving convergence rates in operator learning with linear target and stochastic input.
method Active data collection strategies with mean-zero stochastic process and continuous covariance kernels.
result Achieves arbitrarily fast error convergence rates with eigenvalue decay of covariance kernels.

For CR structures in dimension three, the CR pluriharmonic functions are characterized by the vanishing of a third order operator. This third order operator, after composition with the divergence operator, gives the fourth order analogue of the Paneitz operator. In this short note, we give criteria under which the kern…

2015-02-06abs ↗pdf ↗

Defines a new algebra for singular foliations, extending Schwartz kernels.

problem Extending Schwartz kernel operators to singular foliations.
method Defines convolution algebra of transverse distributions, proves representation as operators on spaces of functions.
result Generalizes Schwartz kernel operators to singular foliations.

Kernel-based Bayesian filter for nonlinear systems using infinite-dimensional operators.

problem Modeling and predicting nonlinear dynamical systems.
method Functional Bayesian perspective, reproducing kernel Hilbert space, Gaussian kernel.
result Effective approximation and accurate results for nonlinear systems.

We consider second-order elliptic partial differential operators acting on sections of vector bundles over a compact Riemannian manifold without boundary, working without the assumption of Laplace-like principal part NμNμ-\N^μ\N_μ. Our objective is to obtain information on the asymptotic expansions of the corresponding r…

1999-05-03abs ↗pdf ↗

Framework extends neural operators to handle functions outside training set.

problem Robust handling of functions beyond the training set.
method Kernel approximation techniques and Reproducing Kernel Hilbert Spaces (RKHSs) theory.
result Theoretical framework and empirical validation for reliable function extension.

Random feature method approximates operators with theoretical guarantees and reduced computation.

problem Approximating operators between infinite dimensional Banach spaces using machine learning.
method Random feature operator learning method with theoretical guarantees and error bounds.
result The random feature method can achieve similar or better test errors than kernel-based methods and neural networks with significantly reduced training times.

A new data-adaptive prior stabilizes kernel learning in operators.

problem Learning kernels in operators from data is ill-posed due to nonlocal dependence.
method Introduces a data-adaptive prior to stabilize the Bayesian posterior mean.
result The data-adaptive prior achieves a stable posterior with small noise limits.

Convolution and pooling improve kernel methods in image classification.

problem Understanding the interplay between approximation and generalization in convolutional architectures.
method Characterized RKHS of kernels with convolution, pooling, and downsampling, computed generalization error.
result Convolution and pooling operations trade off approximation with generalization power.