Exploring Predictive States via Cantor Embeddings and Wasserstein
Distance
- URL: http://arxiv.org/abs/2206.04198v1
- Date: Thu, 9 Jun 2022 00:09:47 GMT
- Title: Exploring Predictive States via Cantor Embeddings and Wasserstein
Distance
- Authors: Samuel P. Loomis and James P. Crutchfield
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Predictive states for stochastic processes are a nonparametric and
interpretable construct with relevance across a multitude of modeling
paradigms. Recent progress on the self-supervised reconstruction of predictive
states from time-series data focused on the use of reproducing kernel Hilbert
spaces. Here, we examine how Wasserstein distances may be used to detect
predictive equivalences in symbolic data. We compute Wasserstein distances
between distributions over sequences ("predictions"), using a
finite-dimensional embedding of sequences based on the Cantor for the
underlying geometry. We show that exploratory data analysis using the resulting
geometry via hierarchical clustering and dimension reduction provides insight
into the temporal structure of processes ranging from the relatively simple
(e.g., finite-state hidden Markov models) to the very complex (e.g.,
infinite-state indexed grammars).
Related papers
- Convergence of Score-Based Discrete Diffusion Models: A Discrete-Time Analysis [56.442307356162864]
We study the theoretical aspects of score-based discrete diffusion models under the Continuous Time Markov Chain (CTMC) framework.
We introduce a discrete-time sampling algorithm in the general state space $[S]d$ that utilizes score estimators at predefined time points.
Our convergence analysis employs a Girsanov-based method and establishes key properties of the discrete score function.
arXiv Detail & Related papers (2024-10-03T09:07:13Z) - Distributed Bayesian Learning of Dynamic States [65.7870637855531]
The proposed algorithm is a distributed Bayesian filtering task for finite-state hidden Markov models.
It can be used for sequential state estimation, as well as for modeling opinion formation over social networks under dynamic environments.
arXiv Detail & Related papers (2022-12-05T19:40:17Z) - Score-based Continuous-time Discrete Diffusion Models [102.65769839899315]
We extend diffusion models to discrete variables by introducing a Markov jump process where the reverse process denoises via a continuous-time Markov chain.
We show that an unbiased estimator can be obtained via simple matching the conditional marginal distributions.
We demonstrate the effectiveness of the proposed method on a set of synthetic and real-world music and image benchmarks.
arXiv Detail & Related papers (2022-11-30T05:33:29Z) - Unsupervised Learning of Equivariant Structure from Sequences [30.974508897223124]
We present an unsupervised framework to learn the symmetry from the time sequence of length at least three.
We will demonstrate that, with our framework, the hidden disentangled structure of the dataset naturally emerges as a by-product.
arXiv Detail & Related papers (2022-10-12T07:29:18Z) - Nonparametric and Regularized Dynamical Wasserstein Barycenters for
Sequential Observations [16.05839190247062]
We consider probabilistic models for sequential observations which exhibit gradual transitions among a finite number of states.
We numerically solve a finite dimensional estimation problem using cyclic descent alternating between updates to the pure-state quantile functions and the barycentric weights.
We demonstrate the utility of the proposed algorithm in segmenting both simulated and real world human activity time series.
arXiv Detail & Related papers (2022-10-04T21:39:55Z) - Wasserstein Iterative Networks for Barycenter Estimation [80.23810439485078]
We present an algorithm to approximate the Wasserstein-2 barycenters of continuous measures via a generative model.
Based on the celebrity faces dataset, we construct Ave, celeba! dataset which can be used for quantitative evaluation of barycenter algorithms.
arXiv Detail & Related papers (2022-01-28T16:59:47Z) - Temporally-Consistent Surface Reconstruction using Metrically-Consistent
Atlases [131.50372468579067]
We propose a method for unsupervised reconstruction of a temporally-consistent sequence of surfaces from a sequence of time-evolving point clouds.
We represent the reconstructed surfaces as atlases computed by a neural network, which enables us to establish correspondences between frames.
Our approach outperforms state-of-the-art ones on several challenging datasets.
arXiv Detail & Related papers (2021-11-12T17:48:25Z) - Topology, Convergence, and Reconstruction of Predictive States [0.0]
We show that convergence of predictive states can be achieved from empirical samples in the weak topology of measures.
We explain how these representations are particularly beneficial when reconstructing high-memory processes and connect them to reproducing kernel Hilbert spaces.
arXiv Detail & Related papers (2021-09-19T19:52:11Z) - Regularization of Mixture Models for Robust Principal Graph Learning [0.0]
A regularized version of Mixture Models is proposed to learn a principal graph from a distribution of $D$-dimensional data points.
Parameters of the model are iteratively estimated through an Expectation-Maximization procedure.
arXiv Detail & Related papers (2021-06-16T18:00:02Z) - Nonparametric Score Estimators [49.42469547970041]
Estimating the score from a set of samples generated by an unknown distribution is a fundamental task in inference and learning of probabilistic models.
We provide a unifying view of these estimators under the framework of regularized nonparametric regression.
We propose score estimators based on iterative regularization that enjoy computational benefits from curl-free kernels and fast convergence.
arXiv Detail & Related papers (2020-05-20T15:01:03Z)
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.