A new approach to learning in Dynamic Bayesian Networks (DBNs)

12/21/2018
by   E. Benhamou, et al.
0

In this paper, we revisit the parameter learning problem, namely the estimation of model parameters for Dynamic Bayesian Networks (DBNs). DBNs are directed graphical models of stochastic processes that encompasses and generalize Hidden Markov models (HMMs) and Linear Dynamical Systems (LDSs). Whenever we apply these models to economics and finance, we are forced to make some modeling assumptions about the state dynamics and the graph topology (the DBN structure). These assumptions may be incorrectly specified and contain some additional noise compared to reality. Trying to use a best fit approach through maximum likelihood estimation may miss this point and try to fit at any price these models on data. We present here a new methodology that takes a radical point of view and instead focus on the final efficiency of our model. Parameters are hence estimated in terms of their efficiency rather than their distributional fit to the data. The resulting optimization problem that consists in finding the optimal parameters is a hard problem. We rely on Covariance Matrix Adaptation Evolution Strategy (CMA-ES) method to tackle this issue. We apply this method to the seminal problem of trend detection in financial markets. We see on numerical results that the resulting parameters seem less error prone to over fitting than traditional moving average cross over trend detection and perform better. The method developed here for algorithmic trading is general. It can be applied to other real case applications whenever there is no physical law underlying our DBNs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/14/2019

NGO-GM: Natural Gradient Optimization for Graphical Models

This paper deals with estimating model parameters in graphical models. W...
research
11/28/2018

Kalman filter demystified: from intuition to probabilistic graphical model to real case in financial markets

In this paper, we revisit the Kalman filter theory. After giving the int...
research
01/30/2023

Structure Learning and Parameter Estimation for Graphical Models via Penalized Maximum Likelihood Methods

Probabilistic graphical models (PGMs) provide a compact and flexible fra...
research
10/05/2017

Learning Graphical Models from a Distributed Stream

A current challenge for data management systems is to support the constr...
research
06/09/2021

Robust Prediction Interval estimation for Gaussian Processes by Cross-Validation method

Probabilistic regression models typically use the Maximum Likelihood Est...
research
03/17/2022

Design of Compressed Sensing Systems via Density-Evolution Framework for Structure Recovery in Graphical Models

It has been shown that the task of learning the structure of Bayesian ne...
research
02/05/2019

Discovering bursts revisited: guaranteed optimization of the model parameters

One of the classic data mining tasks is to discover bursts, time interva...

Please sign up or login with your details

Forgot password? Click here to reset