Polynomial-time SDP and ellipsoid-based approximation of Kolmogorov widths yields efficient robust detection boundaries matching upper bounds up to polylog factors for structured constrained signals.
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing , pages =
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Proves CLS-hardness for Nash equilibrium computation in two-team polymatrix games with zero-sum or coordination pairwise payoffs, with tight CLS membership when one team has independent adversaries, plus an ε-Nash algorithm with 1/ε² runtime dependence.
Establishes n^{1-ε}-hardness of approximation for dichromatic number and acyclic number on tournaments, plus polynomial-time approximations for ℓ-dicolorable digraphs and special dense cases.
citing papers explorer
-
Efficient Robust Constrained Signal Detection via Kolmogorov Width Approximations
Polynomial-time SDP and ellipsoid-based approximation of Kolmogorov widths yields efficient robust detection boundaries matching upper bounds up to polylog factors for structured constrained signals.