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 =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.ST 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.