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

Trend · papers per month

64127191254 · Jun 202019922001200920172026
48 results for Assumed Density Filtering

Deep density methods improve filtering in high-dimensional systems.

problem Nonlinear filtering in high-dimensional systems.
method Two deep density methods based on Feynman-Kac formulas and neural networks.
result Logarithmic deep backward stochastic differential equation filter outperforms classical methods in high dimensions.

The kernel least-mean-square (KLMS) algorithm is an appealing tool for online identification of nonlinear systems due to its simplicity and robustness. In addition to choosing a reproducing kernel and setting filter parameters, designing a KLMS adaptive filter requires to select a so-called dictionary in order to get a…

2013-10-31abs ↗pdf ↗

EnEMF uses Epanechnikov kernel for high-dimensional filtering, improving accuracy and robustness.

problem Suboptimal Gaussian mixture kernel density estimates in high-dimensional settings.
method Ensemble Epanechnikov mixture filter (EnEMF) using optimal Epanechnikov kernel.
result EnEMF reduces error per particle on high-dimensional systems like Lorenz '96.

Many nonlinear extensions of the Kalman filter, e.g., the extended and the unscented Kalman filter, reduce the state densities to Gaussian densities. This approximation gives sufficient results in many cases. However, this filters only estimate states that are correlated with the observation. Therefore, sequential esti…

2012-07-18abs ↗pdf ↗

Deep learning has the potential to dramatically impact navigation and tracking state estimation problems critical to autonomous vehicles and robotics. Measurement uncertainties in state estimation systems based on Kalman and other Bayes filters are typically assumed to be a fixed covariance matrix. This assumption is r…

2019-10-31abs ↗pdf ↗

Generative Bayesian Filtering improves inference in complex models without explicit density evaluations.

problem Performing posterior inference in complex nonlinear and non-Gaussian state-space models.
method Generative Bayesian Filtering (GBF) extends GBC to dynamic settings using deep neural networks for recursive posterior inference. Generative-Gibbs sampler bypasses density evaluations for parameter learning.
result GBF significantly outperforms likelihood-free approaches in accuracy and robustness for intractable state-space models.

Joint state and parameter estimation is a core problem for dynamic Bayesian networks. Although modern probabilistic inference toolkits make it relatively easy to specify large and practically relevant probabilistic models, the silver bullet---an efficient and general online inference algorithm for such problems---remai…

2016-03-29abs ↗pdf ↗

We formulate and analyze an inverse problem using derivatives prices to obtain an implied filtering density on volatility's hidden state. Stochastic volatility is the unobserved state in a hidden Markov model (HMM) and can be tracked using Bayesian filtering. However, derivative data can be considered as conditional ex…

2012-03-29abs ↗pdf ↗

A new numerical scheme approximates nonlinear filtering densities for noisy and partial measurements.

problem Approximating nonlinear filtering densities for noisy and partial measurements.
method Deep splitting scheme applied to the Fokker--Planck equation followed by Bayes' formula.
result Convergence rate established for the numerical scheme under parabolic Hörmander condition.

EnSF improves accuracy in tracking high-dimensional nonlinear systems.

problem Low accuracy in high-dimensional, nonlinear filtering problems.
method Score-based diffusion model, mini-batch Monte Carlo estimator.
result EnSF outperforms state-of-the-art methods in tracking high-dimensional systems.

The vast majority of the neural network literature focuses on predicting point values for a given set of response variables, conditioned on a feature vector. In many cases we need to model the full joint conditional distribution over the response variables rather than simply making point predictions. In this paper, we …

2016-06-07abs ↗pdf ↗

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 ↗

This paper examines a heterogeneous beliefs model in which there is a process that is only partially observed by the agents. The economy contains a risky asset producing dividends continuously in time. The dividends are observed by the agents. The dividends are assumed to be a known function of some other unobserved pr…

2009-07-28abs ↗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 ↗

Paper proves convergence of Kalman filter on Stiefel manifolds with measurement errors.

problem Filtering constant particle with measurement errors on Stiefel manifolds.
method Extended Kalman filter applied to Stiefel manifold-valued observations.
result Convergence of the extended Kalman filter proved for constant system process.

