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.

169,181 papers · 148 categories

Trend · papers per month

141282423564 · Jun 202019922001200920182026
48 results for Recursive Gaussian Processes

RGPs connect predictive coding to Bayesian inference, providing a neural substrate.

problem Scalable implementations of Bayesian inference respecting neurobiological constraints.
method Formal connection between predictive coding and Recursive Gaussian Processes (RGPs).
result RGPs intrinsically implement hierarchical Bayesian inference and uncertainty propagation.

Paper proposes a recursive GPSSM for efficient online learning.

problem Efficient online learning for dynamical models with limited prior information.
method Recursive Gaussian Process State-Space Model with adaptive capabilities for domains and hyperparameters.
result Superior accuracy, computational efficiency, and adaptability compared to state-of-the-art methods.

Improved GP models for scalable large data sets.

problem Computational infeasibility of Gaussian process models for large datasets.
method Composite likelihood approach with recursive computation and hyper-parameter learning.
result The derived composite GP model provides accurate predictions and hyper-parameter learning.

Unified bounds for iterative algorithms with Gaussian data matrices.

problem Establishing non-asymptotic bounds for iterative algorithms with Gaussian data.
method Explicit coupling between iterates and Gaussian process with deterministic covariance.
result Tight, dimension-free bounds for generalized first-order methods.

New method speeds up Gaussian process inference for large datasets.

problem Numerical instability and inefficiency in approximate inference methods for non-Gaussian likelihoods.
method Conjugate-computation variational inference with Kalman recursions.
result Linear-time inference with fast and stable variational inference for state-space GP models.

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.

Gaussian processes (GPs) are versatile tools that have been successfully employed to solve nonlinear estimation problems in machine learning, but that are rarely used in signal processing. In this tutorial, we present GPs for regression as a natural nonlinear extension to optimal Wiener filtering. After establishing th…

2013-03-12abs ↗pdf ↗

Paper develops efficient recursive learning for multi-channel systems with heterogeneous dynamics.

problem Accurately learning system dynamics in complex, multi-channel systems with nonlinear and noisy data.
method Formulates system as Gaussian process state-space models (GPSSMs), introduces heterogeneous multi-output kernel, and develops recursive inference framework.
result Matches SOTA offline GPSSMs in accuracy with 1/100 runtime, and outperforms SOTA online GPSSMs by 70% in accuracy under noise with 1/20 runtime.

The paper links deep neural networks to Gaussian processes, showing convergence under certain conditions.

problem Understanding theoretical properties of deep neural networks.
method Study of random, wide, fully connected feedforward networks and Gaussian processes with recursive kernels.
result As network width increases, random functions converge to Gaussian processes under broad conditions.

Model collapse occurs quickly for synthetic data generated by previous models.

problem Model quality degrades over recursive training on synthetic data.
method Theoretical and experimental evaluations of discrete and Gaussian distributions under near ML estimation.
result Model collapse for discrete distributions is approximately linearly dependent on the number of times a word occurs in the original corpus, and for Gaussian models, the standard deviation reduces to zero roughly at n iterations.

New Riemannian geometry for Compound Gaussian distributions applied to efficient change detection.

problem Change detection in multivariate image times series.
method Developed a recursive approach based on Riemannian optimization.
result Optimal performance achieved with computational efficiency.

Theoretical study on AI models' resilience to data contamination during recursive training.

problem Data contamination in recursive training of generative AI models.
method General framework with minimal assumptions on real data distribution and flexible generative models.
result Contaminated recursive training converges with a rate equal to the minimum of baseline model's rate and contamination fraction.

Ens-CGP synthesizes ensemble-based inference with Gaussian processes.

problem Ensemble-based inference and Gaussian process modeling.
method Formulates Ens-CGP as a conditional Gaussian process for ensemble moments.
result Ens-CGP provides a unified probabilistic foundation for Kalman-type methods.

Sparse Markovian Gaussian processes improve probabilistic model inference for large datasets.

problem Efficient inference for large-scale time series data.
method Combining inducing variables with Kalman filter-like recursions for linear scaling.
result General site-based approach for approximating non-Gaussian likelihoods.

Recursive KalmanNet combines neural networks with Kalman filters for precise state estimation.

problem State estimation in systems with noisy measurements and non-Gaussian noise.
method Recursive KalmanNet uses a recurrent neural network to estimate states with consistent error covariance, optimizing for Gaussian negative log-likelihood.
result Recursive KalmanNet outperforms conventional Kalman filters and deep learning-based estimators in non-Gaussian noise conditions.

Approximates option prices in Barndorff-Nielsen and Shephard models using Taylor expansion.

problem Approximating option prices in complex stochastic volatility models.
method Taylor expansion and recursive algorithm for closed-form approximations.
result Explicit results for inverse Gaussian and gamma stationary distributions, with favorable comparisons to characteristic function.

We use the explicit relation between genus filtrated ss-loop means of the Gaussian matrix model and terms of the genus expansion of the Kontsevich--Penner matrix model (KPMM), which is the generating function for volumes of discretized (open) moduli spaces Mg,sdiscM_{g,s}^{disc} (discrete volumes), to express Gaussian means…

2015-12-31abs ↗pdf ↗

Recursive training of generative models can lead to model collapse, and the recursion converges to a unique limiting distribution.

problem Model collapse in recursive training of generative models
method Recursive training on their own outputs
result Recursive training converges to a unique limiting distribution

A novel optimization-based Gaussian mixture reduction method using composite transportation divergence.

