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

Trend · papers per month

25.0%50.0%75.0%100.0% · Dec 199219922001200920172026
48 results for vector-valued reproducing kernel Hilbert spaces

Paper develops metrics for random dynamical systems using vector-valued RKHSs.

problem Creating metrics for random nonlinear dynamical systems.
method Develops metrics on random dynamical systems using Perron-Frobenius operators in vector-valued reproducing kernel Hilbert spaces (vvRKHSs). Uses operator-valued kernels and time-wise independence criteria.
result Extends existing metrics for deterministic systems and introduces kernel maximal mean discrepancy for random processes.

Develops vector-valued RKBS for neural networks and operators.

problem Understanding function spaces of Rd\mathbb{R}^d-valued neural networks and neural operators.
method Defines and constructs vector-valued RKBS (vv-RKBS) without restrictive assumptions.
result Establishes Representer Theorem for neural architectures.

Framework for transferring discount curve estimates across fixed-income product classes.

problem Challenges in estimating discount curves from sparse or noisy data.
method Proposes a vector-valued kernel ridge regression (KR) framework with economic regularization.
result Transfer learning tightens confidence intervals and improves extrapolation performance.

We study the stability properties of nonlinear multi-task regression in reproducing Hilbert spaces with operator-valued kernels. Such kernels, a.k.a. multi-task kernels, are appropriate for learning prob- lems with nonscalar outputs like multi-task learning and structured out- put prediction. We show that multi-task ke…

2013-06-17abs ↗pdf ↗

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.

Optimal rates for vector-valued regression on various norms.

problem Optimal rates for vector-valued ridge regression on continuous norms.
method Combining standard capacity assumptions with tensor product constructions of vector-valued interpolation spaces.
result Optimal rates for vector-valued ridge regression, independent of output space dimension.

MOCK learns complex systems from trajectories efficiently.

problem Learning nonparametric differential equations from high-dimensional data.
method MOCK uses multivariate occupation kernel functions to learn vector fields linearly.
result MOCK outperforms other methods on various datasets.

This paper investigates a novel algorithmic approach to data representation based on kernel methods. Assuming that the observations lie in a Hilbert space X, the introduced Kernel Autoencoder (KAE) is the composition of mappings from vector-valued Reproducing Kernel Hilbert Spaces (vv-RKHSs) that minimizes the expected…

2018-05-28abs ↗pdf ↗

A new method estimates multi-dimensional value distributions using Hilbert space embeddings.

problem Estimating value distributions in complex, multi-dimensional reinforcement learning settings.
method Hilbert space mappings and kernel mean embeddings to estimate the kernel mean embedding of multi-dimensional value distributions.
result Uniform convergence guarantees and robust off-policy evaluation demonstrated in simulations.

A new method estimates SDEs using occupation kernels.

problem Learning multivariate stochastic differential equations (SDEs).
method Two-step procedure: estimate drift, then diffusion. Occupation kernels used in RKHS.
result Validated on simulated and real-world data.

This work improves multi-task regression performance using approximations of full-conformal prediction.

problem Jointly solve multiple regression tasks with better performance than individual tasks.
method Design an approximating prediction region in RKHS for full-conformal multi-task regression.
result The approximating prediction region improves upon split-conformal prediction on synthetic data.

This paper develops a nonparametric model for complex network data.

problem Capturing conditional independence structure in multivariate data with heterogeneous graph structures.
method Integrates network embedding with nonparametric graphical model estimation, solving a linear equation system.
result The proposed method effectively recovers heterogeneous graph structures without distributional assumptions.

A new algorithm for decentralized learning in heterogeneous networks reduces sub-optimality over time.

problem Learning in decentralized heterogeneous networks with local data streams and nonlinear constraints.
method Functional variant of stochastic primal-dual method with greedy subspace projection.
result The HALK algorithm achieves O(T)\mathcal{O}(\sqrt{T}) sub-optimality reduction and constraint satisfaction.

fCBO optimizes interventions in causal graphs using Gaussian processes.

problem Optimizing interventions in known causal graphs.
method Functional causal Bayesian optimization (fCBO) using Gaussian processes and expected improvement acquisition.
result Functional interventions can lead to better target effects and optimal conditional effects.

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 ↗

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.

New algorithms optimize multiple tasks with shared similarities, reducing regret.

problem Optimizing multiple objectives with shared similarities in non-parametric Bayesian optimization.
method Developed two novel BO algorithms using multi-task kernels and random scalarizations.
result Derived worst-case regret bounds capturing inter-task similarities.

We propose a vector-valued regression problem whose solution is equivalent to the reproducing kernel Hilbert space (RKHS) embedding of the Bayesian posterior distribution. This equivalence provides a new understanding of kernel Bayesian inference. Moreover, the optimization problem induces a new regularization for the …

2016-07-07abs ↗pdf ↗

We consider the problem of learning a vector-valued function f in an online learning setting. The function f is assumed to lie in a reproducing Hilbert space of operator-valued kernels. We describe two online algorithms for learning f while taking into account the output structure. A first contribution is an algorithm,…

2013-11-01abs ↗pdf ↗

Study optimizes learning rates for conditional mean embedding estimates.

problem Consistency of kernel ridge regression for conditional mean embedding.
method Adaptive statistical learning rate derived for misspecified setting.
result Upper bound matches optimal O(logn/n)O(\log n / n) rates without assuming finite dimensionality.

Kernel methods are among the most popular techniques in machine learning. From a frequentist/discriminative perspective they play a central role in regularization theory as they provide a natural choice for the hypotheses space and the regularization functional through the notion of reproducing kernel Hilbert spaces. F…

2011-06-30abs ↗pdf ↗

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.

Paper develops a duality approach for robust loss functions in infinite-dimensional RKHSs.

problem Robustness issues in infinite-dimensional RKHSs with operator-valued kernels.
method Develops a duality approach to solve OVK machines for various loss functions.
result Empirical improvements and theoretical stability analysis for robust structured data applications.

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.

We demonstrate an equivalence between reproducing kernel Hilbert space (RKHS) embeddings of conditional distributions and vector-valued regressors. This connection introduces a natural regularized loss function which the RKHS embeddings minimise, providing an intuitive understanding of the embeddings and a justificatio…

2012-05-21abs ↗pdf ↗

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 characterizes embeddability of function spaces into LpL_p-type RKBS via metric entropy.

problem Characterizing embeddability of function spaces into LpL_p-type RKBS.
method Establishes a connection between metric entropy growth and embeddability.
result A bound on metric entropy growth allows embedding into LpL_p-type RKBS.