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

Trend · papers per month

138276413551 · Jun 202019922001200920172026
48 results for univariate Gaussian processes

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.

A new approach simplifies multitask Gaussian processes without rank approximations.

problem Handling multioutput regression problems with conditionally dependent tasks.
method Introduces a novel approach to reduce multitask learning to univariate GPs, eliminating the need for rank approximations.
result Accurately recovers multitask covariance and noise matrices with fewer parameters, improving performance and reducing overfitting risk.

New kernel models multi-output Gaussian processes accurately.

problem Challenges in modelling cross-covariances for multiple-output Gaussian processes.
method Replaced Gaussian components with block components of finite bandwidth in spectral mixture kernel.
result First multi-output generalization of spectral mixture kernel that can approximate any stationary multi-output kernel to arbitrary precision.

DSPPs improve predictive distributions in scalable regression tasks.

problem Improving predictive distributions in scalable regression tasks.
method Inspired by DGPs, DSPPs use mini-batch training and kernel basis functions for uncertainty control.
result DSPPs provide significantly better calibrated predictive distributions than other methods.

Improves Bayesian optimization using Gaussian process Thompson sampling.

problem Global optimization of Gaussian process posterior samples.
method Carefully selects starting points for gradient-based multi-start optimizers, identifies all local optima via univariate global rootfinding, and optimizes the posterior sample.
result Dramatic improvements in overall performance of Bayesian optimization.

Paper proposes a new GPR-HS framework for accurate VCV estimation in global equity indices.

problem Accurate forecasting of Volatility-Covariance Matrix (VCV) for regulatory processes.
method Hybrid Gaussian Process Regression-Historical Simulation (GPR-HS) framework.
result GPR-HS framework achieves regulatory compliance and outperforms static VaR benchmarks.

A new Weyl prior is proposed for Bayesian statistics, offering a more canonical choice for parameter α.

problem Choosing a prior distribution for Bayesian inference.
method Proposed a new Weyl prior based on the Weyl structure on a statistical manifold.
result The Weyl prior is a special case of the α-parallel prior with α = -n, where n is the dimension of the statistical manifold.

New framework models complex spatial data with basis functions and graphical vectors.

problem Modeling highly-multivariate spatial processes with varying resolutions.
method Extends graphical lasso to multivariate Gaussian processes with independent graphical vectors at different resolutions, using an orthogonal basis and fusion penalty.
result Linear complexity and parsimonious conditional independence structure in multilevel graphical model.

Most signal processing problems involve the challenging task of multidimensional probability density function (PDF) estimation. In this work, we propose a solution to this problem by using a family of Rotation-based Iterative Gaussianization (RBIG) transforms. The general framework consists of the sequential applicatio…

2016-01-31abs ↗pdf ↗

DLFM models complex systems with uncertainty, outperforming traditional methods.

problem Modeling highly nonlinear dynamical systems with robust uncertainty quantification.
method Deep latent force model (DLFM) using physics-informed kernels derived from ODEs.
result DLFM achieves comparable performance to non-physics-informed models on univariate tasks and captures dynamics in real-world data.

We develop an automated variational method for inference in models with Gaussian process (GP) priors and general likelihoods. The method supports multiple outputs and multiple latent functions and does not require detailed knowledge of the conditional likelihood, only needing its evaluation as a black-box function. Usi…

2016-09-02abs ↗pdf ↗

We utilize copulas to constitute a unified framework for constructing and optimizing variational proposals in hierarchical Bayesian models. For models with continuous and non-Gaussian hidden variables, we propose a semiparametric and automated variational Gaussian copula approach, in which the parametric Gaussian copul…

2015-06-19abs ↗pdf ↗

Study assesses drought and late-frost risks in Bavaria using vine copulas.

problem Assessing risks of late-frost and drought in Bavaria due to climate change.
method Used vine copula models for non-Gaussian and asymmetric dependencies, with univariate and bivariate regression analyses.
result Identified 'at-risk' regions for forest adaptation.

SVGP KAN integrates sparse variational GP with KANs for scalable probabilistic inference.

problem Lack of probabilistic outputs in standard KANs and cubic scaling of Gaussian Process methods.
method Sparse Variational GP-KAN combines KAN topology with sparse variational inference and permutation-based importance analysis.
result Enables probabilistic KANs to handle larger datasets with linear computational complexity.

A new method for learning Gaussian Mixture Models using gradient descent.

problem Learning Gaussian Mixture Models efficiently and with gradient descent.
method Sliced Cramér 2-distance for multivariate GMMs, compatible with gradient descent.
result Closed-form solution for univariate case, easy to implement.

