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

3570105140 · Jun 202019922001200920172026
48 results for Matern kernels

The NNGP kernel's predictions closely match those of the Matern kernel under certain conditions.

problem Comparing NNGP kernels to Matern kernels in practical applications.
method Demonstrated the necessity of normalization for NNGP kernels, explored numerical challenges, and compared predictions and performance.
result NNGP kernel predictions closely match Matern kernel predictions under specific circumstances.

Paper speeds up Gaussian process inference using Matérn kernels.

problem Efficiently performing Gaussian process inference for large datasets.
method Exact Matérn kernel decomposition into empirical cumulative distribution functions, combined with divide-and-conquer approach.
result The proposed algorithm significantly speeds up Gaussian process inference for low-dimensional problems with hundreds of thousands of data points.

The paper explores the identifiability and interpretability of Gaussian process models using different kernel structures.

problem Identifiability and interpretability issues in Gaussian process models.
method The paper examines both single-output and multi-output Gaussian process models using additive and multiplicative mixtures of Matérn kernels.
result The smoothness of a mixture of Matérn kernels is determined by the least smooth component, and none of the mixing weights or parameters are identifiable.

New Hida-Matérn kernels enable flexible process priors and efficient GP inference.

problem Flexible modeling of stationary processes with oscillatory components.
method Introducing a new class of covariance functions (Hida-Matérn kernels) and their state space representations.
result Efficient Gaussian Process inference and improved numerical stability.

The paper improves error bounds for Bayesian quadrature in noisy settings.

problem Improving error bounds for Bayesian quadrature in noisy settings.
method Develops a two-step meta-algorithm to relate average-case quadrature error to L2L^2-function approximation error.
result Provides new average-case results for various kernels and noise settings.

Optimizes Gaussian process hyperparameters using Bayesian autoregression.

problem Optimizing hyperparameters for Matérn kernel temporal Gaussian processes.
method Recursive Bayesian estimation for autoregressive parameters.
result Outperforms traditional optimization methods in runtime and accuracy.

Study finds polynomial convergence rate for Farey sequences linked to Riemann hypothesis.

problem Understanding convergence rates of maximum mean discrepancies for Farey sequences.
method Identifying positive-semidefinite kernels and their polynomial convergence rates.
result Polynomial convergence rate of maximum mean discrepancies of Farey sequences is equivalent to the Riemann hypothesis.

Exact and scalable algorithm for Gaussian process regression with Matérn correlations.

problem Efficient Gaussian process regression with Matérn correlations.
method Novel kernel packet theory and sparse representation of covariance matrix.
result Significantly superior to existing alternatives in computational time and predictive accuracy.

We consider the problem of optimising functions in the reproducing kernel Hilbert space (RKHS) of a Matérn kernel with smoothness parameter νν over the domain [0,1]d[0,1]^d under noisy bandit feedback. Our contribution, the ππ-GP-UCB algorithm, is the first practical approach with guaranteed sublinear regret for all $ν>1…

2020-01-28abs ↗pdf ↗

New random feature maps for Laplacian and related kernels.

problem Challenges in approximating the Laplacian kernel and its generalizations.
method Developed random feature maps for Laplacian and related kernels, providing efficient sampling schemes.
result Demonstrated the efficacy of these random feature maps on real datasets.

