Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes
From MaRDI portal
Publication:5076319
DOI10.1613/jair.1.13288OpenAlexW3198670157MaRDI QIDQ5076319
Publication date: 16 May 2022
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.00727
Cites Work
- Unnamed Item
- Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope
- On selecting a maximum volume sub-matrix of a matrix and related problems
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Exponential inapproximability of selecting a maximum volume sub-matrix
- Eynard-Mehta theorem, Schur process, and their Pfaffian analogs
- Determinantal Point Processes for Machine Learning
- Randomized Rounding for the Largest Simplex Problem
- A threshold of ln n for approximating set cover
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
- The coincidence approach to stochastic point processes
- An analysis of approximations for maximizing submodular set functions—I
- A Parallel Repetition Theorem
- Deterministic Algorithms for Submodular Maximization Problems
- An Exact Algorithm for Maximum Entropy Sampling
- On the NP-Hardness of Checking Matrix Polytope Stability and Continuous-Time Switching Stability
- A generalization of permanent inequalities and applications in counting and optimization
- Parallel Repetition of Two-Prover One-Round Games: An Exposition
- Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid
- Analytical approach to parallel repetition
- Maximizing determinants under partition constraints
- On largest volume simplices and sub-determinants
- Some optimal inapproximability results
- Mathematical Foundations of Computer Science 2005
This page was built for publication: Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes
