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

Trend · papers per month

136272408544 · Jun 202019922001200920172026
48 results for vector-valued Gaussian processes

The paper extends consistency results for sequential design strategies to vector-valued Gaussian processes.

problem Estimating excursion sets of vector-valued Gaussian processes.
method Clarifying the connection between continuous Gaussian processes and Gaussian measures in Banach spaces, extending concepts and properties from scalar-valued settings to vector-valued settings.
result Consistency results for sequential design strategies can be applied to vector-valued Gaussian processes.

Study improves self-normalized bounds for vector-valued processes beyond sub-Gaussianity.

problem Limited understanding of self-normalized concentration for vector-valued processes outside sub-Gaussian frameworks.
method Developed concentration inequalities for self-normalized processes with light tails (e.g., Bennett, Bernstein bounds) for vector-valued data.
result Provided new insights and bounds for self-normalized processes with non-sub-Gaussian distributions.

Gaussian processes adapted for Riemannian manifolds using gauge-independent kernels.

problem Deploying Gaussian processes on non-Euclidean domains like Riemannian manifolds.
method Developed techniques to generalize Gaussian processes to vector fields on Riemannian manifolds using gauge-independent kernels.
result Enabled training of vector-valued Gaussian processes on Riemannian manifolds using standard Gaussian process methods.

The paper introduces novel Gaussian process models for vector-valued signals on manifolds.

problem Modeling vector-valued signals on non-Euclidean domains, especially for applications like wind speeds.
method Intrinsically defined Gaussian vector fields on manifolds, accounting for manifold geometry.
result Gaussian vector fields provide more refined inductive biases than extrinsic fields.

This work develops discrete Gaussian models for vector-valued data on triangular meshes.

problem Discrete representation of continuous vector-valued environmental data.
method Develops discrete intrinsic Gaussian processes for vector-valued data on triangular meshes using discrete differential operators.
result Models can capture harmonic flows, incorporate boundary conditions, and model non-stationary data.

Optimal transport for vector Gaussian mixtures improves efficiency and structure preservation.

problem Optimal mass transport for vector-valued Gaussian mixtures.
method Vectorizing Gaussian mixture models and studying optimal mass transport problems.
result Computational efficiency and structure preservation in optimal mass transport.

Gaussian processes adapted for non-Euclidean spaces enhance decision-making.

problem Applying Gaussian processes in non-Euclidean spaces.
method Developed pathwise conditioning and Gaussian process models over non-Euclidean spaces.
result Efficient Gaussian process models for non-Euclidean spaces.

This paper presents a new model called infinite mixtures of multivariate Gaussian processes, which can be used to learn vector-valued functions and applied to multitask learning. As an extension of the single multivariate Gaussian process, the mixture model has the advantages of modeling multimodal data and alleviating…

2013-07-26abs ↗pdf ↗

We present a novel extension of multi-output Gaussian processes for handling heterogeneous outputs. We assume that each output has its own likelihood function and use a vector-valued Gaussian process prior to jointly model the parameters in all likelihoods as latent functions. Our multi-output Gaussian process uses a c…

2018-05-19abs ↗pdf ↗

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 consider vector valued, unit variance Gaussian processes defined over stratified manifolds and the geometry of their excursion sets. In particular, we develop an explicit formula for the expectation of all the Lipschitz--Killing curvatures of these sets. Whereas our motivation is primarily probabilistic, with statis…

2006-12-20abs ↗pdf ↗

Randomized algorithm solves vector-valued regression problems with low-rank operators.

problem Vector-valued regression problems involving infinite-dimensional spaces.
method Randomized Reduced Rank Regression (R4) using Gaussian sketching for optimization.
result R4 estimators are efficient and accurate, with empirical risk close to optimal.

tvGP-VAE models tensor-valued latent variables with Gaussian processes for better data structure representation.

problem Agnostic latent variables in VAEs ignore data structure correlations.
method Proposes tensor-variate Gaussian process prior for variational autoencoder.
result Explicitly modeling correlation structures improves model performance in reconstruction.

We improve bounds for stochastic processes, especially those with heavy tails.

problem Bounding the concentration of sub-ψψ processes with heavy tails.
method Variational approach to concentration, focusing on sub-Gaussian and other tail conditions.
result First dimension-free self-normalized empirical Bernstein inequality.

The paper develops sampling methods for ocean phenomena based on temperature and salinity measurements.

problem Improving oceanographic sampling with limited resources.
method Design criterion based on uncertainty in excursions of vector-valued Gaussian random fields.
result Demonstrates effective exploration of ambiguous regions for data-driven sampling.

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.

We present the first treatment of the arc length of the Gaussian Process (GP) with more than a single output dimension. GPs are commonly used for tasks such as trajectory modelling, where path length is a crucial quantity of interest. Previously, only paths in one dimension have been considered, with no theoretical con…

2017-03-23abs ↗pdf ↗

Study on identifying most preferred policy in bandits with vector-valued rewards.

