Selecting Optimal Variable Order in Autoregressive Ising Models
Not on the map. Why?
Abstract (arXiv)
Autoregressive models enable tractable sampling from learned probability distributions, but their performance critically depends on the variable ordering used in the factorization via complexities of the resulting conditional distributions. We propose to learn the Markov random field describing the underlying data, and use the inferred graphical model structure to construct optimized variable orderings. We illustrate our approach on two-dimensional image-like models where a structure-aware ordering leads to restricted conditioning sets, thereby reducing model complexity. Numerical experiments on Ising models with discrete data demonstrate that graph-informed orderings yield higher-fidelity generated samples compared to naive variable orderings.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 15 of its 18 references that are in the map. First posted on arXiv 23 Feb 2026.
Builds on
15 of 18 references.
References · 15
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2022GPT-NeoX-20B: An Open-Source Autoregressive Language Modelcited by 711
- 2017Masked Autoregressive Flow for Density Estimationcited by 680
- 2018GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Modelscited by 406
- 2015MADE: Masked Autoencoder for Distribution Estimationcited by 306
- 2020GraphAF: a Flow-based Autoregressive Model for Molecular Graph Generationcited by 301
- 2016Neural Autoregressive Distribution Estimationcited by 94
- 2016Interaction Screening: Efficient and Sample-Optimal Learning of Ising Modelscited by 43
- 2017Learning Graphical Models Using Multiplicative Weightscited by 43
- 2016Optimal structure and parameter learning of Ising modelscited by 26
- 2019Efficient Learning of Discrete Graphical Modelscited by 21
- 2022Hierarchical autoregressive neural networks for statistical systemscited by 12
Built on by
Not cited yet.