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

Trend · papers per month

2665327981,064 · Jun 202019922001200920172026
48 results for Gaussian state space

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.

In this paper we investigate a link between state- space models and Gaussian Processes (GP) for time series modeling and forecasting. In particular, several widely used state- space models are transformed into continuous time form and corresponding Gaussian Process kernels are derived. Experimen- tal results demonstrat…

2016-10-25abs ↗pdf ↗

A novel multi-resolution Gaussian process model for efficient time traversal.

problem Inference for long sequences with fast and slow transitions is difficult.
method A novel Gaussian process state-space architecture composed of multiple components, each trained on a different resolution.
result The combined model allows efficient inference for arbitrarily long sequences with complex dynamics.

We provide a comprehensive overview and tooling for GP modeling with non-Gaussian likelihoods using state space methods. The state space formulation allows for solving one-dimensional GP models in O(n)\mathcal{O}(n) time and memory complexity. While existing literature has focused on the connection between GP regression …

2018-02-13abs ↗pdf ↗

Robust state-space radio interferometric imaging using Stochastic Approximation Expectation Maximization

problem Improving state-space radio interferometric imaging in the presence of heavy-tailed noise
method Stochastic Approximation Expectation Maximization
result Significant improvement in reconstruction fidelity and robustness to radio-frequency interference

A new method for Gaussian filtering using gradient flows and Wasserstein metrics.

problem Approximating Gaussian and mixture-of-Gaussians filtering for complex systems.
method Variational approximation via gradient-flow representation on Wasserstein metric space.
result Competitive performance in posterior representation and parameter estimation for systems with multiplicative noise and multi-modal distributions.

In this paper, the problem of state estimation, in the context of both filtering and smoothing, for nonlinear state-space models is considered. Due to the nonlinear nature of the models, the state estimation problem is generally intractable as it involves integrals of general nonlinear functions and the filtered and sm…

2020-02-07abs ↗pdf ↗

The use of Gaussian process models is typically limited to datasets with a few tens of thousands of observations due to their complexity and memory footprint. The two most commonly used methods to overcome this limitation are 1) the variational sparse approximation which relies on inducing points and 2) the state-space…

2020-01-15abs ↗pdf ↗

Gaussian processes are used in machine learning to learn input-output mappings from observed data. Gaussian process regression is based on imposing a Gaussian process prior on the unknown regressor function and statistically conditioning it on the observed data. In system identification, Gaussian processes are used to …

2019-07-13abs ↗pdf ↗

ETGPSSM efficiently models high-dimensional, non-stationary systems with reduced complexity.

problem Prohibitive computational and parametric complexity in high-dimensional, non-stationary dynamical systems.
method ETGPSSM integrates a single shared GP with input-dependent normalizing flows for scalable and flexible modeling.
result ETGPSSM outperforms existing models in computational efficiency and accuracy.

A new active learning method for Gaussian process models.

problem Efficiently exploring unbounded state spaces for accurate models.
method Maximizes mutual information with respect to a bounded region using model predictive control.
result Our method yields a better model within the region of interest than entropy-based 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.

Generalizes bits back coding for time-series models with latent Markov structures.

problem Efficiently compressing time-series data with latent Markov structures.
method Extends bits back coding to time-series models with latent Markov structures, including HMMs and LGSSMs.
result Effective for small scale models, promising for larger scale settings like video compression.

We prove a conjecture about approximating Gaussian Processes on one dimension.

problem Computational scaling issues with Gaussian Processes on one dimension.
method Developed a new family of state-space models (LEG) to approximate any stationary GP on one dimension.
result Proved that any stationary GP on one dimension can be approximated using the LEG family.

State-space models have been successfully used for more than fifty years in different areas of science and engineering. We present a procedure for efficient variational Bayesian learning of nonlinear state-space models based on sparse Gaussian processes. The result of learning is a tractable posterior over nonlinear dy…

2014-06-18abs ↗pdf ↗

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 Gaussian Process model for predicting trajectories without independence assumption errors.

problem Incorrect independence assumption in previous work on Gaussian Process uncertainty propagation.
method Proposed a novel piecewise linear approximation to correct the independence assumption in continuous models.
result Corrected the independence assumption in Gaussian Process models for predicting trajectories.

The paper introduces a new pairs trading model using nonlinear and non-Gaussian state-space models.

problem Developing a robust trading strategy for pairs of assets with non-Gaussian and heteroskedastic innovations.
method A nonlinear and non-Gaussian state-space model for the spread between two assets, with mean reversion modeled as a mean-reverting process.
result The new trading strategy yields significantly higher returns and Sharpe ratios compared to existing methods.

