|国家预印本平台
首页|Ising Models with Hidden Markov Structure: Applications to Probabilistic Inference in Machine Learning

Ising Models with Hidden Markov Structure: Applications to Probabilistic Inference in Machine Learning

Ising Models with Hidden Markov Structure: Applications to Probabilistic Inference in Machine Learning

来源:Arxiv_logoArxiv
英文摘要

In this paper, we investigate a Hamiltonian that incorporates Ising interactions between hidden $\pm 1$ spins, alongside a data-dependent term that couples the hidden and observed variables. Specifically, we explore translation-invariant Gibbs measures (TIGM) of this Hamiltonian on Cayley trees. Under certain explicit conditions on the model's parameters, we demonstrate that there can be up to three distinct TIGMs. Each of these measures represents an equilibrium state of the spin system. These measures provide a structured approach to inference on hierarchical data in machine learning. They have practical applications in tasks such as denoising, weakly supervised learning, and anomaly detection. The Cayley tree structure is particularly advantageous for exact inference due to its tractability.

U. A. Rozikov、M. V. Velasco、F. Herrera

物理学数学信息科学、信息技术

U. A. Rozikov,M. V. Velasco,F. Herrera.Ising Models with Hidden Markov Structure: Applications to Probabilistic Inference in Machine Learning[EB/OL].(2025-04-13)[2025-05-05].https://arxiv.org/abs/2504.13927.点此复制

评论