12 citations · 20 across the 5 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.DS2018
A Tight Analysis of Bethe Approximation for Permanent
Nima Anari, Alireza Rezaei
We prove that the permanent of nonnegative matrices can be deterministically approximated within a factor of in polynomial time, improving upon the previous determinis…
cs.LG2018★ 4 cited
A Polynomial Time MCMC Method for Sampling from Continuous DPPs
Shayan Oveis Gharan, Alireza Rezaei
We study the Gibbs sampling algorithm for continuous determinantal point processes. We show that, given a warm start, the Gibbs sampler generates a random sample from a continuous…
cs.DS2018
Composable Core-sets for Determinant Maximization Problems via Spectral Spanners
Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan +1
We study a spectral generalization of classical combinatorial graph spanners to the spectral setting. Given a set of vectors , we say a set is an $…