Efficiently Learning Ising Models on Arbitrary Graphs
From MaRDI portal
Publication:2941573
DOI10.1145/2746539.2746631zbMath1321.68397arXiv1411.6156OpenAlexW1969880349WikidataQ105584188 ScholiaQ105584188MaRDI QIDQ2941573
Publication date: 21 August 2015
Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.6156
Learning and adaptive systems in artificial intelligence (68T05) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Related Items
Efficient learning of discrete graphical models* ⋮ Universality of the mean-field for the Potts model ⋮ Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models ⋮ Multi-group binary choice with social interaction and a random communication structure -- a random graph approach ⋮ Ising model selection using ℓ 1-regularized linear regression: a statistical mechanics analysis* ⋮ An expectation maximization algorithm for high-dimensional model selection for the Ising model with misclassified states* ⋮ Exact recovery in block spin Ising models at the critical line ⋮ Region selection in Markov random fields: Gaussian case ⋮ The minimax learning rates of normal and Ising undirected graphical models ⋮ Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu ⋮ Unnamed Item ⋮ Learning a tree-structured Ising model in order to make predictions ⋮ Joint estimation of parameters in Ising model ⋮ Estimating the interaction graph of stochastic neural dynamics ⋮ Spectral bounds for the Ising ferromagnet on an arbitrary given graph ⋮ Fluctuation results for general block spin Ising models ⋮ A global approach for learning sparse Ising models ⋮ Fluctuations for block spin Ising models ⋮ Structure learning in inverse Ising problems using ℓ 2-regularized linear estimator ⋮ Exact recovery in the Ising blockmodel ⋮ On testing for parameters in Ising models ⋮ Property testing in high-dimensional Ising models ⋮ Unnamed Item
Uses Software
Cites Work
- Ramsey partitions and proximity data structures
- On sparse spanners of weighted graphs
- Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
- On Approximate Distance Labels and Routing Schemes with Affine Stretch
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Approximate distance oracles
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Near-Linear Time Construction of Sparse Neighborhood Covers
- Shortest-path queries in static networks
- Approximate distance oracles with constant query time
- Automata, Languages and Programming
- Unnamed Item
