English
Related papers

Related papers: A review of Gaussian Markov models for conditional…

200 papers

Gaussian process emulators of computationally expensive computer codes provide fast statistical approximations to model physical processes. The training of these surrogates depends on the set of design points chosen to run the simulator.…

Computation · Statistics 2016-08-16 A. Garbuno-Inigo , F. A. DiazDelaO , K. M. Zuev

We introduce graphical time series models for the analysis of dynamic relationships among variables in multivariate time series. The modelling approach is based on the notion of strong Granger causality and can be applied to time series…

Statistics Theory · Mathematics 2011-07-18 Michael Eichler

Ancestral graphs can encode conditional independence relations that arise in directed acyclic graph (DAG) models with latent and selection variables. However, for any ancestral graph, there may be several other graphs to which it is Markov…

Statistics Theory · Mathematics 2009-08-26 R. Ayesha Ali , Thomas S. Richardson , Peter Spirtes

Traditional hidden Markov models have been a useful tool to understand and model stochastic dynamic data; in the case of non-Gaussian data, models such as mixture of Gaussian hidden Markov models can be used. However, these suffer from the…

Machine Learning · Statistics 2023-05-16 Carlos Puerto-Santana , Concha Bielza , Pedro Larrañaga , Gustav Eje Henter

We study discrete-time, discrete-state multistate Markov models from the perspective of algebraic statistics. These models are widely studied in event history analysis, and are characterized by the state space, the initial distribution and…

The main approach to defining equivalence among acyclic directed causal graphical models is based on the conditional independence relationships in the distributions that the causal models can generate, in terms of the Markov equivalence.…

Machine Learning · Computer Science 2020-07-03 AmirEmad Ghassami , Alan Yang , Negar Kiyavash , Kun Zhang

Much of the causal discovery literature prioritises guaranteeing the identifiability of causal direction in statistical models. For structures within a Markov equivalence class, this requires strong assumptions which may not hold in…

Machine Learning · Statistics 2024-05-29 Anish Dhir , Samuel Power , Mark van der Wilk

Causal DAGs (also known as Bayesian networks) are a popular tool for encoding conditional dependencies between random variables. In a causal DAG, the random variables are modeled as vertices in the DAG, and it is stipulated that every…

Data Structures and Algorithms · Computer Science 2024-07-04 Vidya Sagar Sharma

Matrix Schubert varieties are certain varieties in the affine space of square matrices which are determined by specifying rank conditions on submatrices. We study these varieties for generic matrices, symmetric matrices, and upper…

Algebraic Geometry · Mathematics 2016-09-14 Alex Fink , Jenna Rajchgot , Seth Sullivant

Markov processes are widely used in modeling random phenomena/problems. However, they may not be adequate in some cases where more general processes are needed. The conditionally Markov (CM) process is a generalization of the Markov process…

Probability · Mathematics 2021-03-16 Reza Rezaie , X. Rong Li

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,…

Machine Learning · Statistics 2017-01-10 Valery A. Kalyagin , Alexander P. Koldanov , Petr A. Koldanov , Panos M. Pardalos

Many probabilistic models introduce strong dependencies between variables using a latent multivariate Gaussian distribution or a Gaussian process. We present a new Markov chain Monte Carlo algorithm for performing inference in models with…

Computation · Statistics 2010-03-22 Iain Murray , Ryan Prescott Adams , David J. C. MacKay

We compare different selection criteria to choose the number of latent states of a multivariate latent Markov model for longitudinal data. This model is based on an underlying Markov chain to represent the evolution of a latent…

Methodology · Statistics 2012-12-04 Silvia Bacci , Silvia Pandolfi , Fulvia Pennoni

The PC algorithm uses conditional independence tests for model selection in graphical modeling with acyclic directed graphs. In Gaussian models, tests of conditional independence are typically based on Pearson correlations, and…

Statistics Theory · Mathematics 2012-07-03 Naftali Harris , Mathias Drton

In many applications we have both observational and (randomized) interventional data. We propose a Gaussian likelihood framework for joint modeling of such different data-types, based on global parameters consisting of a directed acyclic…

Statistics Theory · Mathematics 2014-06-03 Alain Hauser , Peter Bühlmann

Markov automata combine non-determinism, probabilistic branching, and exponentially distributed delays. This compositional variant of continuous-time Markov decision processes is used in reliability engineering, performance evaluation and…

Logic in Computer Science · Computer Science 2017-05-11 Tim Quatmann , Sebastian Junges , Joost-Pieter Katoen

Acyclic directed mixed graphs, also known as semi-Markov models represent the conditional independence structure induced on an observed margin by a DAG model with latent variables. In this paper we present a factorization criterion for…

Artificial Intelligence · Computer Science 2014-06-27 Thomas S. Richardson

The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabilities via product of parameters are shown to capture…

Artificial Intelligence · Computer Science 2012-06-18 Ydo Wexler , Christopher Meek

Graphical causal models are an important tool for knowledge discovery because they can represent both the causal relations between variables and the multivariate probability distributions over the data. Once learned, causal graphs can be…

Artificial Intelligence · Computer Science 2017-04-11 Andrew J Sedgewick , Joseph D. Ramsey , Peter Spirtes , Clark Glymour , Panayiotis V. Benos

We propose two new measures for extracting the unique information in $X$ and not $Y$ about a message $M$, when $X, Y$ and $M$ are joint random variables with a given joint distribution. We take a Markov based approach, motivated by…

Information Theory · Computer Science 2023-07-21 Keerthana Gurushankar , Praveen Venkatesh , Pulkit Grover
‹ Prev 1 4 5 6 7 8 10 Next ›