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

3907801,1701,560 · Jun 202019922001200920172026
48 results for Gaussian additive models

Improved Gaussian process models for interpretable predictions.

problem Complex responses require high-dimensional interaction terms in additive Gaussian processes.
method Orthogonal additive kernel (OAK) with orthogonality constraint on additive functions.
result OAK models achieve similar or better predictive performance with fewer terms, retaining interpretability.

Combines additivity and active subspaces for high-dimensional Gaussian process modeling.

problem High-dimensional Gaussian process modeling challenges due to the curse of dimensionality.
method Combines additivity and active subspaces with a multi-fidelity strategy.
result Shows advantages through experiments on synthetic functions and datasets.

Projection pursuit model improves Gaussian process regression for high-dimensional data.

problem Scalability issues with traditional Gaussian process models in high dimensions.
method Additive Gaussian process regression with dimension expansion and gradient descent.
result The proposed method approximates more complex functions and outperforms traditional models.

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.

We introduce a Gaussian process model of functions which are additive. An additive function is one which decomposes into a sum of low-dimensional functions, each depending on only a subset of the input variables. Additive GPs generalize both Generalized Additive Models, and the standard GP models which use squared-expo…

2011-12-19abs ↗pdf ↗

Generalized additive models (GAMs) are a widely used class of models of interest to statisticians as they provide a flexible way to design interpretable models of data beyond linear models. We here propose a scalable and well-calibrated Bayesian treatment of GAMs using Gaussian processes (GPs) and leveraging recent adv…

2018-12-28abs ↗pdf ↗

Deep Gaussian processes (DGPs) can model complex marginal densities as well as complex mappings. Non-Gaussian marginals are essential for modelling real-world data, and can be generated from the DGP by incorporating uncorrelated variables to the model. Previous work on DGP models has introduced noise additively and use…

2019-05-14abs ↗pdf ↗

Scalable algorithm for sampling Gaussian processes using sparse grids and preconditioners.

problem Generating high-dimensional Gaussian random vectors for GP sampling is computationally challenging.
method Proposes a scalable algorithm using inducing points approximation with sparse grids and additive Schwarz preconditioners.
result Demonstrates the efficacy and accuracy of the proposed method through experiments and comparisons.

We propose a partially linear additive Gaussian graphical model (PLA-GGM) for the estimation of associations between random variables distorted by observed confounders. Model parameters are estimated using an L1L_1-regularized maximal pseudo-profile likelihood estimator (MaPPLE) for which we prove n\sqrt{n}-sparsisten…

2019-06-08abs ↗pdf ↗

The paper forecasts joint electricity demand across 14 British regions using additive models.

problem Forecasting regional electricity demand with cross-regional dependencies.
method Modified Cholesky parametrisation for multivariate Gaussian model, gradient boosting for model selection.
result The proposed model outperforms non-Gaussian copula-based models in forecasting.

A scalable Bayesian additive model for stellar flare detection using Gaussian process inference and hidden Markov models.

problem Bayesian time-series modeling for astronomical datasets
method Generative surrogate framework with Variational Autoencoder and neural network forward pass
result Significant reduction in computational time for stellar flare detection

This study converts BART to Gaussian process regression, revealing its limitations and potential improvements.

problem Understanding the Gaussian process limit of BART and its implications.
method Deriving and computing BART's prior covariance function, implementing the infinite trees limit as GP regression, and tuning hyperparameters.
result The Gaussian process limit of BART is inferior to standard BART but can be made competitive with proper hyperparameter tuning.

Optimized Franz-Parisi criterion matches SQ lower bounds for various statistical models.

problem Understanding computational hardness in statistical inference.
method Proposed and refined Franz-Parisi criterion, established equivalence with SQ lower bounds.
result Optimized Franz-Parisi criterion is equivalent to Statistical Query (SQ) lower bounds.

Much recent work has concerned sparse approximations to speed up the Gaussian process regression from the unfavorable O(n3) scaling in computational time to O(nm2). Thus far, work has concentrated on models with one covariance function. However, in many practical situations additive models with multiple covariance func…

2012-06-13abs ↗pdf ↗

Paper introduces a nonparametric functional graphical model for random functions.

problem Estimating probabilistic conditional independence in functional graphical models.
method Functional sufficient dimension reduction to relax Gaussian or copula Gaussian assumptions.
result Enhances estimation accuracy and retains probabilistic conditional independence.

Kernel Multigrid accelerates Back-fitting for additive Gaussian Processes.

