14 citations · 59 across the 21 of their papers we have counts for
Showing cs.LGShow all
3 papers · 1 filter
cs.LG2021
Computational Complexity of Normalizing Constants for the Product of Determinantal Point Processes
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…
cs.LG2021★ 2 cited
Spanning Tree Constrained Determinantal Point Processes are Hard to (Approximately) Evaluate
Tatsuya Matsuoka, Naoto Ohsaka
We consider determinantal point processes (DPPs) constrained by spanning trees. Given a graph and a positive semi-definite matrix indexed by , a spanning-…
cs.LG2021★ 1 cited
Predictive Optimization with Zero-Shot Domain Adaptation
Tomoya Sakai, Naoto Ohsaka
Prediction in a new domain without any training sample, called zero-shot domain adaptation (ZSDA), is an important task in domain adaptation. While prediction in a new domain has g…