Paper uses Gaussian processes and neural nets to model sub-km wind accurately.

problem Accurately modeling sub-kilometer surface wind for optimal decision-making.
method Integrates Gaussian processes and neural networks to model wind gusts at sub-kilometer resolution.
result Modeling covariance structure improves prediction quality and calibration.

New SQ lower bounds for NGCA without requiring chi-squared condition.

problem Proving SQ hardness for NGCA under moment-matching conditions.
method General SQ lower bound methodology applied to NGCA under moment-matching conditions.
result Proved near-optimal SQ lower bounds for NGCA without chi-squared condition.

We derive generalization error bounds for stationary univariate autoregressive (AR) models. We show that imposing stationarity is enough to control the Gaussian complexity without further regularization. This lets us use structural risk minimization for model selection. We demonstrate our methods by predicting interest…

2011-03-04abs ↗pdf ↗

In deterministic optimization, line searches are a standard tool ensuring stability and efficiency. Where only stochastic gradients are available, no direct equivalent has so far been formulated, because uncertain gradients do not allow for a strict sequence of decisions collapsing the search space. We construct a prob…

2017-03-29abs ↗pdf ↗

In deterministic optimization, line searches are a standard tool ensuring stability and efficiency. Where only stochastic gradients are available, no direct equivalent has so far been formulated, because uncertain gradients do not allow for a strict sequence of decisions collapsing the search space. We construct a prob…

2015-02-10abs ↗pdf ↗

DCK improves air quality index prediction with probabilistic spatial models.

problem Non-Gaussian, complex spatial structure of air quality index.
method Deep classifier kriging (DCK) for non-Gaussian, nonlinear spatial prediction.
result DCK outperforms conventional methods in predictive accuracy and uncertainty quantification.

Undirected graphical models, or Markov networks, are a popular class of statistical models, used in a wide variety of applications. Popular instances of this class include Gaussian graphical models and Ising models. In many settings, however, it might not be clear which subclass of graphical models to use, particularly…

2013-01-17abs ↗pdf ↗

A boosting method improves nonparametric density estimation without smoothing assumptions.

problem Overfitting in nonparametric data fitting.
method Introduces a boosting algorithm for univariate nonparametric maximum likelihood estimation.
result Demonstrates the effectiveness of the boosting approach through simulations and real data experiments.

In this paper we introduce the concept of conic martingales}. This class refers to stochastic processes having the martingale property, but that evolve within given (possibly time-dependent) boundaries. We first review some results about the martingale property of solution to driftless stochastic differential equations…

2016-03-24abs ↗pdf ↗

PySAD offers a unified Python framework for efficient streaming anomaly detection.

problem Efficient anomaly detection in streaming data with strict constraints.
method Unified architecture with 17+ streaming algorithms, specialized components, and support for multiple learning paradigms.
result PySAD enables real-time processing with bounded memory and is compatible with other Python frameworks.

While Gaussian probability densities are omnipresent in applied mathematics, Gaussian cumulative probabilities are hard to calculate in any but the univariate case. We study the utility of Expectation Propagation (EP) as an approximate integration method for this problem. For rectangular integration regions, the approx…

2011-11-29abs ↗pdf ↗

Study benchmarks TSC algorithms in distinguishing diffusions using the likelihood ratio test.

problem Benchmarking optimality of TSC algorithms in distinguishing diffusion processes.
method Proposes to benchmark TSC algorithms using the likelihood ratio test (LRT).
result LRT benchmarks are computationally efficient and can be applied to various time series types.

Gaussian Process (GP) models are often used as mathematical approximations of computationally expensive experiments. Provided that its kernel is suitably chosen and that enough data is available to obtain a reasonable fit of the simulator, a GP model can beneficially be used for tasks such as prediction, optimization, …

2011-03-21abs ↗pdf ↗

We study a class of weakly identifiable location-scale mixture models for which the maximum likelihood estimates based on nn i.i.d. samples are known to have lower accuracy than the classical n12n^{- \frac{1}{2}} error. We investigate whether the Expectation-Maximization (EM) algorithm also converges slowly for these m…

2019-02-01abs ↗pdf ↗

A new SBI framework for trawl processes efficiently estimates parameters from large datasets.

problem Challenges in estimating parameters of complex stochastic processes.
method Telescoping ratio estimation, Chebyshev polynomial approximations, amortized posterior inference.
result Accurate and efficient inference for intractable stochastic processes, even with limited data.