no code implementations • ICML 2020 • Naoto Ohsaka, Tatsuya Matsuoka

We consider the product of determinantal point processes (DPPs), a point process whose probability mass is proportional to the product of principal minors of multiple matrices as a natural, promising generalization of DPPs.

no code implementations • 26 Apr 2024 • Ken Yokoyama, Shinji Ito, Tatsuya Matsuoka, Kei Kimura, Makoto Yokoo

An existing general framework for dealing with such objective functions is the online submodular minimization.

no code implementations • 28 Nov 2021 • Naoto Ohsaka, Tatsuya Matsuoka

(2) $\sum_S\det({\bf A}_{S, S})\det({\bf B}_{S, S})\det({\bf C}_{S, S})$ is NP-hard to approximate within a factor of $2^{O(|I|^{1-\epsilon})}$ or $2^{O(n^{1/\epsilon})}$ for any $\epsilon>0$, where $|I|$ is the input size and $n$ is the order of the input matrix.

no code implementations • 25 Feb 2021 • Tatsuya Matsuoka, Naoto Ohsaka

We consider determinantal point processes (DPPs) constrained by spanning trees.

Cannot find the paper you are looking for? You can
Submit a new open access paper.

Contact us on:
hello@paperswithcode.com
.
Papers With Code is a free resource with all data licensed under CC-BY-SA.