problem Exponential increase in Gaussian mixture order leads to intractable inference.
method Optimization-based Gaussian mixture reduction (GMR) using composite transportation divergence (CTD).
result Unified framework for selecting optimal cost function in various applications.

Stable processes emerge as limits of deep neural networks with symmetric stable distributions.

problem Understanding the behavior of deep neural networks as they become infinitely wide.
method Analyzing fully connected feed-forward deep neural networks with symmetric stable distributions and showing the limit as a stable process.
result The infinite wide limit of the network is a stable process with multivariate stable distributions.

To scale Gaussian processes (GPs) to large data sets we introduce the robust Bayesian Committee Machine (rBCM), a practical and scalable product-of-experts model for large-scale distributed GP regression. Unlike state-of-the-art sparse GP approximations, the rBCM is conceptually simple and does not rely on inducing or …

2015-02-10abs ↗pdf ↗

Enhances Gaussian process regression with multi-fidelity models and active subspaces for high-dimensional problems.

problem Data scarcity and high-dimensional input spaces with low intrinsic dimensionality.
method Employ Gaussian processes in a Bayesian setting, augmenting with low-fidelity models, and exploiting active subspaces.
result Improves model accuracy through multi-fidelity Gaussian process regression with active subspaces.

The paper studies risk-sensitive MDPs with recursive risk measures.

problem Risk-sensitive decision-making in MDPs with unbounded costs.
method Recursive application of static risk measures, Bellman equation derivation, existence of optimal policies.
result Existence of Markovian optimal policies for infinite planning horizons, contractive model for stationary optimal policy.

Bayesian deep neural networks converge to processes with α-stable marginals under infinite variance weights.

problem Representation learning in deep kernel processes is hindered by deterministic covariance kernels.
method Showed convergence to α-stable processes with conditionally Gaussian representations in infinite-width networks.
result Conditional random covariance kernels can be recursively linked, even if the process is α-stable.

Study adds investment gains and losses to recursive utility model, proving existence and uniqueness of utility process.

problem Existence and uniqueness of utility process in a recursive utility model with investment gains and losses.
method Generalized recursive utility model with constant elasticity of intertemporal substitution and relative risk aversion degree. Proved existence and uniqueness in a specific, finite-state Markovian setting.
result Utility process exists and is unique when agent derives nonnegative gain-loss utility, and non-existent or non-unique otherwise.

New method tackles model uncertainty in stochastic control using Bayesian nonparametrics.

problem Model uncertainty in stochastic control problems.
method Nonparametric Bayesian approach with Dirichlet process for unknown distributions, online learning, and Gaussian process surrogates.
result Demonstrates financial advantages of nonparametric Bayesian over parametric methods.

A scalable GP model for online uncertainty quantification over graphs.

problem Scalable uncertainty quantification over graphs with dynamic data.
method Graph-aware parametric Gaussian process model using random features and online conformal prediction.
result Improved coverage and efficient prediction sets over existing methods.

In this paper we demonstrate that tempering Markov chain Monte Carlo samplers for Bayesian models by recursively subsampling observations without replacement can improve the performance of baseline samplers in terms of effective sample size per computation. We present two tempering by subsampling algorithms, subsampled…

2014-01-28abs ↗pdf ↗

This paper refines the Gaussian Sinkhorn algorithm for general multivariate models.

problem Finite-dimensional solutions for general Gaussian multivariate models.
method Recursive formulation of the Sinkhorn algorithm for Gaussian models, including closed form expressions of entropic transport maps and Schrödinger bridges.
result Refined convergence analysis of Gaussian Sinkhorn algorithms.

Recurrent neural networks (RNNs) process input text sequentially and model the conditional transition between word tokens. In contrast, the advantages of recursive networks include that they explicitly model the compositionality and the recursive structure of natural language. However, the current recursive architectur…

2016-07-15abs ↗pdf ↗

The paper presents a novel approach to multi-output regression using probabilistic circuits.

problem Capturing correlations between multiple output dimensions in large-scale regression problems.
method Employing a mixture of single-output Gaussian process experts encoded via a probabilistic circuit.
result The method can capture correlations between output dimensions and often outperforms other approaches.

This paper removes the finite variance assumption for deep convolutional neural networks.

problem Removing the finite variance assumption for deep convolutional neural networks.
method Assuming iid parameters distributed according to a stable distribution, the paper shows that the infinite-channel limit of a deep feed-forward convolutional neural network is a multivariate stable stochastic process.
result The infinite-channel limit of a deep feed-forward convolutional neural network, under suitable scaling, is a multivariate stable stochastic process.

The paper develops a method to estimate conditional survival probabilities under noisy firm value data.

problem Estimating conditional default probabilities in models with partial information about firm value.
method Recursive quantization method to approximate conditional survival probabilities.
result The recursive quantization method provides a way to approximate conditional survival probabilities under noisy data.

GP-PSRL achieves sublinear regret for continuous control with unbounded state space.

problem Analyzing regret bounds for GP-PSRL in continuous control with unbounded state space.
method Recursive application of Borell-Tsirelson-Ibragimov-Sudakov inequality and chaining method.
result Sublinear regret bound of O~(HγTT)\widetilde{\mathcal{O}}(H\sqrt{γ_TT}) for GP-PSRL.

Deep learning solves dynamic programming with recursive utility.

problem Challenges in solving high-dimensional discrete-time dynamic programming problems with recursive utility.
method Certainty Equivalent Learning (CEL) algorithm that learns certainty-equivalent value directly with neural networks.
result Accurate value and policy approximations in high-dimensional problems, comparable to VFI in some cases.