Coherent set identification via direct low rank maximum likelihood estimation
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916416146374656 |
|---|---|
| author | Polzin, Robert Klebanov, Ilja Nüsken, Nikolas Koltai, Péter |
| author_facet | Polzin, Robert Klebanov, Ilja Nüsken, Nikolas Koltai, Péter |
| contents | We analyze connections between two low rank modeling approaches from the last decade for treating dynamical data. The first one is the coherence problem (or coherent set approach), where groups of states are sought that evolve under the action of a stochastic transition matrix in a way maximally distinguishable from other groups. The second one is a low rank factorization approach for stochastic matrices, called Direct Bayesian Model Reduction (DBMR), which estimates the low rank factors directly from observed data. We show that DBMR results in a low rank model that is a projection of the full model, and exploit this insight to infer bounds on a quantitative measure of coherence within the reduced model. Both approaches can be formulated as optimization problems, and we also prove a bound between their respective objectives. On a broader scope, this work relates the two classical loss functions of nonnegative matrix factorization, namely the Frobenius norm and the generalized Kullback--Leibler divergence, and suggests new links between likelihood-based and projection-based estimation of probabilistic models. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2308_07663 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Coherent set identification via direct low rank maximum likelihood estimation Polzin, Robert Klebanov, Ilja Nüsken, Nikolas Koltai, Péter Information Theory Dynamical Systems 65F55, 62M05, 37M10, 15A23, 60J22 We analyze connections between two low rank modeling approaches from the last decade for treating dynamical data. The first one is the coherence problem (or coherent set approach), where groups of states are sought that evolve under the action of a stochastic transition matrix in a way maximally distinguishable from other groups. The second one is a low rank factorization approach for stochastic matrices, called Direct Bayesian Model Reduction (DBMR), which estimates the low rank factors directly from observed data. We show that DBMR results in a low rank model that is a projection of the full model, and exploit this insight to infer bounds on a quantitative measure of coherence within the reduced model. Both approaches can be formulated as optimization problems, and we also prove a bound between their respective objectives. On a broader scope, this work relates the two classical loss functions of nonnegative matrix factorization, namely the Frobenius norm and the generalized Kullback--Leibler divergence, and suggests new links between likelihood-based and projection-based estimation of probabilistic models. |
| title | Coherent set identification via direct low rank maximum likelihood estimation |
| topic | Information Theory Dynamical Systems 65F55, 62M05, 37M10, 15A23, 60J22 |
| url | https://arxiv.org/abs/2308.07663 |