problem Identifying the most preferred policy in bandits with vector-valued rewards.
method Derive a novel lower bound on sample complexity, design the Preference-based Track and Stop (PreTS) algorithm, and derive a new concentration inequality.
result The sample complexity of PreTS is asymptotically tight.

Deep Gaussian processes can have non-degenerate and non-Gaussian limits.

problem Understanding the behavior of deep Gaussian processes as depth grows.
method Studying the limit of compositional Gaussian processes where each layer is a Gaussian process.
result Identified a sharp bandwidth threshold above which the limit is degenerate, and proved that for bandwidths below this threshold, the limit is a non-degenerate and non-Gaussian distribution.

We prove a conjecture about approximating Gaussian Processes on one dimension.

problem Computational scaling issues with Gaussian Processes on one dimension.
method Developed a new family of state-space models (LEG) to approximate any stationary GP on one dimension.
result Proved that any stationary GP on one dimension can be approximated using the LEG family.

The contraction inequality for Rademacher averages is extended to Lipschitz functions with vector-valued domains, and it is also shown that in the bounding expression the Rademacher variables can be replaced by arbitrary iid symmetric and sub-gaussian variables. Example applications are given for multi-category learnin…

2016-05-01abs ↗pdf ↗

Algorithm identifies Pareto optimal designs efficiently for noisy, multi-objective functions.

problem Optimizing multi-objective functions with noisy data and large design spaces.
method Adaptive discretization and tree-based approach to identify Pareto optimal designs.
result Algorithm identifies Pareto optimal designs with fewer evaluations than exhaustive search.

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.

Boosting framework for vector-valued prediction with geometric stability.

problem Lack of a general theoretical understanding of aggregation for structured prediction.
method Identifies (α,β)(α,β)-stability property and proposes a boosting framework based on exponential reweighting and geometric-median aggregation.
result Obtains exponential decay of empirical divergence error under weak learner condition and (α,β)(α,β)-stability.

We consider optimization of composite objective functions, i.e., of the form f(x)=g(h(x))f(x)=g(h(x)), where hh is a black-box derivative-free expensive-to-evaluate function with vector-valued outputs, and gg is a cheap-to-evaluate real-valued function. While these problems can be solved with standard Bayesian optimization, we…

2019-06-04abs ↗pdf ↗

Study confirms learning rates for vector-valued spectral algorithms, proving consistency.

problem Theoretical confirmation of learning rates for vector-valued spectral algorithms.
method Rigorous analysis of learning rates for various vector-valued spectral algorithms, including kernel ridge regression and gradient descent.
result Upper and lower bounds on learning rates for vector-valued spectral algorithms, proving minimax optimality in various scenarios.

The space of vector-valued forms on any manifold is a graded Lie algebra with respect to the Frolicher-Nijenhuis bracket. In this paper we consider multiplicative vector-valued forms on Lie groupoids and show that they naturally form a graded Lie subalgebra. Along the way, we discuss various examples and different char…

2017-06-02abs ↗pdf ↗

Vector-valued learning, where the output space admits a vector-valued structure, is an important problem that covers a broad family of important domains, e.g. multi-task learning and transfer learning. Using local Rademacher complexity and unlabeled data, we derive novel semi-supervised excess risk bounds for general v…

2019-09-11abs ↗pdf ↗

The paper proposes methods to find a shared active subspace for multivariate vector-valued functions.

problem Minimizing the deviation between function evaluations in the original and reconstructed spaces.
method Manipulating gradients or SPD matrices to identify a shared structure.
result Summing SPD matrices often identifies the best shared active subspace.

We present a framework to derive risk bounds for vector-valued learning with a broad class of feature maps and loss functions. Multi-task learning and one-vs-all multi-category learning are treated as examples. We discuss in detail vector-valued functions with one hidden layer, and demonstrate that the conditions under…

2016-06-05abs ↗pdf ↗

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 ↗

New imputation strategies improve signature models for irregular time series.

problem Applying signature models to irregular time series requires continuous path construction.
method Characterized imputation as a problem, evaluated various strategies, proposed GP-PoM.
result Gaussian process adapters improve predictive performance and robustness.

The sequence of moments of a vector-valued random variable can characterize its law. We study the analogous problem for path-valued random variables, that is stochastic processes, by using so-called robust signature moments. This allows us to derive a metric of maximum mean discrepancy type for laws of stochastic proce…

2018-10-25abs ↗pdf ↗

We approximate derivatives of functions on manifolds by embedding them and applying vector-valued operators.

problem Derivatives of manifold-valued functions are harder to approximate than vector-valued functions.
method Embed the manifold into a higher space, approximate the derivative of the vector-valued function, and project back.
result We provide error bounds for the approximation of manifold-valued function derivatives.

Paper introduces vector-valued variation spaces for multi-output neural networks.

problem Understanding and optimizing multi-output neural networks.
method Development of vector-valued variation spaces and representer theorem.
result Novel bounds for layer widths in deep networks and a convex optimization method for compression.