A new method learns complex dynamical systems from data efficiently.

problem Learning complex dynamical systems from large-scale data efficiently.
method Low-rank structured variational autoencoding framework for nonlinear Gaussian state-space models.
result Consistently demonstrates better predictive capabilities compared to other models.

New method for efficient Bayesian inference in GPSSMs.

problem Challenges in inference for Gaussian process state-space models.
method Free-form variational inference with stochastic gradient Hamiltonian Monte Carlo.
result Our method learns transition dynamics and latent states more accurately than competing methods.

New method for state inference in state-space models with unknown dynamics.

problem State inference in state-space models with computationally expensive and undefined dynamics.
method Estimate state transition dynamics using a multi-output Gaussian process and Bayesian Neural Network as a surrogate model.
result Significant improvement in accuracy for state inference and prediction in non-stationary user models.

We consider a nonlinear state-space model with the state transition and observation functions expressed as basis function expansions. The coefficients in the basis function expansions are learned from data. Using a connection to Gaussian processes we also develop priors on the coefficients, for tuning the model flexibi…

2016-03-17abs ↗pdf ↗

Gaussian processes provide a flexible framework for forecasting, removing noise, and interpreting long temporal datasets. State space modelling (Kalman filtering) enables these non-parametric models to be deployed on long datasets by reducing the complexity to linear in the number of data points. The complexity is stil…

2018-11-15abs ↗pdf ↗

The Gaussian process state space model (GPSSM) is a non-linear dynamical system, where unknown transition and/or measurement mappings are described by GPs. Most research in GPSSMs has focussed on the state estimation problem, i.e., computing a posterior of the latent state given the model. However, the key challenge in…

2017-05-30abs ↗pdf ↗

GWI combines deep neural networks with Gaussian processes for better predictive performance and uncertainty quantification.

problem Combining deep learning with Gaussian process uncertainty quantification.
method Gaussian Wasserstein inference (GWI) using Wasserstein distance between Gaussian measures.
result GWI achieves state-of-the-art performance on benchmark datasets.

Combines pseudo-point and state space approximations for scalable GPs.

problem Handling large numbers of off-the-grid spatial data-points and long time-series.
method Combines pseudo-point approximations for spatial data with state space GP approximations for temporal data.
result Combined approach is more scalable and applicable to a greater range of spatio-temporal problems.

The state space (SS) representation of Gaussian processes (GP) has recently gained a lot of interest. The main reason is that it allows to compute GPs based inferences in O(n), where nn is the number of observations. This implementation makes GPs suitable for Big Data. For this reason, it is important to provide a SS …

2016-01-07abs ↗pdf ↗

Bayesian filtering approach identifies nonlinear restoring forces in dynamic systems.

problem Identification of nonlinear dynamic systems in engineering.
method Modeling the nonlinear restoring force as a Gaussian process, converting it to a state-space model, and inferring internal states and the nonlinear restoring force through filtering and smoothing.
result The approach effectively identifies nonlinear restoring forces in both simulated and experimental datasets.

New variational inference approach using Hilbert space for robotic state estimation.

problem Robotic state estimation with high-dimensional data.
method Variational inference reformulated in a Bayesian Hilbert space, using iterative projection.
result Variational inference can be seen as iterative projection in Euclidean space.

A Bayesian filtering algorithm is developed for a class of state-space systems that can be modelled via Gaussian mixtures. In general, the exact solution to this filtering problem involves an exponential growth in the number of mixture terms and this is handled here by utilising a Gaussian mixture reduction step after …

2017-05-16abs ↗pdf ↗

The study characterizes canal hypersurfaces in Euclidean spaces and their curvature properties.

problem Characterizing canal hypersurfaces in Euclidean spaces.
method Analyzing canal hypersurfaces in Euclidean n-space, focusing on E4, computing curvature properties, and proving specific cases.
result Flat canal hypersurfaces in Euclidean 4-space are only circular hypercylinders or circular hypercones, and minimal canal hypersurfaces are only generalized catenoids.

A method for robust reinforcement learning in large state spaces.

problem Challenges in RL with large state spaces, costly data, and real-world dynamics deviation.
method Distributionally robust Markov decision processes with Gaussian Processes and maximum variance reduction.
result Efficient learning of multi-output nominal transition dynamics with statistical sample complexity bounds.

We show that the visible sector probability density function of the Riemann-Theta Boltzmann machine corresponds to a gaussian mixture model consisting of an infinite number of component multi-variate gaussians. The weights of the mixture are given by a discrete multi-variate gaussian over the hidden state space. This a…

2018-04-20abs ↗pdf ↗