A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
On the (In)tractability of Computing Normalizing Constants for the Product of Determinantal Point Processes
International Conference on Machine Learning
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. We study the computational complexity of computing its normalizing constant, which is among the most essential probabilistic inference tasks. Our complexitytheoretic results (almost) rule out the existence of efficient algorithms for this task, unless input matrices aredblp:conf/icml/OhsakaM20 fatcat:wnoawgl6lrgqxmziwayghjhyde