NeurIPS 2019
Sun Dec 8th through Sat the 14th, 2019 at Vancouver Convention Center
A clever new approach for learning pairwise graphical models with a gain of O(k) wrt previous work (k is the alphabet size). Results seem correct (though a detailed mathematical check was not performed) and important for the problem.