| An Algorithm to Learn Polytree Networks with Hidden Nodes | Firoozeh Sepehr · Donatello Materassi |
| Approximating the Permanent by Sampling from Adaptive Partitions | Jonathan Kuck · Tri Dao · Hamid Rezatofighi · Ashish Sabharwal · Stefano Ermon |
| Bayesian Joint Estimation of Multiple Graphical Models | Lingrui Gan · Xinming Yang · Naveen Narisetty · Feng Liang |
| Counting the Optimal Solutions in Graphical Models | Radu Marinescu · Rina Dechter |
| Direct Estimation of Differential Functional Graphical Models | Boxin Zhao · Y. Samuel Wang · Mladen Kolar |
| On Tractable Computation of Expected Predictions | Pasha Khosravi · YooJung Choi · Yitao Liang · Antonio Vergari · Guy Van den Broeck |
| Smoothing Structured Decomposable Circuits | Andy Shih · Guy Van den Broeck · Paul Beame · Antoine Amarilli |
| Sparse Logistic Regression Learns All Discrete Pairwise Graphical Models | Shanshan Wu · Sujay Sanghavi · Alexandros Dimakis |
| Structured Graph Learning Via Laplacian Spectral Constraints | Sandeep Kumar · Jiaxi Ying · Jose Vinicius de Miranda Cardoso · Daniel Palomar |