The Minimax Learning Rates of Normal and Ising Undirected Graphical Models

18 Jun 2018Luc DevroyeAbbas MehrabianTommy Reddad

Let $G$ be an undirected graph with $m$ edges and $d$ vertices. We show that $d$-dimensional Ising models on $G$ can be learned from $n$ i.i.d... (read more)

PDF Abstract


No code implementations yet. Submit your code now


Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.