We consider the problem of Bayesian optimization (BO) in one dimension, under a Gaussian process prior and Gaussian sampling noise. We provide a theoretical analysis showing that, under fairly mild technical assumptions on the kernel, the best possible cumulative regret up to time TT behaves as Ω(T)Ω(\sqrt{T}) and $O(\s…

2018-05-30abs ↗pdf ↗

cvHM framework speeds up GP inference for neural spike train analysis.

problem Scalability issue in approximate inference for latent GP models.
method cvHM framework using Hida-Matérn kernels and conjugate computation variational inference (CVI).
result Linear time inference for latent neural trajectories.

Develops kernels for matchings, overcoming computational challenges.

problem Challenges in applying kernel methods to matchings due to their discrete, non-Euclidean nature.
method Characterizes stationary kernels, introduces heat and Matérn kernel families, and develops a sub-exponential algorithm for efficient evaluation.
result Establishes novel negative results and identifies an open problem in transferring the framework to trees.

Standard Gaussian Process outperforms in high-dimensional Bayesian Optimization.

problem Standard Gaussian Process underperforms in high-dimensional optimization problems.
method Comprehensive evaluation of twelve benchmarks, use of Matérn kernels, probabilistic bounds, robust initialization strategy.
result Standard Gaussian Process can consistently achieve top-tier results in high-dimensional optimization problems.

The paper establishes bounds on the smoothness parameter in Gaussian process interpolation.

problem Estimating the smoothness parameter in Gaussian process models.
method Approximation theory in Sobolev spaces and general theorems on parameter estimation.
result Maximum likelihood estimation recovers the true smoothness for certain classes of functions.

New Gaussian processes for Riemannian manifolds enable uncertainty quantification.

problem Modeling functions on Riemannian manifolds with uncertainty.
method Generalized Matérn Gaussian processes on compact manifolds via spectral theory.
result Efficient training of Riemannian Matérn Gaussian processes using scalable techniques.

Paper improves regret bounds for Gaussian process upper confidence bound in Bayesian optimization.

problem Minimizing regret in Gaussian process bandit optimization.
method Gaussian process upper confidence bound (GP-UCB) algorithm with refined analysis.
result Achieves O(Tln2T)O(\sqrt{T \ln^2 T}) cumulative regret under squared exponential kernel.

Paper analyzes consistency of Bayesian and machine learning methods for hierarchical parameter estimation.

problem Learning hierarchical parameters in complex and real-world problems.
method Empirical Bayes and Kernel Flow approaches.
result Consistency results for Matérn-like model on the torus, and comparison of algorithms.

New RL method handles large state-action spaces with complex models.

problem Complex models and large state-action spaces in reinforcement learning.
method π-KRVI, an optimistic modification of least-squares value iteration using kernel ridge regression.
result First order-optimal regret guarantees under general settings, improving over state of the art.

Adaptive RBF-KAN improves KANs by dynamically adjusting kernel parameters.

problem Efficiently approximating multivariate functions using learnable univariate edge functions.
method Integrates LOOCV-based kernel scale estimation with adaptive kernel learning.
result Adaptive RBF-KAN outperforms fixed kernel KANs on various benchmark functions.

Gaussian process regression loses locality in high dimensions, affecting molecular energy surface fitting.

problem Loss of locality in high-dimensional Gaussian process regression.
method Analysis of Matern family kernels and multi-zeta basis functions.
result The property of locality disappears in high dimensions, impacting regression quality.

The paper improves bounds on regret in Gaussian process bandits.

problem Sequential optimization of expensive, possibly non-convex functions with noisy feedback.
method Analyzes maximal information gain and decay rates of GP kernel eigenvalues to improve regret bounds.
result General bounds on maximal information gain and improved regret bounds for various settings, including Matérn kernels.

GeometricKernels package implements kernels for uncertain data on graphs, manifolds, and meshes.

problem Defining and computing kernels for structured data on graphs, manifolds, and meshes.
method Implementation of geometric analogs of Euclidean kernels (heat and Matérn) with automatic differentiation support.
result Ability to compute Fourier-feature-type expansions on geometric spaces.

A new kernel improves Gaussian process performance for non-stationary data.

problem Poor prediction and uncertainty quantification with standard GPs.
method Study and comparison of non-stationary kernels, propose a new combined kernel.
result A new kernel outperforms existing stationary and non-stationary kernels.

CEI achieves convergence rates for constrained Bayesian optimization.

problem Constrained Bayesian optimization with theoretical convergence rates.
method Analyzing simple regret upper bound for CEI in RKHS and Gaussian process settings.
result CEI achieves convergence rates of t12logd+12(t)t^{-\frac{1}{2}}\log^{\frac{d+1}{2}}(t) and tν2ν+dlogν2ν+d(t)t^{\frac{-ν}{2ν+d}} \log^{\fracν{2ν+d}}(t) for squared exponential and Matérn kernels, respectively.

Standard kernels such as Matérn or RBF kernels only encode simple monotonic dependencies within the input space. Spectral mixture kernels have been proposed as general-purpose, flexible kernels for learning and discovering more complicated patterns in the data. Spectral mixture kernels have recently been generalized in…

2018-11-27abs ↗pdf ↗

New algorithm improves Gaussian process hyperparameter tuning for large datasets.

problem Scalable hyperparameter tuning for Gaussian processes on large datasets.
method Estimates smoothness and length-scale parameters in Matern kernel using novel loss functions.
result Improved uncertainty quantification over traditional methods.

Improved kernel ridge regression for large datasets using weighted random binning.

problem Efficiently approximating kernel matrices for large-scale datasets.
method Introduced weighted random binning features for locality sensitive hashing.
result Weighted random binning features generate Gaussian processes of any desired smoothness.

Data-driven discovery of "hidden physics" -- i.e., machine learning of differential equation models underlying observed data -- has recently been approached by embedding the discovery problem into a Gaussian Process regression of spatial data, treating and discovering unknown equation parameters as hyperparameters of a…

2018-08-02abs ↗pdf ↗

Graph Gaussian processes use Matérn models for better function learning.

problem Lack of Gaussian process models for graph input spaces.
method Stochastic partial differential equation characterization of Matérn Gaussian processes.
result Graph Matérn Gaussian processes inherit properties of Euclidean and Riemannian models and can be trained efficiently.

Paper analyzes GP-EI for Bayesian optimization with no regret and provides guidance on choosing incumbents.

problem Analyzing cumulative regret of GP-EI with different incumbents in noisy Bayesian optimization.
method Analyzes GP-EI with three incumbents (BPMI, BSPMI, BOI) in both SE and Matérn kernels, proving no-regret for BPMI and BSPMI.
result GP-EI with BPMI and BSPMI is a no-regret algorithm for both SE and Matérn kernels, providing theoretical guidance for choosing incumbents.

Gaussian processes are rich distributions over functions, with generalization properties determined by a kernel function. When used for long-range extrapolation, predictions are particularly sensitive to the choice of kernel parameters. It is therefore critical to account for kernel uncertainty in our predictive distri…

2018-02-02abs ↗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.

Paper tackles non-stationary kernelized bandits with near-optimal algorithm.

problem Minimizing regret in a time-varying reward function.
method Near-optimal algorithm with a novel restarting phased elimination with random permutation (R-PERP).
result Regret upper bound matches the lower bound, making the algorithm near-optimal.

We consider black box optimization of an unknown function in the nonparametric Gaussian process setting when the noise in the observed function values can be heavy tailed. This is in contrast to existing literature that typically assumes sub-Gaussian noise distributions for queries. Under the assumption that the unknow…

2019-09-16abs ↗pdf ↗

Unified analysis of kernel-based and locally adaptive bandit optimization methods.

problem Performance of bandit optimization algorithms in RKHS functions.
method Investigates the relationship between kernel regularity and algorithmic performance, characterizing spectral properties of various kernels.
result Unified framework for analyzing kernel-based and locally adaptive bandit algorithms, deriving explicit regret bounds.