Establishes a variance-aware pointwise majorizing-measure theorem for Gaussian fields, records Bayesian algorithmic lower bounds, and constructs a separation example among classical, algorithmic, and pointwise quantities.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Pointwise Complexity for Gaussian Fields: Upper Envelopes, Algorithmic Lower Bounds, and Separation
Establishes a variance-aware pointwise majorizing-measure theorem for Gaussian fields, records Bayesian algorithmic lower bounds, and constructs a separation example among classical, algorithmic, and pointwise quantities.