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.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
years
2026 4verdicts
UNVERDICTED 4representative citing papers
ABGD parametrizes piecewise linear functions as difference of max-affine functions and converges linearly to an epsilon-accurate solution with O(d max(sigma/epsilon,1)^2) samples under sub-Gaussian noise, which is minimax optimal up to logs.
Pre-training provides a geometric warm start in a single-index model that enables weak-to-strong generalization up to a supervisor-limited bound, with empirical phase-transition evidence in LLMs.
The paper proves statistical consistency of contrastive loss for retrieval via an AUC criterion and derives generalization bounds O(1/m + 1/sqrt(n)) supervised and O(1/sqrt(m) + 1/sqrt(n)) self-supervised that explain benefits of large negative sets.
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.