| 2017 | Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks. | Diarmaid Conaty, Cassio P. de Campos, Denis Deratani Mau |
| 2017 | Efficient Online Learning for Optimizing Value of Information: Theory and Application to Interactive Troubleshooting. | Yuxin Chen, Jean-Michel Renders, Morteza Haghir Chehreghani, Andreas Krause |
| 2017 | FROSH: FasteR Online Sketching Hashing. | Xixian Chen, Irwin King, Michael R. Lyu |
| 2017 | Submodular Variational Inference for Network Reconstruction. | Lin Chen, Forrest W. Crawford, Amin Karbasi |
| 2017 | Analysis of Thompson Sampling for Stochastic Sleeping Bandits. | Aritra Chatterjee, Ganesh Ghalme, Shweta Jain, Rohit Vaish, Y. Narahari |
| 2017 | Robust Model Equivalence using Stochastic Bisimulation for N-Agent Interactive DIDs. | Muthukumaran Chandrasekaran, Junhuan Zhang, Prashant Doshi, Yifeng Zeng |
| 2017 | On the Complexity of Nash Equilibrium Reoptimization. | Andrea Celli, Alberto Marchesi, Nicola Gatti |
| 2017 | Why Rules are Complex: Real-Valued Probabilistic Logic Programs are not Fully Expressive. | David Buchman, David Poole |
| 2017 | Exact Inference for Relational Graphical Models with Interpreted Functions: Lifted Probabilistic Inference Modulo Theories. | Rodrigo de Salvo Braz, Ciaran O'Reilly |
| 2017 | Regret Minimization Algorithms for the Followers Behaviour Identification in Leadership Games. | Lorenzo Bisi, Giuseppe De Nittis, Francesco Trov, Marcello Restelli, Nicola Gatti |
| 2017 | Weighted Model Counting With Function Symbols. | Vaishak Belle |
| 2017 | The Binomial Block Bootstrap Estimator for Evaluating Loss on Dependent Clusters. | Matt Barnes, Artur Dubrawski |
| 2017 | Coupling Adaptive Batch Sizes with Learning Rates. | Lukas Balles, Javier Romero, Philipp Hennig |
| 2016 | Cascading Bandits for Large-Scale Recommendation Problems. | Shi Zong, Hao Ni, Kenny Sung, Nan Rosemary Ke, Zheng Wen, Branislav Kveton |
| 2016 | On the Identifiability and Estimation of Functional Causal Models in the Presence of Outcome-Dependent Selection. | Kun Zhang, Jiji Zhang, Biwei Huang, Bernhard Schlkopf, Clark Glymour |
| 2016 | Efficient Multi-Class Selective Sampling on Graphs. | Peng Yang, Peilin Zhao, Zhen Hai, Wei Liu, Steven C. H. Hoi, Xiaoli Li |
| 2016 | Adaptive Algorithms and Data-Dependent Guarantees for Bandit Convex Optimization. | Scott Yang, Mehryar Mohri |
| 2016 | Lighter-Communication Distributed Machine Learning via Sufficient Factor Broadcasting. | Pengtao Xie, Jin Kyu Kim, Yi Zhou, Qirong Ho, Abhimanu Kumar, Yaoliang Yu, Eric P. Xing |
| 2016 | Bayesian Estimators As Voting Rules. | Lirong Xia |
| 2016 | Subspace Clustering with a Twist. | David P. Wipf, Yue Dong, Bo Xin |
| 2016 | Characterizing Tightness of LP Relaxations by Forbidding Signed Minors. | Adrian Weller |
| 2016 | Efficient Observation Selection in Probabilistic Graphical Models Using Bayesian Lower Bounds. | Dilin Wang, John W. Fisher III, Qiang Liu |
| 2016 | Non-parametric Domain Approximation for Scalable Gibbs Sampling in MLNs. | Deepak Venugopal, Somdeb Sarkhel, Kyle Cherry |
| 2016 | Score-based vs Constraint-based Causal Learning in the Presence of Confounders. | Sofia Triantafillou, Ioannis Tsamardinos |
| 2016 | The Efficacy of the POMDP-RTI Approach for Early Reading Intervention. | Umit Tokac, Russell G. Almond |