42 citations · 247 across the 29 of their papers we have counts for
4 papers · 1 filter
Domain Sparsification of Discrete Distributions using Entropic Independence
Nima Anari, Michał Dereziński, Thuy-Duong Vuong +1
We present a framework for speeding up the time it takes to sample from discrete distributions defined over subsets of size of a ground set of elements, in the regime $…
Sparse sketches with small inversion bias
Michał Dereziński, Zhenyu Liao, Edgar Dobriban +1
For a tall matrix and a random sketching matrix , the sketched estimate of the inverse covariance matrix is typically biased: $E[(\…
Determinantal Point Processes in Randomized Numerical Linear Algebra
Michał Dereziński, Michael W. Mahoney
Randomized Numerical Linear Algebra (RandNLA) uses randomness to develop improved algorithms for matrix problems that arise in scientific computing, data science, machine learning,…
Isotropy and Log-Concave Polynomials: Accelerated Sampling and High-Precision Counting of Matroid Bases
Nima Anari, Michał Dereziński
We define a notion of isotropy for discrete set distributions. If is a distribution over subsets of a ground set , we say that is in isotropic position if $P[e \in…