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

173345518690 · Jun 202019922001200920172026
48 results for Smooth Gaussian Processes

Smooth Schrödinger Bridges improve trajectory inference by smoothing Gaussian processes.

problem Improving trajectory inference in applications like particle tracking.
method Generalizes Schrödinger Bridge problem to smooth Gaussian processes, solving the problem on phase space.
result The method outperforms existing methods on real datasets.

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.

GPCDL uses Gaussian Processes to learn smooth templates from data.

problem Lack of smoothness in learned templates leads to overfitting and poor predictive performance.
method GPCDL incorporates Gaussian Process priors to enforce smoothness in the learned templates.
result GPCDL outperforms unregularized CDL in accuracy and predictive performance across various SNRs and applications.

Improved model for non-smooth signals with complex spectra.

problem Current models struggle with non-smooth signals and complex spectral structures.
method CGPCM and RGPCM models with causality and Bayesian nonparametric interpretations, improved variational inference.
result Proposed models show better performance on synthetic and real-world data.

We propose a principled algorithm for robust Bayesian filtering and smoothing in nonlinear stochastic dynamic systems when both the transition function and the measurement function are described by non-parametric Gaussian process (GP) models. GPs are gaining increasing importance in signal processing, machine learning,…

2012-03-20abs ↗pdf ↗

Unified framework for efficient Gaussian process inference.

problem Efficient inference in non-conjugate Gaussian process models.
method Combines expectation propagation with linearization for improved efficiency.
result Unified view of various inference schemes, including classical smoothers and EP.

The paper proposes a method to model non-smooth functions using clustering, classification, and Gaussian process modeling.

problem Modeling discontinuities and non-smoothness in expensive computational models.
method Three-stage approach combining clustering, classification, and Gaussian process modeling.
result The approach successfully models discontinuities and non-smoothness in various functions.

This work investigates the properties of Gaussian-smoothed sliced divergences for comparing distributions.

problem Comparing probability distributions while preserving privacy.
method Investigates the theoretical properties of Gaussian-smoothed sliced Wasserstein distance and generalized versions.
result Gaussian smoothed sliced Wasserstein distance converges with a rate of \(O(n^{-1/2})\).

Gaussian processes are rich distributions over functions, which provide a Bayesian nonparametric approach to smoothing and interpolation. We introduce simple closed form kernels that can be used with Gaussian processes to discover patterns and enable extrapolation. These kernels are derived by modelling a spectral dens…

2013-02-18abs ↗pdf ↗

New Gaussian min-max theorem extends classical results to non-i.i.d. Gaussian matrices.

problem Extending classical Gaussian min-max theorems to non-i.i.d. Gaussian matrices.
method Identifying a new pair of Gaussian processes that satisfy comparison inequalities.
result New Gaussian min-max and convex Gaussian min-max theorems with applications in multi-source Gaussian regression and binary classification.

Off-the-shelf Gaussian Process (GP) covariance functions encode smoothness assumptions on the structure of the function to be modeled. To model complex and non-differentiable functions, these smoothness assumptions are often too restrictive. One way to alleviate this limitation is to find a different representation of …

2014-02-24abs ↗pdf ↗

Wide neural networks can be closely approximated by Gaussian processes, with rates depending on the activation function's properties.

problem Approximating the behavior of wide neural networks using Gaussian processes.
method Established convergence rates for the central limit theorem in an infinite-dimensional functional space, using a transportation distance metric.
result Explicit convergence rates for neural networks approximated by Gaussian processes, varying based on the activation function's properties.

RAMBO optimizes multi-regime problems by discovering and modeling distinct energy basins.

problem Multi-regime problems in molecular conformation and drug discovery.
method Dirichlet Process Mixture of Gaussian Processes with adaptive hyperparameters and concentration parameters.
result Consistent improvements over state-of-the-art on multi-regime objectives.

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.

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.

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.

This study examines Gaussian processes on Riemannian manifolds and proves contraction rates.