We propose a Fourier-based approach for optimization of several clustering algorithms. Mathematically, clusters data can be described by a density function represented by the Dirac mixture distribution. The density function can be smoothed by applying the Fourier transform and a Gaussian filter. The determination of th…

2019-04-29abs ↗pdf ↗

In nonlinear state-space models, sequential learning about the hidden state can proceed by particle filtering when the density of the observation conditional on the state is available analytically (e.g. Gordon et al., 1993). This condition need not hold in complex environments, such as the incomplete-information equili…

2011-05-23abs ↗pdf ↗

A method for optimal Bayesian filtering using progressive particle flow and optimal transport maps.

problem Optimizing Bayesian filtering with deterministic particles to avoid degeneration.
method Progressive flow of particles through a sequence of sub-steps, each using an optimal transport map to replace non-equally weighted particles with equally weighted ones.
result The method avoids particle degeneration and simplifies the filtering process by not requiring inversions or monotonicity constraints.

Accurate forecasting of risk is the key to successful risk management techniques. Using the largest stock index futures from twelve European bourses, this paper presents VaR measures based on their unconditional and conditional distributions for single and multi-period settings. These measures underpinned by extreme va…

2011-03-29abs ↗pdf ↗

Optimal Bayesian feature filtering (OBF) is a supervised screening method designed for biomarker discovery. In this article, we prove two major theoretical properties of OBF. First, optimal Bayesian feature selection under a general family of Bayesian models reduces to filtering if and only if the underlying Bayesian m…

2019-09-09abs ↗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.

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.

A new flow-based Bayesian filter tackles high-dimensional nonlinear stochastic systems.

problem Bayesian filtering for high-dimensional nonlinear systems is challenging due to non-Gaussian distributions and computational limitations.
method Integrates normalizing flows to construct a latent linear state-space model with efficient density estimation and sampling.
result Demonstrates superior accuracy and efficiency in numerical experiments.

Gradient filters track moving parameters under noisy data and misspecification.

problem Tracking multidimensional time-varying parameters under noisy observations and model misspecification.
method Gradient-based filters update parameters using the gradient of a postulated objective function, evaluated at either the predicted or updated parameters.
result Novel sufficient conditions for exponential stability of the filtered parameter path, and finite-sample and asymptotic mean squared error bounds.

We propose a Conditional Density Filtering (C-DF) algorithm for efficient online Bayesian inference. C-DF adapts MCMC sampling to the online setting, sampling from approximations to conditional posterior distributions obtained by propagating surrogate conditional sufficient statistics (a function of data and parameter …

2014-01-15abs ↗pdf ↗

This paper addresses the problem of filtering with a state-space model. Standard approaches for filtering assume that a probabilistic model for observations (i.e. the observation model) is given explicitly or at least parametrically. We consider a setting where this assumption is not satisfied; we assume that the knowl…

2013-12-17abs ↗pdf ↗

This paper is concerned with nonlinear filtering of the coefficients in asset price models with stochastic volatility. More specifically, we assume that the asset price process S=(St)t0S=(S_{t})_{t\geq0} is given by \[ dS_{t}=m(θ_{t})S_{t} dt+v(θ_{t})S_{t} dB_{t}, \] where B=(Bt)t0B=(B_{t})_{t\geq0} is a Brownian motion, vv is a …

2006-12-08abs ↗pdf ↗

This paper is concerned with nonlinear filtering of the coefficients in asset price models with stochastic volatility. More specifically, we assume that the asset price process S=(St)t0 S=(S_{t})_{t\geq0} is given by \[ dS_{t}=r(θ_{t})S_{t}dt+v(θ_{t})S_{t}dB_{t}, \] where B=(Bt)t0B=(B_{t})_{t\geq0} is a Brownian motion, vv is a …

2005-09-22abs ↗pdf ↗

Stable and consistent model alignment for language models without assuming human preference models.

problem Lack of statistical consistency in existing alignment methods.
method Relative density ratio optimization between preferred and mixture of preferred and non-preferred data distributions.
result Our approach achieves statistical consistency and stability, providing tighter convergence guarantees.