12 citations · 20 across the 5 of their papers we have counts for
6 papers
Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm
Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan +1
``Composable core-sets'' are an efficient framework for solving optimization problems in massive data models. In this work, we consider efficient construction of composable core-se…
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…
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…
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 $…
Monte Carlo Markov Chain Algorithms for Sampling Strongly Rayleigh Distributions and Determinantal Point Processes
Nima Anari, Shayan Oveis Gharan, Alireza Rezaei
Strongly Rayleigh distributions are natural generalizations of product and determinantal probability distributions and satisfy strongest form of negative dependence properties. We…
Approximation Algorithms for Finding Maximum Induced Expanders
Shayan Oveis Gharan, Alireza Rezaei
We initiate the study of approximating the largest induced expander in a given graph . Given a -regular graph with vertices, the goal is to find the set with the larg…