Detecting Renewal States in Chains of Variable Length via Intrinsic
Bayes Factors
- URL: http://arxiv.org/abs/2110.07430v1
- Date: Thu, 14 Oct 2021 14:57:44 GMT
- Title: Detecting Renewal States in Chains of Variable Length via Intrinsic
Bayes Factors
- Authors: Victor Freguglia and Nancy Garcia
- Abstract summary: We propose the use of Intrinsic Bayes Factor to evaluate the plausibility of each set of renewal states.
To show the strength of our method, we analyzed artificial datasets generated from two binary models models and one example coming from the field of Linguistics.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Markov chains with variable length are useful parsimonious stochastic models
able to generate most stationary sequence of discrete symbols. The idea is to
identify the suffixes of the past, called contexts, that are relevant to
predict the future symbol. Sometimes a single state is a context, and looking
at the past and finding this specific state makes the further past irrelevant.
These states are called renewal states and they split the chain into
independent blocks. In order to identify renewal states for chains with
variable length, we propose the use of Intrinsic Bayes Factor to evaluate the
plausibility of each set of renewal states. In this case, the difficulty lies
in finding the marginal posterior distribution for the random context trees for
general prior distribution on the space of context trees and Dirichlet prior
for the transition probabilities. To show the strength of our method, we
analyzed artificial datasets generated from two binary models models and one
example coming from the field of Linguistics.
Related papers
- Unsupervised Representation Learning from Sparse Transformation Analysis [79.94858534887801]
We propose to learn representations from sequence data by factorizing the transformations of the latent variables into sparse components.
Input data are first encoded as distributions of latent activations and subsequently transformed using a probability flow model.
arXiv Detail & Related papers (2024-10-07T23:53:25Z) - To be Continuous, or to be Discrete, Those are Bits of Questions [19.872554909401316]
We introduce binary representation as a novel representation that lies between continuous and discrete representations.
We preserve structural information on the output side along with label information.
Our model achieves competitive performance on various structured prediction tasks.
arXiv Detail & Related papers (2024-06-12T02:08:45Z) - Ito Diffusion Approximation of Universal Ito Chains for Sampling, Optimization and Boosting [64.0722630873758]
We consider rather general and broad class of Markov chains, Ito chains, that look like Euler-Maryama discretization of some Differential Equation.
We prove the bound in $W_2$-distance between the laws of our Ito chain and differential equation.
arXiv Detail & Related papers (2023-10-09T18:38:56Z) - On the Foundations of Cycles in Bayesian Networks [4.312746668772342]
We present a foundational study regarding semantics for cyclic BNs that are generic and conservatively extend the cycle-free setting.
First, we propose constraint-based semantics that specify requirements for full joint distributions over a BN to be consistent with the local conditional probabilities and independencies.
Second, two kinds of limit semantics that formalize infinite unfolding approaches are introduced and shown to be computable by a Markov chain construction.
arXiv Detail & Related papers (2023-01-20T14:40:17Z) - Posterior Collapse and Latent Variable Non-identifiability [54.842098835445]
We propose a class of latent-identifiable variational autoencoders, deep generative models which enforce identifiability without sacrificing flexibility.
Across synthetic and real datasets, latent-identifiable variational autoencoders outperform existing methods in mitigating posterior collapse and providing meaningful representations of the data.
arXiv Detail & Related papers (2023-01-02T06:16:56Z) - The distribution of syntactic dependency distances [0.7614628596146599]
We contribute to the characterization of the actual distribution of syntactic dependency distances.
We propose a new double-exponential model in which decay in probability is allowed to change after a break-point.
We find that a two-regime model is the most likely one in all 20 languages we considered.
arXiv Detail & Related papers (2022-11-26T17:31:25Z) - Exploring Predictive States via Cantor Embeddings and Wasserstein
Distance [0.0]
We show how Wasserstein distances may be used to detect predictive equivalences in symbolic data.
We show that exploratory data analysis using the resulting geometry provides insight into the temporal structure of processes.
arXiv Detail & Related papers (2022-06-09T00:09:47Z) - Complex Event Forecasting with Prediction Suffix Trees: Extended
Technical Report [70.7321040534471]
Complex Event Recognition (CER) systems have become popular in the past two decades due to their ability to "instantly" detect patterns on real-time streams of events.
There is a lack of methods for forecasting when a pattern might occur before such an occurrence is actually detected by a CER engine.
We present a formal framework that attempts to address the issue of Complex Event Forecasting.
arXiv Detail & Related papers (2021-09-01T09:52:31Z) - Interplay between transport and quantum coherences in free fermionic
systems [58.720142291102135]
We study the quench dynamics in free fermionic systems.
In particular, we identify a function, that we dub emphtransition map, which takes the value of the stationary current as input and gives the value of correlation as output.
arXiv Detail & Related papers (2021-03-24T17:47:53Z) - Discrete Variational Attention Models for Language Generation [51.88612022940496]
We propose a discrete variational attention model with categorical distribution over the attention mechanism owing to the discrete nature in languages.
Thanks to the property of discreteness, the training of our proposed approach does not suffer from posterior collapse.
arXiv Detail & Related papers (2020-04-21T05:49:04Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.