Researchers have developed spectral algorithms for selecting state-space partitions that define averaging kernels for finite Markov chains. These algorithms aim to accelerate convergence by composing or mixing a baseline kernel with a Gibbs kernel, which resamples within a chosen block. The selection process involves rounding the bottom nonconstant eigenfunctions of the Markov chain's squared kernel, or the algebraically smallest eigenfunctions for additive mixtures, using weighted k-means. This objective is shown to be equivalent to minimizing the Pearson chi-squared mutual information between the initial block label and the state after one transition, providing a probabilistic interpretation. Experiments on various models demonstrate notable per-iteration improvements in convergence and statistical estimation. AI
IMPACT Introduces novel spectral algorithms that could enhance the efficiency of machine learning models relying on Markov chain simulations.
RANK_REASON Academic paper detailing a new algorithmic method. [lever_c_demoted from research: ic=1 ai=1.0]
- averaging kernels
- Gibbs kernel
- Markov chains
- Pearson chi-squared mutual information
- spectral algorithms
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →
