On the Complexity of Constrained Determinantal Point Processes

v1v2v3 (latest)

On the Complexity of Constrained Determinantal Point Processes

1 August 2016

Nisheeth K. Vishnoi

ArXiv (abs)PDF HTML

Papers citing "On the Complexity of Constrained Determinantal Point Processes"

10 / 10 papers shown

Title
Diverse Probabilistic Trajectory Forecasting with Admissibility Constraints Laura Calem H. Ben-younes P. Pérez Nicolas Thome 93 3 0 07 Feb 2023
Scalable MCMC Sampling for Nonsymmetric Determinantal Point Processes Insu Han Mike Gartrell Elvis Dohmatob Amin Karbasi 58 4 0 01 Jul 2022
Computational Complexity of Normalizing Constants for the Product of Determinantal Point Processes Naoto Ohsaka Tatsuya Matsuoka 53 0 0 28 Nov 2021
Spanning Tree Constrained Determinantal Point Processes are Hard to (Approximately) Evaluate Tatsuya Matsuoka Naoto Ohsaka 34 4 0 25 Feb 2021
Multi-Agent Determinantal Q-Learning Yaodong Yang Ying Wen Lihuan Chen Jun Wang Kun Shao D. Mguni Weinan Zhang 114 73 0 02 Jun 2020
Maximizing Determinants under Matroid Constraints V. Madan Aleksandar Nikolov Mohit Singh U. Tantipongpipat 57 8 0 16 Apr 2020
Classification with Fairness Constraints: A Meta-Algorithm with Provable Guarantees L. E. Celis Lingxiao Huang Vijay Keswani Nisheeth K. Vishnoi FaML 251 310 0 15 Jun 2018
Fair and Diverse DPP-based Data Summarization L. E. Celis Vijay Keswani D. Straszak Amit Deshpande Tarun Kathuria Nisheeth K. Vishnoi 93 122 0 12 Feb 2018
Maximum Entropy Distributions: Bit Complexity and Stability D. Straszak Nisheeth K. Vishnoi 71 10 0 06 Nov 2017
Subdeterminant Maximization via Nonconvex Relaxations and Anti-concentration J. Ebrahimi D. Straszak Nisheeth K. Vishnoi 61 12 0 10 Jul 2017