problem Comparing intrinsic vs. extrinsic Gaussian processes on Riemannian manifolds.
method Proves optimal contraction rates for intrinsic Matérn Gaussian processes on compact Riemannian manifolds.
result Intrinsic Gaussian processes on Riemannian manifolds achieve better performance than extrinsic ones.

Improved sample efficiency in reinforcement learning with deep Gaussian processes.

problem Efficiently learn to control actions with limited interaction data.
method Deep Gaussian processes that simulate dynamics with depth and prior knowledge.
result Significantly improved early sample efficiency across various tasks, including half-cheetah control.

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.

VMGP extends Gaussian processes for Bayesian meta-learning, improving uncertainty prediction.

problem Bayesian meta-learning for few-shot tasks with non-Gaussian uncertainty.
method VMGP (Variational Meta-Gaussian Processes) extends Gaussian processes to model non-Gaussian predictive posteriors.
result VMGP significantly outperforms existing Bayesian meta-learning methods on complex tasks.

Bounds on Gaussian approximation for neural networks with novel smoothing techniques.

problem Approximating the distribution of wide random neural networks.
method Stein's method, Gaussian smoothing, Laplacian operators, Cameron-Martin space.
result First bounds on Gaussian approximation of wide random neural networks.

Generative Bayesian Computation improves surrogates for expensive simulations.

problem Limitations of Gaussian process surrogates in handling complex, non-stationary data.
method Generative Bayesian Computation via Implicit Quantile Networks (IQNs).
result Generative Bayesian Computation outperforms traditional Gaussian process methods across various benchmarks.

We derive expressions for the predicitive information rate (PIR) for the class of autoregressive Gaussian processes AR(N), both in terms of the prediction coefficients and in terms of the power spectral density. The latter result suggests a duality between the PIR and the multi-information rate for processes with mutua…

2012-06-01abs ↗pdf ↗

The paper develops a state-space approach to deep Gaussian processes for efficient state estimation.

problem Efficient regression and state estimation for deep Gaussian processes.
method Hierarchical transformed Gaussian process priors, state-space representation, linear stochastic differential equations, sequential methods.
result The state-space approach enables efficient state estimation and regression for deep Gaussian processes.

Novel method uses Gaussian process to estimate particle sizes from scattering data.

problem Estimating particle size distributions from noisy optical scattering measurements.
method Constrained Gaussian process regression with normalization constraints.
result Accurately reconstructs particle size distributions from noisy data.

Quantum-assisted Gaussian process speeds up data regression.

problem High computational complexity of Gaussian process regression for large datasets.
method Quantum-assisted sparse Gaussian process regression using random Fourier features.
result Achieves polynomial-order computational speedup compared to classical methods.

GP-BART improves BART's predictive performance by incorporating Gaussian process priors.

problem Lack of smoothness and explicit covariance structure in BART.
method GP-BART extends BART with Gaussian process priors for tree predictions.
result GP-BART outperforms traditional models in various applications.

Enhances Gaussian process models for handling variable error variances and multiple responses.

problem Limited ability of Gaussian process models to capture abrupt changes and heteroscedastic errors.
method Introduces a novel heteroscedastic Gaussian process (HeGP) framework coupled with variational inference and EM algorithm.
result Effective modeling of multivariate responses with varying error variances.

A new method scales Gaussian process variational autoencoders to handle high-dimensional time series.

problem Scalability issue in Gaussian process variational autoencoders (GPVAEs).
method Introducing Markovian GPs and using Kalman filtering and smoothing for linear time training.
result MGPVAE outperforms existing approaches in various tasks with high scalability.

Two methods improve Gaussian process predictive distributions' calibration.

problem Improving the reliability of Gaussian process predictive intervals.
method Introduces two methods: cps-gp and bcr-gp, both adapting conformal predictive systems to GP interpolation.
result Both methods provide finite-sample marginal calibration and smooth predictive distributions.

Efficient spatio-temporal Gaussian process inference method.

problem Scalable Gaussian process inference for multivariate, spatio-temporal data.
method Combines spatio-temporal filtering with natural gradient variational inference, resulting in a scalable non-conjugate GP method.
result Linear scaling with respect to time and logarithmic scaling with respect to time steps.