Polynomial time algorithms for dual volume sampling
© 2017 Neural information processing systems foundation. All rights reserved. We study dual volume sampling, a method for selecting k columns from an n × m short and wide matrix (n ≤ k ≤ m) such that the probability of selection is proportional to the volume spanned by the rows of the induced submat...
Main Authors: | Li, C, Jegelka, S, Sra, S |
---|---|
Format: | Article |
Language: | English |
Published: |
2021
|
Online Access: | https://hdl.handle.net/1721.1/132306 |
Similar Items
-
Polynomial time algorithms for dual volume sampling
by: Li, Chengtao, et al.
Published: (2022) -
Fast DPP Sampling for Nyström with Application to Kernel Methods
by: Li, Chengtao, et al.
Published: (2018) -
Fast mixing Markov chains for strongly rayleigh measures, DPPs, and constrained sampling
by: Li, Chengtao, et al.
Published: (2021) -
Polynomial dual network simplex algorithms
by: Orlin, James B., et al.
Published: (2009) -
Exponentiated strongly Rayleigh distributions
by: Mariet, Z, et al.
Published: (2021)