Proves coNP-completeness of verifying mPJR in metric clustering, defines mPJR+ with polynomial-time find-and-check algorithms, and introduces DC-mPJR+ with O(mn log n + mnk) verification that approximates mPJR+.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Causality resolves trade-offs in trustworthy AI by treating them as invariance conflicts under different data-generating process changes.
citing papers explorer
-
Check, Please: Verifiably Fair Clustering
Proves coNP-completeness of verifying mPJR in metric clustering, defines mPJR+ with polynomial-time find-and-check algorithms, and introduces DC-mPJR+ with O(mn log n + mnk) verification that approximates mPJR+.
-
Trustworthy AI Suffers from Invariance Conflicts and Causality is The Solution
Causality resolves trade-offs in trustworthy AI by treating them as invariance conflicts under different data-generating process changes.