Composable core-sets for determinant maximization: A simple near-optimal algorithm
"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-sets for the determinant maximization problem. This can also be cast as the MAP inference task for determinantal p...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
International Machine Learning Society (IMLS),
2021-01-15T15:06:10Z.
|
| Subjects: | |
| Online Access: | Get fulltext |