Fetching the paper…
Reading the bibliography…
Given a fixed $n\times d$ matrix $\mathbf{X}$, where $n\gg d$, we study the complexity of sampling from a distribution over all subsets of rows where the probability of a subset is proportional to the squared volume of the parallelepiped spanned by the rows (a.k.a.
A note on wilks’ internal scatter
H. Robert van der Vaart · 1965
Earlier work this paper cites.
The coincidence approach to stochastic point processes
Odile Macchi · 1975
Earlier work this paper cites.
Random spanning tree
A Guénoche · 1983
Earlier work this paper cites.
Matrix approximation and projective clustering via volume sampling
Amit Deshpande, Luis Rademacher, Santosh Vempala, and Grant Wang · 2006
Earlier work this paper cites.
Determinantal processes and independence
J Ben Hough, Manjunath Krishnapur, Yuval Peres, Bálint Virág, et al · 2006
Earlier work this paper cites.
Near optimal dimensionality reductions that preserve volumes
Avner Magen and Anastasios Zouzias · 2008
Earlier work this paper cites.
Efficient volume sampling for row/column subset selection
Amit Deshpande and Luis Rademacher · 2010
Earlier work this paper cites.
Structured determinantal point processes
Alex Kulesza and Ben Taskar · 2010
Earlier work this paper cites.
Near optimal column-based matrix reconstruction
Christos Boutsidis, Petros Drineas, and Malik Magdon-Ismail · 2011
Earlier work this paper cites.
k-DPPs: Fixed-Size Determinantal Point Processes
Alex Kulesza and Ben Taskar · 2011
Earlier work this paper cites.
A class of submodular functions for document summarization
Hui Lin and Jeff Bilmes · 2011
Earlier work this paper cites.
Fast approximation of matrix coherence and statistical leverage
Petros Drineas, Malik Magdon-Ismail, Michael W. Mahoney, and David P. Woodruff · 2012
Earlier work this paper cites.
Discovering diverse and salient threads in document collections
Jennifer Gillenwater, Alex Kulesza, and Ben Taskar · 2012
Cited alongside, same era.
Optimal column-based low-rank matrix reconstruction
Venkatesan Guruswami and Ali K. Sinop · 2012
Cited alongside, same era.
Determinantal Point Processes for Machine Learning
Alex Kulesza and Ben Taskar · 2012
Cited alongside, same era.
User-friendly tail bounds for sums of random matrices
Joel A. Tropp · 2012
Cited alongside, same era.
Nystrom approximation for large-scale determinantal processes
Raja Hafiz Affandi, Alex Kulesza, Emily Fox, and Ben Taskar · 2013
Cited alongside, same era.
Faster subset selection for matrices and applications
Haim Avron and Christos Boutsidis · 2013
Cited alongside, same era.
Monte Carlo with Determinantal Point Processes
Rémi Bardenet and Adrien Hardy · 2016
Later among the works it cites.
Efficient sampling for k-determinantal point processes
Chengtao Li, Stefanie Jegelka, and Suvrit Sra · 2016
Later among the works it cites.
On a few statistical applications of determinantal point processes
Rémi Bardenet, Frédéric Lavancier, Xavier Mary, and Aurélien Vasseur · 2017
Later among the works it cites.
Optimal cur matrix decompositions
Christos Boutsidis and David P. Woodruff · 2017
Later among the works it cites.
A short note on poisson tail bounds
Clément Canonne · 2017
Later among the works it cites.
Low-rank approximation and regression in input sparsity time
Kenneth L. Clarkson and David P. Woodruff · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Osnap: Faster numerical linear algebra algorithms via sparser subspace embeddings
Jelani Nelson and Huy L. Nguyên · 2013
Cited alongside, same era.
Diverse sequential subset selection for supervised video summarization
Boqing Gong, Wei-Lun Chao, Kristen Grauman, and Fei Sha · 2014
Cited alongside, same era.
Concentration of lipschitz functionals of determinantal and other strong rayleigh measures
Robin Pemantle and Yuval Peres · 2014
Cited alongside, same era.
Fast randomized kernel ridge regression with statistical guarantees
Ahmed El Alaoui and Michael W. Mahoney · 2015
Cited alongside, same era.
Dimensionality reduction for k-means clustering and low rank approximation
Michael B. Cohen, Sam Elder, Cameron Musco, Christopher Musco, and Madalina Persu · 2015
Cited alongside, same era.
Monte carlo markov chain algorithms for sampling strongly rayleigh distributions and determinantal point processes
Nima Anari, Shayan Oveis Gharan, and Alireza Rezaei · 2016
Cited alongside, same era.
Determinantal point processes for mini-batch diversification
Cheng Zhang, Hedvig Kjellström, and Stephan Mandt · 2017
Later among the works it cites.
Reverse iterative volume sampling for linear regression
Michał Dereziński and Manfred K. Warmuth · 2018
Closest in time.
Correcting the bias in least squares regression with volume-rescaled sampling
Michał Dereziński, Manfred K. Warmuth, and Daniel Hsu · 2018
Closest in time.
Leveraged volume sampling for linear regression
Michał Dereziński, Manfred K. Warmuth, and Daniel Hsu · 2018
Closest in time.
Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
Xiangrui Meng and Michael W. Mahoney · 2029
Closest in time.