problem Slow convergence of Back-fitting in training additive Gaussian Processes.
method Kernel Packets (KP) and Sparse Gaussian Process Regression (GPR) to enhance Back-fitting.
result Kernel Multigrid reduces the required iterations to O(logn)\mathcal{O}(\log n).

Combines BART and Gaussian process for spatial covariate prediction with uncertainty.

problem Improving spatial prediction models with nonlinear and interaction covariates.
method Bayesian Additive Regression Trees (BART) combined with Gaussian process for spatial dependence.
result Effective in reducing computational burden through INLA and MCMC.

New algorithm for collective Gaussian hidden Markov models inference.

problem Inference of collective Gaussian hidden Markov models from aggregate data.
method Collective Gaussian forward-backward algorithm, extending Sinkhorn belief propagation.
result Convergence guarantee and applicability to single individual Kalman filter.

Additive Gaussian process framework handles monotonicity constraints in high dimensions.

problem Handling monotonicity constraints in high-dimensional data.
method Additive Gaussian process framework with MaxMod algorithm for dimension reduction.
result Framework enables to satisfy monotonicity constraints everywhere in the input space.

The paper analyzes and mitigates biases in scalable Gaussian Process methods.

problem Modeling biases in scalable Gaussian Process methods.
method Randomized truncation estimators to eliminate bias in exchange for increased variance.
result Randomized truncation estimators meaningfully outperform biased counterparts with minimal additional computation.

Method estimates bivariate causal models using normalising flows and variational Gaussian process regression.

problem Lack of explainability in AI models, especially in causal mechanisms.
method Combination of normalising flows for density estimation and variational Gaussian process regression for post-nonlinear models.
result Method better explains cause-effect pairs than simple additive noise models.

Gaussian processes struggle with compositional functions, but deep Gaussian processes can outperform.

problem Gaussian process regression struggles with compositional functions.
method We study information-theoretic lower bounds for posterior contraction rates in Gaussian process regression for a continuous regression model.
result Posterior based on any mean-zero Gaussian process can only recover the truth at a rate strictly slower than the minimax rate for generalized additive functions.

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 ↗

Gaussian graphical model is a graphical representation of the dependence structure for a Gaussian random vector. It is recognized as a powerful tool in different applied fields such as bioinformatics, error-control codes, speech language, information retrieval and others. Gaussian graphical model selection is a statist…

2017-01-09abs ↗pdf ↗

BARK optimizes black-box functions using Bayesian Additive Regression Trees.

problem Bayesian optimization of complex, black-box functions with uncertainty quantification.
method BART Kernel using tree agreement for posterior over piecewise-constant functions, explored using MCMC.
result BARK obtains samples of Gaussian processes for function distributions, enabling acquisition functions for optimization.

Paper presents characteristic function of Tsallis q-Gaussian and its applications.

problem Modeling input quantities in measurement models using Tsallis q-Gaussians.
method Developed a characteristic function and proposed a numerical method for its inversion.
result Exact probability distribution of output quantities can be determined.

Sparse matrices simplify computation of GP variances and likelihoods.

problem Efficient computation of posterior variance and log-likelihood for additive Matérn GPs.
method Represented posterior mean, variance, log-likelihood, and gradient using sparse matrices.
result Efficient computation of posterior mean, variance, log-likelihood, and gradient in O(nlogn)O(n \log n) time.

We study learning problems in which the conditional distribution of the output given the input varies as a function of additional task variables. In varying-coefficient models with Gaussian process priors, a Gaussian process generates the functional relationship between the task variables and the parameters of this con…

2015-08-28abs ↗pdf ↗

A model learns causal representations from high-dimensional data.

problem Challenges in learning causal representations from high-dimensional data.
method Formulated a latent variable decoder model, Decoder BCD, for Bayesian causal discovery.
result Shows that using known intervention targets as labels helps in unsupervised Bayesian inference over structure and parameters.

Bayesian inference for wide neural networks using Edgeworth expansion.

problem Analyzing the non-Gaussian behavior of wide neural networks in Bayesian inference.
method Proposed a non-Gaussian distribution using multivariate Edgeworth expansion for finite-width neural networks.
result Derived non-Gaussian posterior distribution in Bayesian regression tasks.

Gaussian process models are flexible, Bayesian non-parametric approaches to regression. Properties of multivariate Gaussians mean that they can be combined linearly in the manner of additive models and via a link function (like in generalized linear models) to handle non-Gaussian data. However, the link function formal…

2016-04-18abs ↗pdf ↗