5 citations · 16 across the 20 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.LG2019★ 4 cited
Amortized Rejection Sampling in Universal Probabilistic Programming
Saeid Naderiparizi, Adam Ścibior, Andreas Munk +9
Naive approaches to amortized inference in probabilistic programs with unbounded loops can produce estimators with infinite variance. This is particularly true of importance sampli…
cs.LG2019★ 1 cited
Distributed Maximization of Submodular plus Diversity Functions for Multi-label Feature Selection on Huge Datasets
Mehrdad Ghadiri, Mark Schmidt
There are many problems in machine learning and data mining which are equivalent to selecting a non-redundant, high "quality" set of objects. Recommender systems, feature selection…
cs.DS2019
Beyond Submodular Maximization via One-Sided Smoothness
Mehrdad Ghadiri, Richard Santiago, Bruce Shepherd
The multilinear framework has achieved the breakthrough approximation for maximizing a monotone submodular function subject to a matroid constraint. This framework has a co…